Data coming from complex simulation models reach easily dimensions much greater than available computational resources. Visualization of such data still represents the most intuit...
In high dimensional data, clusters often only exist in arbitrarily oriented subspaces of the feature space. In addition, these so-called correlation clusters may have complex rela...
Abstract In data clustering, many approaches have been proposed. For example, K-means method and hierarchical method. A problem is in effect by initial value and criterion to comb...
EM algorithm is an important unsupervised clustering algorithm, but the algorithm has several limitations. In this paper, we propose a fast EM algorithm (FEMA) to address the limi...
We present a novel algorithm for agglomerative hierarchical clustering based on evaluating marginal likelihoods of a probabilistic model. This algorithm has several advantages ove...