Publication:
Improvement on agglomerative hierarchical clustering algorithm based on tree data structure with bidirectional approach

Simple item page
dc.Conferencecode89401
dc.Conferencedate8 February 2012 through 10 February 2012
dc.ConferencelocationKota Kinabalu
dc.Conferencename3rd International Conference on Intelligent Systems Modelling and Simulation, ISMS 2012
dc.citedby5
dc.contributor.affiliationsFaculty of Science and Technology
dc.contributor.affiliationsUniversiti Sains Islam Malaysia (USIM)
dc.contributor.authorDalbouh H.A.en_US
dc.contributor.authorMd Norwawi N.en_US
dc.date.accessioned2024-05-29T01:59:28Z
dc.date.available2024-05-29T01:59:28Z
dc.date.issued2012
dc.description.abstractHierarchical clustering algorithms take an input of pairwise data-item similarities and output a hierarchy of the data-items. This paper presents bidirectional 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 bidirectional 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. � 2012 IEEE.
dc.description.natureFinalen_US
dc.identifier.ArtNo6169670
dc.identifier.doi10.1109/ISMS.2012.13
dc.identifier.epage30
dc.identifier.isbn9780770000000
dc.identifier.scopus2-s2.0-84859966324
dc.identifier.spage25
dc.identifier.urihttps://www.scopus.com/inward/record.uri?eid=2-s2.0-84859966324&doi=10.1109%2fISMS.2012.13&partnerID=40&md5=c2394b850679810fd2ba2245bd14f5fd
dc.identifier.urihttps://oarep.usim.edu.my/handle/123456789/10063
dc.languageEnglish
dc.language.isoen_US
dc.relation.ispartofProceedings - 3rd International Conference on Intelligent Systems Modelling and Simulation, ISMS 2012
dc.sourceScopus
dc.subjectBidirectional algorithmen_US
dc.subjectComplexityen_US
dc.subjectHierarchicalen_US
dc.subjectTreeen_US
dc.subjectAgglomerative algorithmen_US
dc.subjectAgglomerative hierarchical clusteringen_US
dc.subjectAVL treeen_US
dc.subjectComplexityen_US
dc.subjectData pointsen_US
dc.subjectHierarchicalen_US
dc.subjectHierarchical clustering algorithmsen_US
dc.subjectHigher efficiencyen_US
dc.subjectImproved algorithmen_US
dc.subjectTime complexityen_US
dc.subjectTreeen_US
dc.subjectTree data structuresen_US
dc.subjectData structuresen_US
dc.subjectForestryen_US
dc.subjectIntelligent systemsen_US
dc.subjectMulti agent systemsen_US
dc.titleImprovement on agglomerative hierarchical clustering algorithm based on tree data structure with bidirectional approach
dc.typeConference Paperen_US
dspace.entity.typePublication

Files

Collections

Scopus