Sciweavers

1454 search results - page 15 / 291
» On High Dimensional Skylines
Sort
View
VLDB
2000
ACM
166views Database» more  VLDB 2000»
14 years 1 months ago
What Is the Nearest Neighbor in High Dimensional Spaces?
Nearest neighbor search in high dimensional spaces is an interesting and important problem which is relevant for a wide variety of novel database applications. As recent results s...
Alexander Hinneburg, Charu C. Aggarwal, Daniel A. ...
WSC
2008
14 years 5 days ago
On the approximation error in high dimensional model representation
Mathematical models are often described by multivariate functions, which are usually approximated by a sum of lower dimensional functions. A major problem is the approximation err...
Xiaoqun Wang
ICDM
2002
IEEE
158views Data Mining» more  ICDM 2002»
14 years 2 months ago
Adaptive dimension reduction for clustering high dimensional data
It is well-known that for high dimensional data clustering, standard algorithms such as EM and the K-means are often trapped in local minimum. Many initialization methods were pro...
Chris H. Q. Ding, Xiaofeng He, Hongyuan Zha, Horst...
KDD
2008
ACM
172views Data Mining» more  KDD 2008»
14 years 10 months ago
Structured metric learning for high dimensional problems
The success of popular algorithms such as k-means clustering or nearest neighbor searches depend on the assumption that the underlying distance functions reflect domain-specific n...
Jason V. Davis, Inderjit S. Dhillon
KDD
2006
ACM
149views Data Mining» more  KDD 2006»
14 years 10 months ago
Regularized discriminant analysis for high dimensional, low sample size data
Linear and Quadratic Discriminant Analysis have been used widely in many areas of data mining, machine learning, and bioinformatics. Friedman proposed a compromise between Linear ...
Jieping Ye, Tie Wang