This paper presents a simple but powerful extension of the maximum margin clustering (MMC) algorithm that optimizes multivariate performance measure specifically defined for clustering, including Normalized Mutual Information, Rand Index and F-measure. Different from previous MMC algorithms that always employ the error rate as the loss function, our formulation involves a multivariate loss function that is a non-linear combination of the individual clustering results. Computationally, we propose a cutting plane algorithm to approximately solve the resulting optimization problem with a guaranteed accuracy. Experimental evaluations show clear improvements in clustering performance of our method over previous maximum margin clustering algorith...
The notion of cluster ability is often used to determine how strong the cluster structure within a s...
Information-maximization clustering learns a probabilistic classifier in an unsuper-vised manner so ...
In this paper, we introduce an assumption which makes it possible to extend the learn-ing ability of...
Motivated by the success of large margin methods in supervised learning, maximum margin clustering (...
Motivated by the success of large margin methods in supervised learning, maximum margin clustering (...
Maximum margin clustering (MMC) has recently attracted considerable interests in both the data minin...
Maximum margin clustering (MMC), which borrows the large margin heuristic from support vector machin...
In recent decades, large margin methods such as Support Vector Machines (SVMs) are supposed to be th...
Maximum margin clustering was proposed lately and has shown promising performance in recent studies ...
We present a maximum margin framework that clusters data using latent vari-ables. Using latent repre...
This paper proposes a new approach for discriminative clustering. The intuition is, for a good clust...
We present max-margin Bayesian clustering (BMC), a general and robust frame-work that incorporates t...
We present a hierarchical maximum-margin clus-tering method for unsupervised data analysis. Our meth...
The minimum-sum-of-squared error clustering (MSSC) is one of the most intuitive and popular clusteri...
A new approach to clustering multivariate data, based on a multilevel linear mixed model, is propose...
The notion of cluster ability is often used to determine how strong the cluster structure within a s...
Information-maximization clustering learns a probabilistic classifier in an unsuper-vised manner so ...
In this paper, we introduce an assumption which makes it possible to extend the learn-ing ability of...
Motivated by the success of large margin methods in supervised learning, maximum margin clustering (...
Motivated by the success of large margin methods in supervised learning, maximum margin clustering (...
Maximum margin clustering (MMC) has recently attracted considerable interests in both the data minin...
Maximum margin clustering (MMC), which borrows the large margin heuristic from support vector machin...
In recent decades, large margin methods such as Support Vector Machines (SVMs) are supposed to be th...
Maximum margin clustering was proposed lately and has shown promising performance in recent studies ...
We present a maximum margin framework that clusters data using latent vari-ables. Using latent repre...
This paper proposes a new approach for discriminative clustering. The intuition is, for a good clust...
We present max-margin Bayesian clustering (BMC), a general and robust frame-work that incorporates t...
We present a hierarchical maximum-margin clus-tering method for unsupervised data analysis. Our meth...
The minimum-sum-of-squared error clustering (MSSC) is one of the most intuitive and popular clusteri...
A new approach to clustering multivariate data, based on a multilevel linear mixed model, is propose...
The notion of cluster ability is often used to determine how strong the cluster structure within a s...
Information-maximization clustering learns a probabilistic classifier in an unsuper-vised manner so ...
In this paper, we introduce an assumption which makes it possible to extend the learn-ing ability of...