{"id":"https://openalex.org/W4213058793","doi":"https://doi.org/10.5220/0010800000003122","title":"A k-Means Algorithm for Clustering with Soft Must-link and Cannot-link Constraints","display_name":"A k-Means Algorithm for Clustering with Soft Must-link and Cannot-link Constraints","publication_year":2022,"publication_date":"2022-01-01","ids":{"openalex":"https://openalex.org/W4213058793","doi":"https://doi.org/10.5220/0010800000003122"},"language":"en","primary_location":{"id":"doi:10.5220/0010800000003122","is_oa":false,"landing_page_url":"https://doi.org/10.5220/0010800000003122","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 11th International Conference on Pattern Recognition Applications and Methods","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/A5072687277","display_name":"Philipp Baumann","orcid":"https://orcid.org/0000-0002-3286-4474"},"institutions":[{"id":"https://openalex.org/I118564535","display_name":"University of Bern","ror":"https://ror.org/02k7v4d05","country_code":"CH","type":"education","lineage":["https://openalex.org/I118564535"]}],"countries":["CH"],"is_corresponding":true,"raw_author_name":"Philipp Baumann","raw_affiliation_strings":["Department of Business Administration, University of Bern, Schuetzenmattstrasse 14, 3012 Bern, Switzerland, --- Select a Country ---"],"affiliations":[{"raw_affiliation_string":"Department of Business Administration, University of Bern, Schuetzenmattstrasse 14, 3012 Bern, Switzerland, --- Select a Country ---","institution_ids":["https://openalex.org/I118564535"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5085640376","display_name":"Dorit S. Hochbaum","orcid":"https://orcid.org/0000-0002-2498-0512"},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Dorit Hochbaum","raw_affiliation_strings":["IEOR Department, University of California, Berkeley, Etcheverry Hall, CA 94720, U.S.A., --- Select a Country ---"],"affiliations":[{"raw_affiliation_string":"IEOR Department, University of California, Berkeley, Etcheverry Hall, CA 94720, U.S.A., --- Select a Country ---","institution_ids":["https://openalex.org/I95457486"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5072687277"],"corresponding_institution_ids":["https://openalex.org/I118564535"],"apc_list":null,"apc_paid":null,"fwci":1.2498,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.82416673,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10637","display_name":"Advanced Clustering Algorithms Research","score":0.9878000020980835,"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.9878000020980835,"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.9574000239372253,"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/T11063","display_name":"Rough Sets and Fuzzy Logic","score":0.9433000087738037,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/link","display_name":"Link (geometry)","score":0.9052481651306152},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.7148153185844421},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6359882354736328},{"id":"https://openalex.org/keywords/link-analysis","display_name":"Link analysis","score":0.5484411120414734},{"id":"https://openalex.org/keywords/k-means-clustering","display_name":"k-means clustering","score":0.43670228123664856},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.43395382165908813},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.19316253066062927},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.17014935612678528},{"id":"https://openalex.org/keywords/information-retrieval","display_name":"Information retrieval","score":0.08355754613876343}],"concepts":[{"id":"https://openalex.org/C2778753846","wikidata":"https://www.wikidata.org/wiki/Q6554239","display_name":"Link (geometry)","level":2,"score":0.9052481651306152},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.7148153185844421},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6359882354736328},{"id":"https://openalex.org/C1173588","wikidata":"https://www.wikidata.org/wiki/Q6554294","display_name":"Link analysis","level":2,"score":0.5484411120414734},{"id":"https://openalex.org/C207968372","wikidata":"https://www.wikidata.org/wiki/Q310401","display_name":"k-means clustering","level":3,"score":0.43670228123664856},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.43395382165908813},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.19316253066062927},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.17014935612678528},{"id":"https://openalex.org/C23123220","wikidata":"https://www.wikidata.org/wiki/Q816826","display_name":"Information retrieval","level":1,"score":0.08355754613876343}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.5220/0010800000003122","is_oa":false,"landing_page_url":"https://doi.org/10.5220/0010800000003122","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 11th International Conference on Pattern Recognition Applications and Methods","raw_type":"proceedings-article"},{"id":"pmh:oai:boris.unibe.ch:165923","is_oa":false,"landing_page_url":"https://boris.unibe.ch/165923/","pdf_url":null,"source":{"id":"https://openalex.org/S4306401086","display_name":"Bern Open Repository and Information System (University of Bern)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I118564535","host_organization_name":"University of Bern","host_organization_lineage":["https://openalex.org/I118564535"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Baumann, Philipp (2022). A k-means algorithm for clustering with soft must-link and cannot-link constraints (Unpublished). In: International Conference on Pattern Recognition Applications and Methods. Virtual Conference. 3.-5. February 2022.","raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"pmh:oai:escholarship.org:ark:/13030/qt25p4f0vn","is_oa":false,"landing_page_url":"https://escholarship.org/uc/item/25p4f0vn","pdf_url":null,"source":{"id":"https://openalex.org/S4306400115","display_name":"eScholarship (California Digital Library)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2801248553","host_organization_name":"California Digital Library","host_organization_lineage":["https://openalex.org/I2801248553"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2380760159","https://openalex.org/W2305543783","https://openalex.org/W2963128065","https://openalex.org/W2583864867","https://openalex.org/W1598884124","https://openalex.org/W2377904462","https://openalex.org/W2074640979","https://openalex.org/W2322922235","https://openalex.org/W2351568302","https://openalex.org/W2992119116"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}