{"id":"https://openalex.org/W2080068757","doi":"https://doi.org/10.1145/258533.258657","title":"Incremental clustering and dynamic information retrieval","display_name":"Incremental clustering and dynamic information retrieval","publication_year":1997,"publication_date":"1997-01-01","ids":{"openalex":"https://openalex.org/W2080068757","doi":"https://doi.org/10.1145/258533.258657","mag":"2080068757"},"language":"en","primary_location":{"id":"doi:10.1145/258533.258657","doi":"https://doi.org/10.1145/258533.258657","is_oa":true,"landing_page_url":"https://doi.org/10.1145/258533.258657","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/258533.258657","source":{"id":"https://openalex.org/S7407087723","display_name":"ACM Symposium on Theory of Computing (STOC)","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":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the twenty-ninth annual ACM symposium on Theory of computing - STOC '97","raw_type":"proceedings-article"},"volume":null,"type":"conference-paper","is_traditional":true,"indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://dl.acm.org/doi/pdf/10.1145/258533.258657","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5071016611","display_name":"Moses Charikar","orcid":"https://orcid.org/0000-0003-0807-3389","observed_orcids":["https://orcid.org/0000-0003-0807-3389"]},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Moses Charikar","raw_affiliation_strings":["Department of Computer Science, Stanford University, Stanford, CA","Department of Computer Science, Stanford University Stanford, CA#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Stanford University, Stanford, CA","institution_ids":["https://openalex.org/I97018004"]},{"raw_affiliation_string":"Department of Computer Science, Stanford University Stanford, CA#TAB#","institution_ids":["https://openalex.org/I97018004"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5036503505","display_name":"Chandra Chekuri","orcid":"https://orcid.org/0000-0003-3035-1699","observed_orcids":["https://orcid.org/0000-0003-3035-1699"]},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Chandra Chekuri","raw_affiliation_strings":["Department of Computer Science, Stanford University, Stanford, CA","Department of Computer Science, Stanford University Stanford, CA#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Stanford University, Stanford, CA","institution_ids":["https://openalex.org/I97018004"]},{"raw_affiliation_string":"Department of Computer Science, Stanford University Stanford, CA#TAB#","institution_ids":["https://openalex.org/I97018004"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5109192583","display_name":"Tom\u00e1s Feder","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Tom\u00e1s Feder","raw_affiliation_strings":["Department of Computer Science, Stanford University, Stanford, CA","Department of Computer Science, Stanford University Stanford, CA#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Stanford University, Stanford, CA","institution_ids":["https://openalex.org/I97018004"]},{"raw_affiliation_string":"Department of Computer Science, Stanford University Stanford, CA#TAB#","institution_ids":["https://openalex.org/I97018004"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5112649653","display_name":"Rajeev Motwani","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Rajeev Motwani","raw_affiliation_strings":["Department of Computer Science, Stanford University, Stanford, CA","Department of Computer Science, Stanford University Stanford, CA#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Stanford University, Stanford, CA","institution_ids":["https://openalex.org/I97018004"]},{"raw_affiliation_string":"Department of Computer Science, Stanford University Stanford, CA#TAB#","institution_ids":["https://openalex.org/I97018004"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I97018004"],"apc_list":null,"apc_paid":null,"fwci":7.1154,"has_fulltext":true,"cited_by_count":361,"citation_normalized_percentile":{"value":0.97556886,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":92,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"626","last_page":"635"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10637","display_name":"Advanced Clustering Algorithms Research","score":0.9413999915122986,"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.9413999915122986,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.029100000858306885,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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.007499999832361937,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/incremental-clustering","display_name":"incremental clustering","score":1.0},{"id":"https://openalex.org/keywords/metric-spaces","display_name":"metric spaces","score":0.796999990940094},{"id":"https://openalex.org/keywords/information-retrieval","display_name":"information retrieval","score":0.6389999985694885},{"id":"https://openalex.org/keywords/document-classification","display_name":"document classification","score":0.734000027179718},{"id":"https://openalex.org/keywords/image-classification","display_name":"image classification","score":0.9890000224113464},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"greedy algorithm","score":0.628000020980835},{"id":"https://openalex.org/keywords/randomized-algorithms","display_name":"randomized algorithms","score":0.9139999747276306},{"id":"https://openalex.org/keywords/deterministic-algorithms","display_name":"deterministic algorithms","score":0.8579999804496765},{"id":"https://openalex.org/keywords/performance-lower-bound","display_name":"performance lower bound","score":0.718999981880188},{"id":"https://openalex.org/keywords/cluster-maintenance","display_name":"cluster maintenance","score":0.5109999775886536}],"concepts":[{"id":"https://openalex.org/C2778805511","wikidata":"https://www.wikidata.org/wiki/Q1713","display_name":"Citation","level":2,"score":0.6722682118415833},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.639782190322876},{"id":"https://openalex.org/C161191863","wikidata":"https://www.wikidata.org/wiki/Q199655","display_name":"Library science","level":1,"score":0.5163039565086365},{"id":"https://openalex.org/C2776244770","wikidata":"https://www.wikidata.org/wiki/Q253590","display_name":"Ninth","level":2,"score":0.4895547330379486},{"id":"https://openalex.org/C95831776","wikidata":"https://www.wikidata.org/wiki/Q16387","display_name":"Information science","level":2,"score":0.4526788890361786},{"id":"https://openalex.org/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/258533.258657","doi":"https://doi.org/10.1145/258533.258657","is_oa":true,"landing_page_url":"https://doi.org/10.1145/258533.258657","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/258533.258657","source":{"id":"https://openalex.org/S7407087723","display_name":"ACM Symposium on Theory of Computing (STOC)","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":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the twenty-ninth annual ACM symposium on Theory of computing - STOC '97","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/258533.258657","doi":"https://doi.org/10.1145/258533.258657","is_oa":true,"landing_page_url":"https://doi.org/10.1145/258533.258657","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/258533.258657","source":{"id":"https://openalex.org/S7407087723","display_name":"ACM Symposium on Theory of Computing (STOC)","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":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the twenty-ninth annual ACM symposium on Theory of computing - STOC '97","raw_type":"proceedings-article"},"sustainable_development_goals":[],"study_designs":[],"awards":[{"id":"https://openalex.org/G8081833360","display_name":"NYI:  The Complexity of Probablistic Algorithms","funder_award_id":"9357849","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320307065","display_name":"Schlumberger Foundation","ror":"https://ror.org/03daw3m97"},{"id":"https://openalex.org/F4320333591","display_name":"Multidisciplinary University Research Initiative","ror":null},{"id":"https://openalex.org/F4320338281","display_name":"Army Research Office","ror":"https://ror.org/05epdh915"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2080068757.pdf","grobid_xml":"https://content.openalex.org/works/W2080068757.grobid-xml"},"referenced_works_count":47,"referenced_works":["https://openalex.org/W64690233","https://openalex.org/W230344389","https://openalex.org/W575347202","https://openalex.org/W1524103363","https://openalex.org/W1527583442","https://openalex.org/W1531908439","https://openalex.org/W1570542661","https://openalex.org/W1868287705","https://openalex.org/W1956559956","https://openalex.org/W1964200124","https://openalex.org/W1968447145","https://openalex.org/W1971784203","https://openalex.org/W1973264045","https://openalex.org/W1984953641","https://openalex.org/W1988401413","https://openalex.org/W1996764654","https://openalex.org/W1997841190","https://openalex.org/W2006636107","https://openalex.org/W2008375984","https://openalex.org/W2011039300","https://openalex.org/W2013451793","https://openalex.org/W2041565863","https://openalex.org/W2044028871","https://openalex.org/W2044718761","https://openalex.org/W2073583237","https://openalex.org/W2100961486","https://openalex.org/W2106231890","https://openalex.org/W2108602505","https://openalex.org/W2122146382","https://openalex.org/W2133311553","https://openalex.org/W2133962824","https://openalex.org/W2145036943","https://openalex.org/W2160484851","https://openalex.org/W2612166593","https://openalex.org/W2889395214","https://openalex.org/W2911330481","https://openalex.org/W2912202394","https://openalex.org/W2913066018","https://openalex.org/W2914866334","https://openalex.org/W2939083804","https://openalex.org/W3017143921","https://openalex.org/W4241122026","https://openalex.org/W4252521233","https://openalex.org/W4285719527","https://openalex.org/W4405107181","https://openalex.org/W6606335672","https://openalex.org/W6842351706"],"related_works":["https://openalex.org/W2006636107","https://openalex.org/W2108602505","https://openalex.org/W2111843750","https://openalex.org/W2249049444","https://openalex.org/W7100567661","https://openalex.org/W7095110335","https://openalex.org/W2390205849","https://openalex.org/W2058862427","https://openalex.org/W3142354955","https://openalex.org/W4285219948"],"abstract_inverted_index":{"Motivated":[0],"by":[1],"applications":[2],"such":[3],"as":[4,63],"document":[5],"and":[6,45,73,82,119],"image":[7],"classification":[8],"in":[9,21,51],"information":[10,42],"retrieval,":[11],"we":[12,106],"consider":[13,107],"the":[14,38,41,101,113,120,125],"problem":[15,111],"of":[16,37,40,60,103,116,127],"clustering":[17,29,85,110],"dynamic":[18],"point":[19],"sets":[20],"a":[22,26,34,89],"metric":[23],"space.We":[24],"propose":[25,79],"model-c~led":[27],"incremental":[28,84,104],"which":[30,46,87],"is":[31,55,122],"based":[32],"on":[33,100],"careful":[35],"analysis":[36],"requirements":[39],"retrieval":[43],"application,":[44],"should":[47],"also":[48],"be":[49],"useful":[50],"other":[52],"applications.The":[53],"goal":[54,121],"to":[56,123],"efficiently":[57],"maintain":[58],"clusters":[59,114],"small":[61],"diameter":[62],"new":[64,80],"points":[65],"are":[66,115],"inserted.We":[67],"analyze":[68],"several":[69],"natural":[70],"greedy":[71],"algorithms":[72,86],"demonstrate":[74],"that":[75],"they":[76],"perform":[77],"poorly.We":[78],"deterministic":[81],"randomized":[83],"have":[88],"provably":[90],"good":[91],"performance.We":[92],"complement":[93],"our":[94],"positive":[95],"results":[96],"with":[97],"lower":[98],"bounds":[99],"performance":[102],"algorithms.Finally,":[105],"tbe":[108],"dual":[109],"where":[112],"fixed":[117],"diameter,":[118],"minimize":[124],"number":[126],"clusters.":[128]},"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":6},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":8},{"year":2019,"cited_by_count":7},{"year":2018,"cited_by_count":14},{"year":2017,"cited_by_count":12},{"year":2016,"cited_by_count":10},{"year":2015,"cited_by_count":18},{"year":2014,"cited_by_count":14},{"year":2013,"cited_by_count":23},{"year":2012,"cited_by_count":12}],"updated_date":"2026-11-12T12:28:57.059296","created_date":"2016-06-24T00:00:00"}