{"id":"https://openalex.org/W2044049260","doi":"https://doi.org/10.4304/jsw.9.3.732-737","title":"CUDAP: A Novel Clustering Algorithm for Uncertain Data Based on Approximate Backbone","display_name":"CUDAP: A Novel Clustering Algorithm for Uncertain Data Based on Approximate Backbone","publication_year":2014,"publication_date":"2014-03-01","ids":{"openalex":"https://openalex.org/W2044049260","doi":"https://doi.org/10.4304/jsw.9.3.732-737","mag":"2044049260"},"language":"en","primary_location":{"id":"doi:10.4304/jsw.9.3.732-737","is_oa":false,"landing_page_url":"https://doi.org/10.4304/jsw.9.3.732-737","pdf_url":null,"source":{"id":"https://openalex.org/S114141714","display_name":"Journal of Software","issn_l":"1796-217X","issn":["1796-217X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318660","host_organization_name":"Academy Publisher","host_organization_lineage":["https://openalex.org/P4310318660"],"host_organization_lineage_names":["Academy Publisher"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Software","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/A5103254650","display_name":"Ping Jin","orcid":"https://orcid.org/0000-0003-2498-2654"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ping Jin","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100987504","display_name":"Shichao Qu","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Shichao Qu","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5111355598","display_name":"Yu Zong","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Yu Zong","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5100353920","display_name":"Xin Li","orcid":"https://orcid.org/0000-0002-6460-6066"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Xin Li","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.8846,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.74473429,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"9","issue":"3","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"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"}},"topics":[{"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/T10637","display_name":"Advanced Clustering Algorithms Research","score":0.9973999857902527,"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/T11063","display_name":"Rough Sets and Fuzzy Logic","score":0.9891999959945679,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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.8675093650817871},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7683866024017334},{"id":"https://openalex.org/keywords/initialization","display_name":"Initialization","score":0.7043603658676147},{"id":"https://openalex.org/keywords/cure-data-clustering-algorithm","display_name":"CURE data clustering algorithm","score":0.6671192646026611},{"id":"https://openalex.org/keywords/canopy-clustering-algorithm","display_name":"Canopy clustering algorithm","score":0.6007898449897766},{"id":"https://openalex.org/keywords/correlation-clustering","display_name":"Correlation clustering","score":0.5832900404930115},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.544466495513916},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5236465930938721},{"id":"https://openalex.org/keywords/data-stream-clustering","display_name":"Data stream clustering","score":0.4996356964111328},{"id":"https://openalex.org/keywords/data-set","display_name":"Data set","score":0.4984116554260254},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4839773178100586},{"id":"https://openalex.org/keywords/k-medoids","display_name":"k-medoids","score":0.47916117310523987},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.4274984896183014},{"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.4255616366863251},{"id":"https://openalex.org/keywords/single-linkage-clustering","display_name":"Single-linkage clustering","score":0.4122757017612457},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.23745796084403992}],"concepts":[{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.8675093650817871},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7683866024017334},{"id":"https://openalex.org/C114466953","wikidata":"https://www.wikidata.org/wiki/Q6034165","display_name":"Initialization","level":2,"score":0.7043603658676147},{"id":"https://openalex.org/C33704608","wikidata":"https://www.wikidata.org/wiki/Q5014717","display_name":"CURE data clustering algorithm","level":4,"score":0.6671192646026611},{"id":"https://openalex.org/C104047586","wikidata":"https://www.wikidata.org/wiki/Q5033439","display_name":"Canopy clustering algorithm","level":4,"score":0.6007898449897766},{"id":"https://openalex.org/C94641424","wikidata":"https://www.wikidata.org/wiki/Q5172845","display_name":"Correlation clustering","level":3,"score":0.5832900404930115},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.544466495513916},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5236465930938721},{"id":"https://openalex.org/C193143536","wikidata":"https://www.wikidata.org/wiki/Q5227360","display_name":"Data stream clustering","level":5,"score":0.4996356964111328},{"id":"https://openalex.org/C58489278","wikidata":"https://www.wikidata.org/wiki/Q1172284","display_name":"Data set","level":2,"score":0.4984116554260254},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4839773178100586},{"id":"https://openalex.org/C65932786","wikidata":"https://www.wikidata.org/wiki/Q3191282","display_name":"k-medoids","level":5,"score":0.47916117310523987},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.4274984896183014},{"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.4255616366863251},{"id":"https://openalex.org/C22648726","wikidata":"https://www.wikidata.org/wiki/Q7523744","display_name":"Single-linkage clustering","level":5,"score":0.4122757017612457},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.23745796084403992},{"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.4304/jsw.9.3.732-737","is_oa":false,"landing_page_url":"https://doi.org/10.4304/jsw.9.3.732-737","pdf_url":null,"source":{"id":"https://openalex.org/S114141714","display_name":"Journal of Software","issn_l":"1796-217X","issn":["1796-217X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318660","host_organization_name":"Academy Publisher","host_organization_lineage":["https://openalex.org/P4310318660"],"host_organization_lineage_names":["Academy Publisher"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Software","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W1496151277","https://openalex.org/W1574922246","https://openalex.org/W1586919270","https://openalex.org/W1969642980","https://openalex.org/W1989270503","https://openalex.org/W1999122033","https://openalex.org/W2004791924","https://openalex.org/W2042502381","https://openalex.org/W2062169813","https://openalex.org/W2078277510","https://openalex.org/W2089500395","https://openalex.org/W2106582507","https://openalex.org/W2168894297","https://openalex.org/W2185021446","https://openalex.org/W2335101729","https://openalex.org/W6629638098"],"related_works":["https://openalex.org/W2559422900","https://openalex.org/W2188840951","https://openalex.org/W2770741777","https://openalex.org/W2171610853","https://openalex.org/W2185849206","https://openalex.org/W2393816671","https://openalex.org/W2389934482","https://openalex.org/W4241252752","https://openalex.org/W2567087402","https://openalex.org/W2544656483"],"abstract_inverted_index":{"Clustering":[0],"for":[1,61],"uncertain":[2,16,82,174],"data":[3,10,17,83,96,141,175,200],"is":[4,28,43],"an":[5,29],"interesting":[6],"research":[7],"topic":[8],"in":[9,209],"mining.":[11],"Researchers":[12],"prefer":[13],"to":[14,32,90,155],"define":[15],"clustering":[18,26,38,55,117,212],"problem":[19],"by":[20,134,183],"using":[21],"combinatorial":[22],"optimization":[23],"model.":[24],"Heuristic":[25],"algorithm":[27,56,60,137,154],"efficient":[30],"way":[31],"deal":[33],"with":[34],"this":[35,49],"kind":[36],"of":[37,45,205,211],"problem,":[39],"but":[40],"initialization":[41,185],"sensitivity":[42],"one":[44],"inevitable":[46],"drawbacks.":[47],"In":[48,68],"paper,":[50],"we":[51,70],"propose":[52],"a":[53,151],"novel":[54],"named":[57],"CUDAP":[58],"(Clustering":[59],"Uncertain":[62],"Data":[63],"based":[64],"on":[65,79,138,171,195],"Approximate":[66],"backbone).":[67],"CUDAP,":[69],"(1)":[71],"make":[72],"M":[74,93,106,113,127],"times":[76],"random":[77],"sampling":[78],"the":[80,111,158,172,203,206],"original":[81,173],"set":[84,142,176],"D":[86,178],"m":[87,179],"generate":[91],"sampled":[95],"sets":[97,201],"DS=":[99],"{":[100],"Ds":[101,144],"1":[102,123],",Ds":[103],"2":[104,125],",\u2026,Ds":[105],"};":[108],"(2)":[109],"capture":[110],"local":[115],"optimal":[116],"results":[118,194],"P":[120,165],"={":[121],"C":[122],",C":[124],",\u2026,C":[126],"}":[129],"from":[130,163,189],"DS":[132],"running":[135],"UK-Medoids":[136,169],"each":[139],"sample":[140],"i":[145],",":[146],"i=1,\u2026M":[147],";\u00a0":[148],"(3)":[149],"design":[150],"greedy":[152],"search":[153],"find":[156],"out":[157],"approximate":[159],"backbone(":[160],"APB":[161,191],")":[162],";":[166],"(4)":[167],"run":[168],"again":[170],"guided":[182],"new":[184],"which":[186],"was":[187],"generated":[188],".":[192],"Experimental":[193],"synthetic":[196],"and":[197],"real":[198],"world":[199],"demonstrate":[202],"superiority":[204],"proposed":[207],"approach":[208],"terms":[210],"quality":[213],"measures.":[214]},"counts_by_year":[{"year":2021,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}