Sciweavers

419 search results - page 1 / 84
» Using Matrix Decompositions in Formal Concept Analysis
Sort
View
ISIM
2007
13 years 6 months ago
Using Matrix Decompositions in Formal Concept Analysis
One of the main problems connected with the formal concept analysis and lattice construction is the high complexity of algorithms which plays a significant role when computing all ...
Václav Snásel, Petr Gajdos, Hussam M...
SYRCODIS
2007
126views Database» more  SYRCODIS 2007»
13 years 5 months ago
Concept Lattice Reduction by Singular Value Decomposition
High complexity of lattice construction algorithms and uneasy way of visualising lattices are two important problems connected with the formal concept analysis. Algorithm complexi...
Václav Snásel, Martin Polovincak, Hu...
GRC
2010
IEEE
13 years 5 months ago
Optimal Factorization of Three-Way Binary Data
We present a problem of factor analysis of three-way binary data, i.e. data described by a 3-dimensional binary matrix I, describing a relationship between objects, attributes, an...
Radim Belohlávek, Vilém Vychodil
ICFCA
2009
Springer
13 years 11 months ago
Factor Analysis of Incidence Data via Novel Decomposition of Matrices
Matrix decomposition methods provide representations of an object-variable data matrix by a product of two different matrices, one describing relationship between objects and hidd...
Radim Belohlávek, Vilém Vychodil
KBS
2006
127views more  KBS 2006»
13 years 4 months ago
Collaborative Recommending using Formal Concept Analysis
We show how Formal Concept Analysis (FCA) can be applied to Collaborative Recommenders. FCA is a mathematical method for analysing binary relations. Here we apply it to the relati...
Patrick du Boucher-Ryan, Derek G. Bridge