AIMech AI

Clustering Data by Melting

Algorithms AIMech:ClusteringDataByMelting DRAFT
Aliases: Melting Algorithm for Clustering
A scale-dependent clustering procedure that heats Gaussian-weighted center iterations to build a merging membership tree, then selects clusters by persistence of their within-cluster weight fraction across logarithmic scales.
Identity Notes & Concept Scope This record denotes Wong’s complete melting procedure plus fractional-free-energy persistence selection. At one inverse temperature, the center update is the Gaussian mean-shift weighted mean; the outer heating path, original-point membership tree and selection stage distinguish the named algorithm. Weights are normalized over original observations, not mixture components. Cluster independence means separate center updates using the same data, not statistical independence of clusters. Heating decreases inverse temperature, unlike DAEM cooling toward one. No normalized match across all442pinned AIO labels/scoped synonyms and480native IDs/names/aliases, including GAM and VEM probes. Full-checkout searches include ignored and hidden files in worktree and main;59and61matched lines reduce to31distinct text windows, all read. Hits denote topic-model fitting steps, prior frontier leads, unrelated GAM generalized-additive-model context or programming mnemonics. GAM is the joint distribution/parameter KL-descent framework, not GEM with its exact current E-step. Variational EM fits model parameters with a restricted posterior family; BBVI is a stochastic variational-gradient procedure, NVIL specifies amortized stochastic learning, and structured factorial-HMM inference is model-specific. Melting shares its fixed-bandwidth weighted-mean update with Gaussian mean shift; its named outer heating, membership tree and persistence selection supply the distinct scope. Bare GAM/VEM aliases are qualified. Absence is bounded to this snapshot, corpus and inspected semantic neighborhood. Identity-search counts: 59 matched lines in the worktree and 61 in main; all 31 distinct matching-text windows were read, with ignored and hidden files included.

Claims & Grounded Evidence

4 Claims
Mechanism #weighted-center-heating
For each center y and beta>0, assign original points weights P_y,beta(x)=exp(-beta*||x-y||^2)/sum_u exp(-beta*||u-y||^2). Iterate y_new=sum_x x*P_y,beta(x) at fixed beta. Start centers at observations at a sufficiently high initial beta, retain their point memberships, track converged centers, and combine memberships when centers coalesce. Decrease beta and warm-start the retained centers; the printed schedule divides beta by1.05 and uses200inner iterations in demonstrations. The weighting set remains the original observations, not an unweighted replacement by merged centers.
Mechanism #persistence-selection
For nominal cluster Q at its tracked center, fractional free energy M_Q(beta)=sum_(x in Q)P_y,beta(x) is a membership weight fraction. Choose a threshold M_T; a cluster is good where its fraction exceeds that threshold, and robustness is the corresponding range of logarithmic scales. Greedily select the most robust good cluster, remove its ancestors and descendants from consideration, and repeat. Observations not covered by selected clusters remain in a leftover set; complete coverage is hoped for in the source, not guaranteed. Threshold choice and tie handling affect the result.
Limitation #fixed-points-and-rate
Stationary centers satisfy the weighted-mean equation for F=-log Z/beta, but not every fixed point is a local minimum or exponentially attracting. For points{-1,+1}, the update is tanh(2*beta*y): at beta=1, y=0 stays at an unstable free-energy maximum if initialized exactly there; at beta=0.5, the critical map tanh(y) has derivative one and no uniform local geometric rate. The one-dimensional bifurcation condition2*beta*weighted_variance=1 does not establish higher-dimensional global cluster recovery.
Limitation #implementation-and-empirical-limits
The printed merge step says more than two coincident clusters, while the surrounding prose describes two-cluster mergers; this record uses the intended two-or-more interpretation explicitly. Exact coincidence tolerance, robust tie policy and a universally adequate initial scale are not specified. Finite inner iteration does not certify convergence or finite exact tree completion. Selected synthetic and SAR demonstrations do not establish universal density/shape insensitivity, semantic cluster-count recovery or superiority to ISODATA under arbitrary initialization.

⚠️ Curated Limitations & Negative Results

Artificial Intelligence Ontology (AIO) Grounding

Mapped AIO Classes
AIO Target Class Mapping Relation Mapping Rationale
AIO:UnsupervisedClustering
Unsupervised Clustering
related_match The method constructs and selects clusters from unlabeled points. The inspected target denotes an unsupervised clustering process/task; this related match preserves the algorithm-versus-task distinction without asserting equivalence or an upstream subclass.

Evidence Sources & Primary Literature

1 Source
Source ID Publication / Document Type / Access Reference & Checksum
melting-source
Yiu-fai Wong
primary paper
full_text
ID: doi:10.1162/neco.1993.5.1.89
sha256:cb2f6511c0f5…

Curation Provenance

Curator: Codex
Method: ai_assisted
Model: GPT-6
Created: 2026-10-12T05:01:54Z
Updated: 2026-10-12T05:01:54Z
Source File: data/curated/ClusteringDataByMelting.yaml