{"id":"https://openalex.org/W7137802037","doi":"https://doi.org/10.1609/aaai.v40i17.38427","title":"Learning with Structure: Computing Consistent Subsets on Structurally-Regular Graphs","display_name":"Learning with Structure: Computing Consistent Subsets on Structurally-Regular Graphs","publication_year":2026,"publication_date":"2026-03-14","ids":{"openalex":"https://openalex.org/W7137802037","doi":"https://doi.org/10.1609/aaai.v40i17.38427"},"language":null,"primary_location":{"id":"doi:10.1609/aaai.v40i17.38427","is_oa":true,"landing_page_url":"https://doi.org/10.1609/aaai.v40i17.38427","pdf_url":null,"source":{"id":"https://openalex.org/S4210191458","display_name":"Proceedings of the AAAI Conference on Artificial Intelligence","issn_l":"2159-5399","issn":["2159-5399","2374-3468"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320058","host_organization_name":"Association for the Advancement of Artificial Intelligence","host_organization_lineage":["https://openalex.org/P4310320058"],"host_organization_lineage_names":["Association for the Advancement of Artificial Intelligence"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the AAAI Conference on Artificial Intelligence","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://doi.org/10.1609/aaai.v40i17.38427","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5000126726","display_name":"Aritra Banik","orcid":"https://orcid.org/0000-0002-7544-6125"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Aritra Banik","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5120841711","display_name":"Mano Prakash Parthasarathi","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Mano Prakash Parthasarathi","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5073311967","display_name":"Venkatesh Raman","orcid":"https://orcid.org/0000-0001-8123-0980"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Venkatesh Raman","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5129668548","display_name":"Diya Roy","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Diya Roy","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5078282127","display_name":"Abhishek Sahu","orcid":"https://orcid.org/0000-0001-6481-6728"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Abhishek Sahu","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5000126726"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.01498127,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"40","issue":"17","first_page":"14149","last_page":"14156"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10637","display_name":"Advanced Clustering Algorithms Research","score":0.4480000138282776,"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.4480000138282776,"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/T10057","display_name":"Face and Expression Recognition","score":0.12919999659061432,"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"}},{"id":"https://openalex.org/T12535","display_name":"Machine Learning and Data Classification","score":0.11550000309944153,"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/parameterized-complexity","display_name":"Parameterized complexity","score":0.6481999754905701},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.5594000220298767},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4205999970436096},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.41679999232292175},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.4115000069141388},{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.3788999915122986},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.374099999666214},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.3720000088214874}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.6481999754905701},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.5594000220298767},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.507099986076355},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.45080000162124634},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4205999970436096},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.41679999232292175},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.41679999232292175},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.4115000069141388},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4050000011920929},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3847000002861023},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.3788999915122986},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.374099999666214},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.3720000088214874},{"id":"https://openalex.org/C198043062","wikidata":"https://www.wikidata.org/wiki/Q180953","display_name":"Metric space","level":2,"score":0.3562999963760376},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.34610000252723694},{"id":"https://openalex.org/C21080849","wikidata":"https://www.wikidata.org/wiki/Q13611879","display_name":"Data point","level":2,"score":0.3312999904155731},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3278999924659729},{"id":"https://openalex.org/C136389625","wikidata":"https://www.wikidata.org/wiki/Q334384","display_name":"Supervised learning","level":3,"score":0.303600013256073},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.3021000027656555},{"id":"https://openalex.org/C87465248","wikidata":"https://www.wikidata.org/wiki/Q1417790","display_name":"Minimum description length","level":2,"score":0.2874000072479248},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.2851000130176544},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.2838999927043915},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.27320000529289246},{"id":"https://openalex.org/C153180895","wikidata":"https://www.wikidata.org/wiki/Q7148389","display_name":"Pattern recognition (psychology)","level":2,"score":0.27320000529289246},{"id":"https://openalex.org/C13251829","wikidata":"https://www.wikidata.org/wiki/Q3085841","display_name":"Dense graph","level":5,"score":0.2680000066757202},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2667999863624573},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.25850000977516174}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1609/aaai.v40i17.38427","is_oa":true,"landing_page_url":"https://doi.org/10.1609/aaai.v40i17.38427","pdf_url":null,"source":{"id":"https://openalex.org/S4210191458","display_name":"Proceedings of the AAAI Conference on Artificial Intelligence","issn_l":"2159-5399","issn":["2159-5399","2374-3468"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320058","host_organization_name":"Association for the Advancement of Artificial Intelligence","host_organization_lineage":["https://openalex.org/P4310320058"],"host_organization_lineage_names":["Association for the Advancement of Artificial Intelligence"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the AAAI Conference on Artificial Intelligence","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1609/aaai.v40i17.38427","is_oa":true,"landing_page_url":"https://doi.org/10.1609/aaai.v40i17.38427","pdf_url":null,"source":{"id":"https://openalex.org/S4210191458","display_name":"Proceedings of the AAAI Conference on Artificial Intelligence","issn_l":"2159-5399","issn":["2159-5399","2374-3468"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320058","host_organization_name":"Association for the Advancement of Artificial Intelligence","host_organization_lineage":["https://openalex.org/P4310320058"],"host_organization_lineage_names":["Association for the Advancement of Artificial Intelligence"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the AAAI Conference on Artificial Intelligence","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"The":[0,49],"Minimum":[1,172],"Consistent":[2,173],"Subset":[3,174],"(MCS)":[4],"problem":[5,51,97,175],"arises":[6],"naturally":[7],"in":[8,41,60,79,92,155,209,273,280,314,353],"the":[9,35,64,95,135,145,161,171,183,189,233,333,358,364,383],"context":[10],"of":[11,27,38,73,88,137,147,163,235,262,310,385],"supervised":[12,18],"clustering":[13],"and":[14,126,160,188,264,337,355,357],"instance":[15],"selection.":[16],"In":[17,166,341],"clustering,":[19],"one":[20,87],"aims":[21],"to":[22,67,101,299],"infer":[23],"a":[24,30,45,56,61,69,259,276],"meaningful":[25],"partitioning":[26],"data":[28,40],"using":[29],"small":[31,201,204,241,255,267,305,318],"labeled":[32,57],"subset.":[33],"However,":[34],"sheer":[36],"volume":[37],"training":[39],"modern":[42],"applications":[43],"poses":[44],"significant":[46],"computational":[47],"challenge.":[48],"MCS":[50,96,116,140,313,327],"formalizes":[52],"this":[53,167],"goal:":[54],"given":[55],"dataset":[58],"X":[59,74,80],"metric":[62],"space,":[63],"task":[65],"is":[66,328,351,379],"compute":[68],"smallest":[70],"subset":[71],"S":[72],"such":[75,282],"that":[76,115,151,229,326],"every":[77],"point":[78],"shares":[81],"its":[82,89],"label":[83],"with":[84,232,240,254,286,292,304],"at":[85],"least":[86],"nearest":[90],"neighbors":[91],"S.":[93],"Recently,":[94],"has":[98,113],"been":[99],"extended":[100],"graph":[102,122,149],"metrics,":[103],"where":[104,317],"distances":[105],"are":[106,221,245,308],"defined":[107],"by":[108,134,213,332,338],"shortest":[109],"paths.":[110],"Prior":[111],"work":[112,300],"shown":[114],"remains":[117],"NP-hard":[118],"even":[119,272],"on":[120,141,176,179,363,382],"simple":[121],"classes":[123,150],"like":[124],"trees,":[125],"presented":[127],"an":[128,346],"fixed-parameter":[129],"tractable":[130],"(FPT)":[131],"algorithm":[132,347],"parameterized":[133,331],"number":[136,162,186,336,384],"colors":[138,164],"for":[139,198,302,372],"trees.":[142],"This":[143],"raises":[144],"challenge":[146],"identifying":[148],"admit":[152],"algorithms":[153,197,297,369],"efficient":[154,196,371],"both":[156],"input":[157],"size":[158],"(n)":[159],"(c).":[165],"work,":[168],"we":[169,194,344],"study":[170],"graphs,":[177,275],"focusing":[178],"two":[180],"well-established":[181],"measures:":[182],"vertex":[184,242,319,334],"cover":[185,243,335],"(vc)":[187],"neighborhood":[190,256,268,306,339],"diversity":[191,257,269,307],"(nd).":[192],"Specifically,":[193],"design":[195],"graphs":[199,253,291,303],"exhibiting":[200],"vc":[202],"or":[203,216,289],"nd,":[205],"which":[206],"frequently":[207,278],"arise":[208],"real-world":[210],"domains":[211,281],"characterized":[212],"local":[214],"sparsity":[215],"repetitive":[217],"structure.":[218],"These":[219],"parameters":[220],"particularly":[222],"relevant":[223],"because":[224],"they":[225],"capture":[226],"structural":[227],"properties":[228],"often":[230],"correlate":[231],"tractability":[234],"otherwise":[236],"hard":[237],"problems.":[238],"Graphs":[239],"sizes":[244],"\"almost":[246],"independent":[247],"sets\",":[248],"representing":[249],"sparse":[250],"interactions,":[251],"while":[252],"exhibit":[258],"high":[260],"degree":[261],"symmetry":[263],"regularity.":[265],"Importantly,":[266],"can":[270],"occur":[271],"dense":[274],"property":[277],"observed":[279],"as":[283,376],"social":[284],"networks":[285],"modular":[287],"communities":[288],"knowledge":[290],"repeated":[293],"relational":[294],"patterns.":[295],"Thus,":[296],"designed":[298],"efficiently":[301,311],"capable":[309],"solving":[312],"complex":[315],"settings":[316],"covers":[320],"may":[321],"not":[322],"exist.":[323],"We":[324],"show":[325],"FPT":[329],"when":[330],"diversity.":[340],"each":[342],"case,":[343],"present":[345],"whose":[348],"running":[349],"time":[350],"polynomial":[352],"n":[354],"c,":[356],"non-polynomial":[359],"part":[360],"depends":[361],"solely":[362],"chosen":[365],"parameter.":[366],"Notably,":[367],"our":[368],"remain":[370],"arbitrarily":[373],"many":[374],"colors,":[375],"their":[377],"complexity":[378],"polynomially":[380],"dependent":[381],"colors.":[386]},"counts_by_year":[],"updated_date":"2026-03-18T06:31:55.123368","created_date":"2026-03-18T00:00:00"}