atlas

Research map / Learning theory and algorithms / Clustering

Optimal Neighborhood Kernel Clustering with Multiple Kernels

AAAI 2017 · Learning theory and algorithms › Clustering · approach: Clustering approximation algorithms · 124 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
let optimal kernel lie in neighborhood of linear kernel combination (vs linear combination)MKKM · psortPosACC: 60.81 -> 64.33Helped
neighborhood kernel vs MKKM-MRmultiple kernel k-means · warpPIE10PACC: 55.24 -> 81.43Helped
ONKC vs RMKKMmultiple kernel clustering · JAFFEACC: 84.51 -> 83.57Hurt
ONKC vs RMSCmultiple kernel clustering · TOX171NMI: 33.66 -> 28.91Hurt
vary rho (neighborhood size regularizer) (ablation)ONKC · psortPosACCMixed
vary lambda over wide range (ablation)ONKC · psortPosACCNo clear effect

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy