Constrained clustering and multiple kernel learning without pairwise constraint relaxation

DOI10.1007/S11634-022-00507-5MaRDI QIDQ6613890zbMATH OpenFDO

Authors Benedikt Boecking, Vincent Jeanselme, Artur Dubrawski

Publication date 3 October 2024

Published in Advances in Data Analysis and Classification. ADAC (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S11634-022-00507-5

zbMATH Keywords

constrained clusteringkernel learningpairwise constraintssemi-supervised clustering

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30)

Cites work

• A Bayesian model for supervised clustering with the Dirichlet process prior
• Multiple kernel learning algorithms
• Revisiting the Nyström method for improved large-scale machine learning
• Scalable kernel \(k\)-means clustering with Nyström approximation: relative-error bounds
• Semi-supervised clustering with metric learning: an adaptive kernel method
• Semi-supervised graph clustering: a kernel approach

This page was built for publication: Constrained clustering and multiple kernel learning without pairwise constraint relaxation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6613890)