Matrix multiplication via arithmetic progressions
Journal of Symbolic Computation - Special issue on computational algebraic complexity
Efficient enumeration of all minimal separators in a graph
Theoretical Computer Science
Listing all Minimal Separators of a Graph
SIAM Journal on Computing
Efficient mining of association rules using closed itemset lattices
Information Systems
A fast algorithm for building lattices
Information Processing Letters
A partition-based approach towards constructing Galois (concept) lattices
Discrete Mathematics
Using Lattice-Based Framework as a Tool for Feature Extraction
ECML '98 Proceedings of the 10th European Conference on Machine Learning
Structural Machine Learning with Galois Lattice and Graphs
ICML '98 Proceedings of the Fifteenth International Conference on Machine Learning
Maintaining Class Membership Information
OOIS '02 Proceedings of the Workshops on Advances in Object-Oriented Information Systems
Partitioning Large Data to Scale up Lattice-Based Algorithm
ICTAI '03 Proceedings of the 15th IEEE International Conference on Tools with Artificial Intelligence
Representing a concept lattice by a graph
Discrete Applied Mathematics - Discrete mathematics & data mining (DM & DM)
Distributed Algorithm for Computing Formal Concepts Using Map-Reduce Framework
IDA '09 Proceedings of the 8th International Symposium on Intelligent Data Analysis: Advances in Intelligent Data Analysis VIII
Space-optimal, backtracking algorithms to list the minimal vertex separators of a graph
Discrete Applied Mathematics
Parallel algorithm for computing fixpoints of Galois connections
Annals of Mathematics and Artificial Intelligence
Similarity measures in formal concept analysis
Annals of Mathematics and Artificial Intelligence
Distributed formal concept analysis algorithms based on an iterative mapreduce framework
ICFCA'12 Proceedings of the 10th 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
| Hi-index | 0.00 |
Generating concepts defined by a binary relation between a set $\mathcal{P}$ of properties and a set $\mathcal{O}$ of objects is one of the important current problems encountered in Data Mining and Knowledge Discovery in Databases. We present a new algorithmic process which computes all the concepts, without requiring an exponential-size data structure, and with a good worst-time complexity analysis, which makes it competitive with the best existing algorithms for this problem. Our algorithm can be used to compute the edges of the lattice as well at no extra cost.