{"id":"https://openalex.org/W2896680434","doi":"https://doi.org/10.1109/fuzz-ieee.2018.8491554","title":"Clustering with Minimum Spanning Tree using TOPSIS with Multi-Criteria Information","display_name":"Clustering with Minimum Spanning Tree using TOPSIS with Multi-Criteria Information","publication_year":2018,"publication_date":"2018-07-01","ids":{"openalex":"https://openalex.org/W2896680434","doi":"https://doi.org/10.1109/fuzz-ieee.2018.8491554","mag":"2896680434"},"language":"en","primary_location":{"id":"doi:10.1109/fuzz-ieee.2018.8491554","is_oa":false,"landing_page_url":"https://doi.org/10.1109/fuzz-ieee.2018.8491554","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE International Conference on Fuzzy Systems (FUZZ-IEEE)","raw_type":"proceedings-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/A5026938500","display_name":"Jos\u00e9 G. M. Esgario","orcid":null},"institutions":[{"id":"https://openalex.org/I51235708","display_name":"Universidade Federal do Esp\u00edrito Santo","ror":"https://ror.org/05sxf4h28","country_code":"BR","type":"education","lineage":["https://openalex.org/I51235708"]}],"countries":["BR"],"is_corresponding":true,"raw_author_name":"Jose G. M. Esgario","raw_affiliation_strings":["Graduate Program in Computer Science, PPGI, Federal University of Esp\u00edrito Santo \u2013 UFES, Vit\u00f3ria, ES, Brasil"],"affiliations":[{"raw_affiliation_string":"Graduate Program in Computer Science, PPGI, Federal University of Esp\u00edrito Santo \u2013 UFES, Vit\u00f3ria, ES, Brasil","institution_ids":["https://openalex.org/I51235708"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5015026639","display_name":"Renato A. Krohling","orcid":"https://orcid.org/0000-0001-8861-4274"},"institutions":[{"id":"https://openalex.org/I51235708","display_name":"Universidade Federal do Esp\u00edrito Santo","ror":"https://ror.org/05sxf4h28","country_code":"BR","type":"education","lineage":["https://openalex.org/I51235708"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Renato A. Krohling","raw_affiliation_strings":["Production Engineering Department, LABCIN & Graduate Program in Computer Science, PPGI, Federal University of Esp\u00edrito Santo - UFES, Vit\u00f3ria, ES, Brasil"],"affiliations":[{"raw_affiliation_string":"Production Engineering Department, LABCIN & Graduate Program in Computer Science, PPGI, Federal University of Esp\u00edrito Santo - UFES, Vit\u00f3ria, ES, Brasil","institution_ids":["https://openalex.org/I51235708"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5026938500"],"corresponding_institution_ids":["https://openalex.org/I51235708"],"apc_list":null,"apc_paid":null,"fwci":0.4886,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.7342366,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"12","issue":null,"first_page":"1","last_page":"7"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10637","display_name":"Advanced Clustering Algorithms Research","score":0.9998000264167786,"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.9998000264167786,"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.991599977016449,"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/T10057","display_name":"Face and Expression Recognition","score":0.9911999702453613,"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/cluster-analysis","display_name":"Cluster analysis","score":0.8402529954910278},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.6873597502708435},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6241982579231262},{"id":"https://openalex.org/keywords/correlation-clustering","display_name":"Correlation clustering","score":0.58077073097229},{"id":"https://openalex.org/keywords/canopy-clustering-algorithm","display_name":"Canopy clustering algorithm","score":0.522733747959137},{"id":"https://openalex.org/keywords/cure-data-clustering-algorithm","display_name":"CURE data clustering algorithm","score":0.5212445855140686},{"id":"https://openalex.org/keywords/single-linkage-clustering","display_name":"Single-linkage clustering","score":0.5103744864463806},{"id":"https://openalex.org/keywords/fuzzy-clustering","display_name":"Fuzzy clustering","score":0.48997870087623596},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.4793732464313507},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.4759916067123413},{"id":"https://openalex.org/keywords/determining-the-number-of-clusters-in-a-data-set","display_name":"Determining the number of clusters in a data set","score":0.426118940114975},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3423030972480774},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.31229260563850403},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3102319836616516}],"concepts":[{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.8402529954910278},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.6873597502708435},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6241982579231262},{"id":"https://openalex.org/C94641424","wikidata":"https://www.wikidata.org/wiki/Q5172845","display_name":"Correlation clustering","level":3,"score":0.58077073097229},{"id":"https://openalex.org/C104047586","wikidata":"https://www.wikidata.org/wiki/Q5033439","display_name":"Canopy clustering algorithm","level":4,"score":0.522733747959137},{"id":"https://openalex.org/C33704608","wikidata":"https://www.wikidata.org/wiki/Q5014717","display_name":"CURE data clustering algorithm","level":4,"score":0.5212445855140686},{"id":"https://openalex.org/C22648726","wikidata":"https://www.wikidata.org/wiki/Q7523744","display_name":"Single-linkage clustering","level":5,"score":0.5103744864463806},{"id":"https://openalex.org/C17212007","wikidata":"https://www.wikidata.org/wiki/Q5511111","display_name":"Fuzzy clustering","level":3,"score":0.48997870087623596},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.4793732464313507},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.4759916067123413},{"id":"https://openalex.org/C149872217","wikidata":"https://www.wikidata.org/wiki/Q5265701","display_name":"Determining the number of clusters in a data set","level":5,"score":0.426118940114975},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3423030972480774},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.31229260563850403},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3102319836616516},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/fuzz-ieee.2018.8491554","is_oa":false,"landing_page_url":"https://doi.org/10.1109/fuzz-ieee.2018.8491554","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE International Conference on Fuzzy Systems (FUZZ-IEEE)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W58415858","https://openalex.org/W83294241","https://openalex.org/W108464071","https://openalex.org/W194786220","https://openalex.org/W1965998456","https://openalex.org/W1972969203","https://openalex.org/W1976496412","https://openalex.org/W1983116226","https://openalex.org/W1992419399","https://openalex.org/W2011430131","https://openalex.org/W2030129503","https://openalex.org/W2034887891","https://openalex.org/W2076408892","https://openalex.org/W2084642062","https://openalex.org/W2121904206","https://openalex.org/W2479531384","https://openalex.org/W2506768821","https://openalex.org/W2617341762","https://openalex.org/W2736425480","https://openalex.org/W6602452552","https://openalex.org/W6644299198"],"related_works":["https://openalex.org/W2559422900","https://openalex.org/W2342518500","https://openalex.org/W2103650652","https://openalex.org/W4220814143","https://openalex.org/W2360225591","https://openalex.org/W2386689530","https://openalex.org/W2050713761","https://openalex.org/W2770741777","https://openalex.org/W4241767317","https://openalex.org/W2216440784"],"abstract_inverted_index":{"Clustering":[0,19],"is":[1],"the":[2,9,32,38,45,103],"process":[3,69],"of":[4,34,40,51,58,105],"grouping":[5],"similar":[6],"objects":[7,15],"into":[8],"same":[10],"partition":[11],"and":[12,96],"keeping":[13],"dissimilar":[14],"on":[16,22,78,94],"different":[17,84],"partitions.":[18],"algorithms":[20,46],"based":[21,77],"Minimum":[23,79],"Spanning":[24,80],"Tree":[25,81],"(MST)":[26],"have":[27],"been":[28],"successfully":[29],"applied":[30],"in":[31,56],"separation":[33],"non-convex":[35],"clusters,":[36],"although":[37],"use":[39],"individual":[41,113],"objective":[42,85,106],"functions":[43,86,107],"limits":[44],"to":[47,66,112],"a":[48],"reduced":[49],"set":[50],"clustering":[52,68,109],"problems,":[53],"presenting":[54],"difficulties":[55],"cases":[57],"unbalanced,":[59],"noisy,":[60],"overlapping":[61],"datasets,":[62],"etc.":[63],"In":[64],"order":[65],"make":[67],"more":[70],"robust,":[71],"this":[72],"paper":[73],"proposes":[74],"an":[75],"algorithm":[76,90],"that":[82,102],"combines":[83],"using":[87],"TOPSIS.":[88],"The":[89],"performance":[91],"was":[92],"evaluated":[93],"real":[95],"synthetic":[97],"datasets.":[98],"Experimental":[99],"results":[100,110],"indicate":[101],"combination":[104],"improves":[108],"compared":[111],"functions.":[114]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}