Sciweavers

113 search results - page 8 / 23
» Locally adaptive metrics for clustering high dimensional dat...
Sort
View
PAKDD
2005
ACM
120views Data Mining» more  PAKDD 2005»
14 years 25 days ago
Speeding-Up Hierarchical Agglomerative Clustering in Presence of Expensive Metrics
In several contexts and domains, hierarchical agglomerative clustering (HAC) offers best-quality results, but at the price of a high complexity which reduces the size of datasets ...
Mirco Nanni
ICML
2008
IEEE
14 years 8 months ago
Fast solvers and efficient implementations for distance metric learning
In this paper we study how to improve nearest neighbor classification by learning a Mahalanobis distance metric. We build on a recently proposed framework for distance metric lear...
Kilian Q. Weinberger, Lawrence K. Saul
PR
2006
141views more  PR 2006»
13 years 7 months ago
Relaxational metric adaptation and its application to semi-supervised clustering and content-based image retrieval
The performance of many supervised and unsupervised learning algorithms is very sensitive to the choice of an appropriate distance metric. Previous work in metric learning and ada...
Hong Chang, Dit-Yan Yeung, William K. Cheung
ICDM
2007
IEEE
137views Data Mining» more  ICDM 2007»
14 years 1 months ago
Locally Constrained Support Vector Clustering
Support vector clustering transforms the data into a high dimensional feature space, where a decision function is computed. In the original space, the function outlines the bounda...
Dragomir Yankov, Eamonn J. Keogh, Kin Fai Kan
VLDB
2007
ACM
174views Database» more  VLDB 2007»
14 years 7 months ago
An adaptive and dynamic dimensionality reduction method for high-dimensional indexing
Abstract The notorious "dimensionality curse" is a wellknown phenomenon for any multi-dimensional indexes attempting to scale up to high dimensions. One well-known approa...
Heng Tao Shen, Xiaofang Zhou, Aoying Zhou