Sciweavers

199 search results - page 10 / 40
» Accuracy of distance metric learning algorithms
Sort
View
TKDE
2008
148views more  TKDE 2008»
13 years 8 months ago
Semisupervised Clustering with Metric Learning using Relative Comparisons
Semisupervised clustering algorithms partition a given data set using limited supervision from the user. The success of these algorithms depends on the type of supervision and also...
Nimit Kumar, Krishna Kummamuru
ML
2010
ACM
119views Machine Learning» more  ML 2010»
13 years 7 months ago
A cooperative coevolutionary algorithm for instance selection for instance-based learning
This paper presents a cooperative evolutionary approach for the problem of instance selection for instance based learning. The presented model takes advantage of one of the most r...
Nicolás García-Pedrajas, Juan Antoni...
ECML
2006
Springer
14 years 7 days ago
Subspace Metric Ensembles for Semi-supervised Clustering of High Dimensional Data
A critical problem in clustering research is the definition of a proper metric to measure distances between points. Semi-supervised clustering uses the information provided by the ...
Bojun Yan, Carlotta Domeniconi
CVPR
2006
IEEE
14 years 2 months ago
Learning Non-Metric Partial Similarity Based on Maximal Margin Criterion
The performance of many computer vision and machine learning algorithms critically depends on the quality of the similarity measure defined over the feature space. Previous works...
Xiaoyang Tan, Songcan Chen, Jun Li, Zhi-Hua Zhou
ICDE
2000
IEEE
168views Database» more  ICDE 2000»
14 years 10 months ago
PAC Nearest Neighbor Queries: Approximate and Controlled Search in High-Dimensional and Metric Spaces
In high-dimensional and complex metric spaces, determining the nearest neighbor (NN) of a query object ? can be a very expensive task, because of the poor partitioning operated by...
Paolo Ciaccia, Marco Patella