298 search results - page 38 / 60 » Subspace Clustering of High Dimensional Data |
141
click to vote
AUSDM
2008
Springer
15 years 6 months ago
2008
Springer
LBR is a highly accurate classification algorithm, which lazily constructs a single Bayesian rule for each test instance at classification time. However, its computational complex...
163
click to vote
ECML
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Principal component analysis (PCA) is a well-known classical data analysis technique. There are a number of algorithms for solving the problem, some scaling better than o...
246
click to vote
ICDE
2007
IEEE
16 years 5 months ago
2007
IEEE
A key method for privacy preserving data mining is that of randomization. Unlike k-anonymity, this technique does not include public information in the underlying assumptions. In ...
130
click to vote
IJCNN
2007
IEEE
15 years 10 months ago
2007
IEEE
— Although AdaBoost has achieved great success, it still suffers from following problems: (1) the training process could be unmanageable when the number of features is extremely ...
129
click to vote
ICML
2004
IEEE
16 years 5 months ago
2004
IEEE
Many clustering algorithms fail when dealing with high dimensional data. Principal component analysis (PCA) is a popular dimensionality reduction algorithm. However, it assumes a ...