Agglomerative Grouping of Observations by Bounding Entropy Variation

Abstract. An information theoretic framework for grouping observations is proposed. The entropy change incurred by new observations is analyzed using the Kalman filter update equations. It is found, that the entropy variation is caused by a positive similarity term and a negative proximity term. Bounding the similarity term in the spirit of the minimum description length principle and the proximity term in the spirit of maximum entropy inference a robust and efficient grouping procedure is devised. Some of its properties are demonstrated for the exemplary task of edgel grouping.

• Type: Conference
• Year: 2005
• Where: DAGM
• Authors: Christian Beder
• Keywords: DAGM 2005, Entropy, Proximity Term, Similarity Term