Sciweavers

60 search results - page 1 / 12
» Concept Lattice Reduction by Singular Value Decomposition
Sort
View
104
Voted
SYRCODIS
2007
126views Database» more  SYRCODIS 2007»
15 years 17 hour 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...
CLA
2004
15 years 8 days ago
Concept Lattice Generation by Singular Value Decomposition
Abstract. Latent semantic indexing (LSI) is an application of numerical method called singular value decomposition (SVD), which discovers latent semantic in documents by creating c...
Petr Gajdos, Pavel Moravec, Václav Sn&aacut...
96
Voted
CAINE
2001
15 years 7 days ago
Model Reduction Scheme of State-Affine Systems
In this paper, a new method for the approximation of discrete time state-affine systems is proposed. The method is based on the diagonalization of proposed generalized controllabi...
Samir A. Al-Baiyat
85
Voted
SPRINGSIM
2008
15 years 8 days ago
A shared memory parallel algorithm for data reduction using the singular value decomposition
Rhonda D. Phillips, Layne T. Watson, Randolph H. W...
IPCV
2008
15 years 9 days ago
Face Recognition using PCA and LDA with Singular Value Decomposition (SVD)
Linear Discriminant Analysis(LDA) is well-known scheme for feature extraction and dimension reduction. It has been used widely in many applications involving high-dimensional data,...
Neeta Nain, Nitish Agarwal, Prashant Gour, Rakesh ...