Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

13

CORR
2006
Springer

favoriteEmaildiscussreport

98views Education» more CORR 2006»

Faster Algorithms for Constructing a Concept (Galois) Lattice

13 years 4 months ago

Faster Algorithms for Constructing a Concept (Galois) Lattice

Download people.cs.vt.edu

In this paper, we present a fast algorithm for constructing a concept (Galois) lattice of a binary relation, including computing all concepts and their lattice order. We also present two efficient variants of the algorithm, one for computing all concepts only, and one for constructing a frequent closed itemset lattice. The running time of our algorithms depends on the lattice structure and is faster than all other existing algorithms for these problems.

Vicky Choi

Real-time Traffic

Algorithms | Closed Itemset Lattice | CORR 2006 | Education | Lattice Order |

claim paper

Related Content

» Performances of Galois Subhierarchybuilding Algorithms

» A Novel Approach for Graphics Recognition Based on Galois Lattice and Bag of Words Represe...

» OntoRefiner a user query refinement interface usable for Semantic Web Portals

» An Incremental Concept Formation Approach for Learning from Databases

» Design of Class Hierarchies Based on Concept Galois Lattices

» Topological Visual Localization Using Decentralized Galois Lattices

» Yet a Faster Algorithm for Building the Hasse Diagram of a Concept Lattice

» Fuzzy Concept Lattice is Made by ProtoFuzzy Concepts

» Policies Generalization in Reinforcement Learning using Galois Partitions Lattices

Post Info
More Details (n/a)

Added	11 Dec 2010
Updated	11 Dec 2010
Type	Journal
Year	2006
Where	CORR
Authors	Vicky Choi

Comments (0)