Scheduled System Maintenance:
Some services will be unavailable Sunday, March 29th through Monday, March 30th. We apologize for the inconvenience.
By Topic

Improvement on Agglomerative Hierarchical Clustering Algorithm Based on Tree Data Structure with Bidirectional Approach

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Dalbouh, H.A. ; Fac. of Sci. & Technol, Univ. Sains Islam Malaysia (USIM), Nilai, Malaysia ; Norwawi, N.M.

Hierarchical clustering algorithms take an input of pair wise data-item similarities and output a hierarchy of the data-items. This paper presents bi-directional agglomerative hierarchical clustering algorithm to create a bottom-up hierarchy, by iteratively merging the closest pair of data-items into one cluster. The result is a rooted AVL tree. The n leafs correspond to input data-items that need to n/2 or n/2+1 steps to merge into one cluster, correspond to groupings of items in coarser granularities climbing towards the root. As observed from the time complexity and number of steps needed to cluster all data points into one cluster perspective, the performance of the bi-directional agglomerative algorithm using tree data structure is better than the current agglomerative algorithms. Analysis on the experimental results indicates that the improved algorithm has a higher efficiency than previous methods.

Published in:

Intelligent Systems, Modelling and Simulation (ISMS), 2012 Third International Conference on

Date of Conference:

8-10 Feb. 2012