Bibliography

(eng): This paper deals with clustering non-gaussian data with fixed bounds. It considers the problem using recursive mixture estimation algorithms under the Bayesian methodology. Such a solution is often desired in areas, where the assumption of normality of modeled data is rather questionable and brings a series of limitations (e.g., non-negative, bounded data, etc.). Here for modeling the data a mixture of uniform distributions is taken, where individual clusters are described by mixture components. For the on-line detection of clusters of measured bounded data, the paper proposes a mixture estimation algorithm based on (i) the update of reproducible statistics of uniform components; (ii) the heuristic initialization via the method of moments; (iii) the non-trivial adaptive forgetting technique; (iv) the data-dependent dynamic pointer model. The approach is validated using realistic traffic flow simulations.