Sciweavers

419 search results - page 13 / 84
» Using Matrix Decompositions in Formal Concept Analysis
Sort
View
CORR
2010
Springer
189views Education» more  CORR 2010»
15 years 1 months ago
Robust PCA via Outlier Pursuit
Singular Value Decomposition (and Principal Component Analysis) is one of the most widely used techniques for dimensionality reduction: successful and efficiently computable, it ...
Huan Xu, Constantine Caramanis, Sujay Sanghavi
125
Voted
CLA
2006
15 years 4 months ago
An Algorithm to Find Frequent Concepts of a Formal Context with Taxonomy
Formal Concept Analysis (FCA) considers attributes as a non-ordered set. This is appropriate when the data set is not structured. When an attribute taxonomy exists, existing techni...
Peggy Cellier, Sébastien Ferré, Oliv...
JMLR
2012
13 years 5 months ago
Sparse Higher-Order Principal Components Analysis
Traditional tensor decompositions such as the CANDECOMP / PARAFAC (CP) and Tucker decompositions yield higher-order principal components that have been used to understand tensor d...
Genevera Allen
186
Voted
ICDM
2009
IEEE
202views Data Mining» more  ICDM 2009»
15 years 1 months ago
Link Prediction on Evolving Data Using Matrix and Tensor Factorizations
Abstract--The data in many disciplines such as social networks, web analysis, etc. is link-based, and the link structure can be exploited for many different data mining tasks. In t...
Evrim Acar, Daniel M. Dunlavy, Tamara G. Kolda
QSIC
2005
IEEE
15 years 9 months ago
Formal Fault Tree Analysis of State Transition Systems
Fault Tree Analysis (FTA) is a traditional deductive safety analysis technique that is applied during the system design stage. However, traditional FTA does not consider transitio...
Jianwen Xiang, Kazuhiro Ogata