{"id":"https://openalex.org/W2017920586","doi":"https://doi.org/10.14778/2180912.2180914","title":"Uncertain centroid based partitional clustering of uncertain data","display_name":"Uncertain centroid based partitional clustering of uncertain data","publication_year":2012,"publication_date":"2012-03-01","ids":{"openalex":"https://openalex.org/W2017920586","doi":"https://doi.org/10.14778/2180912.2180914","mag":"2017920586"},"language":"en","primary_location":{"id":"doi:10.14778/2180912.2180914","is_oa":false,"landing_page_url":"https://doi.org/10.14778/2180912.2180914","pdf_url":null,"source":{"id":"https://openalex.org/S4210226185","display_name":"Proceedings of the VLDB Endowment","issn_l":"2150-8097","issn":["2150-8097"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the VLDB Endowment","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/A5026420819","display_name":"Francesco Gullo","orcid":"https://orcid.org/0000-0002-7052-1114"},"institutions":[{"id":"https://openalex.org/I2800095910","display_name":"Yahoo (Spain)","ror":"https://ror.org/03gq8sg42","country_code":"ES","type":"company","lineage":["https://openalex.org/I2800095910","https://openalex.org/I4210134091"]}],"countries":["ES"],"is_corresponding":false,"raw_author_name":"Francesco Gullo","raw_affiliation_strings":["Yahoo! Research, Barcelona, Spain"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Yahoo! Research, Barcelona, Spain","institution_ids":["https://openalex.org/I2800095910"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5021211836","display_name":"Andrea Tagarelli","orcid":"https://orcid.org/0000-0002-8142-503X"},"institutions":[{"id":"https://openalex.org/I45204951","display_name":"University of Calabria","ror":"https://ror.org/02rc97e94","country_code":"IT","type":"education","lineage":["https://openalex.org/I45204951"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Andrea Tagarelli","raw_affiliation_strings":["University of Calabria, Rende (CS), Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Calabria, Rende (CS), Italy","institution_ids":["https://openalex.org/I45204951"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.1931,"has_fulltext":false,"cited_by_count":33,"citation_normalized_percentile":{"value":0.90263888,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"5","issue":"7","first_page":"610","last_page":"621"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9994000196456909,"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.9994000196456909,"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.9970999956130981,"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/T13282","display_name":"Automated Road and Building Extraction","score":0.9912999868392944,"subfield":{"id":"https://openalex.org/subfields/2212","display_name":"Ocean Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"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.8796114921569824},{"id":"https://openalex.org/keywords/centroid","display_name":"Centroid","score":0.789522111415863},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.6759037375450134},{"id":"https://openalex.org/keywords/cure-data-clustering-algorithm","display_name":"CURE data clustering algorithm","score":0.566234290599823},{"id":"https://openalex.org/keywords/correlation-clustering","display_name":"Correlation clustering","score":0.5598839521408081},{"id":"https://openalex.org/keywords/k-medians-clustering","display_name":"k-medians clustering","score":0.5568206310272217},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5474496483802795},{"id":"https://openalex.org/keywords/cluster","display_name":"Cluster (spacecraft)","score":0.5125932097434998},{"id":"https://openalex.org/keywords/constrained-clustering","display_name":"Constrained clustering","score":0.4964142441749573},{"id":"https://openalex.org/keywords/single-linkage-clustering","display_name":"Single-linkage clustering","score":0.4906567633152008},{"id":"https://openalex.org/keywords/pattern-recognition","display_name":"Pattern recognition (psychology)","score":0.4761229157447815},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.46931955218315125},{"id":"https://openalex.org/keywords/object","display_name":"Object (grammar)","score":0.4670267105102539},{"id":"https://openalex.org/keywords/consensus-clustering","display_name":"Consensus clustering","score":0.46500810980796814},{"id":"https://openalex.org/keywords/uncertain-data","display_name":"Uncertain data","score":0.44227468967437744},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.35109943151474}],"concepts":[{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.8796114921569824},{"id":"https://openalex.org/C146599234","wikidata":"https://www.wikidata.org/wiki/Q511093","display_name":"Centroid","level":2,"score":0.789522111415863},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.6759037375450134},{"id":"https://openalex.org/C33704608","wikidata":"https://www.wikidata.org/wiki/Q5014717","display_name":"CURE data clustering algorithm","level":4,"score":0.566234290599823},{"id":"https://openalex.org/C94641424","wikidata":"https://www.wikidata.org/wiki/Q5172845","display_name":"Correlation clustering","level":3,"score":0.5598839521408081},{"id":"https://openalex.org/C115328559","wikidata":"https://www.wikidata.org/wiki/Q4041956","display_name":"k-medians clustering","level":5,"score":0.5568206310272217},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5474496483802795},{"id":"https://openalex.org/C164866538","wikidata":"https://www.wikidata.org/wiki/Q367351","display_name":"Cluster (spacecraft)","level":2,"score":0.5125932097434998},{"id":"https://openalex.org/C27964816","wikidata":"https://www.wikidata.org/wiki/Q5164359","display_name":"Constrained clustering","level":5,"score":0.4964142441749573},{"id":"https://openalex.org/C22648726","wikidata":"https://www.wikidata.org/wiki/Q7523744","display_name":"Single-linkage clustering","level":5,"score":0.4906567633152008},{"id":"https://openalex.org/C153180895","wikidata":"https://www.wikidata.org/wiki/Q7148389","display_name":"Pattern recognition (psychology)","level":2,"score":0.4761229157447815},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.46931955218315125},{"id":"https://openalex.org/C2781238097","wikidata":"https://www.wikidata.org/wiki/Q175026","display_name":"Object (grammar)","level":2,"score":0.4670267105102539},{"id":"https://openalex.org/C186767784","wikidata":"https://www.wikidata.org/wiki/Q5162841","display_name":"Consensus clustering","level":5,"score":0.46500810980796814},{"id":"https://openalex.org/C2778865114","wikidata":"https://www.wikidata.org/wiki/Q7882489","display_name":"Uncertain data","level":2,"score":0.44227468967437744},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.35109943151474},{"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.14778/2180912.2180914","is_oa":false,"landing_page_url":"https://doi.org/10.14778/2180912.2180914","pdf_url":null,"source":{"id":"https://openalex.org/S4210226185","display_name":"Proceedings of the VLDB Endowment","issn_l":"2150-8097","issn":["2150-8097"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the VLDB Endowment","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":18,"referenced_works":["https://openalex.org/W1490591387","https://openalex.org/W1496151277","https://openalex.org/W1505129060","https://openalex.org/W1574922246","https://openalex.org/W1969642980","https://openalex.org/W1971784203","https://openalex.org/W1978933387","https://openalex.org/W1995369260","https://openalex.org/W2003571118","https://openalex.org/W2004366212","https://openalex.org/W2106582507","https://openalex.org/W2110553125","https://openalex.org/W2113728436","https://openalex.org/W2130308858","https://openalex.org/W2146004021","https://openalex.org/W2152440300","https://openalex.org/W2171660758","https://openalex.org/W3120740533"],"related_works":["https://openalex.org/W2551136488","https://openalex.org/W1491908038","https://openalex.org/W2153958734","https://openalex.org/W4301079385","https://openalex.org/W2953024232","https://openalex.org/W3008552679","https://openalex.org/W3025379803","https://openalex.org/W2017920586","https://openalex.org/W4362544924","https://openalex.org/W3125249621"],"abstract_inverted_index":{"Clustering":[0],"uncertain":[1,10,87,104,141],"data":[2,11,88],"has":[3,27,56],"emerged":[4],"as":[5,102],"a":[6,17,32,82,91,110,138,145],"challenging":[7],"task":[8],"in":[9,44,107],"management":[12],"and":[13,31,50,65,79,131],"mining.":[14],"Thanks":[15],"to":[16,59,85,125],"computational":[18],"complexity":[19],"advantage":[20],"over":[21],"other":[22],"clustering":[23,26,51,86,148,157],"paradigms,":[24],"partitional":[25,77,156],"been":[28,37,57],"particularly":[29],"studied":[30],"number":[33],"of":[34,47,62,76,94,109,122,140],"algorithms":[35],"have":[36],"developed.":[38],"While":[39],"existing":[40,74,155],"proposals":[41],"differ":[42],"mainly":[43],"the":[45,123],"notions":[46],"cluster":[48,95,98,139],"centroid":[49,99],"objective":[52],"function,":[53],"little":[54],"attention":[55],"given":[58],"an":[60,103],"analysis":[61],"their":[63],"characteristics":[64],"limits.":[66],"In":[67],"this":[68,133],"work,":[69],"we":[70],"theoretically":[71,130],"investigate":[72],"major":[73],"methods":[75],"clustering,":[78],"alternatively":[80],"propose":[81],"well-founded":[83],"approach":[84],"based":[89,117],"on":[90,118],"novel":[92],"notion":[93],"centroid.":[96],"A":[97],"is":[100],"seen":[101],"object":[105],"defined":[106],"terms":[108],"random":[111],"variable":[112],"whose":[113],"realizations":[114],"are":[115],"derived":[116],"all":[119],"deterministic":[120],"representations":[121],"objects":[124],"be":[126],"clustered.":[127],"As":[128],"demonstrated":[129],"experimentally,":[132],"allows":[134],"for":[135],"better":[136],"representing":[137],"objects,":[142],"thus":[143],"supporting":[144],"consistently":[146],"improved":[147],"performance":[149],"while":[150],"maintaining":[151],"comparable":[152],"efficiency":[153],"with":[154],"algorithms.":[158]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":6},{"year":2013,"cited_by_count":2}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}
