A k-means algorithm for clustering with soft must-link and cannot-link constraints

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.

Item Type:

Conference or Workshop Item (Speech)

Division/Institute:

03 Faculty of Business, Economics and Social Sciences > Department of Business Management > Institute of Financial Management > Professorship for Quantitative Methods in Business Administration

UniBE Contributor:

Baumann, Philipp

Subjects:

600 Technology > 650 Management & public relations

Language:

English

Submitter:

Nina Ackermann

Date Deposited:

09 May 2022 14:50

Last Modified:

09 May 2022 14:50

URI:

https://boris.unibe.ch/id/eprint/165923

Actions (login required)

Edit item Edit item
Provide Feedback