Representative cross information potential clustering

Daniel Araújo

doi:10.1016/j.patrec.2013.08.021

2013-12-01

PRE

Daniel Araújo *

Adrião Duarte Dória Neto

Allan Martins

DOI：10.1016/j.patrec.2013.08.021

原文链接

原文求助

摘要

En 中文

This paper proposes an information-theoretic approach for clustering with a new measure of cross information potential and two clustering algorithms. Instead of using all points of the dataset, the proposed measure uses representative points to quantify the interaction between distributions without any loss of the original properties of cross information potential. This brings a double advantage. It decreases the cost of computing the cross information potential, thus drastically reducing the running time. Secondly, it captures the interaction among the data points by utilizing the underlying statistics of the space region centered around the representative points. With this, we have made it possible to use cross information potential in applications where it was not. We also proposed two algorithms for clustering which explore the idea of creating links between regions of the feature space that are highly correlated. We ran several tests and compared the results with single linkage hierarchical algorithm, finite mixture of Gaussians and spectral clustering in both synthetic and real image segmentation datasets. Experiments showed that our approach achieved better results compared to the other algorithms and it was capable of capture the real structure of the data in most cases regardless of its complexity. It also produced good image segmentation with the advantage of a tuning parameter that provides a way of refine segmentation. (C) 2013 Elsevier B. V. All rights reserved.

Keyword:

Clustering

Entropy

Information theory

Information potential

Complex data

Image segmentation