The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Displaying similar documents to “Direct neighborhood discriminant analysis for face recognition.”

Analysis of correlation based dimension reduction methods

Yong Joon Shin, Cheong Hee Park (2011)

International Journal of Applied Mathematics and Computer Science

Similarity:

Dimension reduction is an important topic in data mining and machine learning. Especially dimension reduction combined with feature fusion is an effective preprocessing step when the data are described by multiple feature sets. Canonical Correlation Analysis (CCA) and Discriminative Canonical Correlation Analysis (DCCA) are feature fusion methods based on correlation. However, they are different in that DCCA is a supervised method utilizing class label information, while CCA is an unsupervised...

Correspondence analysis and two-way clustering.

Antonio Ciampi, Ana González Marcos, Manuel Castejón Limas (2005)

SORT

Similarity:

Correspondence analysis followed by clustering of both rows and columns of a data matrix is proposed as an approach to two-way clustering. The novelty of this contribution consists of: i) proposing a simple method for the selecting of the number of axes; ii) visualizing the data matrix as is done in micro-array analysis; iii) enhancing this representation by emphasizing those variables and those individuals which are 'well represented' in the subspace of the chosen axes. The approach...

Rough sets methods in feature reduction and classification

Roman Świniarski (2001)

International Journal of Applied Mathematics and Computer Science

Similarity:

The paper presents an application of rough sets and statistical methods to feature reduction and pattern recognition. The presented description of rough sets theory emphasizes the role of rough sets reducts in feature selection and data reduction in pattern recognition. The overview of methods of feature selection emphasizes feature selection criteria, including rough set-based methods. The paper also contains a description of the algorithm for feature selection and reduction based on...

Latent Semantic Indexing for patent documents

Andreea Moldovan, Radu Boţ, Gert Wanka (2005)

International Journal of Applied Mathematics and Computer Science

Similarity:

Since the huge database of patent documents is continuously increasing, the issue of classifying, updating and retrieving patent documents turned into an acute necessity. Therefore, we investigate the efficiency of applying Latent Semantic Indexing, an automatic indexing method of information retrieval, to some classes of patent documents from the United States Patent Classification System. We present some experiments that provide the optimal number of dimensions for the Latent Semantic...