Sciweavers

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

38

MDAI
2009
Springer

favoriteEmaildiscussreport

101views Artificial Intelligence» more MDAI 2009»

Comparison of Data Structures for Computing Formal Concepts

14 years 3 months ago

Comparison of Data Structures for Computing Formal Concepts

Download vychodil.inf.upol.cz

Presented is preliminary study of the role of data structures in algorithms for formal concept analysis. Studied is performance of selected algorithms in dependence on chosen data structures and size and density of input object-attribute data. The observations made in the paper can be seen as guidelines on how to select data structures for implementing algorithms for formal concept analysis.

Petr Krajca, Vilém Vychodil

Real-time Traffic

Data Structures | Formal Concept Analysis | Input Object-attribute Data | MDAI 2009 |

claim paper

Related Content

» Binary Factor Analysis with Help of Formal Concepts

» Using Formal Concept Analysis for Microarray Data Comparison

» Lindigs Algorithm for Concept Lattices over Graded Attributes

» Operational Semantics of the Marte Repetitive Structure Modeling Concepts for DataParallel...

» Linkability estimation between subjects and message contents using formal concepts

» An Algorithm to Find Frequent Concepts of a Formal Context with Taxonomy

» ConstraintBased Mining of Formal Concepts in Transactional Data

» On Computing the Minimal Generator Family for Concept Lattices and Icebergs

» Formalization of Link Farm Structure Using Graph Grammar

Post Info
More Details (n/a)

Added	26 Jul 2010
Updated	26 Jul 2010
Type	Conference
Year	2009
Where	MDAI
Authors	Petr Krajca, Vilém Vychodil

Comments (0)