{"id":"https://openalex.org/W2840489105","doi":"https://doi.org/10.5075/epfl-thesis-8546","title":"Algorithms For Clustering Problems : Theoretical Guarantees and Empirical Evaluations","display_name":"Algorithms For Clustering Problems : Theoretical Guarantees and Empirical Evaluations","publication_year":2018,"publication_date":"2018-01-01","ids":{"openalex":"https://openalex.org/W2840489105","doi":"https://doi.org/10.5075/epfl-thesis-8546","mag":"2840489105"},"language":"en","primary_location":{"id":"pmh:oai:infoscience.epfl.ch:255937","is_oa":true,"landing_page_url":"https://infoscience.epfl.ch/handle/20.500.14299/147179","pdf_url":"http://infoscience.epfl.ch/record/255937","source":{"id":"https://openalex.org/S4306400487","display_name":"Infoscience (Ecole Polytechnique F\u00e9d\u00e9rale de Lausanne)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"doctoral thesis"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://infoscience.epfl.ch/record/255937","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5044498140","display_name":"Ashkan Norouzi Fard","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Norouzi Fard, Ashkan","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5044498140"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10637","display_name":"Advanced Clustering Algorithms Research","score":0.5985000133514404,"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.5985000133514404,"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/cluster-analysis","display_name":"Cluster analysis","score":0.5936256051063538},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5368400812149048},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.31549376249313354}],"concepts":[{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.5936256051063538},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5368400812149048},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.31549376249313354}],"mesh":[],"locations_count":3,"locations":[{"id":"pmh:oai:infoscience.epfl.ch:255937","is_oa":true,"landing_page_url":"https://infoscience.epfl.ch/handle/20.500.14299/147179","pdf_url":"http://infoscience.epfl.ch/record/255937","source":{"id":"https://openalex.org/S4306400487","display_name":"Infoscience (Ecole Polytechnique F\u00e9d\u00e9rale de Lausanne)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"doctoral thesis"},{"id":"doi:10.5075/epfl-thesis-8546","is_oa":true,"landing_page_url":"https://doi.org/10.5075/epfl-thesis-8546","pdf_url":null,"source":{"id":"https://openalex.org/S4306400488","display_name":"Infoscience (Ecole Polytechnique F\u00e9d\u00e9rale de Lausanne)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"thesis"},{"id":"mag:2840489105","is_oa":false,"landing_page_url":"https://infoscience.epfl.ch/record/255937/","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":null}],"best_oa_location":{"id":"pmh:oai:infoscience.epfl.ch:255937","is_oa":true,"landing_page_url":"https://infoscience.epfl.ch/handle/20.500.14299/147179","pdf_url":"http://infoscience.epfl.ch/record/255937","source":{"id":"https://openalex.org/S4306400487","display_name":"Infoscience (Ecole Polytechnique F\u00e9d\u00e9rale de Lausanne)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"doctoral thesis"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2840489105.pdf"},"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2963576481","https://openalex.org/W2971624618","https://openalex.org/W1996659439","https://openalex.org/W2094923936","https://openalex.org/W1891203375","https://openalex.org/W2033344446","https://openalex.org/W3137423196","https://openalex.org/W2199495299","https://openalex.org/W2139841919","https://openalex.org/W3166121878","https://openalex.org/W2009234819","https://openalex.org/W2048974928","https://openalex.org/W2106777604","https://openalex.org/W1921984393","https://openalex.org/W3026889334","https://openalex.org/W3120306418","https://openalex.org/W3132054035","https://openalex.org/W2735184074","https://openalex.org/W3211422366","https://openalex.org/W2791559636"],"abstract_inverted_index":{"Clustering":[0],"is":[1,138,171,186,239,271],"a":[2,10,44,168,172,183,202,240,300],"classic":[3],"topic":[4],"in":[5,13,39,89,280],"combinatorial":[6],"optimization":[7],"and":[8,19,74,76,119,154,217,255,277,297,314,323],"plays":[9],"central":[11],"role":[12],"many":[14],"areas,":[15],"including":[16],"data":[17],"science":[18],"machine":[20],"learning.":[21],"In":[22,113,130],"this":[23,198],"thesis,":[24],"we":[25,115,120,150,256,317],"first":[26,55],"focus":[27],"on":[28,72],"the":[29,35,54,61,81,86,90,132,146,158,212,221,233,246,262,268,286],"dynamic":[30,62,147],"facility":[31,36,49,63,110],"location":[32,37,50,64,111],"problem":[33,38],"(i.e.,":[34],"evolving":[40],"metrics).":[41],"We":[42,196,283,303],"present":[43,151],"new":[45,203],"LP-rounding":[46,143],"algorithm":[47,59,67,137,164,242,291,306],"for":[48,60,109,140,165,261,278],"problems,":[51],"which":[52],"yields":[53,177],"constant":[56],"factor":[57],"approximation":[58,179,234],"problem.":[65,148,160],"Our":[66,236,250],"installs":[68],"competing":[69],"exponential":[70,95],"clocks":[71,96],"clients":[73,122],"facilities,":[75],"connects":[77],"every":[78],"client":[79],"by":[80,200],"path":[82],"that":[83,102,176,185,206,224,316],"repeatedly":[84],"follows":[85],"smallest":[87],"clock":[88],"neighborhood.":[91],"The":[92,161],"use":[93,116],"of":[94,127,135,157,181,215,265,289],"gives":[97],"rise":[98],"to":[99,123,145,188,193,210,219,245,274,292],"several":[100],"properties":[101],"distinguish":[103],"our":[104,136,142,290,305],"approach":[105,144,205],"from":[106],"previous":[107],"LP-roundings":[108],"problems.":[112],"particular,":[114],"\\emph{no":[117],"clustering}":[118],"enable":[121],"connect":[124],"through":[125],"paths":[126],"\\emph{arbitrary":[128],"lengths}.":[129],"fact,":[131],"clustering-free":[133],"nature":[134],"crucial":[139],"applying":[141],"Furthermore,":[149],"both":[152],"empirical":[153],"theoretical":[155],"aspects":[156],"$k$-means":[159,166,216,266],"best":[162],"known":[163,187],"with":[167,191,243,307,321],"provable":[169,301],"guarantee":[170,180],"simple":[173],"local-search":[174],"heuristic":[175],"an":[178],"$9+\\epsilon$,":[182],"ratio":[184],"be":[189,275],"tight":[190],"respect":[192,244],"such":[194],"methods.":[195],"overcome":[197],"barrier":[199],"presenting":[201],"primal-dual":[204],"enables":[207],"us":[208],"(1)":[209],"exploit":[211],"geometric":[213],"structure":[214],"(2)":[218],"satisfy":[220],"hard":[222],"constraint":[223],"at":[225],"most":[226],"$k$":[227],"clusters":[228],"are":[229,252],"selected":[230],"without":[231],"deteriorating":[232],"guarantee.":[235,302],"main":[237],"result":[238],"$6.357$-approximation":[241],"standard":[247],"LP":[248],"relaxation.":[249],"techniques":[251],"quite":[253],"general":[254,263],"also":[257,284],"show":[258,315],"improved":[259],"guarantees":[260],"version":[264],"where":[267],"underlying":[269],"metric":[270],"not":[272],"required":[273],"Euclidean":[276,281],"$k$-median":[279],"metrics.":[282],"improve":[285],"running":[287,295,326],"time":[288,296],"almost":[293],"linear":[294],"still":[298],"maintain":[299],"compare":[304],"{\\sc":[308],"K-Means++}":[309],"(a":[310],"widely":[311],"studied":[312],"algorithm)":[313],"obtain":[318],"better":[319,325],"accuracy":[320],"comparable":[322],"even":[324],"time.":[327]},"counts_by_year":[],"updated_date":"2025-11-06T06:51:31.235846","created_date":"2018-07-19T00:00:00"}