{"id":"https://openalex.org/W2143654071","doi":"https://doi.org/10.1109/sfcs.2003.1238225","title":"Clustering with qualitative information","display_name":"Clustering with qualitative information","publication_year":2004,"publication_date":"2004-03-02","ids":{"openalex":"https://openalex.org/W2143654071","doi":"https://doi.org/10.1109/sfcs.2003.1238225","mag":"2143654071"},"language":"en","primary_location":{"id":"doi:10.1109/sfcs.2003.1238225","is_oa":false,"landing_page_url":"https://doi.org/10.1109/sfcs.2003.1238225","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings.","raw_type":"proceedings-article"},"type":"article","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":"https://openalex.org/A5071016611","display_name":"Moses Charikar","orcid":"https://orcid.org/0000-0003-0807-3389"},"institutions":[{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"M. Charikar","raw_affiliation_strings":["Princeton University, USA","Princeton Univ, NJ, USA"],"affiliations":[{"raw_affiliation_string":"Princeton University, USA","institution_ids":["https://openalex.org/I20089843"]},{"raw_affiliation_string":"Princeton Univ, NJ, USA","institution_ids":["https://openalex.org/I20089843"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5068388812","display_name":"Venkatesan Guruswami","orcid":"https://orcid.org/0000-0001-7926-3396"},"institutions":[{"id":"https://openalex.org/I201448701","display_name":"University of Washington","ror":"https://ror.org/00cvxb145","country_code":"US","type":"education","lineage":["https://openalex.org/I201448701"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"V. Guruswami","raw_affiliation_strings":["University of Washington, USA","University of Washington"],"affiliations":[{"raw_affiliation_string":"University of Washington, USA","institution_ids":["https://openalex.org/I201448701"]},{"raw_affiliation_string":"University of Washington","institution_ids":["https://openalex.org/I201448701"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5087794199","display_name":"Anthony Wirth","orcid":"https://orcid.org/0000-0003-3746-6704"},"institutions":[{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"A. Wirth","raw_affiliation_strings":["Princeton University, USA","Princeton University#TAB#"],"affiliations":[{"raw_affiliation_string":"Princeton University, USA","institution_ids":["https://openalex.org/I20089843"]},{"raw_affiliation_string":"Princeton University#TAB#","institution_ids":["https://openalex.org/I20089843"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5071016611"],"corresponding_institution_ids":["https://openalex.org/I20089843"],"apc_list":null,"apc_paid":null,"fwci":11.3989,"has_fulltext":false,"cited_by_count":133,"citation_normalized_percentile":{"value":0.98917318,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":91,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"524","last_page":"533"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9979000091552734,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9979000091552734,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9927999973297119,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9902999997138977,"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/combinatorics","display_name":"Combinatorics","score":0.7713577747344971},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6261922121047974},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.5821236371994019},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.5131381154060364},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.49810123443603516},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4955192804336548},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.492995947599411},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4907906949520111},{"id":"https://openalex.org/keywords/pairwise-comparison","display_name":"Pairwise comparison","score":0.4693656265735626},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.2938240170478821},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.12911227345466614},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.08161929249763489}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7713577747344971},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6261922121047974},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.5821236371994019},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.5131381154060364},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.49810123443603516},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4955192804336548},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.492995947599411},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4907906949520111},{"id":"https://openalex.org/C184898388","wikidata":"https://www.wikidata.org/wiki/Q1435712","display_name":"Pairwise comparison","level":2,"score":0.4693656265735626},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.2938240170478821},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.12911227345466614},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.08161929249763489}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/sfcs.2003.1238225","is_oa":false,"landing_page_url":"https://doi.org/10.1109/sfcs.2003.1238225","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings.","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.631.3417","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.631.3417","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://i11www.iti.uni-karlsruhe.de/_media/teaching/winter2006/graphclustering/cgw-cqi-05.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.90.3645","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.90.3645","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.mu.oz.au/~awirth/pubs/awirthFocs03.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W1483204526","https://openalex.org/W1511938660","https://openalex.org/W1601412462","https://openalex.org/W1601503375","https://openalex.org/W1981960292","https://openalex.org/W1982381767","https://openalex.org/W1999032440","https://openalex.org/W2017732166","https://openalex.org/W2018025029","https://openalex.org/W2019062750","https://openalex.org/W2039104371","https://openalex.org/W2044343300","https://openalex.org/W2072261513","https://openalex.org/W2107223449","https://openalex.org/W2120358419","https://openalex.org/W2152729085","https://openalex.org/W2157016223","https://openalex.org/W2295665070","https://openalex.org/W2611831635","https://openalex.org/W2806518615","https://openalex.org/W3009415557","https://openalex.org/W4213009134","https://openalex.org/W4242357733","https://openalex.org/W4285719527","https://openalex.org/W4289255343","https://openalex.org/W6628851909","https://openalex.org/W6630432195","https://openalex.org/W6635765164"],"related_works":["https://openalex.org/W2487162673","https://openalex.org/W2793211469","https://openalex.org/W2949152769","https://openalex.org/W4372354731","https://openalex.org/W2807634898","https://openalex.org/W1692008701","https://openalex.org/W2942366970","https://openalex.org/W2597588799","https://openalex.org/W2023397165","https://openalex.org/W4297648919"],"abstract_inverted_index":{"We":[0,86,108,163],"consider":[1],"the":[2,24,41,47,58,68,129,166],"problem":[3,25],"of":[4,8,14,49,103,168],"clustering":[5,104],"a":[6,28,100,110,120,132,147,156],"collection":[7],"elements":[9],"based":[10],"on":[11,116,170],"pairwise":[12],"judgments":[13],"similarity":[15],"and":[16,73,98,119],"dissimilarity.":[17],"N.":[18,93,140],"Bansal":[19,94,141],"et":[20,95,142],"al.":[21,96,143],"(2002)":[22,97],"cast":[23],"thus:":[26],"given":[27],"graph":[29],"G":[30],"whose":[31],"edges":[32,78],"are":[33,79,82],"labeled":[34],"\"+\"":[35],"(similar)":[36],"or":[37],"\"-\"":[38],"(dissimilar),":[39],"partition":[40],"vertices":[42],"into":[43],"clusters":[44],"so":[45],"that":[46,155],"number":[48],"pairs":[50],"correctly":[51],"(resp.":[52,63],"incorrectly)":[53],"classified":[54],"with":[55,105],"respect":[56],"to":[57],"input":[59],"labeling":[60],"is":[61,137,158],"maximized":[62],"minimized).":[64],"Complete":[65],"graphs,":[66,75,118,153],"where":[67,76],"classifier":[69],"labels":[70],"every":[71],"edge,":[72],"general":[74,126,152],"some":[77],"not":[80],"labeled,":[81],"both":[83],"worth":[84],"studying.":[85],"answer":[87],"several":[88],"questions":[89],"left":[90],"open":[91],"by":[92,139,160],"provide":[99],"sound":[101],"overview":[102],"qualitative":[106],"information.":[107],"give":[109,146],"factor":[111,121,148],"4":[112],"approximation":[113,124,150],"for":[114,125,134,151],"minimization":[115,169],"complete":[117,135,171],"O(log":[122],"n)":[123],"graphs.":[127,172],"For":[128],"maximization":[130],"version,":[131],"PTAS":[133,157],"graphs":[136],"shown":[138],"(2002);":[144],"we":[145],"0.7664":[149],"noting":[154],"unlikely":[159],"proving":[161],"APX-hardness.":[162],"also":[164],"prove":[165],"APX-hardness":[167]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":8},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":7},{"year":2016,"cited_by_count":9},{"year":2015,"cited_by_count":12},{"year":2014,"cited_by_count":7},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":5}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}