Sciweavers

917 search results - page 1 / 184
» Comparison of Data Structures for Computing Formal Concepts
Sort
View
MDAI
2009
Springer
13 years 9 months ago
Comparison of Data Structures for Computing Formal Concepts
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 ...
Petr Krajca, Vilém Vychodil
CLA
2004
13 years 6 months ago
Binary Factor Analysis with Help of Formal Concepts
Binary factor analysis (BFA, also known as Boolean Factor Analysis) is a nonhierarchical analysis of binary data, based on reduction of binary space dimension. It allows us to find...
Ales Keprt, Václav Snásel
APBC
2007
13 years 6 months ago
Using Formal Concept Analysis for Microarray Data Comparison
V. Choi, Y. Huang, Vy Lam, D. Potter, Reinhard C. ...
MDAI
2007
Springer
13 years 10 months ago
Lindig's Algorithm for Concept Lattices over Graded Attributes
Formal concept analysis (FCA) is a method of exploratory data analysis. The data is in the form of a table describing relationship between objects (rows) and attributes (columns), ...
Radim Belohlávek, Bernard De Baets, Jan Out...
ISPDC
2010
IEEE
13 years 3 months ago
Operational Semantics of the Marte Repetitive Structure Modeling Concepts for Data-Parallel Applications Design
—This paper presents an operational semantics of the repetitive model of computation, which is the basis for the repetitive structure modeling (RSM) package defined in the stand...
Abdoulaye Gamatié, Vlad Rusu, Éric R...