{"id":"https://openalex.org/W2787331065","doi":"https://doi.org/10.1109/ic3.2017.8284349","title":"Clustering based minimum spanning tree algorithm","display_name":"Clustering based minimum spanning tree algorithm","publication_year":2017,"publication_date":"2017-08-01","ids":{"openalex":"https://openalex.org/W2787331065","doi":"https://doi.org/10.1109/ic3.2017.8284349","mag":"2787331065"},"language":"en","primary_location":{"id":"doi:10.1109/ic3.2017.8284349","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ic3.2017.8284349","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 Tenth International Conference on Contemporary Computing (IC3)","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/A5057860084","display_name":"Sakshi Saxena","orcid":null},"institutions":[{"id":"https://openalex.org/I154970844","display_name":"Jaypee Institute of Information Technology","ror":"https://ror.org/05sttyy11","country_code":"IN","type":"education","lineage":["https://openalex.org/I154970844"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Sakshi Saxena","raw_affiliation_strings":["Computer Science and Engineering, Jaypee Institute of Information Technology, Noida, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science and Engineering, Jaypee Institute of Information Technology, Noida, India","institution_ids":["https://openalex.org/I154970844"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5043698836","display_name":"Priyanka Verma","orcid":"https://orcid.org/0000-0002-2616-0489"},"institutions":[{"id":"https://openalex.org/I154970844","display_name":"Jaypee Institute of Information Technology","ror":"https://ror.org/05sttyy11","country_code":"IN","type":"education","lineage":["https://openalex.org/I154970844"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Priyanka Verma","raw_affiliation_strings":["Computer Science and Engineering, Jaypee Institute of Information Technology, Noida, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science and Engineering, Jaypee Institute of Information Technology, Noida, India","institution_ids":["https://openalex.org/I154970844"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5083405354","display_name":"Dharmveer Singh Rajpoot","orcid":"https://orcid.org/0009-0004-4124-1545"},"institutions":[{"id":"https://openalex.org/I154970844","display_name":"Jaypee Institute of Information Technology","ror":"https://ror.org/05sttyy11","country_code":"IN","type":"education","lineage":["https://openalex.org/I154970844"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Dharmveer Singh Rajpoot","raw_affiliation_strings":["Computer Science and Engineering, Jaypee Institute of Information Technology, Noida, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science and Engineering, Jaypee Institute of Information Technology, Noida, India","institution_ids":["https://openalex.org/I154970844"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.2065,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.67419046,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"3"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10637","display_name":"Advanced Clustering Algorithms Research","score":0.9983000159263611,"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.9983000159263611,"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.9958000183105469,"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.9929999709129333,"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.8273394107818604},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.7025431990623474},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6948561668395996},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.5750541687011719},{"id":"https://openalex.org/keywords/canopy-clustering-algorithm","display_name":"Canopy clustering algorithm","score":0.541757345199585},{"id":"https://openalex.org/keywords/cure-data-clustering-algorithm","display_name":"CURE data clustering algorithm","score":0.5137311220169067},{"id":"https://openalex.org/keywords/correlation-clustering","display_name":"Correlation clustering","score":0.5080814361572266},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.47296565771102905},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.4626046419143677},{"id":"https://openalex.org/keywords/single-linkage-clustering","display_name":"Single-linkage clustering","score":0.4426459074020386},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3698001205921173},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.31604284048080444},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.21691569685935974}],"concepts":[{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.8273394107818604},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.7025431990623474},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6948561668395996},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.5750541687011719},{"id":"https://openalex.org/C104047586","wikidata":"https://www.wikidata.org/wiki/Q5033439","display_name":"Canopy clustering algorithm","level":4,"score":0.541757345199585},{"id":"https://openalex.org/C33704608","wikidata":"https://www.wikidata.org/wiki/Q5014717","display_name":"CURE data clustering algorithm","level":4,"score":0.5137311220169067},{"id":"https://openalex.org/C94641424","wikidata":"https://www.wikidata.org/wiki/Q5172845","display_name":"Correlation clustering","level":3,"score":0.5080814361572266},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.47296565771102905},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.4626046419143677},{"id":"https://openalex.org/C22648726","wikidata":"https://www.wikidata.org/wiki/Q7523744","display_name":"Single-linkage clustering","level":5,"score":0.4426459074020386},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3698001205921173},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.31604284048080444},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.21691569685935974},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ic3.2017.8284349","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ic3.2017.8284349","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 Tenth International Conference on Contemporary Computing (IC3)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W976798568","https://openalex.org/W1128809682","https://openalex.org/W1501500081","https://openalex.org/W1888898201","https://openalex.org/W1965998456","https://openalex.org/W1976496412","https://openalex.org/W2084642062","https://openalex.org/W2141585940"],"related_works":["https://openalex.org/W2559422900","https://openalex.org/W2160785859","https://openalex.org/W2360225591","https://openalex.org/W2103650652","https://openalex.org/W2342518500","https://openalex.org/W2188840951","https://openalex.org/W3120229345","https://openalex.org/W2393707058","https://openalex.org/W147612390","https://openalex.org/W2374506950"],"abstract_inverted_index":{"Data":[0],"mining":[1,26],"is":[2,24,36,101,141],"a":[3,10,17,25,42,90],"technique":[4,27],"used":[5,28,58],"to":[6,37,83,123],"process":[7],"information":[8],"from":[9],"big":[11],"dataset":[12,100],"and":[13,117],"converting":[14],"it":[15],"into":[16],"reasonable":[18],"form":[19],"for":[20,59,73,110],"supplementary":[21],"use.":[22],"Clustering":[23],"in":[29,92,103],"data":[30],"mining.":[31],"The":[32,79],"goal":[33],"of":[34,41,44],"clustering":[35,54],"discover":[38],"the":[39,70,85,98,107,125,137],"groupings":[40],"set":[43],"points,":[45],"patterns":[46],"or":[47],"objects.":[48],"Minimum":[49],"Spanning":[50],"Tree":[51],"(MST)":[52],"based":[53],"algorithms":[55],"are":[56,115,121],"successfully":[57],"detecting":[60],"clusters.":[61,105],"In":[62,95,106],"this":[63],"paper":[64],"we":[65],"have":[66],"focused":[67],"on":[68],"minimizing":[69],"time":[71,86],"complexity":[72,87],"constructing":[74,89],"MST":[75,91,127,131,139],"by":[76,88,128],"using":[77,129],"clustering.":[78],"proposed":[80,138],"algorithm":[81,140],"tries":[82],"minimize":[84],"two":[93],"stages.":[94],"divide":[96],"stage,":[97,109],"given":[99],"divided":[102],"various":[104],"conquer":[108],"every":[111],"cluster,":[112],"local":[113],"MSTs":[114,120],"created":[116],"then":[118],"these":[119],"combined":[122],"obtain":[124],"final":[126],"Midpoint":[130],"algorithm.":[132],"Experimental":[133],"results":[134],"show":[135],"that":[136],"computationally":[142],"efficient.":[143]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}