Approximating monotone concepts

Authors:
Jamil Saquer;Jitender S. Deogun
Affiliations:
Computer Science Department, Southwest Missouri State University, Springfield, MO;Department of Computer Science, University of Nebraska, Lincoln, NE
Venue:
Design and application of hybrid intelligent systems
Year:
2003

Citing 2
Cited 3

Formal Concept Analysis: Mathematical Foundations

Formal Concept Analysis: Mathematical Foundations
Monotone concepts for formal concept analysis

Discrete Applied Mathematics - Discrete mathematics & data mining (DM & DM)

Concept analysis via rough set and AFS algebra

Information Sciences: an International Journal
A new model of evaluating concept similarity

Knowledge-Based Systems
Combined rough sets with flow graph and formal concept analysis for business aviation decision-making

Journal of Intelligent Information Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

A monotone concept is a generalization of Wille's notion of concept where disjunctions are allowed in the intent and set unions are allowed in the extent. This generalization allows an information retrieval query containing disjunctions to be understood as the intent of a monotone concept whose answer is the extent of that concept. A problem arises, though, when no monotone concept corresponds exactly to the query, In this case, we would be interested in finding monotone concepts whose intents are close to the query. In this paper, we present a general solution where we show how to find monotone concepts whose intents approximate any given disjunction of conjunctions. We also show how to find monotone concepts whrose extents approximate any given set of objects.