Comments on "Parallel algorithms for hierarchical clustering and cluster validity

In the above-titled paper (ibid., vol.12, no.11, p.1088-92, Nov. 1990), parallel implementations of hierarchical clustering algorithms that achieve O(n/sup 2/) computational time complexity and thereby improve on the baseline of sequential implementations are described. The latter are stated to be O...

Full description

Saved in:
Bibliographic Details
Published inIEEE transactions on pattern analysis and machine intelligence Vol. 14; no. 10; pp. 1056 - 1057
Main Author Murtagh, F.
Format Journal Article
LanguageEnglish
Published IEEE 01.10.1992
Subjects
Online AccessGet full text
ISSN0162-8828
2160-9292
DOI10.1109/34.159908

Cover

Abstract In the above-titled paper (ibid., vol.12, no.11, p.1088-92, Nov. 1990), parallel implementations of hierarchical clustering algorithms that achieve O(n/sup 2/) computational time complexity and thereby improve on the baseline of sequential implementations are described. The latter are stated to be O(n/sup 3/), with the exception of the single-link method. The commenter points out that state-of-the-art hierarchical clustering algorithms have O(n/sup 2/) time complexity and should be referred to in preference to the O(n/sup 3/) algorithms, which were described in many texts in the 1970s. Some further references in the parallelizing of hierarchic clustering algorithms are provided.< >
AbstractList In the above-titled paper (ibid., vol.12, no.11, p.1088-92, Nov. 1990), parallel implementations of hierarchical clustering algorithms that achieve O(n/sup 2/) computational time complexity and thereby improve on the baseline of sequential implementations are described. The latter are stated to be O(n/sup 3/), with the exception of the single-link method. The commenter points out that state-of-the-art hierarchical clustering algorithms have O(n/sup 2/) time complexity and should be referred to in preference to the O(n/sup 3/) algorithms, which were described in many texts in the 1970s. Some further references in the parallelizing of hierarchic clustering algorithms are provided.< >
Author Murtagh, F.
Author_xml – sequence: 1
  givenname: F.
  surname: Murtagh
  fullname: Murtagh, F.
  organization: ESA Space Telescope-European Coordinating Fac., Garching bei Munchen, Germany
BookMark eNptkE1LAzEYhINUsK0evHoK3jxsm2S_kqMUv6Cggp6Xt9k3bSSbSBKF_nuVVQTxNAzzzBxmRiY-eCTklLMF50wty2rBa6WYPCBTwRtWKKHEhEwZb0QhpZBHZJbSC2O8qlk5JY-rMAzoc6LB0_MHiOAcOgpuG6LNuyFREyLdWYwQ9c5qcFS7t5QxWr-l4PsfS9_B2d7m_TE5NOASnnzrnDxfXz2tbov1_c3d6nJdaCHaXEi9KZU0qlZcAbYtaoGVQMGVlqyXmhuhZLMppUZsDatNU7NaSmag10q3spyT5birY0gpoum0zZBt8DmCdR1n3dcjXVl14yOfjYs_jddoB4j7f9mzkbWI-MuN4QdYw2vZ
CODEN ITPIDJ
CitedBy_id crossref_primary_10_1016_j_jglr_2019_06_007
crossref_primary_10_1016_S0950_5849_99_00018_X
crossref_primary_10_1142_S0129054102001242
crossref_primary_10_1016_S0198_9715_01_00044_8
crossref_primary_10_1134_S0081543809020175
crossref_primary_10_1142_S0129053300000096
crossref_primary_10_1134_S0026261720030133
crossref_primary_10_7717_peerj_12748
crossref_primary_10_1007_s00357_014_9161_z
crossref_primary_10_1155_2007_24717
crossref_primary_10_5351_KJAS_2002_15_2_381
Cites_doi 10.1108/eb026836
10.1007/BF01890115
10.1093/comjnl/16.1.30
10.1145/355921.355927
10.1016/0020-0190(78)90039-X
10.1016/0020-0190(83)90095-9
10.1093/comjnl/20.4.364
10.1109/34.61708
10.1093/comjnl/26.4.354
ContentType Journal Article
DBID AAYXX
CITATION
DOI 10.1109/34.159908
DatabaseName CrossRef
DatabaseTitle CrossRef
DatabaseTitleList
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
Computer Science
EISSN 2160-9292
EndPage 1057
ExternalDocumentID 10_1109_34_159908
159908
Genre comment-reply
GroupedDBID ---
-DZ
-~X
.DC
0R~
29I
4.4
53G
5GY
5VS
6IK
97E
9M8
AAJGR
AARMG
AASAJ
AAWTH
ABAZT
ABFSI
ABQJQ
ABVLG
ACGFO
ACGFS
ACIWK
ACNCT
ADRHT
AENEX
AETEA
AETIX
AGQYO
AGSQL
AHBIQ
AI.
AIBXA
AKJIK
AKQYR
ALLEH
ALMA_UNASSIGNED_HOLDINGS
ASUFR
ATWAV
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CS3
DU5
E.L
EBS
EJD
F5P
FA8
HZ~
H~9
IBMZZ
ICLAB
IEDLZ
IFIPE
IFJZH
IPLJI
JAVBF
LAI
M43
MS~
O9-
OCL
P2P
PQQKQ
RIA
RIE
RNI
RNS
RXW
RZB
TAE
TN5
UHB
VH1
XJT
~02
AAYXX
CITATION
ID FETCH-LOGICAL-c227t-8cb398f95919ae77ec2e42e219c80d8c1f2986b38cee7f05f6505880fadc9c783
IEDL.DBID RIE
ISSN 0162-8828
IngestDate Thu Apr 24 23:12:36 EDT 2025
Wed Oct 01 03:57:21 EDT 2025
Wed Aug 27 02:47:52 EDT 2025
IsPeerReviewed true
IsScholarly true
Issue 10
Language English
License https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c227t-8cb398f95919ae77ec2e42e219c80d8c1f2986b38cee7f05f6505880fadc9c783
PageCount 2
ParticipantIDs ieee_primary_159908
crossref_citationtrail_10_1109_34_159908
crossref_primary_10_1109_34_159908
ProviderPackageCode CITATION
AAYXX
PublicationCentury 1900
PublicationDate 1992-10
PublicationDateYYYYMMDD 1992-10-01
PublicationDate_xml – month: 10
  year: 1992
  text: 1992-10
PublicationDecade 1990
PublicationTitle IEEE transactions on pattern analysis and machine intelligence
PublicationTitleAbbrev TPAMI
PublicationYear 1992
Publisher IEEE
Publisher_xml – name: IEEE
References rohlf (ref12) 1973; 16
ref14
de rham (ref11) 1980; v
sneath (ref15) 1973
bruynooghe (ref2) 1977
ref1
ref16
ref8
murtagh (ref9) 1984; 1
ref7
ref4
ref3
ref6
juan (ref5) 1982; vii
rohlf (ref13) 1978; 7
murtagh (ref10) 1985; 4
References_xml – ident: ref16
  doi: 10.1108/eb026836
– year: 1973
  ident: ref15
  publication-title: Numerical Taxonomy
– ident: ref3
  doi: 10.1007/BF01890115
– volume: vii
  start-page: 219
  year: 1982
  ident: ref5
  article-title: Programme de classification hi rarchique par l'algorithme de la recherche en cha ne des voisins r ciproques
  publication-title: Les Cahiers de l'Analyse des Donnes
– volume: v
  start-page: 135
  year: 1980
  ident: ref11
  article-title: La classification hi rarchique ascendante selon la m thode des voisins r ciproques
  publication-title: Les Cahiers de l'Analyse des Donnes
– ident: ref14
  doi: 10.1093/comjnl/16.1.30
– ident: ref1
  doi: 10.1145/355921.355927
– volume: 7
  start-page: 44
  year: 1978
  ident: ref13
  article-title: A probabilistic minimum spanning tree algorithm
  publication-title: Inform Proc Lett
  doi: 10.1016/0020-0190(78)90039-X
– ident: ref8
  doi: 10.1016/0020-0190(83)90095-9
– start-page: 24
  year: 1977
  ident: ref2
  article-title: M thodes nouvelles en classification automatique des donn es taxinomiques nombreuses
  publication-title: Stat Anal Donn es
– volume: 1
  start-page: 101
  year: 1984
  ident: ref9
  article-title: Complexities of hierarchic clustering algorithms: State of the art
  publication-title: Comput Stat Quarter
– volume: 16
  start-page: 93
  year: 1973
  ident: ref12
  article-title: Algorithm 76: Hierarchical clustering using the minimum spanning tree
  publication-title: Comput J
– ident: ref4
  doi: 10.1093/comjnl/20.4.364
– volume: 4
  year: 1985
  ident: ref10
  publication-title: Multidimensional Clustering Algorithms
– ident: ref6
  doi: 10.1109/34.61708
– ident: ref7
  doi: 10.1093/comjnl/26.4.354
SSID ssj0014503
Score 1.5259386
Snippet In the above-titled paper (ibid., vol.12, no.11, p.1088-92, Nov. 1990), parallel implementations of hierarchical clustering algorithms that achieve O(n/sup 2/)...
SourceID crossref
ieee
SourceType Enrichment Source
Index Database
Publisher
StartPage 1056
SubjectTerms Clustering algorithms
Clustering methods
Concurrent computing
Machine intelligence
Nearest neighbor searches
Parallel algorithms
Title Comments on "Parallel algorithms for hierarchical clustering and cluster validity
URI https://ieeexplore.ieee.org/document/159908
Volume 14
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVIEE
  databaseName: IEEE Electronic Library (IEL) (F)
  customDbUrl:
  eissn: 2160-9292
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0014503
  issn: 0162-8828
  databaseCode: RIE
  dateStart: 19790101
  isFulltext: true
  titleUrlDefault: https://ieeexplore.ieee.org/
  providerName: IEEE
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV3PS8MwFA66kx6cTsX5izA8eGnXH2mTHEUcQ1AUHOxW0iTVYW1lay_-9b6k3Zyyg7cmvNCSJn1f-t77PoSuQspTFfqw01ggHUI85XDqcUfGoZAK2kKaiO7DYzyekPtpNG15tm0tjNbaJp9p11zaWL4qZW1-lQ3B9XJT2LtNWdyUaq0CBiSyIsgAYOxtWUsi5Ht8GBK3GfjL9axpqVhXMuo2NdoLy0BoMkje3bpKXfn1h5_xn0-5j_ZaSIlvmjVwgLZ00UPdpVwDbndvD-2ucQ8eomdTGmKyKHBZ4MGTmBtRlRyL_LWcz6q3jwUGOIuNUraNNcCrxDKvDa0CDMeiUMsmhrU6UwDmj9BkdPdyO3ZafQVHBgGtHCbTkLOMR9znQlOqZaBJoOEbJpmnmPSzgLM4DRk4Upp5UQZoLoL9ngkluaQsPEadoiz0CcJZRiMqFIAHAec9HnMifQW2ShCWAWbso-vl1CeyJR83Ghh5Yg8hHk9CkjQT10eDlelnw7ixyahnJv7HwPaebuw9Qzs2x9Zm4J2jTjWv9QUgiSq9tGvoG_1QxvY
linkProvider IEEE
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV3PT8IwFG6MHtSDKGrEnw3x4GWwHx1tj8ZIUIFoAgm3pWs7JeIwsF38633tBqLh4G1tXrOla_e-7r33fQhdB5THKvBgpzFfOoS4yuHU5Y5sBUIqaAtpIrq9fqszJI-jcFTybNtaGK21TT7TDXNpY_lqKnPzq6wJrpebwt6tkBASFsVay5ABCa0MMkAYe2NW0gh5Lm8GpFEM_eV8VtRUrDNpV4oq7bnlIDQ5JO-NPIsb8usPQ-M_n3Mf7ZWgEt8Wq-AAbei0iioLwQZc7t8q2l1hHzxEL6Y4xORR4GmK689iZmRVJlhMXqezcfb2MccAaLHRyrbRBniZWE5yQ6wAw7FI1aKJYbWOFcD5IzRs3w_uOk6psOBI36eZw2QccJbwkHtcaEq19DXxNXzFJHMVk17ic9aKAwaulCZumACeC2HHJ0JJLikLjtFmOk31CcJJQkMqFMAHASc-3uJEegpslSAsAdRYQzeLqY9kST9uVDAmkT2GuDwKSFRMXA3Vl6afBefGOqOqmfgfA9t7urb3Cm13Br1u1H3oP52hHZtxa_PxztFmNsv1BeCKLL606-kbkd7KQw
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%3Ajournal&rft.genre=article&rft.atitle=Comments+on+%22Parallel+algorithms+for+hierarchical+clustering+and+cluster+validity&rft.jtitle=IEEE+transactions+on+pattern+analysis+and+machine+intelligence&rft.au=Murtagh%2C+F.&rft.date=1992-10-01&rft.pub=IEEE&rft.issn=0162-8828&rft.volume=14&rft.issue=10&rft.spage=1056&rft.epage=1057&rft_id=info:doi/10.1109%2F34.159908&rft.externalDocID=159908
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0162-8828&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0162-8828&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0162-8828&client=summon