{"id":"https://openalex.org/W3041269859","doi":"https://doi.org/10.13053/cys-24-2-3391","title":"Survey of Overlapping Clustering Algorithms","display_name":"Survey of Overlapping Clustering Algorithms","publication_year":2020,"publication_date":"2020-06-30","ids":{"openalex":"https://openalex.org/W3041269859","doi":"https://doi.org/10.13053/cys-24-2-3391","mag":"3041269859"},"language":"es","primary_location":{"id":"doi:10.13053/cys-24-2-3391","is_oa":false,"landing_page_url":"https://doi.org/10.13053/cys-24-2-3391","pdf_url":null,"source":{"id":"https://openalex.org/S61446325","display_name":"Computaci\u00f3n y Sistemas","issn_l":"1405-5546","issn":["1405-5546","2007-9737"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319599","host_organization_name":"National Polytechnic Institute","host_organization_lineage":["https://openalex.org/P4310319599"],"host_organization_lineage_names":["National Polytechnic Institute"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computaci\u00f3n y Sistemas","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/A5012040249","display_name":"Beatr\u00edz Beltr\u00e1n","orcid":"https://orcid.org/0000-0003-4528-4222"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Beatriz Beltr\u00e1n","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5052100151","display_name":"Darnes Vilari\u00f1o","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Darnes Vilari\u00f1o","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.1304,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.53696451,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"24","issue":"2","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10637","display_name":"Advanced Clustering Algorithms Research","score":0.9994999766349792,"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.9994999766349792,"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/T11106","display_name":"Data Management and Algorithms","score":0.9986000061035156,"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/T10538","display_name":"Data Mining Algorithms and Applications","score":0.9977999925613403,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.8886356353759766},{"id":"https://openalex.org/keywords/cure-data-clustering-algorithm","display_name":"CURE data clustering algorithm","score":0.689965546131134},{"id":"https://openalex.org/keywords/correlation-clustering","display_name":"Correlation clustering","score":0.6603007316589355},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6557391285896301},{"id":"https://openalex.org/keywords/canopy-clustering-algorithm","display_name":"Canopy clustering algorithm","score":0.5914384126663208},{"id":"https://openalex.org/keywords/fuzzy-clustering","display_name":"Fuzzy clustering","score":0.5534986853599548},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.5163804292678833},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.5037485957145691},{"id":"https://openalex.org/keywords/data-stream-clustering","display_name":"Data stream clustering","score":0.4689205288887024},{"id":"https://openalex.org/keywords/single-linkage-clustering","display_name":"Single-linkage clustering","score":0.4677555561065674},{"id":"https://openalex.org/keywords/constrained-clustering","display_name":"Constrained clustering","score":0.4586198031902313},{"id":"https://openalex.org/keywords/relevance","display_name":"Relevance (law)","score":0.41381651163101196},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.41035541892051697},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.27354180812835693}],"concepts":[{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.8886356353759766},{"id":"https://openalex.org/C33704608","wikidata":"https://www.wikidata.org/wiki/Q5014717","display_name":"CURE data clustering algorithm","level":4,"score":0.689965546131134},{"id":"https://openalex.org/C94641424","wikidata":"https://www.wikidata.org/wiki/Q5172845","display_name":"Correlation clustering","level":3,"score":0.6603007316589355},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6557391285896301},{"id":"https://openalex.org/C104047586","wikidata":"https://www.wikidata.org/wiki/Q5033439","display_name":"Canopy clustering algorithm","level":4,"score":0.5914384126663208},{"id":"https://openalex.org/C17212007","wikidata":"https://www.wikidata.org/wiki/Q5511111","display_name":"Fuzzy clustering","level":3,"score":0.5534986853599548},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.5163804292678833},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.5037485957145691},{"id":"https://openalex.org/C193143536","wikidata":"https://www.wikidata.org/wiki/Q5227360","display_name":"Data stream clustering","level":5,"score":0.4689205288887024},{"id":"https://openalex.org/C22648726","wikidata":"https://www.wikidata.org/wiki/Q7523744","display_name":"Single-linkage clustering","level":5,"score":0.4677555561065674},{"id":"https://openalex.org/C27964816","wikidata":"https://www.wikidata.org/wiki/Q5164359","display_name":"Constrained clustering","level":5,"score":0.4586198031902313},{"id":"https://openalex.org/C158154518","wikidata":"https://www.wikidata.org/wiki/Q7310970","display_name":"Relevance (law)","level":2,"score":0.41381651163101196},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.41035541892051697},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.27354180812835693},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.13053/cys-24-2-3391","is_oa":false,"landing_page_url":"https://doi.org/10.13053/cys-24-2-3391","pdf_url":null,"source":{"id":"https://openalex.org/S61446325","display_name":"Computaci\u00f3n y Sistemas","issn_l":"1405-5546","issn":["1405-5546","2007-9737"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319599","host_organization_name":"National Polytechnic Institute","host_organization_lineage":["https://openalex.org/P4310319599"],"host_organization_lineage_names":["National Polytechnic Institute"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computaci\u00f3n y Sistemas","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":5,"referenced_works":["https://openalex.org/W2004539934","https://openalex.org/W2064244056","https://openalex.org/W2069484355","https://openalex.org/W2142489247","https://openalex.org/W3123128004"],"related_works":["https://openalex.org/W2559422900","https://openalex.org/W3120229345","https://openalex.org/W2374506950","https://openalex.org/W2160785859","https://openalex.org/W2188840951","https://openalex.org/W2393707058","https://openalex.org/W1999117613","https://openalex.org/W3140018618","https://openalex.org/W2202413591","https://openalex.org/W3186815950"],"abstract_inverted_index":{"This":[0],"paper":[1],"is":[2,60],"presented":[3],"as":[4,41],"a":[5],"study":[6],"of":[7],"the":[8,17,63,74,84],"overlapping":[9,117],"clustering":[10,56,118],"algorithms":[11,26,39,57,90],"that":[12,46,65,71,73],"have":[13,21],"been":[14,22],"developed":[15],"in":[16,27,30,44,55,92],"last":[18],"years,":[19],"researchers":[20],"working":[23],"on":[24,36,104,109],"these":[25],"different":[28],"ways,":[29],"some":[31],"cases":[32],"they":[33],"are":[34,68],"based":[35,103,108],"widely":[37],"known":[38],"such":[40],"k-means":[42],"and":[43,79,111,121],"others":[45],"work":[47,54],"with":[48,58],"heuristics":[49],"orgraphs.":[50],"The":[51,89],"need":[52],"to":[53,62],"overlap":[59],"due":[61],"fact":[64],"currently":[66],"there":[67],"many":[69],"problems":[70],"require":[72],"obtained":[75],"groups":[76],"be":[77],"non-exclusive":[78],"for":[80,86],"which":[81],"it":[82],"gives":[83],"guideline":[85],"this":[87,93],"analysis.":[88],"included":[91],"analysis":[94],"are:":[95],"ADditive":[96],"CLUstering,":[97],"Overlapping":[98,101,106],"K-means,":[99],"Dynamic":[100],"Clustering":[102,107],"Relevance,":[105],"Density":[110],"Compactness,":[112],"MCLC,":[113],"A":[114],"tree-based":[115],"incremental":[116],"method,":[119],"INDCLUS":[120],"HybridK-means.":[122]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}