{"id":"https://openalex.org/W2467640454","doi":null,"title":"Speeding up k-means by approximating Euclidean distances via block vectors","display_name":"Speeding up k-means by approximating Euclidean distances via block vectors","alternate_titles":[],"publication_year":2016,"publication_date":"2016-06-19","ids":{"openalex":"https://openalex.org/W2467640454","mag":"2467640454"},"language":"en","primary_location":{"id":"mag:2467640454","doi":null,"is_oa":false,"landing_page_url":"http://jmlr.org/proceedings/papers/v48/bottesch16.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306419644","display_name":"International Conference on Machine Learning","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"International Conference on Machine Learning","raw_type":null},"parent_works":[],"lineage":["https://openalex.org/W2467640454"],"child_works_count":0,"type":"conference-paper","is_traditional":true,"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/A5018270767","display_name":"Thomas Bottesch","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I196349391","display_name":"Universit\u00e4t Ulm","ror":"https://ror.org/032000t02","country_code":"DE","type":"education","lineage":["https://openalex.org/I196349391"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Thomas Bottesch","raw_affiliation_strings":["Avira Operations GmbH & Co. KG, Tettnang, Germany and Institute of Neural Information Processing, Ulm University, Ulm, Germany#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Avira Operations GmbH & Co. KG, Tettnang, Germany and Institute of Neural Information Processing, Ulm University, Ulm, Germany#TAB#","institution_ids":["https://openalex.org/I196349391"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5023940535","display_name":"Thomas B\u00fchler","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Thomas B\u00fchler","raw_affiliation_strings":["Avira Operations GmbH & Co. KG, Tettnang, Germany#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Avira Operations GmbH & Co. KG, Tettnang, Germany#TAB#","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5058705058","display_name":"Markus K\u00e4chele","orcid":"https://orcid.org/0000-0002-5078-4363","observed_orcids":["https://orcid.org/0000-0002-5078-4363"]},"institutions":[{"id":"https://openalex.org/I196349391","display_name":"Universit\u00e4t Ulm","ror":"https://ror.org/032000t02","country_code":"DE","type":"education","lineage":["https://openalex.org/I196349391"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Markus K\u00e4chele","raw_affiliation_strings":["Inst. of Neural Information Processing, Ulm University, Ulm, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Inst. of Neural Information Processing, Ulm University, Ulm, Germany","institution_ids":["https://openalex.org/I196349391"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.4382,"has_fulltext":false,"cited_by_count":45,"citation_normalized_percentile":{"value":0.92491785,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":88,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"2578","last_page":"2586"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10637","display_name":"Advanced Clustering Algorithms Research","score":0.9990000128746033,"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.9990000128746033,"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/T13373","display_name":"Data Mining and Machine Learning Applications","score":0.00019999999494757503,"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.00019999999494757503,"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/k-means-clustering","display_name":"K-means clustering","score":0.9549999833106995},{"id":"https://openalex.org/keywords/holder-s-inequality","display_name":"H\u00f6lder inequality","score":0.7829999923706055},{"id":"https://openalex.org/keywords/computational-acceleration","display_name":"computational acceleration","score":0.5680000185966492},{"id":"https://openalex.org/keywords/memory-efficient-clustering","display_name":"memory-efficient clustering","score":0.6520000100135803},{"id":"https://openalex.org/keywords/big-data-clustering","display_name":"big data clustering","score":0.972000002861023}],"concepts":[{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.6630262136459351},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.6308290362358093},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.6125563979148865},{"id":"https://openalex.org/C120174047","wikidata":"https://www.wikidata.org/wiki/Q847073","display_name":"Euclidean distance","level":2,"score":0.6102445721626282},{"id":"https://openalex.org/C182964748","wikidata":"https://www.wikidata.org/wiki/Q208216","display_name":"Triangle inequality","level":2,"score":0.5670115351676941},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5669227838516235},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5313910245895386},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.5018274784088135},{"id":"https://openalex.org/C171558263","wikidata":"https://www.wikidata.org/wiki/Q5406122","display_name":"Euclidean distance matrix","level":3,"score":0.49433279037475586},{"id":"https://openalex.org/C164866538","wikidata":"https://www.wikidata.org/wiki/Q367351","display_name":"Cluster (spacecraft)","level":2,"score":0.46533504128456116},{"id":"https://openalex.org/C41431624","wikidata":"https://www.wikidata.org/wiki/Q1053357","display_name":"Block size","level":3,"score":0.42523714900016785},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3660896420478821},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3624064326286316},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.21202561259269714},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.20255544781684875},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.14343193173408508},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.07135361433029175},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.051002830266952515},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:2467640454","doi":null,"is_oa":false,"landing_page_url":"http://jmlr.org/proceedings/papers/v48/bottesch16.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306419644","display_name":"International Conference on Machine Learning","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"International Conference on Machine Learning","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":27,"referenced_works":["https://openalex.org/W118481696","https://openalex.org/W347787326","https://openalex.org/W391578156","https://openalex.org/W1480376833","https://openalex.org/W1561994953","https://openalex.org/W1624140875","https://openalex.org/W1651093245","https://openalex.org/W1990130348","https://openalex.org/W1994671035","https://openalex.org/W1999668761","https://openalex.org/W2029698681","https://openalex.org/W2073459066","https://openalex.org/W2103660993","https://openalex.org/W2108399535","https://openalex.org/W2116965831","https://openalex.org/W2131456395","https://openalex.org/W2141362318","https://openalex.org/W2142827986","https://openalex.org/W2142838865","https://openalex.org/W2149361517","https://openalex.org/W2150593711","https://openalex.org/W2151584222","https://openalex.org/W2160039585","https://openalex.org/W2161160262","https://openalex.org/W2169989102","https://openalex.org/W2171852577","https://openalex.org/W2187617524"],"related_works":["https://openalex.org/W4389262600","https://openalex.org/W797583727","https://openalex.org/W118481696","https://openalex.org/W2507605891","https://openalex.org/W2171852577","https://openalex.org/W4409494232","https://openalex.org/W3127913473","https://openalex.org/W2246235348","https://openalex.org/W2381934205","https://openalex.org/W2963757043"],"abstract_inverted_index":{"This":[0],"paper":[1],"introduces":[2],"a":[3,45],"new":[4],"method":[5],"to":[6,55],"approximate":[7],"Euclidean":[8],"distances":[9],"between":[10],"points":[11],"using":[12],"block":[13],"vectors":[14],"in":[15,48,53],"combination":[16],"with":[17],"the":[18,27,59,68,72,80,86],"Holder":[19],"inequality.":[20],"By":[21],"defining":[22],"lower":[23],"bounds":[24],"based":[25],"on":[26,79],"proposed":[28,61],"approximation,":[29],"cluster":[30],"algorithms":[31],"can":[32],"be":[33],"considerably":[34],"accelerated":[35],"without":[36],"loss":[37],"of":[38,50,71,82],"quality.":[39],"In":[40],"extensive":[41],"experiments,":[42],"we":[43,65],"show":[44,66],"considerable":[46],"reduction":[47],"terms":[49],"computational":[51],"time":[52],"comparison":[54],"standard":[56],"methods":[57],"and":[58],"recently":[60],"Yinyang":[62],"k-means.":[63],"Additionally":[64],"that":[67],"memory":[69],"consumption":[70],"presented":[73],"clustering":[74],"algorithm":[75],"does":[76],"not":[77],"depend":[78],"number":[81],"clusters,":[83],"which":[84],"makes":[85],"approach":[87],"suitable":[88],"for":[89],"large":[90],"scale":[91],"problems.":[92]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2467640454","counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":7},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":1}],"updated_date":"2026-11-16T12:05:36.265796","created_date":"2016-07-22T00:00:00"}
