Sciweavers

419 search results - page 2 / 84
» Using Matrix Decompositions in Formal Concept Analysis
Sort
View
CLA
2007
13 years 6 months ago
Formal Concepts as Optimal Factors in Boolean Factor Analysis: Implications and Experiments
Boolean factor analysis aims at decomposing an objects × attributes Boolean matrix I into a Boolean product of an objects × factors Boolean matrix A and a factors × attributes B...
Radim Belohlávek, Vilém Vychodil
DGCI
2008
Springer
13 years 7 months ago
Decomposition and Construction of Neighbourhood Operations Using Linear Algebra
In this paper, we introduce a method to express a local linear operated in the neighbourhood of each point in the discrete space as a matrix transform. To derive matrix expressions...
Atsushi Imiya, Yusuke Kameda, Naoya Ohnishi
ICASSP
2010
IEEE
13 years 5 months ago
Fast signal analysis and decomposition on graphs using the Sparse Matrix Transform
Recently, the Sparse Matrix Transform (SMT) has been proposed as a tool for estimating the eigen-decomposition of high dimensional data vectors [1]. The SMT approach has two major...
Leonardo R. Bachega, Guangzhi Cao, Charles A. Boum...
ICDM
2009
IEEE
129views Data Mining» more  ICDM 2009»
13 years 11 months ago
Extended Boolean Matrix Decomposition
—With the vast increase in collection and storage of data, the problem of data summarization is most critical for effective data management. Since much of this data is categorica...
Haibing Lu, Jaideep Vaidya, Vijayalakshmi Atluri, ...
IWPC
2007
IEEE
13 years 11 months ago
Combining Formal Concept Analysis with Information Retrieval for Concept Location in Source Code
The paper addresses the problem of concept location in source code by presenting an approach which combines Formal Concept Analysis (FCA) and Latent Semantic Indexing (LSI). In th...
Denys Poshyvanyk, Andrian Marcus