Cluster ensemble in adaptive tree structured clustering Online publication date: Sat, 07-Mar-2015
by Takashi Yamaguchi, Yuki Noguchi, Kenneth J. Mackin, Takumi Ichimura
International Journal of Knowledge Engineering and Soft Data Paradigms (IJKESDP), Vol. 3, No. 1, 2011
Abstract: Adaptive tree structured clustering (ATSC) is our proposed divisive hierarchical clustering method that recursively divides a data set into two subsets using self-organising feature map (SOM). In each partition, after the data set is quantised by SOM, the quantised data is divided using agglomerative hierarchical clustering. ATSC can divide the data sets regardless of data size in feasible time. On the other hand the number of cluster and the members of each cluster are not universal in each run. This non-universality is fundamental problem in the other divisive hierarchical clustering and partitioned clustering. In this paper, we apply cluster ensemble to each data partition of ATSC in order to improve universality. Cluster ensemble is a framework by using multiple learners for improving universality. From the computer simulation, we showed that the proposed method is effective for improving universality. Moreover, the accuracy was improved by solving the non-universality of each partition.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Knowledge Engineering and Soft Data Paradigms (IJKESDP):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook