Discrete Multiple Kernel k-means

The multiple kernel k-means (MKKM) and its variants utilize complementary information from different kernels, achieving better performance than kernel k-means (KKM). However, the optimization procedures of previous works all comprise two stages, learning the continuous relaxed label matrix and obtaining the discrete one by extra discretization procedures. Such a two-stage strategy gives rise to a mismatched problem and severe information loss. To address this problem, we elaborate a novel Discrete Multiple Kernel k-means (DMKKM) model solved by an optimization algorithm that directly obtains the cluster indicator matrix without subsequent discretization procedures. Moreover, DMKKM can strictly measure the correlations among kernels, which is capable of enhancing kernel fusion by reducing redundancy and improving diversity. What’s more, DMKKM is parameter-free avoiding intractable hyperparameter tuning, which makes it feasible in practical applications. Extensive experiments illustrated the effectiveness and superiority of the proposed model.

Authors

• Rong Wang
• Jitao Lu
• Yihang Lu
• Feiping Nie Northwest Polytechnical University Xi'an
• Xuelong Li Institute of Artificial Intelligence (TeleAI), China Telecom

Keywords

• Machine Learning: Clustering
• Machine Learning: Kernel Methods
• Machine Learning: Multi-instance; Multi-label; Multi-view learning