{"id":"https://openalex.org/W2380172038","doi":"https://doi.org/10.1145/2939672.2939750","title":"AnyDBC","display_name":"AnyDBC","publication_year":2016,"publication_date":"2016-08-08","ids":{"openalex":"https://openalex.org/W2380172038","doi":"https://doi.org/10.1145/2939672.2939750","mag":"2380172038"},"language":"en","primary_location":{"id":"doi:10.1145/2939672.2939750","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2939672.2939750","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","raw_type":"proceedings-article"},"type":"conference-paper","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":null,"display_name":"Son T. Mai","orcid":null},"institutions":[{"id":"https://openalex.org/I204337017","display_name":"Aarhus University","ror":"https://ror.org/01aj84f44","country_code":"DK","type":"education","lineage":["https://openalex.org/I204337017"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Son T. Mai","raw_affiliation_strings":["Aarhus University, Aarhus, Denmark"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Aarhus University, Aarhus, Denmark","institution_ids":["https://openalex.org/I204337017"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5104360871","display_name":"Ira Assent","orcid":"https://orcid.org/0000-0002-1091-9948"},"institutions":[{"id":"https://openalex.org/I204337017","display_name":"Aarhus University","ror":"https://ror.org/01aj84f44","country_code":"DK","type":"education","lineage":["https://openalex.org/I204337017"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Ira Assent","raw_affiliation_strings":["Aarhus University, Aarhus, Denmark"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Aarhus University, Aarhus, Denmark","institution_ids":["https://openalex.org/I204337017"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5057988164","display_name":"Martin Storgaard","orcid":null},"institutions":[{"id":"https://openalex.org/I204337017","display_name":"Aarhus University","ror":"https://ror.org/01aj84f44","country_code":"DK","type":"education","lineage":["https://openalex.org/I204337017"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Martin Storgaard","raw_affiliation_strings":["Aarhus University, Aarhus, Denmark"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Aarhus University, Aarhus, Denmark","institution_ids":["https://openalex.org/I204337017"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I204337017"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":52,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1025","last_page":"1034"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10637","display_name":"Advanced Clustering Algorithms Research","score":0.9997000098228455,"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.9997000098228455,"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/T10627","display_name":"Advanced Image and Video Retrieval Techniques","score":0.9976000189781189,"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"}},{"id":"https://openalex.org/T10057","display_name":"Face and Expression Recognition","score":0.9965999722480774,"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/dbscan","display_name":"DBSCAN","score":0.9418469667434692},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8018004894256592},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.7377871870994568},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.6441129446029663},{"id":"https://openalex.org/keywords/range","display_name":"Range (aeronautics)","score":0.5478246212005615},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.4661508798599243},{"id":"https://openalex.org/keywords/nearest-neighbor-search","display_name":"Nearest neighbor search","score":0.41715970635414124},{"id":"https://openalex.org/keywords/pattern-recognition","display_name":"Pattern recognition (psychology)","score":0.37739792466163635},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3264828324317932},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3211875557899475},{"id":"https://openalex.org/keywords/correlation-clustering","display_name":"Correlation clustering","score":0.10815545916557312},{"id":"https://openalex.org/keywords/cure-data-clustering-algorithm","display_name":"CURE data clustering algorithm","score":0.09211474657058716},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.06811445951461792}],"concepts":[{"id":"https://openalex.org/C46576248","wikidata":"https://www.wikidata.org/wiki/Q1114630","display_name":"DBSCAN","level":5,"score":0.9418469667434692},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8018004894256592},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.7377871870994568},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.6441129446029663},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.5478246212005615},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.4661508798599243},{"id":"https://openalex.org/C116738811","wikidata":"https://www.wikidata.org/wiki/Q608751","display_name":"Nearest neighbor search","level":2,"score":0.41715970635414124},{"id":"https://openalex.org/C153180895","wikidata":"https://www.wikidata.org/wiki/Q7148389","display_name":"Pattern recognition (psychology)","level":2,"score":0.37739792466163635},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3264828324317932},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3211875557899475},{"id":"https://openalex.org/C94641424","wikidata":"https://www.wikidata.org/wiki/Q5172845","display_name":"Correlation clustering","level":3,"score":0.10815545916557312},{"id":"https://openalex.org/C33704608","wikidata":"https://www.wikidata.org/wiki/Q5014717","display_name":"CURE data clustering algorithm","level":4,"score":0.09211474657058716},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.06811445951461792},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/2939672.2939750","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2939672.2939750","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","raw_type":"proceedings-article"},{"id":"pmh:oai:pure.atira.dk:publications/2e26a25b-2299-49c0-a398-007f09afa94c","is_oa":false,"landing_page_url":"https://pure.au.dk/portal/en/publications/2e26a25b-2299-49c0-a398-007f09afa94c","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Thai Son, M, Assent, I & Storgaard, M 2016, AnyDBC : An efficient anytime density-based clustering algorithm for very large complex datasets. in KDD 2016 - Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. Association for Computing Machinery, pp. 1025-1034, 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD 2016, San Francisco, United States, 13/08/2016. https://doi.org/10.1145/2939672.2939750","raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W1482766851","https://openalex.org/W1531963106","https://openalex.org/W1548293884","https://openalex.org/W1597504361","https://openalex.org/W1673310716","https://openalex.org/W1990702478","https://openalex.org/W1999163438","https://openalex.org/W2004914209","https://openalex.org/W2048968215","https://openalex.org/W2064681502","https://openalex.org/W2092799168","https://openalex.org/W2103851285","https://openalex.org/W2113054345","https://openalex.org/W2118268275","https://openalex.org/W2123747287","https://openalex.org/W2163316275","https://openalex.org/W2396032095","https://openalex.org/W2903158431","https://openalex.org/W3100089556","https://openalex.org/W6687188548"],"related_works":["https://openalex.org/W2058965144","https://openalex.org/W2164382479","https://openalex.org/W2146343568","https://openalex.org/W98480971","https://openalex.org/W2150291671","https://openalex.org/W3176449234","https://openalex.org/W2767235736","https://openalex.org/W2045002201","https://openalex.org/W4225278791","https://openalex.org/W4322502698"],"abstract_inverted_index":{"The":[0],"density-based":[1],"clustering":[2,9],"algorithm":[3],"DBSCAN":[4,136,156],"is":[5],"a":[6,24,32,113],"state-of-the-art":[7],"data":[8,60,110],"technique":[10],"with":[11,38],"numerous":[12],"applications":[13],"in":[14,125],"many":[15],"fields.":[16],"However,":[17],"its":[18,158],"O(n2)":[19],"time":[20,51],"complexity":[21],"still":[22,138],"remains":[23],"severe":[25],"weakness.":[26],"In":[27],"this":[28,39],"paper,":[29],"we":[30],"propose":[31],"novel":[33],"anytime":[34],"approach":[35],"to":[36,135,155],"cope":[37],"problem":[40],"by":[41],"reducing":[42,80],"both":[43],"the":[44,48,59,81,90,104,109,126,140],"range":[45,91,132],"query":[46,92],"and":[47,68,101,111,157,165],"label":[49,82],"propagation":[50,83],"of":[52,75,87,108,144,150,152],"DBSCAN.":[53,145],"Our":[54],"algorithm,":[55],"called":[56,65],"AnyDBC,":[57],"compresses":[58],"into":[61],"smaller":[62],"density-connected":[63],"subsets":[64],"primitive":[66,77],"clusters":[67,78,120],"labels":[69],"objects":[70,95,117],"based":[71],"on":[72,161],"connected":[73],"components":[74],"these":[76],"for":[79,93,118],"time.":[84],"Moreover,":[85],"instead":[86],"passively":[88],"performing":[89],"all":[94],"like":[96],"existing":[97],"techniques,":[98],"AnyDBC":[99],"iteratively":[100],"actively":[102],"learns":[103],"current":[105],"cluster":[106],"structure":[107],"selects":[112],"few":[114],"most":[115],"promising":[116],"refining":[119],"at":[121],"each":[122],"iteration.":[123],"Thus,":[124],"end,":[127],"it":[128],"performs":[129],"substantially":[130],"fewer":[131],"queries":[133],"compared":[134,154],"while":[137],"guaranteeing":[139],"exact":[141],"final":[142],"result":[143],"Experiments":[146],"show":[147],"speedup":[148],"factors":[149],"orders":[151],"magnitude":[153],"fastest":[159],"variants":[160],"very":[162],"large":[163],"real":[164],"synthetic":[166],"complex":[167],"datasets.":[168]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":6},{"year":2019,"cited_by_count":9},{"year":2018,"cited_by_count":11},{"year":2017,"cited_by_count":7}],"updated_date":"2026-07-25T15:57:00.446498","created_date":"2016-06-24T00:00:00"}