About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
ICPR 2000
Conference paper
Online adaptive clustering in a decision tree framework
Abstract
We present an online adaptive clustering algorithm in a decision tree framework which has an adaptive tree and a code formation layer. The code formation layer stores the representative codes of the clusters and the tree adapts the separating hyperplanes between the clusters. The membership of a sample in a cluster is decided by the tree and the tree parameters are guided by stored codes. The model provides a hierarchical representation of the clusters by minimizing a global objective function as opposed to the exisitng hierarchical clusterings where a local objective function at every level is optimized. We show the results on real-life data. © 2008 IEEE.