{"id":"https://openalex.org/W2105630880","doi":"https://doi.org/10.1142/s0218195904001378","title":"EFFICIENT APPROXIMATION ALGORITHMS FOR PAIRWISE DATA CLUSTERING AND APPLICATIONS","display_name":"EFFICIENT APPROXIMATION ALGORITHMS FOR PAIRWISE DATA CLUSTERING AND APPLICATIONS","publication_year":2004,"publication_date":"2004-04-01","ids":{"openalex":"https://openalex.org/W2105630880","doi":"https://doi.org/10.1142/s0218195904001378","mag":"2105630880"},"language":"en","primary_location":{"id":"doi:10.1142/s0218195904001378","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0218195904001378","pdf_url":null,"source":{"id":"https://openalex.org/S25827807","display_name":"International Journal of Computational Geometry & Applications","issn_l":"0218-1959","issn":["0218-1959","1793-6357"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computational Geometry & Applications","raw_type":"journal-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/A5101702311","display_name":"Xiaodong Wu","orcid":"https://orcid.org/0000-0003-1696-670X"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"XIAODONG WU","raw_affiliation_strings":["Department of Computer Science,  University of Texas \u2013 Pan American, Edinburg, TX 78539, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science,  University of Texas \u2013 Pan American, Edinburg, TX 78539, USA","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5060901632","display_name":"Danny Z. Chen","orcid":"https://orcid.org/0000-0001-6565-2884"},"institutions":[{"id":"https://openalex.org/I107639228","display_name":"University of Notre Dame","ror":"https://ror.org/00mkhxb43","country_code":"US","type":"education","lineage":["https://openalex.org/I107639228"]},{"id":"https://openalex.org/I1311060795","display_name":"U.S. National Science Foundation","ror":"https://ror.org/021nxhr62","country_code":"US","type":"government","lineage":["https://openalex.org/I1311060795"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"DANNY Z. CHEN","raw_affiliation_strings":["Department of Computer Science and Engineering,  University of Notre Dame, Notre Dame, IN 46556, USA","The work of this author was supported in part by the National  Science Foundation under Grants CCR-9623585 and CCR-9988468","Department of Computer Science and Engineering, University of Notre Dame, Notre Dame, IN 46556, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering,  University of Notre Dame, Notre Dame, IN 46556, USA","institution_ids":["https://openalex.org/I107639228"]},{"raw_affiliation_string":"The work of this author was supported in part by the National  Science Foundation under Grants CCR-9623585 and CCR-9988468","institution_ids":["https://openalex.org/I1311060795"]},{"raw_affiliation_string":"Department of Computer Science and Engineering, University of Notre Dame, Notre Dame, IN 46556, USA","institution_ids":["https://openalex.org/I107639228"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5111868033","display_name":"James J. Mason","orcid":null},"institutions":[{"id":"https://openalex.org/I107639228","display_name":"University of Notre Dame","ror":"https://ror.org/00mkhxb43","country_code":"US","type":"education","lineage":["https://openalex.org/I107639228"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"JAMES J. MASON","raw_affiliation_strings":["Department of Aerospace and Mechanical Engineering,  University of Notre Dame, Notre Dame, IN 46556, USA","Department of Aerospace and Mechanical Engineering, University of Notre Dame, Notre Dame, IN 46556, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Aerospace and Mechanical Engineering,  University of Notre Dame, Notre Dame, IN 46556, USA","institution_ids":["https://openalex.org/I107639228"]},{"raw_affiliation_string":"Department of Aerospace and Mechanical Engineering, University of Notre Dame, Notre Dame, IN 46556, USA","institution_ids":["https://openalex.org/I107639228"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5113058780","display_name":"Steven R. Schmid","orcid":null},"institutions":[{"id":"https://openalex.org/I107639228","display_name":"University of Notre Dame","ror":"https://ror.org/00mkhxb43","country_code":"US","type":"education","lineage":["https://openalex.org/I107639228"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"STEVEN R. SCHMID","raw_affiliation_strings":["Department of Aerospace and Mechanical Engineering,  University of Notre Dame, Notre Dame, IN 46556, USA","Department of Aerospace and Mechanical Engineering, University of Notre Dame, Notre Dame, IN 46556, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Aerospace and Mechanical Engineering,  University of Notre Dame, Notre Dame, IN 46556, USA","institution_ids":["https://openalex.org/I107639228"]},{"raw_affiliation_string":"Department of Aerospace and Mechanical Engineering, University of Notre Dame, Notre Dame, IN 46556, USA","institution_ids":["https://openalex.org/I107639228"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5101702311"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.17151022,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"14","issue":"01n02","first_page":"85","last_page":"104"},"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.9908999800682068,"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.9908999800682068,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9787999987602234,"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/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9696999788284302,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.7317422032356262},{"id":"https://openalex.org/keywords/triangle-inequality","display_name":"Triangle inequality","score":0.720386266708374},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.681063175201416},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.6208539605140686},{"id":"https://openalex.org/keywords/pairwise-comparison","display_name":"Pairwise comparison","score":0.6195292472839355},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5601487755775452},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5409918427467346},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5022625923156738},{"id":"https://openalex.org/keywords/graph-partition","display_name":"Graph partition","score":0.47153669595718384},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.4449114501476288},{"id":"https://openalex.org/keywords/maximum-cut","display_name":"Maximum cut","score":0.4407275915145874},{"id":"https://openalex.org/keywords/polynomial-time-approximation-scheme","display_name":"Polynomial-time approximation scheme","score":0.41158682107925415},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3879239857196808},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.38485369086265564},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3469316363334656}],"concepts":[{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.7317422032356262},{"id":"https://openalex.org/C182964748","wikidata":"https://www.wikidata.org/wiki/Q208216","display_name":"Triangle inequality","level":2,"score":0.720386266708374},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.681063175201416},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.6208539605140686},{"id":"https://openalex.org/C184898388","wikidata":"https://www.wikidata.org/wiki/Q1435712","display_name":"Pairwise comparison","level":2,"score":0.6195292472839355},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5601487755775452},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5409918427467346},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5022625923156738},{"id":"https://openalex.org/C48903430","wikidata":"https://www.wikidata.org/wiki/Q491370","display_name":"Graph partition","level":3,"score":0.47153669595718384},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.4449114501476288},{"id":"https://openalex.org/C165526019","wikidata":"https://www.wikidata.org/wiki/Q942557","display_name":"Maximum cut","level":3,"score":0.4407275915145874},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.41158682107925415},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3879239857196808},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38485369086265564},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3469316363334656},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0218195904001378","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0218195904001378","pdf_url":null,"source":{"id":"https://openalex.org/S25827807","display_name":"International Journal of Computational Geometry & Applications","issn_l":"0218-1959","issn":["0218-1959","1793-6357"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computational Geometry & Applications","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W330591652","https://openalex.org/W1977360022","https://openalex.org/W2035652501","https://openalex.org/W2044343300","https://openalex.org/W2077990749","https://openalex.org/W2115996640","https://openalex.org/W2121947440","https://openalex.org/W2150148016","https://openalex.org/W2946046356","https://openalex.org/W4242767541","https://openalex.org/W4292478130"],"related_works":["https://openalex.org/W1815446007","https://openalex.org/W1829077348","https://openalex.org/W2149302127","https://openalex.org/W2783992526","https://openalex.org/W2799046353","https://openalex.org/W2035448415","https://openalex.org/W1850573590","https://openalex.org/W1481223916","https://openalex.org/W2025698306","https://openalex.org/W2561136735"],"abstract_inverted_index":{"Data":[0],"clustering":[1,28,66,94],"is":[2,15,29,111,140],"an":[3,117],"important":[4],"theoretical":[5],"topic":[6],"and":[7,186,203],"a":[8,16,32,81,97,126,155,172,198],"sharp":[9],"tool":[10],"for":[11,133,149,159,179],"various":[12],"applications.":[13],"It":[14],"task":[17],"frequently":[18],"arising":[19],"in":[20,184],"geometric":[21],"computing.":[22],"The":[23,101],"main":[24],"objective":[25],"of":[26,121,206],"data":[27,34,41,65,93],"to":[30,50,55,113],"partition":[31,99,103],"given":[33],"set":[35],"into":[36],"clusters":[37],"such":[38],"that":[39,72],"the":[40,44,63,76,84,90,108,134,141,150,164,181,191],"items":[42],"within":[43],"same":[45],"cluster":[46],"are":[47,212],"\"more\"":[48],"similar":[49],"each":[51],"other":[52],"with":[53,68],"respect":[54],"certain":[56],"measures.":[57],"In":[58,128,174],"this":[59,139,160],"paper,":[60],"we":[61,88,124],"study":[62],"pairwise":[64,69,92],"problem":[67,95,104,161],"similarity/dissimilarity":[70],"measures":[71],"need":[73],"not":[74],"satisfy":[75],"triangle":[77],"inequality.":[78],"By":[79],"using":[80],"criterion,":[82],"called":[83],"minimum":[85,135],"normalized":[86,109,136,209],"cut,":[87],"model":[89],"general":[91],"as":[96],"graph":[98,102,120],"problem.":[100,151],"based":[105],"on":[106],"minimizing":[107],"cut":[110,137,210],"known":[112,194],"be":[114],"NP-hard.":[115],"For":[116],"undirected":[118,188],"weighted":[119],"n":[122],"vertices,":[123],"present":[125],"((4+o(1))":[127],"n)-approximation":[129,175],"polynomial":[130,146,176],"time":[131,147,177],"algorithm":[132,148,158,178],"problem;":[138],"first":[142],"provably":[143],"good":[144],"approximation":[145,165,195,208],"We":[152],"also":[153,213],"give":[154],"more":[156],"efficient":[157],"by":[162,197],"sacrificing":[163],"ratio":[166,196],"slightly.":[167],"Further,":[168],"our":[169,207],"scheme":[170],"achieves":[171],"((2+o(1))":[173],"computing":[180],"sparsest":[182],"cuts":[183],"edge-weighted":[185],"vertex-weighted":[187],"graphs,":[189],"improving":[190],"previously":[192],"best":[193],"constant":[199],"factor.":[200],"Some":[201],"applications":[202],"implementation":[204],"work":[205],"algorithms":[211],"discussed.":[214]},"counts_by_year":[{"year":2022,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}