Multiview Kernel K-Means
Algorithms AIMech:MultiviewKernelKMeans DRAFT
Aliases: MVKKM
A multiview clustering algorithm that alternates kernel k-means on a power-weighted combination of fixed view kernels with simplex view-weight updates minimizing within-cluster feature variance.
Identity Notes & Concept Scope
This is the Tzortzis-Likas 2012 MVKKM procedure. It maintains a discrete common partition while learning view weights. It differs from MVSpec, which optimizes an orthonormal relaxation before final discretization, and from exemplar-based multiview mixture methods, which fit log-mixture objectives. Its kernel-k-means component does not make the complete procedure ordinary input-space k-means or kernel PCA. MVKKM is the source-specific alias. Compared all 442 pinned AIO IDs, labels and scoped synonyms with all 490 preceding native IDs, names and aliases; no normalized identity collision. Full searches of both checkouts include ignored and hidden files, with 5 matched lines in the worktree and 5 in main. All 3 distinct matched texts were inspected as source-query and frontier references. Nine annotated AIO nodes, nine generated YAMLs and seven native contextual YAMLs were assessed. Seven unchanged annotated nodes and generated records, all 442 class labels and 138 semantic rows reuse byte-verified earlier readings; two additional targets and the KernelLayer semantic row were read, giving 139 semantic rows. Absence is bounded to this snapshot and corpus.
Claims & Grounded Evidence
6 Claims
Mechanism
#power-weighted-kernel
Given N aligned observations, V fixed positive-semidefinite view Gram matrices K_v, a supplied cluster count M and exponent p>=1, form Ktilde=sum_v w_v^p K_v with nonnegative w and sum_v w_v=1. The actual kernel coefficients are w_v^p, which need not sum to one. Their feature map concatenates the view features scaled by sqrt(w_v^p). The supplied kernels, M and p are not all learned by this procedure.
Mechanism
#discrete-alternation
Maintain M nonempty clusters with normalized indicator matrix Y_ik=1[i in C_k]/sqrt(|C_k|). For fixed view weights, apply kernel k-means to Ktilde, initializing from the preceding partition. For fixed clusters, use D_v=tr(K_v)-tr(Y^T K_v Y), equal to the sum of squared distances to view-specific feature means, and update w by the conditional weight solution. The paper starts view weights uniformly and initializes the partition through the named global kernel k-means procedure; that initialization is a heuristic, not a certificate of global optimality.
Mechanism
#conditional-weight-solution
For fixed positive residuals D_v and p>1, minimize sum_v D_v*w_v^p on the simplex using w_v=D_v^(-1/(p-1))/sum_u D_u^(-1/(p-1)). This gives positive weights for every positive residual. If some residuals are zero, the ratio formula is undefined; any weights supported entirely on zero-residual views minimize the block. At p=1, select a minimum-residual view as in the source, while ties mathematically permit any simplex distribution over minimizers. Neither zero-residual nor tied cases imply a unique weight vector.
Scope
#weight-and-coefficient-concentration
For fixed positive residuals, increasing p makes the simplex weight ratio (D_u/D_v)^(1/(p-1)) approach one. The ratio of actual kernel coefficients is (D_u/D_v)^(p/(p-1)); as p grows it approaches D_u/D_v, not generally one. Thus nearly uniform w does not imply uniform effective kernel contributions. The source uses sparsity to describe relative concentration; finite p>1 with positive residuals does not select exact zeros. The power-of-simplex constraint is not an asserted equivalence to every conventional lp multiple-kernel regularizer.
Limitation
#scale-normalization
View residual scales affect the learned weights. The source divides each view kernel by its mean pairwise squared feature distance, N^(-2)*sum_ij(K_vii-2*K_vij+K_vjj), to make scales comparable. This denominator vanishes for a constant feature view and needs an explicit convention. Such normalization does not establish that weights quantify semantic reliability or that a method is immune to uninformative views.
Limitation
#discrete-descent-scope
Admissible kernel-k-means updates and exact weight minimization do not increase the shared within-cluster objective. Its nonnegativity supports objective-value convergence, while the selected partition remains initialization dependent. Nonempty clusters, tie handling and numerical stopping require explicit conventions. The procedure does not promise a globally best joint partition and weighting or unique parameters, and the source word global in the initialization algorithm name is not such a guarantee.
⚠️ Curated Limitations & Negative Results
- The input must provide aligned views and valid PSD kernels. An arbitrary similarity matrix is not automatically an RKHS Gram matrix. Kernel selection, requested cluster count and p remain modeling choices.
- Dense Gram matrices require storage quadratic in N per view; the source uses repeated clustering or eigensolutions, with additional initialization cost. No general scalability or global-optimum guarantee is curated.
- Source experiments use known class counts, parameter sweeps, selected digit/image subsets and specific preprocessing; their NMI results do not establish universal superiority or label-free model selection. No historical software or benchmark was reproduced.
Artificial Intelligence Ontology (AIO) Grounding
Mapped AIO Classes
| AIO Target Class | Mapping Relation | Mapping Rationale |
|---|---|---|
AIO:UnsupervisedClustering
Unsupervised Clustering
|
related_match | This complete algorithm groups unlabeled aligned multiview observations. The inspected AIO target is a clustering task, so the association asserts neither equivalence nor an upstream subclass. A dot-product KernelLayer, PCA projection and neural RepresentationLearning have different scopes. |
Evidence Sources & Primary Literature
1 Source| Source ID | Publication / Document | Type / Access | Reference & Checksum |
|---|---|---|---|
kernel-source
|
Grigorios Tzortzis, Aristidis Likas
|
primary paper
full_text
|
ID: doi:10.1109/ICDM.2012.43
sha256:96eb9aab2cdb…
|
Curation Provenance
Curator: Codex
Method: ai_assisted
Model: GPT-6
Created: 2026-10-12T05:57:18Z
Updated: 2026-10-12T05:57:18Z
Source File:
data/curated/MultiviewKernelKMeans.yaml