Sciweavers

298 search results - page 17 / 60
» Subspace Clustering of High Dimensional Data
Sort
View
110
Voted
ISNN
2007
Springer
15 years 6 months ago
Two-Dimensional Bayesian Subspace Analysis for Face Recognition
Bayesian subspace analysis (BSA) has been successfully applied in data mining and pattern recognition. However, due to the use of probabilistic measure of similarity, it often need...
Daoqiang Zhang
SSD
2005
Springer
122views Database» more  SSD 2005»
15 years 6 months ago
Selectivity Estimation of High Dimensional Window Queries via Clustering
Abstract. Query optimization is an important functionality of modern database systems and often based on estimating the selectivity of queries before actually executing them. Well-...
Christian Böhm, Hans-Peter Kriegel, Peer Kr&o...
IJCAI
2007
15 years 1 months ago
A Subspace Kernel for Nonlinear Feature Extraction
Kernel based nonlinear Feature Extraction (KFE) or dimensionality reduction is a widely used pre-processing step in pattern classification and data mining tasks. Given a positive...
Mingrui Wu, Jason D. R. Farquhar
PCM
2007
Springer
169views Multimedia» more  PCM 2007»
15 years 6 months ago
Random Subspace Two-Dimensional PCA for Face Recognition
The two-dimensional Principal Component Analysis (2DPCA) is a robust method in face recognition. Much recent research shows that the 2DPCA is more reliable than the well-known PCA ...
Nam Nguyen, Wanquan Liu, Svetha Venkatesh
ICML
2010
IEEE
14 years 11 months ago
Multiple Non-Redundant Spectral Clustering Views
Many clustering algorithms only find one clustering solution. However, data can often be grouped and interpreted in many different ways. This is particularly true in the high-dim...
Donglin Niu, Jennifer G. Dy, Michael I. Jordan