Sciweavers

6 search results - page 1 / 2
» Efficient Maximum Margin Clustering via Cutting Plane Algori...
Sort
View
SDM
2008
SIAM
161views Data Mining» more  SDM 2008»
13 years 5 months ago
Efficient Maximum Margin Clustering via Cutting Plane Algorithm
Maximum margin clustering (MMC) is a recently proposed clustering method, which extends the theory of support vector machine to the unsupervised scenario and aims at finding the m...
Bin Zhao, Fei Wang, Changshui Zhang
CVPR
2009
IEEE
14 years 11 months ago
Unsupervised Maximum Margin Feature Selection with Manifold Regularization
Feature selection plays a fundamental role in many pattern recognition problems. However, most efforts have been focused on the supervised scenario, while unsupervised feature s...
Bin Zhao, James Tin-Yau Kwok, Fei Wang, Changshui ...
ICDM
2009
IEEE
175views Data Mining» more  ICDM 2009»
13 years 2 months ago
Maximum Margin Clustering with Multivariate Loss Function
This paper presents a simple but powerful extension of the maximum margin clustering (MMC) algorithm that optimizes multivariate performance measure specifically defined for clust...
Bin Zhao, James Tin-Yau Kwok, Changshui Zhang
TKDE
2012
245views Formal Methods» more  TKDE 2012»
11 years 6 months ago
Semi-Supervised Maximum Margin Clustering with Pairwise Constraints
—The pairwise constraints specifying whether a pair of samples should be grouped together or not have been successfully incorporated into the conventional clustering methods such...
Hong Zeng, Yiu-ming Cheung
KDD
2009
ACM
188views Data Mining» more  KDD 2009»
14 years 4 months ago
Mining discrete patterns via binary matrix factorization
Mining discrete patterns in binary data is important for subsampling, compression, and clustering. We consider rankone binary matrix approximations that identify the dominant patt...
Bao-Hong Shen, Shuiwang Ji, Jieping Ye