{"id":"https://openalex.org/W2175766671","doi":"https://doi.org/10.1142/s1793351x15400085","title":"NBC: An Efficient Hierarchical Clustering Algorithm for Large Datasets","display_name":"NBC: An Efficient Hierarchical Clustering Algorithm for Large Datasets","publication_year":2015,"publication_date":"2015-09-01","ids":{"openalex":"https://openalex.org/W2175766671","doi":"https://doi.org/10.1142/s1793351x15400085","mag":"2175766671"},"language":"en","primary_location":{"id":"doi:10.1142/s1793351x15400085","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1793351x15400085","pdf_url":null,"source":{"id":"https://openalex.org/S4210201727","display_name":"International Journal of Semantic Computing","issn_l":"1793-351X","issn":["1793-351X","1793-7108"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Semantic Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5053942348","display_name":"Wei Zhang","orcid":"https://orcid.org/0000-0003-3694-2246"},"institutions":[{"id":"https://openalex.org/I36399199","display_name":"Nanjing University of Science and Technology","ror":"https://ror.org/00xp9wg62","country_code":"CN","type":"education","lineage":["https://openalex.org/I36399199"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Wei Zhang","raw_affiliation_strings":["School of Computer Science and Engineering, Nanjing University of Science and Technology, 200 XiaoLingWei Rd., Nanjing 210094, China"],"affiliations":[{"raw_affiliation_string":"School of Computer Science and Engineering, Nanjing University of Science and Technology, 200 XiaoLingWei Rd., Nanjing 210094, China","institution_ids":["https://openalex.org/I36399199"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5043414541","display_name":"Gongxuan Zhang","orcid":"https://orcid.org/0000-0003-2925-5624"},"institutions":[{"id":"https://openalex.org/I36399199","display_name":"Nanjing University of Science and Technology","ror":"https://ror.org/00xp9wg62","country_code":"CN","type":"education","lineage":["https://openalex.org/I36399199"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Gongxuan Zhang","raw_affiliation_strings":["School of Computer Science and Engineering, Nanjing University of Science and Technology, 200 XiaoLingWei Rd., Nanjing 210094, China"],"affiliations":[{"raw_affiliation_string":"School of Computer Science and Engineering, Nanjing University of Science and Technology, 200 XiaoLingWei Rd., Nanjing 210094, China","institution_ids":["https://openalex.org/I36399199"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100633735","display_name":"Yongli Wang","orcid":"https://orcid.org/0000-0003-2219-067X"},"institutions":[{"id":"https://openalex.org/I36399199","display_name":"Nanjing University of Science and Technology","ror":"https://ror.org/00xp9wg62","country_code":"CN","type":"education","lineage":["https://openalex.org/I36399199"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Yongli Wang","raw_affiliation_strings":["School of Computer Science and Engineering, Nanjing University of Science and Technology, 200 XiaoLingWei Rd., Nanjing 210094, China"],"affiliations":[{"raw_affiliation_string":"School of Computer Science and Engineering, Nanjing University of Science and Technology, 200 XiaoLingWei Rd., Nanjing 210094, China","institution_ids":["https://openalex.org/I36399199"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100854848","display_name":"Zhaomeng Zhu","orcid":null},"institutions":[{"id":"https://openalex.org/I36399199","display_name":"Nanjing University of Science and Technology","ror":"https://ror.org/00xp9wg62","country_code":"CN","type":"education","lineage":["https://openalex.org/I36399199"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Zhaomeng Zhu","raw_affiliation_strings":["School of Computer Science and Engineering, Nanjing University of Science and Technology, 200 XiaoLingWei Rd., Nanjing 210094, China"],"affiliations":[{"raw_affiliation_string":"School of Computer Science and Engineering, Nanjing University of Science and Technology, 200 XiaoLingWei Rd., Nanjing 210094, China","institution_ids":["https://openalex.org/I36399199"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5012896021","display_name":"Tao Li","orcid":"https://orcid.org/0000-0003-3353-4618"},"institutions":[{"id":"https://openalex.org/I36399199","display_name":"Nanjing University of Science and Technology","ror":"https://ror.org/00xp9wg62","country_code":"CN","type":"education","lineage":["https://openalex.org/I36399199"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Tao Li","raw_affiliation_strings":["School of Computer Science and Engineering, Nanjing University of Science and Technology, 200 XiaoLingWei Rd., Nanjing 210094, China"],"affiliations":[{"raw_affiliation_string":"School of Computer Science and Engineering, Nanjing University of Science and Technology, 200 XiaoLingWei Rd., Nanjing 210094, China","institution_ids":["https://openalex.org/I36399199"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5053942348"],"corresponding_institution_ids":["https://openalex.org/I36399199"],"apc_list":null,"apc_paid":null,"fwci":1.7231,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.85220382,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"09","issue":"03","first_page":"307","last_page":"331"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10637","display_name":"Advanced Clustering Algorithms Research","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10627","display_name":"Advanced Image and Video Retrieval Techniques","score":0.9872000217437744,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/nearest-neighbor-chain-algorithm","display_name":"Nearest-neighbor chain algorithm","score":0.8963557481765747},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7231050133705139},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.7168582081794739},{"id":"https://openalex.org/keywords/hierarchical-clustering","display_name":"Hierarchical clustering","score":0.6911823153495789},{"id":"https://openalex.org/keywords/single-linkage-clustering","display_name":"Single-linkage clustering","score":0.5631893277168274},{"id":"https://openalex.org/keywords/hierarchical-clustering-of-networks","display_name":"Hierarchical clustering of networks","score":0.5616886615753174},{"id":"https://openalex.org/keywords/canopy-clustering-algorithm","display_name":"Canopy clustering algorithm","score":0.5403606295585632},{"id":"https://openalex.org/keywords/k-nearest-neighbors-algorithm","display_name":"k-nearest neighbors algorithm","score":0.5294541716575623},{"id":"https://openalex.org/keywords/cure-data-clustering-algorithm","display_name":"CURE data clustering algorithm","score":0.5272670984268188},{"id":"https://openalex.org/keywords/correlation-clustering","display_name":"Correlation clustering","score":0.5149562954902649},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.4950994551181793},{"id":"https://openalex.org/keywords/nearest-neighbor-search","display_name":"Nearest neighbor search","score":0.4468124508857727},{"id":"https://openalex.org/keywords/brown-clustering","display_name":"Brown clustering","score":0.4451545178890228},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4236797094345093},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.39660415053367615},{"id":"https://openalex.org/keywords/pattern-recognition","display_name":"Pattern recognition (psychology)","score":0.38312143087387085},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.29276907444000244}],"concepts":[{"id":"https://openalex.org/C102164700","wikidata":"https://www.wikidata.org/wiki/Q17162702","display_name":"Nearest-neighbor chain algorithm","level":5,"score":0.8963557481765747},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7231050133705139},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.7168582081794739},{"id":"https://openalex.org/C92835128","wikidata":"https://www.wikidata.org/wiki/Q1277447","display_name":"Hierarchical clustering","level":3,"score":0.6911823153495789},{"id":"https://openalex.org/C22648726","wikidata":"https://www.wikidata.org/wiki/Q7523744","display_name":"Single-linkage clustering","level":5,"score":0.5631893277168274},{"id":"https://openalex.org/C82261393","wikidata":"https://www.wikidata.org/wiki/Q17038699","display_name":"Hierarchical clustering of networks","level":5,"score":0.5616886615753174},{"id":"https://openalex.org/C104047586","wikidata":"https://www.wikidata.org/wiki/Q5033439","display_name":"Canopy clustering algorithm","level":4,"score":0.5403606295585632},{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.5294541716575623},{"id":"https://openalex.org/C33704608","wikidata":"https://www.wikidata.org/wiki/Q5014717","display_name":"CURE data clustering algorithm","level":4,"score":0.5272670984268188},{"id":"https://openalex.org/C94641424","wikidata":"https://www.wikidata.org/wiki/Q5172845","display_name":"Correlation clustering","level":3,"score":0.5149562954902649},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.4950994551181793},{"id":"https://openalex.org/C116738811","wikidata":"https://www.wikidata.org/wiki/Q608751","display_name":"Nearest neighbor search","level":2,"score":0.4468124508857727},{"id":"https://openalex.org/C167984511","wikidata":"https://www.wikidata.org/wiki/Q17003931","display_name":"Brown clustering","level":5,"score":0.4451545178890228},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4236797094345093},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.39660415053367615},{"id":"https://openalex.org/C153180895","wikidata":"https://www.wikidata.org/wiki/Q7148389","display_name":"Pattern recognition (psychology)","level":2,"score":0.38312143087387085},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.29276907444000244}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s1793351x15400085","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1793351x15400085","pdf_url":null,"source":{"id":"https://openalex.org/S4210201727","display_name":"International Journal of Semantic Computing","issn_l":"1793-351X","issn":["1793-351X","1793-7108"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Semantic Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W140354800","https://openalex.org/W1565377632","https://openalex.org/W2001619934","https://openalex.org/W2006251480","https://openalex.org/W2008196645","https://openalex.org/W2016381774","https://openalex.org/W2027987815","https://openalex.org/W2035890032","https://openalex.org/W2066965880","https://openalex.org/W2088630449","https://openalex.org/W2107946060","https://openalex.org/W2120636855","https://openalex.org/W2122111042","https://openalex.org/W2126337883","https://openalex.org/W2141807666","https://openalex.org/W2165558283","https://openalex.org/W2173213060","https://openalex.org/W4251656303","https://openalex.org/W6602692429"],"related_works":["https://openalex.org/W4292477917","https://openalex.org/W1574580469","https://openalex.org/W4221155734","https://openalex.org/W2369902490","https://openalex.org/W4226219407","https://openalex.org/W2357582197","https://openalex.org/W2035408495","https://openalex.org/W2888930344","https://openalex.org/W1602287844","https://openalex.org/W2377862590"],"abstract_inverted_index":{"Nearest":[0],"neighbor":[1,48,63,68,84],"search":[2,64],"is":[3,31,53,92,144],"a":[4,60,74,113],"key":[5],"technique":[6],"used":[7],"in":[8,88],"hierarchical":[9,20,29,42,98,115],"clustering":[10,21,30,43,99,116,121],"and":[11,51,80,123,133],"its":[12],"computing":[13,135],"complexity":[14,25,38,96],"decides":[15],"the":[16,19,36,94,124,131],"performance":[17],"of":[18,26,39,85,97],"algorithm.":[22],"The":[23,137],"time":[24,37,95],"standard":[27],"agglomerative":[28],"O(n":[32,54,104],"3":[33],"),":[34],"while":[35],"more":[40],"advanced":[41],"algorithms":[44],"(such":[45],"as":[46],"nearest":[47,62,67,83],"chain,":[49],"SLINK":[50],"CLINK)":[52],"2":[55,106],").":[56],"This":[57],"paper":[58],"presents":[59],"new":[61],"method":[65],"called":[66,118],"boundary":[69,120],"(NNB),":[70],"which":[71],"first":[72],"divides":[73],"large":[75,147],"dataset":[76],"into":[77],"independent":[78],"subset":[79],"then":[81],"finds":[82],"each":[86],"point":[87],"subset.":[89],"When":[90],"NNB":[91],"used,":[93],"can":[100,127],"be":[101,128],"reduced":[102],"to":[103,130],"log":[105],"n).":[107],"Based":[108],"on":[109],"NNB,":[110],"we":[111],"propose":[112],"fast":[114],"algorithm":[117,126,143],"nearest-neighbor":[119],"(NBC),":[122],"proposed":[125],"adapted":[129],"parallel":[132],"distributed":[134],"framework.":[136],"experimental":[138],"results":[139],"demonstrate":[140],"that":[141],"our":[142],"practical":[145],"for":[146],"datasets.":[148]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}