Sciweavers

1313 search results - page 98 / 263
» Dimensionality Reduction for Classification
Sort
View
AUSAI
2007
Springer
15 years 9 months ago
Merging Algorithm to Reduce Dimensionality in Application to Web-Mining
Dimensional reduction may be effective in order to compress data without loss of essential information. Also, it may be useful in order to smooth data and reduce random noise. The...
Vladimir Nikulin, Geoffrey J. McLachlan
139
Voted
KDD
2001
ACM
253views Data Mining» more  KDD 2001»
16 years 3 months ago
GESS: a scalable similarity-join algorithm for mining large data sets in high dimensional spaces
The similarity join is an important operation for mining high-dimensional feature spaces. Given two data sets, the similarity join computes all tuples (x, y) that are within a dis...
Jens-Peter Dittrich, Bernhard Seeger
ICIP
2003
IEEE
16 years 4 months ago
Color photo categorization using compressed histograms and support vector machines
In this paper, an efficient method using various histogrambased (high-dimensional) image content descriptors for automatically classifying general color photos into relevant categ...
Xia Feng, Jianzhong Fang, Guoping Qiu
ICCV
2007
IEEE
15 years 9 months ago
Laplacian PCA and Its Applications
Dimensionality reduction plays a fundamental role in data processing, for which principal component analysis (PCA) is widely used. In this paper, we develop the Laplacian PCA (LPC...
Deli Zhao, Zhouchen Lin, Xiaoou Tang
SIGIR
2005
ACM
15 years 8 months ago
Multi-label informed latent semantic indexing
Latent semantic indexing (LSI) is a well-known unsupervised approach for dimensionality reduction in information retrieval. However if the output information (i.e. category labels...
Kai Yu, Shipeng Yu, Volker Tresp