Algorithms for Building Concept Sets and Concept Lattices (original) (raw)

Using a reinforced concept lattice to incrementally mine association rules from closed itemsets

2007

In the Data Mining area, discovering association rules is one of the most important task. It is well known that the number of these rules rapidly grows to be unwieldy as the frequency requirements become less strict, especially when collected data is highly correlated or dense. Since a big number of the frequent itemsets turns out to be redundant, it is sufficient to consider only the rules among closed frequent itemsets or concepts.

Concept Lattice Theory in Data Mining and its Applications

2019

Concept lattice has been proven to be a very e ective tool and architecture for data mining in general. It is widely used for data analysis and knowledge discovery and various concept lattice based approaches are used depending on the type of data. This paper aims at presenting one application of the lattice theory : the text mining. In this approach, we applied the notion of lattice theory by using one of its components mostly used in data mining, the formal concept analysis which has a powerful method, the association rule extraction which helps to nd in a database patterns which appear frequently together.

An Approach Using Concept Lattice Structure for Data Mining and Information Retrieval

Journal of Science and Technology: Issue on Information and Communications Technology

Since the 1980s, the concept lattice was studied and applied to the problems of text mining, frequent itemset, classification, etc. The formal concept analysis - FCA is one of the main techniques applied in the concept lattice. FCA is a mathematical theory which is applied to the data mining by setting a table with rows describing objects and columns describing attributes, with relationships between them, and then sets up the concept lattice structure. In the area of information retrieval, FCA considers the correlation of objects-attributes the same as those of documents-terms. In the process of setting up the lattice, FCA defines each node in the lattice as a concept. The algorithm for the construction of concept lattice will install a couple on each node, including a set of documents with common terms, and a set of terms which co-occurs in documents. In a larger scale, each concept in the lattice could be recognized as a couple of questions - answers. In the lattice, the action of...