Related Experiment Video
Updated: Aug 18, 2026

Large-scale Reconstructions and Independent, Unbiased Clustering Based on Morphological Metrics to Classify Neurons in Selective Populations
Published on: February 15, 2017
Automated variable weighting in k-means type clustering
Joshua Zhexue Huang1, Michael K Ng, Hongqiang Rong
1E-Business Technology Institute, The University of Hong Kong, Pokfulam Road, Hong Kong. jhuang@eti.hku.hk
Abstract:
This paper proposes a k-means type clustering algorithm that can automatically calculate variable weights. A new step is introduced to the k-means clustering process to iteratively update variable weights based on the current partition of data and a formula for weight calculation is proposed. The convergency theorem of the new clustering process is given. The variable weights produced by the algorithm measure the importance of variables in clustering and can be used in variable selection in data mining applications where large and complex real data are often involved. Experimental results on both synthetic and real data have shown that the new algorithm outperformed the standard k-means type algorithms in recovering clusters in data.
Related Concept Videos
Weighted Mean
For example, consider the number of goals scored in the matches of a tournament. While computing the average number of goals scored in the tournament, it may be more important to...
One-Compartment Open Model: Wagner-Nelson and Loo Riegelman Method for ka Estimation
On...
Cluster Sampling Method
To choose a cluster sample, divide the population into clusters (groups) and then randomly select some of the clusters. All the members from these clusters are in the cluster sample. For example, if you randomly sample four departments from your...
Friedman Two-way Analysis of Variance by Ranks
Variability: Analysis
The range is a simple measure of variability, indicating the difference between the highest and...
One-Way ANOVA: Unequal Sample Sizes