{"id":"https://openalex.org/W4415930016","doi":"https://doi.org/10.3390/make7040139","title":"Cover Tree-Optimized Spectral Clustering: Efficient Nearest Neighbor Search for Large-Scale Data Partitioning","display_name":"Cover Tree-Optimized Spectral Clustering: Efficient Nearest Neighbor Search for Large-Scale Data Partitioning","publication_year":2025,"publication_date":"2025-11-05","ids":{"openalex":"https://openalex.org/W4415930016","doi":"https://doi.org/10.3390/make7040139"},"language":"en","primary_location":{"id":"doi:10.3390/make7040139","is_oa":true,"landing_page_url":"https://doi.org/10.3390/make7040139","pdf_url":null,"source":{"id":"https://openalex.org/S4210213891","display_name":"Machine Learning and Knowledge Extraction","issn_l":"2504-4990","issn":["2504-4990"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Machine Learning and Knowledge Extraction","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.3390/make7040139","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5099583260","display_name":"Abderrafik Laakel Hemdanou","orcid":"https://orcid.org/0009-0004-1189-1352"},"institutions":[{"id":"https://openalex.org/I240042149","display_name":"Abdelmalek Essa\u00e2di University","ror":"https://ror.org/03c4shz64","country_code":"MA","type":"education","lineage":["https://openalex.org/I240042149"]}],"countries":["MA"],"is_corresponding":false,"raw_author_name":"Abderrafik Laakel Hemdanou","raw_affiliation_strings":["Department of Mathematics and Computer Science, Normal Higher School, Abdelmalek Essaadi University, P.O. Box 209, Tetouan 93000, Morocco"],"raw_orcid":"https://orcid.org/0009-0004-1189-1352","affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, Normal Higher School, Abdelmalek Essaadi University, P.O. Box 209, Tetouan 93000, Morocco","institution_ids":["https://openalex.org/I240042149"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5093846372","display_name":"Youssef Achtoun","orcid":"https://orcid.org/0009-0005-5334-2383"},"institutions":[{"id":"https://openalex.org/I240042149","display_name":"Abdelmalek Essa\u00e2di University","ror":"https://ror.org/03c4shz64","country_code":"MA","type":"education","lineage":["https://openalex.org/I240042149"]}],"countries":["MA"],"is_corresponding":true,"raw_author_name":"Youssef Achtoun","raw_affiliation_strings":["Department of Mathematics and Computer Science, Normal Higher School, Abdelmalek Essaadi University, P.O. Box 209, Tetouan 93000, Morocco"],"raw_orcid":"https://orcid.org/0009-0005-5334-2383","affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, Normal Higher School, Abdelmalek Essaadi University, P.O. Box 209, Tetouan 93000, Morocco","institution_ids":["https://openalex.org/I240042149"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5093930834","display_name":"Sara Mouali","orcid":"https://orcid.org/0009-0003-4934-0145"},"institutions":[{"id":"https://openalex.org/I240042149","display_name":"Abdelmalek Essa\u00e2di University","ror":"https://ror.org/03c4shz64","country_code":"MA","type":"education","lineage":["https://openalex.org/I240042149"]}],"countries":["MA"],"is_corresponding":false,"raw_author_name":"Sara Mouali","raw_affiliation_strings":["Department of Mathematics and Computer Science, Normal Higher School, Abdelmalek Essaadi University, P.O. Box 209, Tetouan 93000, Morocco"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, Normal Higher School, Abdelmalek Essaadi University, P.O. Box 209, Tetouan 93000, Morocco","institution_ids":["https://openalex.org/I240042149"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5093672813","display_name":"Mohammed Lamart\u0131 Sefian","orcid":"https://orcid.org/0000-0001-8270-2660"},"institutions":[{"id":"https://openalex.org/I240042149","display_name":"Abdelmalek Essa\u00e2di University","ror":"https://ror.org/03c4shz64","country_code":"MA","type":"education","lineage":["https://openalex.org/I240042149"]}],"countries":["MA"],"is_corresponding":false,"raw_author_name":"Mohammed Lamarti Sefian","raw_affiliation_strings":["Department of Mathematics and Computer Science, Normal Higher School, Abdelmalek Essaadi University, P.O. Box 209, Tetouan 93000, Morocco"],"raw_orcid":"https://orcid.org/0000-0001-8270-2660","affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, Normal Higher School, Abdelmalek Essaadi University, P.O. Box 209, Tetouan 93000, Morocco","institution_ids":["https://openalex.org/I240042149"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5063597846","display_name":"Vesna \u0160e\u0161um-\u010cavi\u0107","orcid":"https://orcid.org/0000-0002-0759-0686"},"institutions":[{"id":"https://openalex.org/I4068193","display_name":"University of Belgrade","ror":"https://ror.org/02qsmb048","country_code":"RS","type":"education","lineage":["https://openalex.org/I4068193"]}],"countries":["RS"],"is_corresponding":false,"raw_author_name":"Vesna \u0160e\u0161um \u010cavi\u0107","raw_affiliation_strings":["Faculty of Civil Engineering, University of Belgrade, Bulevar Kralja Aleksandra 73, 11000 Belgrade, Serbia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Civil Engineering, University of Belgrade, Bulevar Kralja Aleksandra 73, 11000 Belgrade, Serbia","institution_ids":["https://openalex.org/I4068193"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5032620709","display_name":"Stojan Radenovi\u0107","orcid":"https://orcid.org/0000-0001-8254-6688"},"institutions":[{"id":"https://openalex.org/I4068193","display_name":"University of Belgrade","ror":"https://ror.org/02qsmb048","country_code":"RS","type":"education","lineage":["https://openalex.org/I4068193"]}],"countries":["RS"],"is_corresponding":false,"raw_author_name":"Stojan Radenovi\u0107","raw_affiliation_strings":["Faculty of Mechanical Engineering, University of Belgrade, Kraljice Marije 16, 11120 Belgrade, Serbia"],"raw_orcid":"https://orcid.org/0000-0001-8254-6688","affiliations":[{"raw_affiliation_string":"Faculty of Mechanical Engineering, University of Belgrade, Kraljice Marije 16, 11120 Belgrade, Serbia","institution_ids":["https://openalex.org/I4068193"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":6,"corresponding_author_ids":["https://openalex.org/A5093846372"],"corresponding_institution_ids":["https://openalex.org/I240042149"],"apc_list":{"value":1400,"currency":"CHF","value_usd":1515},"apc_paid":{"value":1400,"currency":"CHF","value_usd":1515},"fwci":1.7092,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.89091609,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":"7","issue":"4","first_page":"139","last_page":"139"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10637","display_name":"Advanced Clustering Algorithms Research","score":0.7803999781608582,"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"}},"topics":[{"id":"https://openalex.org/T10637","display_name":"Advanced Clustering Algorithms Research","score":0.7803999781608582,"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/T10064","display_name":"Complex Network Analysis Techniques","score":0.0215000007301569,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.01720000058412552,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.742900013923645},{"id":"https://openalex.org/keywords/cover-tree","display_name":"Cover tree","score":0.6139000058174133},{"id":"https://openalex.org/keywords/k-nearest-neighbors-algorithm","display_name":"k-nearest neighbors algorithm","score":0.5475000143051147},{"id":"https://openalex.org/keywords/spectral-clustering","display_name":"Spectral clustering","score":0.5153999924659729},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.5149999856948853},{"id":"https://openalex.org/keywords/nearest-neighbor-search","display_name":"Nearest neighbor search","score":0.5027999877929688},{"id":"https://openalex.org/keywords/correlation-clustering","display_name":"Correlation clustering","score":0.49889999628067017},{"id":"https://openalex.org/keywords/embedding","display_name":"Embedding","score":0.492900013923645},{"id":"https://openalex.org/keywords/cure-data-clustering-algorithm","display_name":"CURE data clustering algorithm","score":0.4740999937057495},{"id":"https://openalex.org/keywords/nearest-neighbor-chain-algorithm","display_name":"Nearest-neighbor chain algorithm","score":0.4537999927997589}],"concepts":[{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.742900013923645},{"id":"https://openalex.org/C53661774","wikidata":"https://www.wikidata.org/wiki/Q13108095","display_name":"Cover tree","level":5,"score":0.6139000058174133},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6122999787330627},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.5708000063896179},{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.5475000143051147},{"id":"https://openalex.org/C105611402","wikidata":"https://www.wikidata.org/wiki/Q2976589","display_name":"Spectral clustering","level":3,"score":0.5153999924659729},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.5149999856948853},{"id":"https://openalex.org/C116738811","wikidata":"https://www.wikidata.org/wiki/Q608751","display_name":"Nearest neighbor search","level":2,"score":0.5027999877929688},{"id":"https://openalex.org/C94641424","wikidata":"https://www.wikidata.org/wiki/Q5172845","display_name":"Correlation clustering","level":3,"score":0.49889999628067017},{"id":"https://openalex.org/C41608201","wikidata":"https://www.wikidata.org/wiki/Q980509","display_name":"Embedding","level":2,"score":0.492900013923645},{"id":"https://openalex.org/C33704608","wikidata":"https://www.wikidata.org/wiki/Q5014717","display_name":"CURE data clustering algorithm","level":4,"score":0.4740999937057495},{"id":"https://openalex.org/C102164700","wikidata":"https://www.wikidata.org/wiki/Q17162702","display_name":"Nearest-neighbor chain algorithm","level":5,"score":0.4537999927997589},{"id":"https://openalex.org/C193143536","wikidata":"https://www.wikidata.org/wiki/Q5227360","display_name":"Data stream clustering","level":5,"score":0.4413999915122986},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.41839998960494995},{"id":"https://openalex.org/C33721204","wikidata":"https://www.wikidata.org/wiki/Q309949","display_name":"k-d tree","level":3,"score":0.4088999927043915},{"id":"https://openalex.org/C153180895","wikidata":"https://www.wikidata.org/wiki/Q7148389","display_name":"Pattern recognition (psychology)","level":2,"score":0.39739999175071716},{"id":"https://openalex.org/C103278499","wikidata":"https://www.wikidata.org/wiki/Q254465","display_name":"Similarity (geometry)","level":3,"score":0.38179999589920044},{"id":"https://openalex.org/C22648726","wikidata":"https://www.wikidata.org/wiki/Q7523744","display_name":"Single-linkage clustering","level":5,"score":0.3765000104904175},{"id":"https://openalex.org/C104047586","wikidata":"https://www.wikidata.org/wiki/Q5033439","display_name":"Canopy clustering algorithm","level":4,"score":0.375},{"id":"https://openalex.org/C161986146","wikidata":"https://www.wikidata.org/wiki/Q4896845","display_name":"Best bin first","level":3,"score":0.3601999878883362},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.3276999890804291},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.325300008058548},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.31380000710487366},{"id":"https://openalex.org/C17212007","wikidata":"https://www.wikidata.org/wiki/Q5511111","display_name":"Fuzzy clustering","level":3,"score":0.30869999527931213},{"id":"https://openalex.org/C184509293","wikidata":"https://www.wikidata.org/wiki/Q5136711","display_name":"Clustering high-dimensional data","level":3,"score":0.3068000078201294},{"id":"https://openalex.org/C184879717","wikidata":"https://www.wikidata.org/wiki/Q1374523","display_name":"Nearest neighbour algorithm","level":3,"score":0.2831999957561493},{"id":"https://openalex.org/C164866538","wikidata":"https://www.wikidata.org/wiki/Q367351","display_name":"Cluster (spacecraft)","level":2,"score":0.2773999869823456},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.2759000062942505},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2727999985218048},{"id":"https://openalex.org/C13670688","wikidata":"https://www.wikidata.org/wiki/Q3500548","display_name":"Space partitioning","level":2,"score":0.26829999685287476},{"id":"https://openalex.org/C70518039","wikidata":"https://www.wikidata.org/wiki/Q16000077","display_name":"Dimensionality reduction","level":2,"score":0.25619998574256897},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.2556000053882599},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2551000118255615},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.25369998812675476},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.2524999976158142}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.3390/make7040139","is_oa":true,"landing_page_url":"https://doi.org/10.3390/make7040139","pdf_url":null,"source":{"id":"https://openalex.org/S4210213891","display_name":"Machine Learning and Knowledge Extraction","issn_l":"2504-4990","issn":["2504-4990"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Machine Learning and Knowledge Extraction","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:b77246afae914b6fb3f48f732a281c2c","is_oa":true,"landing_page_url":"https://doaj.org/article/b77246afae914b6fb3f48f732a281c2c","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Machine Learning and Knowledge Extraction, Vol 7, Iss 4, p 139 (2025)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.3390/make7040139","is_oa":true,"landing_page_url":"https://doi.org/10.3390/make7040139","pdf_url":null,"source":{"id":"https://openalex.org/S4210213891","display_name":"Machine Learning and Knowledge Extraction","issn_l":"2504-4990","issn":["2504-4990"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Machine Learning and Knowledge Extraction","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W310401897","https://openalex.org/W1128809682","https://openalex.org/W1506690472","https://openalex.org/W1587744656","https://openalex.org/W1989164753","https://openalex.org/W1998871699","https://openalex.org/W2053477750","https://openalex.org/W2116810533","https://openalex.org/W2121947440","https://openalex.org/W2132914434","https://openalex.org/W2133296809","https://openalex.org/W2145866065","https://openalex.org/W2146707163","https://openalex.org/W2596052762","https://openalex.org/W2612769387","https://openalex.org/W2984592067","https://openalex.org/W2992858548","https://openalex.org/W3033997012","https://openalex.org/W3176694003","https://openalex.org/W4214879959","https://openalex.org/W4288709665","https://openalex.org/W4315473124","https://openalex.org/W4318485220","https://openalex.org/W4385068034","https://openalex.org/W4385322401","https://openalex.org/W4393410523","https://openalex.org/W4403034636","https://openalex.org/W4410055813"],"related_works":[],"abstract_inverted_index":{"Spectral":[0],"clustering":[1,44,92,103,122,148],"has":[2],"established":[3],"itself":[4],"as":[5],"a":[6,29,57,69,142],"powerful":[7],"technique":[8,88],"for":[9,76],"data":[10,49,151],"partitioning":[11],"across":[12],"various":[13],"domains":[14],"due":[15],"to":[16,19,51],"its":[17,25],"ability":[18],"handle":[20],"complex":[21],"cluster":[22],"structures.":[23],"However,":[24],"computational":[26,99],"efficiency":[27],"remains":[28],"challenge,":[30],"especially":[31],"with":[32],"large":[33],"datasets.":[34],"In":[35],"this":[36,87],"paper,":[37],"we":[38,94,114],"propose":[39],"an":[40],"enhancement":[41],"of":[42,63,71,126,135,146],"spectral":[43,91,121,147],"by":[45],"integrating":[46],"Cover":[47,66],"tree":[48,73],"structure":[50],"optimize":[52],"the":[53,61,90,133,136],"nearest":[54,79],"neighbor":[55,80],"search,":[56],"crucial":[58],"step":[59],"in":[60,82,98,124,149],"construction":[62],"similarity":[64],"graphs.":[65],"trees":[67],"are":[68],"type":[70],"spatial":[72],"that":[74,116],"allow":[75],"efficient":[77,144],"exact":[78],"queries":[81],"high-dimensional":[83],"spaces.":[84],"By":[85],"embedding":[86],"into":[89],"framework,":[93],"achieve":[95],"significant":[96],"reductions":[97],"cost":[100],"while":[101],"maintaining":[102],"accuracy.":[104],"Through":[105],"extensive":[106],"experiments":[107],"on":[108],"random,":[109],"synthetic,":[110],"and":[111,128],"real-world":[112],"datasets,":[113],"demonstrate":[115],"our":[117],"approach":[118],"outperforms":[119],"traditional":[120],"methods":[123],"terms":[125],"scalability":[127],"execution":[129],"speed,":[130],"without":[131],"compromising":[132],"quality":[134],"resultant":[137],"clusters.":[138],"This":[139],"work":[140],"provides":[141],"more":[143],"utilization":[145],"big":[150],"applications.":[152]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2026-06-15T08:34:33.830935","created_date":"2025-11-05T00:00:00"}