Statistical data preprocessing methods in distance functions to enhance k-means clustering algorithm
Clustering is an unsupervised classification method with major aim of partitioning, where objects in the same cluster are similar, and objects belong to different clusters vary significantly, with respect to their attributes. The K-Means algorithm is the commonest and fast technique in partitiona...
| Main Author: | |
|---|---|
| Format: | Thesis |
| Language: | English |
| Published: |
2018
|
| Subjects: | |
| Online Access: | http://psasir.upm.edu.my/id/eprint/68681/ http://psasir.upm.edu.my/id/eprint/68681/1/68681.pdf |
| _version_ | 1848867603905249280 |
|---|---|
| author | Dalatu, Paul Inuwa |
| author_facet | Dalatu, Paul Inuwa |
| author_sort | Dalatu, Paul Inuwa |
| building | UPM Institutional Repository |
| collection | Online Access |
| description | Clustering is an unsupervised classification method with major aim of partitioning,
where objects in the same cluster are similar, and objects belong to different clusters
vary significantly, with respect to their attributes. The K-Means algorithm is the
commonest and fast technique in partitional cluster algorithms, although with unnormalized
datasets it can achieve local optimal.
We introduced two new approaches to normalization techniques to enhance the
K-Means algorithms. This is to remedy the problem of using the existing Min-Max
(MM) and Decimal Scaling (DS) techniques, which have overflow weakness. The
suggested approaches are called new approach to min-max (NAMM) and decimal
scaling (NADS).
The Hybrid mean algorithms which are based on spherical clusters is also proposed to
remedy the most significant limitation of the K-Means and K-Midranges algorithms. It
is attained successfully by combining the mean in K-Means algorithm, minimum and
maximum in K-Midranges algorithm and compute their average as mean cluster of
Hybrid mean.
The problem of using range function in Heterogeneous Euclidean-Overlap Metric
(HEOM) is addressed by replacing the range with interquartile range function called
Interquartile Range-Heterogeneous Metric (IQR-HEOM). Dividing the HEOM with
range allows outliers to have big effect on the contribution of attributes. Hence,
We proposed interquartile range which is more resistance against outliers in data
pre-processing. It shows that the IQR-HEOM method is more efficient to rectify the
problem caused by using range in HEOM. The Standardized Euclidean distance which uses standard deviation to down weight
maximum points of the ith features on the distance clusters are being criticized in the
literature by many researchers that the method is prone to outliers and has 0% breakdown
points. Therefore, to remedy the problem, we introduced two statistical estimators
called Qn and Sn estimator, both have 50% breakdown points, with their efficiency
as 58% and 82% for Sn and Qn, respectively. The empirical evidences show that the
two suggested methods are more efficient compared to the existing methods. |
| first_indexed | 2025-11-15T11:37:48Z |
| format | Thesis |
| id | upm-68681 |
| institution | Universiti Putra Malaysia |
| institution_category | Local University |
| language | English |
| last_indexed | 2025-11-15T14:39:08Z |
| publishDate | 2018 |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | upm-686812025-09-09T08:44:41Z http://psasir.upm.edu.my/id/eprint/68681/ Statistical data preprocessing methods in distance functions to enhance k-means clustering algorithm Dalatu, Paul Inuwa Clustering is an unsupervised classification method with major aim of partitioning, where objects in the same cluster are similar, and objects belong to different clusters vary significantly, with respect to their attributes. The K-Means algorithm is the commonest and fast technique in partitional cluster algorithms, although with unnormalized datasets it can achieve local optimal. We introduced two new approaches to normalization techniques to enhance the K-Means algorithms. This is to remedy the problem of using the existing Min-Max (MM) and Decimal Scaling (DS) techniques, which have overflow weakness. The suggested approaches are called new approach to min-max (NAMM) and decimal scaling (NADS). The Hybrid mean algorithms which are based on spherical clusters is also proposed to remedy the most significant limitation of the K-Means and K-Midranges algorithms. It is attained successfully by combining the mean in K-Means algorithm, minimum and maximum in K-Midranges algorithm and compute their average as mean cluster of Hybrid mean. The problem of using range function in Heterogeneous Euclidean-Overlap Metric (HEOM) is addressed by replacing the range with interquartile range function called Interquartile Range-Heterogeneous Metric (IQR-HEOM). Dividing the HEOM with range allows outliers to have big effect on the contribution of attributes. Hence, We proposed interquartile range which is more resistance against outliers in data pre-processing. It shows that the IQR-HEOM method is more efficient to rectify the problem caused by using range in HEOM. The Standardized Euclidean distance which uses standard deviation to down weight maximum points of the ith features on the distance clusters are being criticized in the literature by many researchers that the method is prone to outliers and has 0% breakdown points. Therefore, to remedy the problem, we introduced two statistical estimators called Qn and Sn estimator, both have 50% breakdown points, with their efficiency as 58% and 82% for Sn and Qn, respectively. The empirical evidences show that the two suggested methods are more efficient compared to the existing methods. 2018-01 Thesis NonPeerReviewed text en http://psasir.upm.edu.my/id/eprint/68681/1/68681.pdf Dalatu, Paul Inuwa (2018) Statistical data preprocessing methods in distance functions to enhance k-means clustering algorithm. Doctoral thesis, Universiti Putra Malaysia. http://ethesis.upm.edu.my/id/eprint/10902/ Cluster analysis - Mathematical models Statistics Algorithms |
| spellingShingle | Cluster analysis - Mathematical models Statistics Algorithms Dalatu, Paul Inuwa Statistical data preprocessing methods in distance functions to enhance k-means clustering algorithm |
| title | Statistical data preprocessing methods in distance functions to enhance k-means clustering algorithm |
| title_full | Statistical data preprocessing methods in distance functions to enhance k-means clustering algorithm |
| title_fullStr | Statistical data preprocessing methods in distance functions to enhance k-means clustering algorithm |
| title_full_unstemmed | Statistical data preprocessing methods in distance functions to enhance k-means clustering algorithm |
| title_short | Statistical data preprocessing methods in distance functions to enhance k-means clustering algorithm |
| title_sort | statistical data preprocessing methods in distance functions to enhance k-means clustering algorithm |
| topic | Cluster analysis - Mathematical models Statistics Algorithms |
| url | http://psasir.upm.edu.my/id/eprint/68681/ http://psasir.upm.edu.my/id/eprint/68681/ http://psasir.upm.edu.my/id/eprint/68681/1/68681.pdf |