{"id":"https://openalex.org/W2563617393","doi":"https://doi.org/10.1145/3011077.3011114","title":"Local search approach for the pairwise constrained clustering problem","display_name":"Local search approach for the pairwise constrained clustering problem","publication_year":2016,"publication_date":"2016-12-08","ids":{"openalex":"https://openalex.org/W2563617393","doi":"https://doi.org/10.1145/3011077.3011114","mag":"2563617393"},"language":"en","primary_location":{"id":"doi:10.1145/3011077.3011114","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3011077.3011114","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Seventh Symposium on Information and Communication Technology","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/A5046486560","display_name":"Tran Khanh Hiep","orcid":null},"institutions":[{"id":"https://openalex.org/I109689652","display_name":"FPT University","ror":"https://ror.org/03esj4g97","country_code":"VN","type":"education","lineage":["https://openalex.org/I109689652"]}],"countries":["VN"],"is_corresponding":false,"raw_author_name":"Tran Khanh Hiep","raw_affiliation_strings":["FPT University, Hanoi, Vietnam"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"FPT University, Hanoi, Vietnam","institution_ids":["https://openalex.org/I109689652"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Nguyen Minh Duc","orcid":null},"institutions":[{"id":"https://openalex.org/I109689652","display_name":"FPT University","ror":"https://ror.org/03esj4g97","country_code":"VN","type":"education","lineage":["https://openalex.org/I109689652"]}],"countries":["VN"],"is_corresponding":false,"raw_author_name":"Nguyen Minh Duc","raw_affiliation_strings":["FPT University, Hanoi, Vietnam"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"FPT University, Hanoi, Vietnam","institution_ids":["https://openalex.org/I109689652"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5024349250","display_name":"Bui Quoc Trung","orcid":"https://orcid.org/0000-0002-9349-3099"},"institutions":[{"id":"https://openalex.org/I109689652","display_name":"FPT University","ror":"https://ror.org/03esj4g97","country_code":"VN","type":"education","lineage":["https://openalex.org/I109689652"]}],"countries":["VN"],"is_corresponding":false,"raw_author_name":"Bui Quoc Trung","raw_affiliation_strings":["FPT Technology Research Institute, Hanoi, Vietnam"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"FPT Technology Research Institute, Hanoi, Vietnam","institution_ids":["https://openalex.org/I109689652"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I109689652"],"apc_list":null,"apc_paid":null,"fwci":1.7324,"has_fulltext":false,"cited_by_count":15,"citation_normalized_percentile":{"value":0.89615268,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"115","last_page":"122"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10637","display_name":"Advanced Clustering Algorithms Research","score":0.9951000213623047,"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.9951000213623047,"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/T11106","display_name":"Data Management and Algorithms","score":0.9932000041007996,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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.9837999939918518,"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/cluster-analysis","display_name":"Cluster analysis","score":0.8091543316841125},{"id":"https://openalex.org/keywords/pairwise-comparison","display_name":"Pairwise comparison","score":0.7127514481544495},{"id":"https://openalex.org/keywords/constrained-clustering","display_name":"Constrained clustering","score":0.6451506614685059},{"id":"https://openalex.org/keywords/tabu-search","display_name":"Tabu search","score":0.584492564201355},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5831080675125122},{"id":"https://openalex.org/keywords/correlation-clustering","display_name":"Correlation clustering","score":0.4764147996902466},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.46163201332092285},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.44101816415786743},{"id":"https://openalex.org/keywords/cure-data-clustering-algorithm","display_name":"CURE data clustering algorithm","score":0.37253886461257935},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.3614818751811981},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.33395618200302124},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.32353872060775757},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3216526508331299},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.30821239948272705}],"concepts":[{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.8091543316841125},{"id":"https://openalex.org/C184898388","wikidata":"https://www.wikidata.org/wiki/Q1435712","display_name":"Pairwise comparison","level":2,"score":0.7127514481544495},{"id":"https://openalex.org/C27964816","wikidata":"https://www.wikidata.org/wiki/Q5164359","display_name":"Constrained clustering","level":5,"score":0.6451506614685059},{"id":"https://openalex.org/C123370116","wikidata":"https://www.wikidata.org/wiki/Q1424540","display_name":"Tabu search","level":2,"score":0.584492564201355},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5831080675125122},{"id":"https://openalex.org/C94641424","wikidata":"https://www.wikidata.org/wiki/Q5172845","display_name":"Correlation clustering","level":3,"score":0.4764147996902466},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.46163201332092285},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.44101816415786743},{"id":"https://openalex.org/C33704608","wikidata":"https://www.wikidata.org/wiki/Q5014717","display_name":"CURE data clustering algorithm","level":4,"score":0.37253886461257935},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.3614818751811981},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33395618200302124},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.32353872060775757},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3216526508331299},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.30821239948272705},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3011077.3011114","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3011077.3011114","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Seventh Symposium on Information and Communication Technology","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W2283060","https://openalex.org/W1558962159","https://openalex.org/W1580837119","https://openalex.org/W1591532012","https://openalex.org/W1596382552","https://openalex.org/W1636513602","https://openalex.org/W1981097545","https://openalex.org/W1981276685","https://openalex.org/W1986975536","https://openalex.org/W2025399946","https://openalex.org/W2038777942","https://openalex.org/W2073308541","https://openalex.org/W2089040534","https://openalex.org/W2093938881","https://openalex.org/W2096100960","https://openalex.org/W2107631366","https://openalex.org/W2126782412","https://openalex.org/W2127218421","https://openalex.org/W2134089414","https://openalex.org/W2139956879","https://openalex.org/W2140190241","https://openalex.org/W2148687775","https://openalex.org/W2153839362","https://openalex.org/W2159583439","https://openalex.org/W2299467264","https://openalex.org/W3120740533","https://openalex.org/W4234536190"],"related_works":["https://openalex.org/W3146523624","https://openalex.org/W2160785859","https://openalex.org/W1525022337","https://openalex.org/W2188840951","https://openalex.org/W2171583777","https://openalex.org/W2186905933","https://openalex.org/W2969974905","https://openalex.org/W2040929534","https://openalex.org/W3011266291","https://openalex.org/W2555816786"],"abstract_inverted_index":{"The":[0,123],"pairwise":[1,103],"constrained":[2,104],"clustering":[3,51,90,105],"is":[4,66],"the":[5,29,88,102],"problem":[6,41,91],"of":[7,11,24],"partitioning":[8],"a":[9,49,57,67,79],"set":[10],"data":[12],"points":[13,25],"into":[14,45],"clusters":[15],"when":[16],"we":[17],"know":[18],"in":[19,28,78,92,133],"advance":[20],"that":[21,127],"some":[22,33,136],"pairs":[23,34],"should":[26,35],"be":[27,43],"same":[30],"cluster":[31],"and":[32,143],"not.":[36],"Previous":[37],"studies":[38],"on":[39,120],"this":[40,108,115],"can":[42],"divided":[44],"three":[46],"categories:":[47],"modifying":[48],"traditional":[50,89],"algorithm":[52],"to":[53,87],"incorporate":[54],"constraints,":[55],"learning":[56],"distance":[58],"measure":[59],"or":[60],"combining":[61],"both":[62],"approaches.":[63],"Local":[64],"search":[65,112],"heuristic":[68],"method":[69],"for":[70,74,101,114],"finding":[71],"high-quality":[72],"solutions":[73],"hard":[75],"optimization":[76],"problems":[77],"reasonable":[80],"computation":[81],"time.":[82],"It":[83],"has":[84,97],"been":[85,99],"applied":[86],"many":[93],"studies.":[94],"However,":[95],"it":[96],"never":[98],"used":[100],"problem.":[106],"Therefore,":[107],"paper":[109],"proposes":[110],"Tabu":[111],"algorithms":[113,129],"problem,":[116],"which":[117],"were":[118],"tested":[119],"several":[121],"datasets.":[122],"experimental":[124],"results":[125],"show":[126],"these":[128],"are":[130],"very":[131],"interesting":[132],"comparison":[134],"with":[135],"state-of-the-art":[137],"algorithms,":[138],"COP":[139],"K-means,":[140],"MPC":[141],"K-means":[142],"LCVQE.":[144]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}