Scribd
Upload
91 views1 page

An Incremental Clustering Algorithm Based On Mahalanobis Distance

The document describes a paper presented at the 3rd International Conference on Quantitative Sciences and Its Applications titled "An Incremental Clustering Algorithm Based on Mahalanobis Distance". The paper proposes replacing the Euclidean distance used in fuzzy c-means clustering with Mahalanobis distance and applying it to incremental learning. Experimental results showed this Mahalanobis distance based fuzzy incremental clustering algorithm effectively addressed limitations in fuzzy c-means clustering while also increasing training accuracy for non-spherical datasets.

Uploaded by

Khairul
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
91 views1 page

An Incremental Clustering Algorithm Based On Mahalanobis Distance

The document describes a paper presented at the 3rd International Conference on Quantitative Sciences and Its Applications titled "An Incremental Clustering Algorithm Based on Mahalanobis Distance". The paper proposes replacing the Euclidean distance used in fuzzy c-means clustering with Mahalanobis distance and applying it to incremental learning. Experimental results showed this Mahalanobis distance based fuzzy incremental clustering algorithm effectively addressed limitations in fuzzy c-means clustering while also increasing training accuracy for non-spherical datasets.

Uploaded by

Khairul
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 1

3rd International Conference on Quantitative Sciences and Its Applications

ICOQSIA2014

An Incremental Clustering Algorithm Based on


Mahalanobis Distance
Lim Eng Aika, and Tan Wee Choonb
a

Institut Matematik Kejuruteraan, Universiti Malaysia Perlis, 02600 Ulu Pauh, Perlis, Malaysia.
ealim@unimap.edu.my
b
School of Mechatronics Engineering, Universiti Malaysia Perlis, 02600 Ulu Pauh, Perlis, Malaysia.
tweechoon@unimap.edu.my

Abstract. Classical fuzzy c-means clustering algorithm is insufficient to cluster non-spherical or


elliptical distributed datasets. The paper replaces classical fuzzy c-means clustering euclidean
distance with Mahalanobis distance. It applies Mahalanobis distance to incremental learning for
its merits. A Mahalanobis distance based fuzzy incremental clustering learning algorithm is
proposed. Experimental results show the algorithm is an effective remedy for the defect in fuzzy
c-means algorithm but also increase training accuracy.
Keywords: fuzzy c-means, Mahalanobis distance, incremental learning.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy