{"id":"https://openalex.org/W4280654635","doi":"https://doi.org/10.1109/ijcnn55064.2022.9891939","title":"Anchored Constrained Clustering Ensemble","display_name":"Anchored Constrained Clustering Ensemble","publication_year":2022,"publication_date":"2022-07-18","ids":{"openalex":"https://openalex.org/W4280654635","doi":"https://doi.org/10.1109/ijcnn55064.2022.9891939"},"language":"en","primary_location":{"id":"doi:10.1109/ijcnn55064.2022.9891939","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ijcnn55064.2022.9891939","pdf_url":null,"source":{"id":"https://openalex.org/S4363607707","display_name":"2022 International Joint Conference on Neural Networks (IJCNN)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"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":"2022 International Joint Conference on Neural Networks (IJCNN)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://hal.science/hal-03672982","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5079701478","display_name":"Mathieu Guilbert","orcid":"https://orcid.org/0000-0002-4540-8435"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Mathieu Guilbert","raw_affiliation_strings":["Univ. Orléans, INSA Centre,Orléans,France"],"affiliations":[{"raw_affiliation_string":"Univ. Orléans, INSA Centre,Orléans,France","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5050516915","display_name":"Christel Vrain","orcid":"https://orcid.org/0000-0003-3307-0753"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Christel Vrain","raw_affiliation_strings":["Univ. Orléans, INSA Centre,Orléans,France"],"affiliations":[{"raw_affiliation_string":"Univ. Orléans, INSA Centre,Orléans,France","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5017120022","display_name":"Thi-Bich-Hanh Dao","orcid":"https://orcid.org/0000-0002-2740-6954"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Thi-Bich-Hanh Dao","raw_affiliation_strings":["Univ. Orléans, INSA Centre,Orléans,France"],"affiliations":[{"raw_affiliation_string":"Univ. Orléans, INSA Centre,Orléans,France","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5064710760","display_name":"Marc\u00edlio C. P. de Souto","orcid":"https://orcid.org/0000-0002-7033-8328"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Marcilio C. P. de Souto","raw_affiliation_strings":["Univ. Orléans, INSA Centre,Orléans,France"],"affiliations":[{"raw_affiliation_string":"Univ. Orléans, INSA Centre,Orléans,France","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5079701478"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.3131,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.48762389,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"8"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10637","display_name":"Advanced Clustering Algorithms Research","score":0.9998000264167786,"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.9998000264167786,"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.9970999956130981,"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/T10320","display_name":"Neural Networks and Applications","score":0.9929999709129333,"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/partition","display_name":"Partition (number theory)","score":0.7773668766021729},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.7478798031806946},{"id":"https://openalex.org/keywords/pairwise-comparison","display_name":"Pairwise comparison","score":0.6827367544174194},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.580000102519989},{"id":"https://openalex.org/keywords/constrained-clustering","display_name":"Constrained clustering","score":0.4917469322681427},{"id":"https://openalex.org/keywords/consensus-clustering","display_name":"Consensus clustering","score":0.45218226313591003},{"id":"https://openalex.org/keywords/cluster","display_name":"Cluster (spacecraft)","score":0.4199836254119873},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.4171636700630188},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.34787604212760925},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.33335909247398376},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3156566619873047},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.30714792013168335},{"id":"https://openalex.org/keywords/correlation-clustering","display_name":"Correlation clustering","score":0.24197256565093994},{"id":"https://openalex.org/keywords/cure-data-clustering-algorithm","display_name":"CURE data clustering algorithm","score":0.14690762758255005},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.12487027049064636}],"concepts":[{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.7773668766021729},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.7478798031806946},{"id":"https://openalex.org/C184898388","wikidata":"https://www.wikidata.org/wiki/Q1435712","display_name":"Pairwise comparison","level":2,"score":0.6827367544174194},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.580000102519989},{"id":"https://openalex.org/C27964816","wikidata":"https://www.wikidata.org/wiki/Q5164359","display_name":"Constrained clustering","level":5,"score":0.4917469322681427},{"id":"https://openalex.org/C186767784","wikidata":"https://www.wikidata.org/wiki/Q5162841","display_name":"Consensus clustering","level":5,"score":0.45218226313591003},{"id":"https://openalex.org/C164866538","wikidata":"https://www.wikidata.org/wiki/Q367351","display_name":"Cluster (spacecraft)","level":2,"score":0.4199836254119873},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.4171636700630188},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.34787604212760925},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33335909247398376},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3156566619873047},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.30714792013168335},{"id":"https://openalex.org/C94641424","wikidata":"https://www.wikidata.org/wiki/Q5172845","display_name":"Correlation clustering","level":3,"score":0.24197256565093994},{"id":"https://openalex.org/C33704608","wikidata":"https://www.wikidata.org/wiki/Q5014717","display_name":"CURE data clustering algorithm","level":4,"score":0.14690762758255005},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.12487027049064636},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/ijcnn55064.2022.9891939","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ijcnn55064.2022.9891939","pdf_url":null,"source":{"id":"https://openalex.org/S4363607707","display_name":"2022 International Joint Conference on Neural Networks (IJCNN)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"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":"2022 International Joint Conference on Neural Networks (IJCNN)","raw_type":"proceedings-article"},{"id":"pmh:oai:HAL:hal-03672982v1","is_oa":true,"landing_page_url":"https://hal.science/hal-03672982","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"IJCNN, Jul 2022, Padua, Italy","raw_type":"Conference papers"}],"best_oa_location":{"id":"pmh:oai:HAL:hal-03672982v1","is_oa":true,"landing_page_url":"https://hal.science/hal-03672982","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"IJCNN, Jul 2022, Padua, Italy","raw_type":"Conference papers"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W36600959","https://openalex.org/W148941649","https://openalex.org/W302081218","https://openalex.org/W861814484","https://openalex.org/W1673310716","https://openalex.org/W1987839426","https://openalex.org/W2031805499","https://openalex.org/W2127218421","https://openalex.org/W2134089414","https://openalex.org/W2139280638","https://openalex.org/W2576424542","https://openalex.org/W2578643323","https://openalex.org/W2587977506","https://openalex.org/W2605427894","https://openalex.org/W2789712634","https://openalex.org/W2947608767","https://openalex.org/W2960503565","https://openalex.org/W3096268198","https://openalex.org/W6637131181","https://openalex.org/W6678914141","https://openalex.org/W6679849079","https://openalex.org/W6732730141"],"related_works":["https://openalex.org/W2023397165","https://openalex.org/W135418852","https://openalex.org/W3035145740","https://openalex.org/W4312142847","https://openalex.org/W2957046493","https://openalex.org/W2386249431","https://openalex.org/W2801999749","https://openalex.org/W4380364044","https://openalex.org/W197235377","https://openalex.org/W3210419330"],"abstract_inverted_index":{"In":[0],"the":[1,31,38,61,64,67,92,102,128,138,155,161,166,189,193],"context":[2],"of":[3,40,47,66,91,131,183],"semi-supervised":[4,41],"learning":[5],"and":[6,180],"clustering":[7,42],"ensemble":[8],"methods,":[9],"we":[10,28,81,121],"introduce":[11],"a":[12,48,52,96,117,142,181],"novel":[13],"strategy":[14,45],"to":[15,76,108,115,134,146,153,160,186],"consider":[16],"not":[17,34,72],"only":[18],"pairwise":[19],"constraints,":[20,184,191],"but":[21,196],"also":[22],"triplet":[23],"constraints.":[24,167],"As":[25],"far":[26],"as":[27],"are":[29,70,86,112],"aware,":[30],"latter":[32],"have":[33],"been":[35,56],"addressed":[36],"in":[37,74,94,101,137],"literature":[39],"ensembles.":[43],"The":[44,168],"consists":[46],"post-processing":[49],"applied":[50],"once":[51],"consensus":[53,68,139,162,178],"partition":[54,69,156,179],"has":[55,104],"built.":[57],"Taking":[58],"into":[59],"account":[60],"fact":[62],"that":[63,98,120,172],"clusters":[65],"usually":[71],"spherical,":[73],"order":[75],"maintain":[77],"their":[78],"complex":[79],"shapes,":[80],"first":[82],"generate":[83],"anchors,":[84],"which":[85,126,157],"data":[87,118],"points":[88],"judged":[89],"representative":[90],"clusters,":[93],"such":[95],"way":[97],"every":[99],"point":[100,133],"cluster":[103,136],"an":[105,123,147,176],"anchor":[106],"close":[107],"it.":[109],"These":[110],"anchors":[111],"then":[113],"used":[114],"create":[116],"structure":[119],"call":[122],"allocation":[124],"matrix,":[125],"measures":[127],"assignment":[129],"score":[130],"each":[132,135],"partition.":[140],"Such":[141],"matrix":[143],"is":[144,158],"provided":[145],"Integer":[148],"Linear":[149],"Programing":[150],"(ILP)":[151],"model":[152],"find":[154],"closest":[159],"partition,":[163,195],"while":[164],"satisfying":[165],"experimental":[169],"results":[170],"show":[171],"our":[173],"method,":[174],"given":[175,190],"initial":[177,194],"set":[182],"allows":[185],"satisfy":[187],"all":[188],"modifying":[192],"without":[197],"deteriorating":[198],"considerably":[199],"its":[200],"quality.":[201]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}