{"id":"https://openalex.org/W3089301642","doi":"https://doi.org/10.3390/informatics7040038","title":"Tree-Based Algorithm for Stable and Efficient Data Clustering","display_name":"Tree-Based Algorithm for Stable and Efficient Data Clustering","publication_year":2020,"publication_date":"2020-09-27","ids":{"openalex":"https://openalex.org/W3089301642","doi":"https://doi.org/10.3390/informatics7040038","mag":"3089301642"},"language":"en","primary_location":{"id":"doi:10.3390/informatics7040038","is_oa":true,"landing_page_url":"https://doi.org/10.3390/informatics7040038","pdf_url":"https://www.mdpi.com/2227-9709/7/4/38/pdf","source":{"id":"https://openalex.org/S2738238905","display_name":"Informatics","issn_l":"2227-9709","issn":["2227-9709"],"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":"Informatics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.mdpi.com/2227-9709/7/4/38/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5049700581","display_name":"H. Al-Jabbouli","orcid":null},"institutions":[{"id":"https://openalex.org/I92446798","display_name":"Colorado State University","ror":"https://ror.org/03k1gpj17","country_code":"US","type":"education","lineage":["https://openalex.org/I92446798"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Hasan Aljabbouli","raw_affiliation_strings":["Department of Information Systems, Colorado State University Global, Salida Way, Aurora, CO 80526, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Information Systems, Colorado State University Global, Salida Way, Aurora, CO 80526, USA","institution_ids":["https://openalex.org/I92446798"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5022293357","display_name":"Abdullah Albizri","orcid":"https://orcid.org/0000-0002-6818-2344"},"institutions":[{"id":"https://openalex.org/I166088655","display_name":"Montclair State University","ror":"https://ror.org/01nxc2t48","country_code":"US","type":"education","lineage":["https://openalex.org/I166088655"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Abdullah Albizri","raw_affiliation_strings":["Department of Information Management & Business Analytics, Montclair State University, Montclair, NJ 07043, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Information Management & Business Analytics, Montclair State University, Montclair, NJ 07043, USA","institution_ids":["https://openalex.org/I166088655"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5050755625","display_name":"Antoine Harfouche","orcid":"https://orcid.org/0000-0002-0407-9217"},"institutions":[{"id":"https://openalex.org/I40434647","display_name":"Universit\u00e9 Paris Nanterre","ror":"https://ror.org/013bkhk48","country_code":"FR","type":"education","lineage":["https://openalex.org/I40434647"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Antoine Harfouche","raw_affiliation_strings":["Department of SEGMI\u2013CEROS, University Paris Nanterre, 92000 Nanterre, France"],"raw_orcid":"https://orcid.org/0000-0002-0407-9217","affiliations":[{"raw_affiliation_string":"Department of SEGMI\u2013CEROS, University Paris Nanterre, 92000 Nanterre, France","institution_ids":["https://openalex.org/I40434647"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5022293357"],"corresponding_institution_ids":["https://openalex.org/I166088655"],"apc_list":{"value":1600,"currency":"CHF","value_usd":1732},"apc_paid":{"value":1600,"currency":"CHF","value_usd":1732},"fwci":0.4077,"has_fulltext":true,"cited_by_count":7,"citation_normalized_percentile":{"value":0.7018346,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"7","issue":"4","first_page":"38","last_page":"38"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10637","display_name":"Advanced Clustering Algorithms Research","score":0.9997000098228455,"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.9997000098228455,"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/T10538","display_name":"Data Mining Algorithms and Applications","score":0.9973999857902527,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/T12761","display_name":"Data Stream Mining Techniques","score":0.9955999851226807,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.7466819882392883},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6514614224433899},{"id":"https://openalex.org/keywords/k-medoids","display_name":"k-medoids","score":0.5968935489654541},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5965676307678223},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5580652356147766},{"id":"https://openalex.org/keywords/k-d-tree","display_name":"k-d tree","score":0.550487220287323},{"id":"https://openalex.org/keywords/medoid","display_name":"Medoid","score":0.5423963069915771},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5270944833755493},{"id":"https://openalex.org/keywords/canopy-clustering-algorithm","display_name":"Canopy clustering algorithm","score":0.4615056812763214},{"id":"https://openalex.org/keywords/nearest-neighbor-chain-algorithm","display_name":"Nearest-neighbor chain algorithm","score":0.44709697365760803},{"id":"https://openalex.org/keywords/k-nearest-neighbors-algorithm","display_name":"k-nearest neighbors algorithm","score":0.44440653920173645},{"id":"https://openalex.org/keywords/ramer\u2013douglas\u2013peucker-algorithm","display_name":"Ramer\u2013Douglas\u2013Peucker algorithm","score":0.4414839446544647},{"id":"https://openalex.org/keywords/stability","display_name":"Stability (learning theory)","score":0.44091635942459106},{"id":"https://openalex.org/keywords/population-based-incremental-learning","display_name":"Population-based incremental learning","score":0.41218769550323486},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.3497064709663391},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2915165424346924},{"id":"https://openalex.org/keywords/correlation-clustering","display_name":"Correlation clustering","score":0.2826848030090332},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.11701351404190063},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.10339045524597168},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.08492207527160645},{"id":"https://openalex.org/keywords/tree-traversal","display_name":"Tree traversal","score":0.07763853669166565}],"concepts":[{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.7466819882392883},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6514614224433899},{"id":"https://openalex.org/C65932786","wikidata":"https://www.wikidata.org/wiki/Q3191282","display_name":"k-medoids","level":5,"score":0.5968935489654541},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5965676307678223},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5580652356147766},{"id":"https://openalex.org/C33721204","wikidata":"https://www.wikidata.org/wiki/Q309949","display_name":"k-d tree","level":3,"score":0.550487220287323},{"id":"https://openalex.org/C63085389","wikidata":"https://www.wikidata.org/wiki/Q4287912","display_name":"Medoid","level":3,"score":0.5423963069915771},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5270944833755493},{"id":"https://openalex.org/C104047586","wikidata":"https://www.wikidata.org/wiki/Q5033439","display_name":"Canopy clustering algorithm","level":4,"score":0.4615056812763214},{"id":"https://openalex.org/C102164700","wikidata":"https://www.wikidata.org/wiki/Q17162702","display_name":"Nearest-neighbor chain algorithm","level":5,"score":0.44709697365760803},{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.44440653920173645},{"id":"https://openalex.org/C75930677","wikidata":"https://www.wikidata.org/wiki/Q1251950","display_name":"Ramer\u2013Douglas\u2013Peucker algorithm","level":3,"score":0.4414839446544647},{"id":"https://openalex.org/C112972136","wikidata":"https://www.wikidata.org/wiki/Q7595718","display_name":"Stability (learning theory)","level":2,"score":0.44091635942459106},{"id":"https://openalex.org/C184497298","wikidata":"https://www.wikidata.org/wiki/Q7229773","display_name":"Population-based incremental learning","level":3,"score":0.41218769550323486},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.3497064709663391},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2915165424346924},{"id":"https://openalex.org/C94641424","wikidata":"https://www.wikidata.org/wiki/Q5172845","display_name":"Correlation clustering","level":3,"score":0.2826848030090332},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.11701351404190063},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.10339045524597168},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.08492207527160645},{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.07763853669166565},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.3390/informatics7040038","is_oa":true,"landing_page_url":"https://doi.org/10.3390/informatics7040038","pdf_url":"https://www.mdpi.com/2227-9709/7/4/38/pdf","source":{"id":"https://openalex.org/S2738238905","display_name":"Informatics","issn_l":"2227-9709","issn":["2227-9709"],"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":"Informatics","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:538247feb2aa41a09cdeae9614b14f65","is_oa":true,"landing_page_url":"https://doaj.org/article/538247feb2aa41a09cdeae9614b14f65","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Informatics, Vol 7, Iss 4, p 38 (2020)","raw_type":"article"},{"id":"pmh:oai:mdpi.com:/2227-9709/7/4/38/","is_oa":true,"landing_page_url":"https://dx.doi.org/10.3390/informatics7040038","pdf_url":null,"source":{"id":"https://openalex.org/S4306400947","display_name":"MDPI (MDPI AG)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210097602","host_organization_name":"Multidisciplinary Digital Publishing Institute (Switzerland)","host_organization_lineage":["https://openalex.org/I4210097602"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Informatics; Volume 7; Issue 4; Pages: 38","raw_type":"Text"}],"best_oa_location":{"id":"doi:10.3390/informatics7040038","is_oa":true,"landing_page_url":"https://doi.org/10.3390/informatics7040038","pdf_url":"https://www.mdpi.com/2227-9709/7/4/38/pdf","source":{"id":"https://openalex.org/S2738238905","display_name":"Informatics","issn_l":"2227-9709","issn":["2227-9709"],"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":"Informatics","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3089301642.pdf","grobid_xml":"https://content.openalex.org/works/W3089301642.grobid-xml"},"referenced_works_count":28,"referenced_works":["https://openalex.org/W1501500081","https://openalex.org/W1763728792","https://openalex.org/W1971784203","https://openalex.org/W1989270503","https://openalex.org/W1992419399","https://openalex.org/W1999668761","https://openalex.org/W2024668293","https://openalex.org/W2057536593","https://openalex.org/W2081972960","https://openalex.org/W2108343180","https://openalex.org/W2115641384","https://openalex.org/W2127218421","https://openalex.org/W2128703518","https://openalex.org/W2139450862","https://openalex.org/W2140405352","https://openalex.org/W2142458924","https://openalex.org/W2152255870","https://openalex.org/W2160197181","https://openalex.org/W2161160262","https://openalex.org/W2166076290","https://openalex.org/W2246707385","https://openalex.org/W2604895675","https://openalex.org/W2808332967","https://openalex.org/W2963043340","https://openalex.org/W3008016908","https://openalex.org/W3028946697","https://openalex.org/W6684553361","https://openalex.org/W6788247690"],"related_works":["https://openalex.org/W2359783878","https://openalex.org/W2368604885","https://openalex.org/W2386865990","https://openalex.org/W2088480663","https://openalex.org/W2367316505","https://openalex.org/W2378726602","https://openalex.org/W2100425112","https://openalex.org/W2544656483","https://openalex.org/W4311915213","https://openalex.org/W2350975147"],"abstract_inverted_index":{"The":[0,44,77,101,126],"K-means":[1,35,99,114],"algorithm":[2,10,25,36,106,132],"is":[3,26,47],"a":[4,38,50],"well-known":[5],"and":[6,15,63,117,135],"widely":[7],"used":[8],"clustering":[9,138],"due":[11],"to":[12,33,53,64,88],"its":[13,27],"simplicity":[14],"convergence":[16],"properties.":[17],"However,":[18],"one":[19],"of":[20,23,57,60,68,97,103],"the":[21,24,34,55,61,66,69,75,94,98,104,113,130],"drawbacks":[22],"instability.":[28],"This":[29],"paper":[30],"presents":[31],"improvements":[32],"using":[37,122],"K-dimensional":[39],"tree":[40],"(Kd-tree)":[41],"data":[42,51],"structure.":[43],"proposed":[45,105,131],"Kd-tree":[46],"utilized":[48],"as":[49],"structure":[52],"enhance":[54],"choice":[56],"initial":[58],"centers":[59],"clusters":[62],"reduce":[65],"number":[67],"nearest":[70],"neighbor":[71],"searches":[72],"required":[73],"by":[74],"algorithm.":[76,100],"developed":[78],"framework":[79],"also":[80],"includes":[81],"an":[82,89,120],"efficient":[83],"center":[84],"insertion":[85],"technique":[86],"leading":[87],"incremental":[90],"operation":[91],"that":[92,129],"overcomes":[93],"instability":[95],"problem":[96],"results":[102,127],"were":[107],"compared":[108],"with":[109],"those":[110],"obtained":[111],"from":[112],"algorithm,":[115],"K-medoids,":[116],"K-means++":[118],"in":[119],"experiment":[121],"six":[123],"different":[124],"datasets.":[125],"demonstrated":[128],"provides":[133],"superior":[134],"more":[136],"stable":[137],"solutions.":[139]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2020-10-01T00:00:00"}