Sciweavers

502 search results - page 6 / 101
» Principal Component Analysis for Sparse High-Dimensional Dat...
Sort
View
KDD
2001
ACM
253views Data Mining» more  KDD 2001»
16 years 23 days 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
SIGMOD
2001
ACM
142views Database» more  SIGMOD 2001»
16 years 15 days ago
Outlier Detection for High Dimensional Data
The outlier detection problem has important applications in the eld of fraud detection, network robustness analysis, and intrusion detection. Most such applications are high dimen...
Charu C. Aggarwal, Philip S. Yu
112
Voted
COMPLIFE
2006
Springer
15 years 4 months ago
Set-Oriented Dimension Reduction: Localizing Principal Component Analysis Via Hidden Markov Models
We present a method for simultaneous dimension reduction and metastability analysis of high dimensional time series. The approach is based on the combination of hidden Markov model...
Illia Horenko, Johannes Schmidt-Ehrenberg, Christo...
120
Voted
SADM
2010
173views more  SADM 2010»
14 years 7 months ago
Data reduction in classification: A simulated annealing based projection method
This paper is concerned with classifying high dimensional data into one of two categories. In various settings, such as when dealing with fMRI and microarray data, the number of v...
Tian Siva Tian, Rand R. Wilcox, Gareth M. James
128
Voted
CORR
2010
Springer
130views Education» more  CORR 2010»
15 years 14 days ago
Stable Principal Component Pursuit
In this paper, we study the problem of recovering a low-rank matrix (the principal components) from a highdimensional data matrix despite both small entry-wise noise and gross spar...
Zihan Zhou, Xiaodong Li, John Wright, Emmanuel J. ...