Minkowski Metric, Feature Weighting and Anomalous Cluster Initializing in K-Means Clustering

This week on Journal Club session Deepak Panday will talk about a paper "Minkowski Metric, Feature Weighting and Anomalous Cluster Initializing in K-Means Clustering".

This paper represents another step in overcoming a drawback of K-Means, its lack of defense against noisy features, using feature weights in the criterion. The Weighted K-Means method by Huang et al. (2008, 2004, 2005) [5, 7] is extended to the corresponding Minkowski metric for measuring distances. Under Minkowski metric the feature weights become intuitively appealing feature rescaling factors in a conventional K-Means criterion. To see how this can be used in addressing another issue of K-Means, the initial setting, a method to initialize K-Means with anomalous clusters is adapted. The Minkowski metric based method is experimentally validated on datasets from the UCI Machine Learning Repository and generated sets of Gaussian clusters, both as they are and with additional uniform random noise features, and appears to be competitive in comparison with other K-Means based feature weighting algorithms.


Papers:

Date: 2021/03/10
Time: 14:00
Location: online

Share this post on: Twitter| Facebook| Google+| Email

Categories

Tags

neural networks Associative memory Studentship cerebellum Artificial intelligence olfaction Dendritic computation Purkinje cell Neuronal Morphology Evolutionary algorithms Neuromorphic hardware Persistent homology Open position COVID-19 Network connectivity robotics Deep learning Convolutional Neural Networks Neurons computational neuroscience neuroscience computational modelling Homoeostasis Software development machine learning PCA Computer Science optimization Structural plasticity synaptic plasticity