Sciweavers

419 search results - page 16 / 84
» Using Matrix Decompositions in Formal Concept Analysis
Sort
View
ECIR
2006
Springer
13 years 9 months ago
Improving Quality of Search Results Clustering with Approximate Matrix Factorisations
Abstract. In this paper we show how approximate matrix factorisations can be used to organise document summaries returned by a search engine into meaningful thematic categories. We...
Stanislaw Osinski
ICSE
1997
IEEE-ACM
13 years 12 months ago
Assessing Modular Structure of Legacy Code Based on Mathematical Concept Analysis
We apply mathematical concept analysis in order to modularize legacy code. By analysing the relation between procedures and global variables, a so-called concept lattice is constr...
Christian Lindig, Gregor Snelting
SIGSOFT
1998
ACM
13 years 12 months ago
Reengineering Class Hierarchies Using Concept Analysis
The design of a class hierarchy may be imperfect. For example, a class C may contain a member m not accessed in any C-instance, an indication that m could be eliminated, or moved ...
Gregor Snelting, Frank Tip
NIPS
2008
13 years 9 months ago
Covariance Estimation for High Dimensional Data Vectors Using the Sparse Matrix Transform
Covariance estimation for high dimensional vectors is a classically difficult problem in statistical analysis and machine learning. In this paper, we propose a maximum likelihood ...
Guangzhi Cao, Charles A. Bouman
SSIAI
2002
IEEE
14 years 18 days ago
Matching Patterns of Line Segments by Eigenvector Decomposition
This paper presents an algorithm for matching line segments in two images which are related by an affine transformation. Images are represented as patterns of line segments. Areas...
H. B. Chan, Y. S. Hung