Galois connection, formal concepts and Galois lattice in real relations: application in a real classifier

Jaoua, Ali; Elloumi, Samir

doi:10.1016/s0164-1212(01)00087-5

Cited by 85 publications

(34 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For a many-valued-formal-context K=(U,A,V, I), if the value domain of A is some limited interval numerals and union or intersect of any subset of them, then the class lattice generated from the context is an interval numeral formal concept lattice [11].…”

Section: Propertymentioning

confidence: 99%

Efficient Method of Formal Event Analysis

Liu¹,

Liu

2012

Information Computing and Applications

View full text Add to dashboard Cite

Abstract. Based on the philosophic idea about static concept, Professor R.Wille in Germany had provided the theory about formal concept analyses firstly in 1982, which opens out inwardness of static concept and relation between the concepts well. But the theory has evident limitation for representing dynamic event. The paper extends the theory to be a more generic model. On the basis of the definition of event proposed by us, more formalized description of event is given, a method to build formal event lattice from formal event context is suggested. Then the feasibility of the method is demonstrated from theory and instance. The model of Formal Event lattice repairs the limitation of formal concept lattice, so it can characterize the essence of the dynamic world very well. It will exert effect in the application in the fields of network resource management, Web servers, event ontology, robot control, marketing strategy, data mining and etc.

show abstract

Section: Propertymentioning

confidence: 99%

Efficient Method of Formal Event Analysis

Liu¹,

Liu

2012

Information Computing and Applications

View full text Add to dashboard Cite

show abstract

“…However, in many practical applications, the binary relations are real-valued, or interval-valued. Several generalizations of FCA for such application have been attempted in recent years (Burusco and Fuentes-González 2000;Elloumi et al 2004;Belohlavek 2001Belohlavek , 2002Belohlavek , 2004Popescu 2001;Georgescu and Popescu 2004;Jaoua and Elloumi 2002;Yahia and Jaoua 2001;Krajči 2003;Zhang et al 2007). Burusco and Fuentes-González (2000) generalized the FCA model to fuzzy formal contexts.…”

Section: Introductionmentioning

confidence: 99%

Rule acquisition and attribute reduction in real decision formal contexts

2010

View full text Add to dashboard Cite

Formal Concept Analysis of real set formal contexts is a generalization of classical formal contexts. By dividing the attributes into condition attributes and decision attributes, the notion of real decision formal contexts is introduced. Based on an implication mapping, problems of rule acquisition and attribute reduction of real decision formal contexts are examined. The extraction of ''if-then'' rules from the real decision formal contexts, and the approach to attribute reduction of the real decision formal contexts are discussed. By the proposed approach, attributes which are non-essential to the maximal s rules or l rules (to be defined later in the text) can be removed. Furthermore, discernibility matrices and discernibility functions for computing the attribute reducts of the real decision formal contexts are constructed to determine all attribute reducts of the real set formal contexts without affecting the results of the acquired maximal s rules or l rules.

show abstract

“…In fact, Ganter and Wille [6] gave the mathematical foundation of the formal concept analysis, based on lattice theory. Other research teams in Canada [7] and in Tunis (Jaoua, Ounally, Ben Yahia and Elloumi [8][9][10] , have applied formal concept analysis for supervised learning, information engineering and data organization. Document detection techniques are partitioned into three main categories: shingling techniques, similarity measures calculations and document images.…”

Section: Introductionmentioning

confidence: 99%

A New Filtering Algorithm for Duplicate Document Based on Concept Analysis

Hasnah¹

2006

J. of Computer Science

View full text Add to dashboard Cite

Data bases and web pages contain currently a huge number of duplicate document. It is then fundamental to have a filter which can be embedded, for instance, within an information retrieval system like a search engine in order to prohibit the redundant documents references to appear on the screen as a reply to the user's query. This filter can save the user time and increases his satisfaction. In this study, we propose a new algorithm based on concept analysis principle, which can act as a filter for duplicate document. It can be applied on a collection of documents or databases and reduce their storage spaces by eliminating redundant documents without loosing knowledge. Our experiments show that this algorithm increases the precision of the information retrieval system and improves its performance.

show abstract

Galois connection, formal concepts and Galois lattice in real relations: application in a real classifier

Cited by 85 publications

References 14 publications

Efficient Method of Formal Event Analysis

Efficient Method of Formal Event Analysis

Rule acquisition and attribute reduction in real decision formal contexts

A New Filtering Algorithm for Duplicate Document Based on Concept Analysis

Contact Info

Product

Resources

About