Sciweavers

5092 search results - page 37 / 1019
» Clustering the Feature Space
Sort
View
ICML
2004
IEEE
14 years 11 months ago
Boosting margin based distance functions for clustering
The performance of graph based clustering methods critically depends on the quality of the distance function, used to compute similarities between pairs of neighboring nodes. In t...
Tomer Hertz, Aharon Bar-Hillel, Daphna Weinshall
PRL
2008
161views more  PRL 2008»
13 years 9 months ago
Automatic kernel clustering with a Multi-Elitist Particle Swarm Optimization Algorithm
This article introduces a scheme for clustering complex and linearly non-separable datasets, without any prior knowledge of the number of naturally occurring groups in the data. T...
Swagatam Das, Ajith Abraham, Amit Konar
MIR
2003
ACM
174views Multimedia» more  MIR 2003»
14 years 3 months ago
Content-based image retrieval by clustering
In a typical content-based image retrieval (CBIR) system, query results are a set of images sorted by feature similarities with respect to the query. However, images with high fea...
Yixin Chen, James Ze Wang, Robert Krovetz
ICDE
2008
IEEE
158views Database» more  ICDE 2008»
14 years 11 months ago
CARE: Finding Local Linear Correlations in High Dimensional Data
Finding latent patterns in high dimensional data is an important research problem with numerous applications. Existing approaches can be summarized into 3 categories: feature selec...
Xiang Zhang, Feng Pan, Wei Wang
IDEAS
2007
IEEE
71views Database» more  IDEAS 2007»
14 years 4 months ago
Feature Space Enrichment by Incorporation of Implicit Features for Effective Classification
Feature Space Conversion for classifiers is the process by which the data that is to be fed into the classifier is transformed from one form to another. The motivation behind doin...
Abhishek Srivastava, Osmar R. Zaïane, Maria-L...