Abstract—Most well-known discriminative clustering mod-els, such as spectral clustering (SC) and maximum margin clustering (MMC), are non-Bayesian. Moreover, they merely considered to embed domain-dependent prior knowledge into data-specific kernels, while other forms of prior knowledge were seldom considered in these models. In this paper, we propose a Bayesian maximum margin clustering model (BMMC) based on the low-density separation assumption, which unifies the merits of both Bayesian and discriminative approaches. In addition to stating prior distribution on functions explicitly as traditional Gaussian processes, special prior knowledge can be embedded into BMMC implicitly via the Universum set easily. Furthermore, it is much easier to...
We develop a Bayesian framework for tackling the supervised clustering problem, the generic problem ...
A new clustering approach based on mode identification is developed by applying new optimization tec...
Cluster analysis is concerned with partitioning cases into clusters such that the cases in a cluster...
We present max-margin Bayesian clustering (BMC), a general and robust frame-work that incorporates t...
This paper proposes a new approach for discriminative clustering. The intuition is, for a good clust...
In this paper, we introduce an assumption which makes it possible to extend the learn-ing ability of...
We present a novel algorithm for agglomerative hierarchical clustering based on evaluating marginal ...
Maximum margin clustering was proposed lately and has shown promising performance in recent studies ...
Maximum margin clustering (MMC), which borrows the large margin heuristic from support vector machin...
Motivated by the success of large margin methods in supervised learning, maximum margin clustering (...
The Dirichlet process mixtures (DPM) can automatically infer the model complexity from data. Hence i...
<p>Clustering methods are designed to separate heterogeneous data into groups of similar objects suc...
Existing clustering methods can be roughly classified into two categories: generative and discrimina...
Motivated by the success of large margin methods in supervised learning, maximum margin clustering (...
We introduce a new class of “maximization expectation” (ME) algorithms where we maximize over hidden...
We develop a Bayesian framework for tackling the supervised clustering problem, the generic problem ...
A new clustering approach based on mode identification is developed by applying new optimization tec...
Cluster analysis is concerned with partitioning cases into clusters such that the cases in a cluster...
We present max-margin Bayesian clustering (BMC), a general and robust frame-work that incorporates t...
This paper proposes a new approach for discriminative clustering. The intuition is, for a good clust...
In this paper, we introduce an assumption which makes it possible to extend the learn-ing ability of...
We present a novel algorithm for agglomerative hierarchical clustering based on evaluating marginal ...
Maximum margin clustering was proposed lately and has shown promising performance in recent studies ...
Maximum margin clustering (MMC), which borrows the large margin heuristic from support vector machin...
Motivated by the success of large margin methods in supervised learning, maximum margin clustering (...
The Dirichlet process mixtures (DPM) can automatically infer the model complexity from data. Hence i...
<p>Clustering methods are designed to separate heterogeneous data into groups of similar objects suc...
Existing clustering methods can be roughly classified into two categories: generative and discrimina...
Motivated by the success of large margin methods in supervised learning, maximum margin clustering (...
We introduce a new class of “maximization expectation” (ME) algorithms where we maximize over hidden...
We develop a Bayesian framework for tackling the supervised clustering problem, the generic problem ...
A new clustering approach based on mode identification is developed by applying new optimization tec...
Cluster analysis is concerned with partitioning cases into clusters such that the cases in a cluster...