Sciweavers

268 search results - page 20 / 54
» Learning Pairwise Similarity for Data Clustering
Sort
View
KDD
2007
ACM
276views Data Mining» more  KDD 2007»
14 years 7 months ago
Nonlinear adaptive distance metric learning for clustering
A good distance metric is crucial for many data mining tasks. To learn a metric in the unsupervised setting, most metric learning algorithms project observed data to a lowdimensio...
Jianhui Chen, Zheng Zhao, Jieping Ye, Huan Liu
CVPR
2011
IEEE
12 years 11 months ago
Max-margin Clustering: Detecting Margins from Projections of Points on Lines
Given a unlabelled set of points X ∈ RN belonging to k groups, we propose a method to identify cluster assignments that provides maximum separating margin among the clusters. We...
Raghuraman Gopalan, Jagan Sankaranarayanan
ECML
2006
Springer
13 years 11 months ago
An Adaptive Kernel Method for Semi-supervised Clustering
Semi-supervised clustering uses the limited background knowledge to aid unsupervised clustering algorithms. Recently, a kernel method for semi-supervised clustering has been introd...
Bojun Yan, Carlotta Domeniconi

Source Code
2231views
15 years 1 months ago
The Berkeley Segmentation Engine (BSE)
The code is a (good, in my opinion) implementation of a segmentation engine based on normalised cuts (a spectral clustering algorithm) and a pixel affinity matrix calculation algor...
Charless Fowlkes
ICPR
2010
IEEE
14 years 2 months ago
Semi-Supervised Distance Metric Learning by Quadratic Programming
This paper introduces a semi-supervised distance metric learning algorithm which uses pair-wise equivalence (similarity and dissimilarity) constraints to improve the original dist...
Hakan Cevikalp