New approaches to normalization techniques to enhance k-means clustering algorithm
Clustering is fundamentally one of the leading origin of basic data mining tools, which makes researchers believe the normal grouping of attributes in datasets. The main aim of clustering is to ascertain similarities and arrangements with a large dataset by partitioning data into clusters. It is imp...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Institute for Mathematical Research, Universiti Putra Malaysia
2020
|
| Online Access: | http://psasir.upm.edu.my/id/eprint/38339/1/3.%20Paul%20n%20Habshah.pdf |
| _version_ | 1796973326729478144 |
|---|---|
| author | Dalatu, Paul Inuwa Midi, Habshah |
| author_facet | Dalatu, Paul Inuwa Midi, Habshah |
| author_sort | Dalatu, Paul Inuwa |
| collection | UPM |
| description | Clustering is fundamentally one of the leading origin of basic data mining tools, which makes researchers believe the normal grouping of attributes in datasets. The main aim of clustering is to ascertain similarities and arrangements with a large dataset by partitioning data into clusters. It is important to note that distance measures like Euclidean distance, should not be used without normalization of datasets. The limitation of using both Min-Max (MM) and Decimal Scaling (DS) normalization methods are that the minimum and maximum values may be out-of-samples when dataset are unknown. Therefore, we proposed two new normalization approaches to overcome attributes with initially large magnitudes from overweighing attributes with initially smaller magnitudes. The two new normalization approaches are called New Approach to Min-Max (NAMM) and New Approach to Decimal Scaling (NADS). To evaluate the performance of our proposed approaches, simulation study and real data applications are considered. However, the two proposed approaches have shown good performance compared to the existing methods, by achieving nearly maximum points in the average external validity measures, recorded lower computing time and clustering the object points to almost all their cluster centers. Consequently, from the results obtained, it can be noted that the NAMM and NADS approaches yielded better performance in the data preprocessing methods, which down weight the magnitudes of large values. |
| first_indexed | 2024-03-06T08:41:00Z |
| format | Article |
| id | upm.eprints-38339 |
| institution | Universiti Putra Malaysia |
| language | English |
| last_indexed | 2024-03-06T08:41:00Z |
| publishDate | 2020 |
| publisher | Institute for Mathematical Research, Universiti Putra Malaysia |
| record_format | dspace |
| spelling | upm.eprints-383392020-05-04T16:19:08Z http://psasir.upm.edu.my/id/eprint/38339/ New approaches to normalization techniques to enhance k-means clustering algorithm Dalatu, Paul Inuwa Midi, Habshah Clustering is fundamentally one of the leading origin of basic data mining tools, which makes researchers believe the normal grouping of attributes in datasets. The main aim of clustering is to ascertain similarities and arrangements with a large dataset by partitioning data into clusters. It is important to note that distance measures like Euclidean distance, should not be used without normalization of datasets. The limitation of using both Min-Max (MM) and Decimal Scaling (DS) normalization methods are that the minimum and maximum values may be out-of-samples when dataset are unknown. Therefore, we proposed two new normalization approaches to overcome attributes with initially large magnitudes from overweighing attributes with initially smaller magnitudes. The two new normalization approaches are called New Approach to Min-Max (NAMM) and New Approach to Decimal Scaling (NADS). To evaluate the performance of our proposed approaches, simulation study and real data applications are considered. However, the two proposed approaches have shown good performance compared to the existing methods, by achieving nearly maximum points in the average external validity measures, recorded lower computing time and clustering the object points to almost all their cluster centers. Consequently, from the results obtained, it can be noted that the NAMM and NADS approaches yielded better performance in the data preprocessing methods, which down weight the magnitudes of large values. Institute for Mathematical Research, Universiti Putra Malaysia 2020 Article PeerReviewed text en http://psasir.upm.edu.my/id/eprint/38339/1/3.%20Paul%20n%20Habshah.pdf Dalatu, Paul Inuwa and Midi, Habshah (2020) New approaches to normalization techniques to enhance k-means clustering algorithm. Malaysian Journal of Mathematical Sciences, 14 (1). pp. 41-62. ISSN 1823-8343; ESSN: 2289-750X http://einspem.upm.edu.my/journal/fullpaper/vol14no1jan/3.%20Paul%20n%20Habshah.pdf |
| spellingShingle | Dalatu, Paul Inuwa Midi, Habshah New approaches to normalization techniques to enhance k-means clustering algorithm |
| title | New approaches to normalization techniques to enhance k-means clustering algorithm |
| title_full | New approaches to normalization techniques to enhance k-means clustering algorithm |
| title_fullStr | New approaches to normalization techniques to enhance k-means clustering algorithm |
| title_full_unstemmed | New approaches to normalization techniques to enhance k-means clustering algorithm |
| title_short | New approaches to normalization techniques to enhance k-means clustering algorithm |
| title_sort | new approaches to normalization techniques to enhance k means clustering algorithm |
| url | http://psasir.upm.edu.my/id/eprint/38339/1/3.%20Paul%20n%20Habshah.pdf |
| work_keys_str_mv | AT dalatupaulinuwa newapproachestonormalizationtechniquestoenhancekmeansclusteringalgorithm AT midihabshah newapproachestonormalizationtechniquestoenhancekmeansclusteringalgorithm |