{"id":"https://openalex.org/W46794949","doi":null,"title":"An Efficient Approach to Scale up k-medoid based Algorithms in Large Databases.","display_name":"An Efficient Approach to Scale up k-medoid based Algorithms in Large Databases.","publication_year":2006,"publication_date":"2006-01-01","ids":{"openalex":"https://openalex.org/W46794949","mag":"46794949"},"language":"en","primary_location":{"id":"mag:46794949","doi":null,"is_oa":false,"landing_page_url":"http://dblp.uni-trier.de/db/conf/sbbd/sbbd2006.html#BarioniRTT06","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},"volume":null,"type":"article","indexed_in":[],"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/A5009825422","display_name":"Maria Camila N. Barioni","orcid":"https://orcid.org/0000-0002-5809-0243","observed_orcids":["https://orcid.org/0000-0002-5809-0243"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Maria Camila N. Barioni","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0002-5809-0243","affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5014315681","display_name":"Humberto Razente","orcid":"https://orcid.org/0000-0001-9687-5730","observed_orcids":["https://orcid.org/0000-0001-9687-5730"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Humberto Razente","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0001-9687-5730","affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5014783020","display_name":"Agma J. M. Traina","orcid":"https://orcid.org/0000-0003-4929-7258","observed_orcids":["https://orcid.org/0000-0003-4929-7258"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Agma J. M. Traina","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0003-4929-7258","affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5020611078","display_name":"Caetano Traina","orcid":"https://orcid.org/0000-0002-6625-6047","observed_orcids":["https://orcid.org/0000-0002-6625-6047"]},"institutions":[{"id":"https://openalex.org/I17974374","display_name":"Universidade de S\u00e3o Paulo","ror":"https://ror.org/036rp1748","country_code":"BR","type":"education","lineage":["https://openalex.org/I17974374"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Caetano Traina","raw_affiliation_strings":["University of S\u00e3o Paulo"],"raw_orcid":"https://orcid.org/0000-0002-6625-6047","affiliations":[{"raw_affiliation_string":"University of S\u00e3o Paulo","institution_ids":["https://openalex.org/I17974374"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.7611,"has_fulltext":false,"cited_by_count":20,"citation_normalized_percentile":{"value":0.7620049,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"265","last_page":"279"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10637","display_name":"Advanced Clustering Algorithms Research","score":0.7192000150680542,"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.7192000150680542,"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.2502000033855438,"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/T10317","display_name":"Advanced Database Systems and Queries","score":0.008899999782443047,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/k-medoids-clustering","display_name":"K-medoids clustering","score":0.8650000095367432},{"id":"https://openalex.org/keywords/scalable-clustering","display_name":"scalable clustering","score":0.5690000057220459},{"id":"https://openalex.org/keywords/metric-access-methods","display_name":"metric access methods","score":0.8999999761581421},{"id":"https://openalex.org/keywords/database-management-systems","display_name":"database management systems","score":0.7289999723434448},{"id":"https://openalex.org/keywords/large-databases","display_name":"large databases","score":0.7379999756813049},{"id":"https://openalex.org/keywords/distance-calculation-reduction","display_name":"distance calculation reduction","score":0.8389999866485596},{"id":"https://openalex.org/keywords/clustering-quality","display_name":"clustering quality","score":0.37299999594688416}],"concepts":[{"id":"https://openalex.org/C63085389","wikidata":"https://www.wikidata.org/wiki/Q4287912","display_name":"Medoid","level":3,"score":0.9147676825523376},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8023273944854736},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.7377979159355164},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.6550949215888977},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.6510511636734009},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.6279367208480835},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6078027486801147},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.5559426546096802},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.4867384433746338},{"id":"https://openalex.org/C2778755073","wikidata":"https://www.wikidata.org/wiki/Q10858537","display_name":"Scale (ratio)","level":2,"score":0.41723692417144775},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.23249691724777222},{"id":"https://openalex.org/C21547014","wikidata":"https://www.wikidata.org/wiki/Q1423657","display_name":"Operations management","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C187736073","wikidata":"https://www.wikidata.org/wiki/Q2920921","display_name":"Management","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:46794949","doi":null,"is_oa":false,"landing_page_url":"http://dblp.uni-trier.de/db/conf/sbbd/sbbd2006.html#BarioniRTT06","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W87092222","https://openalex.org/W1481265159","https://openalex.org/W1481798977","https://openalex.org/W1575476631","https://openalex.org/W1577072181","https://openalex.org/W1977556410","https://openalex.org/W1992419399","https://openalex.org/W2049797265","https://openalex.org/W2095897464","https://openalex.org/W2111532165","https://openalex.org/W2120636855","https://openalex.org/W2126626732","https://openalex.org/W2131687179","https://openalex.org/W2140190241","https://openalex.org/W2151135734","https://openalex.org/W2157092487","https://openalex.org/W2178795733","https://openalex.org/W2999729612"],"related_works":["https://openalex.org/W2001280717","https://openalex.org/W2029237823","https://openalex.org/W2967990367","https://openalex.org/W2467348223","https://openalex.org/W7099918047","https://openalex.org/W7095606580","https://openalex.org/W1481265159","https://openalex.org/W2977979607","https://openalex.org/W2769842586","https://openalex.org/W2520087089"],"abstract_inverted_index":{"Scalable":[0],"data":[1],"mining":[2],"algorithms":[3,27,37,93],"have":[4],"become":[5],"crucial":[6],"to":[7,38,91],"efficiently":[8],"support":[9],"KDD":[10],"processes":[11],"on":[12,60],"large":[13],"databases.":[14],"In":[15],"this":[16],"paper,":[17],"we":[18],"address":[19],"the":[20,29,49,54,70,75],"task":[21],"of":[22,31,48,77,83,97],"scaling":[23],"up":[24],"k-medoids":[25],"based":[26,59],"through":[28],"utilization":[30],"metric":[32],"access":[33],"methods,":[34],"allowing":[35],"clustering":[36],"be":[39],"executed":[40],"by":[41,53,80],"database":[42],"management":[43],"systems":[44],"in":[45],"a":[46,81,86],"fraction":[47],"time":[50],"usually":[51],"required":[52],"traditional":[55],"approaches.":[56],"Experimental":[57],"results":[58],"several":[61],"datasets,":[62],"including":[63],"synthetic":[64],"and":[65],"real":[66],"data,":[67],"show":[68],"that":[69],"proposed":[71],"algorithm":[72],"may":[73],"reduce":[74],"number":[76],"distance":[78],"calculations":[79],"factor":[82],"more":[84],"than":[85],"thousand":[87],"times":[88],"when":[89],"compared":[90],"existing":[92],"while":[94],"producing":[95],"clusters":[96],"comparable":[98],"quality.":[99]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":2}],"updated_date":"2026-10-16T09:59:22.235173","created_date":"2016-06-24T00:00:00"}