Sciweavers

419 search results - page 8 / 84
» Using Matrix Decompositions in Formal Concept Analysis
Sort
View
CLA
2004
13 years 9 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
SDM
2007
SIAM
143views Data Mining» more  SDM 2007»
13 years 9 months ago
Less is More: Compact Matrix Decomposition for Large Sparse Graphs
Given a large sparse graph, how can we find patterns and anomalies? Several important applications can be modeled as large sparse graphs, e.g., network traffic monitoring, resea...
Jimeng Sun, Yinglian Xie, Hui Zhang, Christos Falo...
CVPR
2000
IEEE
14 years 9 months ago
A Robust and Efficient Motion Segmentation Based on Orthogonal Projection Matrix of Shape Space
A novel algorithm for motion segmentation is proposed. The algorithm uses the fact that shape of an object with homogeneous motion is represented as 4 dimensional linear space. Th...
Naoyuki Ichimura
ICFCA
2004
Springer
14 years 1 months ago
Conceptual Knowledge Processing with Formal Concept Analysis and Ontologies
Abstract. Among many other knowledge representations formalisms, Ontologies and Formal Concept Analysis (FCA) aim at modeling ‘concepts’. We discuss how these two formalisms ma...
Philipp Cimiano, Andreas Hotho, Gerd Stumme, Julie...
CCA
2000
Springer
14 years 8 hour ago
A Computable Spectral Theorem
Computing the spectral decomposition of a normal matrix is among the most frequent tasks to numerical mathematics. A vast range of methods are employed to do so, but all of them su...
Martin Ziegler, Vasco Brattka