Abstract. In this article we present an incremental method for building a mixture model. Given the desired number of clusters K ≥ 2, we start with a two-component mixture and we optimize the likelihood by repeatedly applying a Split-Merge operation. When an optimum is obtained, we add a new component to the model by splitting in two, a properly chosen cluster. This goes on until the number of components reaches a preset limiting value. We have performed numerical experiments on several data–sets and report a performance comparison with other rival methods.
We present a split-and-merge expectation-maximization (SMEM) algo-rithm to overcome the local maxima...
Within the field of data clustering, methods are commonly referred to as either 'distance-based' or ...
Finite mixture model is a powerful tool in many statistical learning problems. In this paper, we pro...
This note is completely expository, and contains a whirlwind abridged introduction to the topic of m...
We present an algorithm for generating a mixture model from a data set by converting the data into a...
Finite mixture models are widely used to model data that exhibit heterogeneity. In machine learning,...
peer reviewedOnline learning, Gaussian mixture model, Uncertain model. We present a method for incre...
In this dissertation, we propose several methodology in clustering and mixture modeling when the use...
AbstractIn this paper, an algorithm is proposed to integrate the unsupervised learning with the opti...
In this paper, an algorithm is proposed to integrate the unsupervised learning with the optimization...
Cluster analysis via a finite mixture model approach is considered. With this approach to clustering...
Finite mixture models are being increasingly used to model the distributions of a wide variety of ra...
The methodological literature on mixture modeling has rapidly expanded in the past 15 years, and mix...
Finite mixture model is a powerful tool in many statistical learning problems. In this paper, we pro...
Two methods for both clustering data and choosing a mixture model are proposed. First, the unknown c...
We present a split-and-merge expectation-maximization (SMEM) algo-rithm to overcome the local maxima...
Within the field of data clustering, methods are commonly referred to as either 'distance-based' or ...
Finite mixture model is a powerful tool in many statistical learning problems. In this paper, we pro...
This note is completely expository, and contains a whirlwind abridged introduction to the topic of m...
We present an algorithm for generating a mixture model from a data set by converting the data into a...
Finite mixture models are widely used to model data that exhibit heterogeneity. In machine learning,...
peer reviewedOnline learning, Gaussian mixture model, Uncertain model. We present a method for incre...
In this dissertation, we propose several methodology in clustering and mixture modeling when the use...
AbstractIn this paper, an algorithm is proposed to integrate the unsupervised learning with the opti...
In this paper, an algorithm is proposed to integrate the unsupervised learning with the optimization...
Cluster analysis via a finite mixture model approach is considered. With this approach to clustering...
Finite mixture models are being increasingly used to model the distributions of a wide variety of ra...
The methodological literature on mixture modeling has rapidly expanded in the past 15 years, and mix...
Finite mixture model is a powerful tool in many statistical learning problems. In this paper, we pro...
Two methods for both clustering data and choosing a mixture model are proposed. First, the unknown c...
We present a split-and-merge expectation-maximization (SMEM) algo-rithm to overcome the local maxima...
Within the field of data clustering, methods are commonly referred to as either 'distance-based' or ...
Finite mixture model is a powerful tool in many statistical learning problems. In this paper, we pro...