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

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 int...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:2012 Third International Conference on Intelligent Systems Modelling and Simulation S. 25 - 30
Hauptverfasser: Dalbouh, Hussain Abu, Norwawi, Norita Md
Format: Tagungsbericht
Sprache:Englisch
Veröffentlicht: IEEE 01.02.2012
Schlagworte:
Algorithm design and analysis
Bidirectional algorithm
Clustering algorithms
Complexity
Complexity theory
Compounds
Hierarchical
Partitioning algorithms
Tin
Tree
Tree data structures
ISBN:1467308862, 9781467308861
ISSN:2166-0662
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Abstract 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.
AbstractList 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.
Author Dalbouh, Hussain Abu
Norwawi, Norita Md
Author_xml – sequence: 1
  givenname: Hussain Abu
  surname: Dalbouh
  fullname: Dalbouh, Hussain Abu
  email: hussainmdalbouh@yahoo.com
  organization: Fac. of Sci. & Technol, Univ. Sains Islam Malaysia (USIM), Nilai, Malaysia
– sequence: 2
  givenname: Norita Md
  surname: Norwawi
  fullname: Norwawi, Norita Md
  email: norita@usim.edu.my
  organization: Fac. of Sci. & Technol, Univ. Sains Islam Malaysia (USIM), Nilai, Malaysia
BookMark eNotT7tuwjAUdVUqFShbty7-gdDrPK7tEegDJKoOsCPHuQmu8kCOAfXvm6qdzhnOc8JGbdcSY48C5kKAft7sPnbzGEQ8F8kNm2mpQKLOUkQlbtlEpCgTUArjERvHAjECxPiezfr-CwAESK20GrPrpjn57kINtYF3LV9UVd015E1wF-JrNzBvj86amq_qcx_Iu7bii7rqvAvHhi9NT8Wvce-J-IsJhu-CP9tw9sSvg4QvXeE82eC6dghZnIY6Y48P7K40dU-zf5yy_dvrfrWOtp_vm9ViGzkNIUqNsDYbpuYGy0xpKVSRgNBWWMp1nmaUYiFLnSeQ4vC90IURpDGDUuYqpWTKnv5iHREdTt41xn8fUKBGCckPYqZhjw
ContentType Conference Proceeding
DBID 6IE
6IL
CBEJK
RIE
RIL
DOI 10.1109/ISMS.2012.13
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Xplore POP ALL
IEEE Xplore All Conference Proceedings
IEEE Electronic Library (IEL)
IEEE Proceedings Order Plans (POP All) 1998-Present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EISBN 9780769546681
0769546684
EndPage 30
ExternalDocumentID 6169670
Genre orig-research
GroupedDBID 6IE
6IF
6IL
6IN
AAJGR
AAWTH
ADZIZ
ALMA_UNASSIGNED_HOLDINGS
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CBEJK
CHZPO
IEGSK
IPLJI
M43
OCL
RIE
RIL
ID FETCH-LOGICAL-i90t-4a1cc5798ba6f589718d3019c1ceb9b45e46d7f9b3046546d9da1e9650f7b84e3
IEDL.DBID RIE
ISBN 1467308862
9781467308861
ISSN 2166-0662
IngestDate Thu May 29 05:57:38 EDT 2025
IsPeerReviewed false
IsScholarly false
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i90t-4a1cc5798ba6f589718d3019c1ceb9b45e46d7f9b3046546d9da1e9650f7b84e3
PageCount 6
ParticipantIDs ieee_primary_6169670
PublicationCentury 2000
PublicationDate 2012-Feb.
PublicationDateYYYYMMDD 2012-02-01
PublicationDate_xml – month: 02
  year: 2012
  text: 2012-Feb.
PublicationDecade 2010
PublicationTitle 2012 Third International Conference on Intelligent Systems Modelling and Simulation
PublicationTitleAbbrev isms
PublicationYear 2012
Publisher IEEE
Publisher_xml – name: IEEE
SSID ssj0001079898
ssib026766966
ssj0000669832
Score 1.5192342
Snippet Hierarchical clustering algorithms take an input of pair wise data-item similarities and output a hierarchy of the data-items. This paper presents...
SourceID ieee
SourceType Publisher
StartPage 25
SubjectTerms Algorithm design and analysis
Bidirectional algorithm
Clustering algorithms
Complexity
Complexity theory
Compounds
Hierarchical
Partitioning algorithms
Tin
Tree
Tree data structures
Title Improvement on Agglomerative Hierarchical Clustering Algorithm Based on Tree Data Structure with Bidirectional Approach
URI https://ieeexplore.ieee.org/document/6169670
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3PT8IwGG2QePDkDzD-Tg8eHWyjfG2PgBJMlJBADDeydh0uwc1M0H_fft1AD168tUvWbG3X171-73uE3PqgmGQaPOh0wGNhwvCQUHoWrS26xFpELojm5YmPx2I-l5MaudtpYYwxLvjMtLDozvLjXG-QKmtDABK4_UHf45yXWq3t3AmBA2y37uUqDFJUmknHt_gcrRLRay4AQOF96HReYKe4EBBu0z9V9WAXJC_bj9PnKQaBhS00QfhlwuIwaHj4v6c_Is0fMR-d7GDqmNRMdkIOt24OtPq4G-Sr5BccXUjzjPaWy1WOlBUuiHSUolLZGaes6GC1wfwKtjnaWy3zIl2_vtG-xcMYb5wVxtD7aB3RqUtOuykMRbqX9tMSQB37SHtVNvMmmQ0fZoORV9kyeKn01x6LAq27tjNVBElXSAtusV0lpA60UVKxrmEQ80QqPHPt2rKMo8BIuxNMuBLMdE5JPcszc0aoUDKC0IcEAs3ijq0JlWCSOmzV-NE5aWA3Lt7LxBuLqgcv_r58SQ5wkMqQ6itSt69orsm-_lynH8WNmy3fI0O4Xw
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3PT8IwGG0ImugJFYy_7cGjg21039ojoAYiEBIWw41sXYdLkBkE_fft123owYu3dsmare36utfvfY-QOxsiJpgEC9ptsJibMDwkFJZGa40useShCaJ5GfrjMZ_NxKRC7ndaGKWUCT5TTSyas_w4k1ukylrggABf_6DveYy5Tq7WKmePCz5AuXnP12EQvFBNGsbF9tEsEd3mHACU3rtG6QV6knMObpkAqqg7uzB50RpMR1MMA3ObaIPwy4bFoNBT7X_Pf0QaP3I-OtkB1TGpqNUJqZV-DrT4vOvkK2cYDGFIsxXtLBbLDEkrXBJpP0WtsrFOWdLecosZFnRztLNcZOt08_pGuxoRY7wxWCtFH8JNSKcmPe12rSgSvrSb5hBq-EfaKfKZN0jw9Bj0-lZhzGClwt5YLHSk9HRnRiEkHhca3mK9TgjpSBWJiHmKQewnIsJTV0-XRRw6Sui9YOJHnKn2KamuspU6I5RHIgTXhgQcyeK2rvEowTR12Kqyw3NSx26cv-epN-ZFD178ffmWHPSD0XA-HIyfL8khDlgeYH1Fqvp11TXZl5-b9GN9Y2bON-tSu6Y
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=2012+Third+International+Conference+on+Intelligent+Systems+Modelling+and+Simulation&rft.atitle=Improvement+on+Agglomerative+Hierarchical+Clustering+Algorithm+Based+on+Tree+Data+Structure+with+Bidirectional+Approach&rft.au=Dalbouh%2C+Hussain+Abu&rft.au=Norwawi%2C+Norita+Md&rft.date=2012-02-01&rft.pub=IEEE&rft.isbn=9781467308861&rft.issn=2166-0662&rft.spage=25&rft.epage=30&rft_id=info:doi/10.1109%2FISMS.2012.13&rft.externalDocID=6169670
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2166-0662&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2166-0662&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2166-0662&client=summon