Computing Formal Concepts by Attribute Sorting

Authors:
Petr Krajca;Jan Outrata;Vilem Vychodil
Affiliations:
DAMOL: Data Analysis and Modeling Laboratory, Department of Computer Science, Palacky University, Olomouc, Czech Republic, vychodil@acm.org/ jan.outrata@upol.cz/ petr.krajca@binghamton.edu;(Supported by grant no. P202/10/P360 of the Czech Science Foundation) DAMOL: Data Analysis and Modeling Laboratory, Department of Computer Science, Palacky University, Olomouc, Czech Republic, vyc ...;(Petr Krajca and Vilem Vychodil were supported by grant no. P103/10/1056 of the Czech Science Foundation) DAMOL: Data Analysis and Modeling Laboratory, Department of Computer Science, Palacky Univ ...
Venue:
Fundamenta Informaticae - Concept Lattices and Their Applications
Year:
2012

Citing 15
Cited 1

On generating all maximal independent sets

Information Processing Letters
Efficient algorithms for listing combinatorial structures

Efficient algorithms for listing combinatorial structures
Mining association rules between sets of items in large databases

SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Efficient mining of association rules using closed itemset lattices

Information Systems
Understanding class hierarchies using concept analysis

ACM Transactions on Programming Languages and Systems (TOPLAS)
Formal Concept Analysis: Mathematical Foundations

Formal Concept Analysis: Mathematical Foundations
Learning of Simple Conceptual Graphs from Positive and Negative Examples

PKDD '99 Proceedings of the Third European Conference on Principles of Data Mining and Knowledge Discovery
Using a Concept Lattice of Decomposition Slices for Program Understanding and Impact Analysis

IEEE Transactions on Software Engineering
Concept Data Analysis: Theory and Applications

Concept Data Analysis: Theory and Applications
Mining Non-Redundant Association Rules

Data Mining and Knowledge Discovery
Discovery of optimal factors in binary data via a novel method of matrix decomposition

Journal of Computer and System Sciences
Parallel algorithm for computing fixpoints of Galois connections

Annals of Mathematics and Artificial Intelligence
Fast algorithm for computing fixpoints of Galois connections induced by object-attribute relational data

Information Sciences: an International Journal
The discrete basis problem

PKDD'06 Proceedings of the 10th European conference on Principle and Practice of Knowledge Discovery in Databases
Two basic algorithms in concept analysis

ICFCA'10 Proceedings of the 8th international conference on Formal Concept Analysis

Review: Formal Concept Analysis in knowledge processing: A survey on models and techniques

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a novel approach to compute formal concepts of formal context. In terms of operations with Boolean matrices, the presented algorithm computes all maximal rectangles of the input Boolean matrix which are full of 1s. The algorithm combines basic ideas of previous approaches with our recent observations on the influence of attribute permutations and attribute sorting on the number of formal concepts which are computed multiple times. As a result, we present algorithm which computes formal concepts by successive context reduction and attribute sorting. We prove its soundness, discuss its complexity and efficiency, and show that it outperforms other algorithms from the CbO family in terms of substantially lower numbers of formal concepts which are computed multiple times.