The performance of graph based clustering methods critically depends on the quality of the distance function, used to compute similarities between pairs of neighboring nodes. In t...
Abstract. This paper elaborates on an efficient approach for clustering discrete data by incrementally building multinomial mixture models through likelihood maximization using the...
In this paper, we propose a Boosted Interactively Distributed Particle Filter (BIDPF) to address the problem of automatic multi-object tracking in the application of player tracki...
Abstracts "Mixtures at the Interface" David Scott, Rice University Mixture modeling provides an effective framework for complex, high-dimensional data. The potential of m...
— Since the Estimation of Distribution Algorithms (EDAs) have been introduced, several single model based EDAs and mixture model based EDAs have been developed. Take Gaussian mod...