Lakhal: Fast computation of concept lattices using data mining techniques (0)

by G Stumme, R Taouil, Y Bastide, N Pasquier, L
Venue:Proc. KRDB ´00, http://sunsite.informatik.rwth-aachen.de/Publications/CEURWS
Add To MetaCart
Results 1 - 7 of 7

Comparing performance of algorithms for generating concept lattices

by Sergei O. Kuznetsov, Sergei A. Obiedkov - J.EXPT.THEOR.ARTIF.INTELL.??(2002)1–28 , 2002
"... Recently concept lattices became widely used tools for intelligent data analysis. In this paper, several algorithms that generate the set of all formal concepts and diagram graphs of concept lattices are considered. Some modifications of well-known algorithms are proposed. Algorithmic complexity of ..."
Abstract - Cited by 133 (11 self) - Add to MetaCart
Recently concept lattices became widely used tools for intelligent data analysis. In this paper, several algorithms that generate the set of all formal concepts and diagram graphs of concept lattices are considered. Some modifications of well-known algorithms are proposed. Algorithmic complexity of the algorithms is studied both theoretically (in the worst case) and experimentally. Conditions of preferable use of some algorithms are given in terms of density/sparseness of underlying formal contexts. Principles of comparing practical performance of algorithms are discussed.
(Show Context)

Computing Iceberg Concept Lattices with TITANIC

by Gerd Stumme , 2002
"... We introduce the notion of iceberg concept lattices... ..."
Abstract - Cited by 112 (15 self) - Add to MetaCart
We introduce the notion of iceberg concept lattices...

Ontology Merging for Federated Ontologies on the Semantic Web

by Gerd Stumme, Alexander Maedche - In Proceedings of the International Workshop for Foundations of Models for Information Integration (FMII-2001 , 2001
"... One of the core challenges for the Semantic Web is the aspect of decentralization. Local structures can be modeled by ontologies. However, in order to support global communication and knowledge exchange, mechanisms have to be developed for integrating the local systems. We adopt the database app ..."
Abstract - Cited by 39 (0 self) - Add to MetaCart
One of the core challenges for the Semantic Web is the aspect of decentralization. Local structures can be modeled by ontologies. However, in order to support global communication and knowledge exchange, mechanisms have to be developed for integrating the local systems. We adopt the database approach of autonomous federated database systems and consider an architecture for federated ontologies for the Semantic Web as starting point of our work.

Intelligent Structuring and Reducing of Association Rules with Formal Concept Analysis

by Gerd Stumme, Rafik Taouil, Yves Bastide, Nicolas Pasquier, Lotfi Lakhal , 2001
"... Association rules are used to investigate large databases. The analyst is usually confronted with large lists of such rules and has to find the most relevant ones for his purpose. Based on results about knowledge representation within the theoretical framework of Formal Concept Analysis, we present ..."
Abstract - Cited by 26 (9 self) - Add to MetaCart
Association rules are used to investigate large databases. The analyst is usually confronted with large lists of such rules and has to find the most relevant ones for his purpose. Based on results about knowledge representation within the theoretical framework of Formal Concept Analysis, we present relatively small bases for association rules from which all rules can be deduced. We also provide algorithms for their calculation.

Iceberg query lattices for Datalog

by Gerd Stumme - Conceptual Structures at Work, volume 3127 of Lecture
"... Abstract. In this paper we study two orthogonal extensions of the classical data mining problem of mining association rules, and show how they naturally interact. The first is the extension from a propositional representation to datalog, and the second is the condensed representation of frequent ite ..."
Abstract - Cited by 5 (0 self) - Add to MetaCart
Abstract. In this paper we study two orthogonal extensions of the classical data mining problem of mining association rules, and show how they naturally interact. The first is the extension from a propositional representation to datalog, and the second is the condensed representation of frequent itemsets by means of Formal Concept Analysis (FCA). We combine the notion of frequent datalog queries with iceberg concept lattices (also called closed itemsets) of FCA and introduce two kinds of iceberg query lattices as condensed representations of frequent datalog queries. We demonstrate that iceberg query lattices provide a natural way to visualize relational association rules in a non-redundant way. 1
(Show Context)

Concept Lattice algorithm implementation

by J. Vásárhelyi, L. Kovács
"... Abstract—The increasing interest on application of concept lattices in the different information systems results in several implementations and algorithm proposals and representation tools. The concept lattice is mainly for representation of the concept generalization structure but it can apply as a ..."
Abstract - Add to MetaCart
Abstract—The increasing interest on application of concept lattices in the different information systems results in several implementations and algorithm proposals and representation tools. The concept lattice is mainly for representation of the concept generalization structure but it can apply as a classification tool too. A key component of practical applications is the efficient implementation of lattice building. This paper analyses the possibility of algorithm parallelization and implementation in hardware, which allow the speed up of the lattice construction and search for generated concepts.
(Show Context)

KNOWLEDGE REPRESENTATION AND REASONING KNOWLEDGE REPRESENTATION AND REASONING COGNITIVE ROBOTICS A Logical Account of Causal and Topological Maps

by Emilio Remolina, Benjamin Kuipers
"... We consider the problem of how an agent creates a discrete spatial representation from its continuous interactions with the environment. Such represen-tation will be the minimal one that explains the ex-periences of the agent in the environment. In this paper we take the Spatial Semantic Hierarchy a ..."
Abstract - Add to MetaCart
We consider the problem of how an agent creates a discrete spatial representation from its continuous interactions with the environment. Such represen-tation will be the minimal one that explains the ex-periences of the agent in the environment. In this paper we take the Spatial Semantic Hierarchy as the agent’s target spatial representation, and use a circumscriptive theory to specify the minimal mod-els associated with this representation. We provide a logic program to calculate the models of the pro-posed theory. We also illustrate how the different levels of the representation assume different spa-tial properties about both the environment and the actions performed by the agent. These spatial prop-erties play the role of “filters ” the agent applies in order to distinguish the different environment states it has visited. 1