{"id":"https://openalex.org/W2065060195","doi":null,"title":"Clustering in large graphs and matrices","display_name":"Clustering in large graphs and matrices","publication_year":1999,"publication_date":"1999-01-01","ids":{"openalex":"https://openalex.org/W2065060195","mag":"2065060195"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.34.8748","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.34.8748","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.yale.edu/~kannan/Papers/./cluster.ps","raw_type":"text"},"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/A5081378199","display_name":"Petros Drineas B","orcid":"https://orcid.org/0000-0003-1994-8670","observed_orcids":["https://orcid.org/0000-0003-1994-8670"]},"institutions":[{"id":"https://openalex.org/I32971472","display_name":"Yale University","ror":"https://ror.org/03v76x132","country_code":"US","type":"education","lineage":["https://openalex.org/I32971472"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Petros Drineas","raw_affiliation_strings":["Computer Science Department, Yale University, New Haven, CT#TAB#"],"raw_orcid":"https://orcid.org/0000-0003-1994-8670","affiliations":[{"raw_affiliation_string":"Computer Science Department, Yale University, New Haven, CT#TAB#","institution_ids":["https://openalex.org/I32971472"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5056950019","display_name":"ALAN M. FRIEZE","orcid":"https://orcid.org/0000-0002-8481-5615","observed_orcids":["https://orcid.org/0000-0002-8481-5615"]},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Alan Frieze","raw_affiliation_strings":["Department of Mathematical Sciences, Carnegie Mellon University, Pittsburgh PA#TAB#"],"raw_orcid":"https://orcid.org/0000-0002-8481-5615","affiliations":[{"raw_affiliation_string":"Department of Mathematical Sciences, Carnegie Mellon University, Pittsburgh PA#TAB#","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5059436381","display_name":"Ravi Kannan","orcid":"https://orcid.org/0000-0002-6412-4550","observed_orcids":["https://orcid.org/0000-0002-6412-4550"]},"institutions":[{"id":"https://openalex.org/I32971472","display_name":"Yale University","ror":"https://ror.org/03v76x132","country_code":"US","type":"education","lineage":["https://openalex.org/I32971472"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ravi Kannan","raw_affiliation_strings":["Computer Science Department, Yale University, New Haven, CT#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science Department, Yale University, New Haven, CT#TAB#","institution_ids":["https://openalex.org/I32971472"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101983359","display_name":"Santosh Vempala","orcid":"https://orcid.org/0000-0002-3779-433X","observed_orcids":["https://orcid.org/0000-0002-3779-433X"]},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]},{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Santosh Vempala","raw_affiliation_strings":["Department of Mathematics, M.I.T., Cambridge, MA and University of California, Berkeley"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics, M.I.T., Cambridge, MA and University of California, Berkeley","institution_ids":["https://openalex.org/I63966007","https://openalex.org/I95457486"]}]},{"author_position":"last","author":{"id":null,"display_name":"Vishwa Vinay","orcid":"https://orcid.org/0000-0002-4043-9953","observed_orcids":["https://orcid.org/0000-0002-4043-9953"]},"institutions":[{"id":"https://openalex.org/I59270414","display_name":"Indian Institute of Science Bangalore","ror":"https://ror.org/04dese585","country_code":"IN","type":"education","lineage":["https://openalex.org/I59270414"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Vishwa Vinay","raw_affiliation_strings":["Indian Inst. of Science, Bangalore  India"],"raw_orcid":"https://orcid.org/0000-0002-4043-9953","affiliations":[{"raw_affiliation_string":"Indian Inst. of Science, Bangalore  India","institution_ids":["https://openalex.org/I59270414"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":5,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":12.8351,"has_fulltext":false,"cited_by_count":191,"citation_normalized_percentile":{"value":0.98875612,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"291","last_page":"299"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10637","display_name":"Advanced Clustering Algorithms Research","score":0.989300012588501,"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.989300012588501,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.003599999938160181,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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.0007999999797903001,"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/clustering","display_name":"clustering","score":0.753000020980835},{"id":"https://openalex.org/keywords/k-means-clustering","display_name":"K-means clustering","score":0.7269999980926514},{"id":"https://openalex.org/keywords/sum-of-squared-distances","display_name":"sum of squared distances","score":0.7089999914169312},{"id":"https://openalex.org/keywords/subspace-approximation","display_name":"subspace approximation","score":0.7239999771118164},{"id":"https://openalex.org/keywords/singular-value-decomposition","display_name":"singular value decomposition","score":0.9750000238418579},{"id":"https://openalex.org/keywords/relaxation","display_name":"relaxation","score":0.6610000133514404},{"id":"https://openalex.org/keywords/approximation-algorithms","display_name":"approximation algorithms","score":0.8980000019073486},{"id":"https://openalex.org/keywords/large-graphs","display_name":"large-scale graphs","score":0.6200000047683716},{"id":"https://openalex.org/keywords/large-matrices","display_name":"large matrices","score":0.6140000224113464}],"concepts":[{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.7207413911819458},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6219910383224487},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.24316561222076416}],"mesh":[],"locations_count":6,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.34.8748","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.34.8748","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.yale.edu/~kannan/Papers/./cluster.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.37.9724","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.37.9724","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.math.cmu.edu/~af1p/cluster.ps.gz","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.40.5541","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.40.5541","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://cluster.cs.yale.edu/Papers/cluster.ps.gz","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.44.3261","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.44.3261","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www-math.mit.edu/~vempala/papers/clus.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.560.7735","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.560.7735","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.stanford.edu/~montanar/TEACHING/Stat319/papers/drineas.pdf","raw_type":"text"},{"id":"mag:2065060195","doi":null,"is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/conf/soda/soda99.html#DrineasFKVV99","pdf_url":null,"source":{"id":"https://openalex.org/S4306420974","display_name":"Symposium on Discrete Algorithms","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":"Symposium on Discrete Algorithms","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1505395986","https://openalex.org/W1527583442","https://openalex.org/W1952127226","https://openalex.org/W1981202432","https://openalex.org/W2013089587","https://openalex.org/W2024552513","https://openalex.org/W2041674806","https://openalex.org/W2072773380","https://openalex.org/W2073583237","https://openalex.org/W2086351984","https://openalex.org/W2114772807","https://openalex.org/W2798467410","https://openalex.org/W2798909945","https://openalex.org/W3111753423"],"related_works":["https://openalex.org/W2004791924","https://openalex.org/W2058681351","https://openalex.org/W2133311553","https://openalex.org/W4238136308","https://openalex.org/W1535669030","https://openalex.org/W7100610368","https://openalex.org/W2987925530","https://openalex.org/W2008513704","https://openalex.org/W7097512040","https://openalex.org/W1585754713"],"abstract_inverted_index":{"We":[0,88,116],"consider":[1,89],"the":[2,29,48,55,69,93,97,103,111,125,137,148,159],"problem":[3,82],"of":[4,8,31,34,71,92,105,130,136],"dividing":[5],"a":[6,90,144,162],"set":[7],"m":[9,112],"points":[10],"in":[11,44,54,85,157,168],"Euclidean":[12],"n-space":[13],"into":[14],"k":[15,22,61],"clusters":[16],"(m,":[17],"n":[18],"are":[19],"variable":[20],"while":[21],"is":[23,83,114,166],"fixed),":[24],"so":[25,101],"as":[26,74],"to":[27,37,108,142],"minimize":[28],"sum":[30,70,104],"distances":[32,73,106],"squared":[33,72,107],"each":[35],"point":[36],"its":[38,169],"\"cluster":[39],"center\".":[40],"This":[41],"formulation":[42],"differs":[43],"two":[45],"ways":[46],"from":[47],"most":[49],"frequently":[50],"considered":[51],"clustering":[52,164],"problems":[53],"literature,":[56],"namely,":[57],"here":[58],"we":[59,67,77,154],"have":[60],"fixed":[62],"and":[63,66],"m;n":[64],"variable,":[65],"use":[68],"our":[75,81],"measure;":[76],"will":[78],"argue":[79,155],"that":[80,102,156],"natural":[84],"many":[86],"contexts.":[87],"relaxation":[91,120,138,160],"discrete":[94],"problem:":[95],"find":[96],"k-dimensional":[98],"subspace":[99],"V":[100,109],"(of":[110],"points)":[113],"minimized.":[115],"show:":[117],"(i)":[118],"The":[119,134],"can":[121,139],"be":[122,140],"solved":[123],"by":[124],"Singular":[126],"Value":[127],"Decomposition":[128],"(SVD)":[129],"Linear":[131],"Algebra.":[132],"(ii)":[133],"solution":[135],"used":[141],"get":[143],"2-approximation":[145],"algorithm":[146],"for":[147],"original":[149],"problem.":[150],"More":[151],"importantly,":[152],"(iii)":[153],"fact":[158],"provides":[161],"generalized":[163],"which":[165],"useful":[167],"own":[170],"right....":[171]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":8},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":4},{"year":2015,"cited_by_count":6},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":5}],"updated_date":"2026-10-16T09:59:22.235173","created_date":"2016-06-24T00:00:00"}