CENTRE-BASED HARD CLUSTERING ALGORITHMS FOR Y-STR DATA
This paper presents Centre-based hard clustering approaches for clustering Y-STR data. Two classical partitioning techniques: Centroid-based partitioning technique and Representative object-based partitioning technique are evaluated. The k-Means and the k-Modes algorithms are the fundamental algorit...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
UiTM Press
2010-04-01
|
| Series: | Malaysian Journal of Computing |
| Subjects: | |
| Online Access: | https://mjoc.uitm.edu.my/main/images/journal/vol1-2010/07-Centre-Based-Hard-Clustering-for-Y-STR-Data-Ali-Seman.pdf |
| _version_ | 1827632506275364864 |
|---|---|
| author | Ali Seman Zainab Abu Bakar Azizian Mohd Sapawi |
| author_facet | Ali Seman Zainab Abu Bakar Azizian Mohd Sapawi |
| author_sort | Ali Seman |
| collection | DOAJ |
| description | This paper presents Centre-based hard clustering approaches for clustering Y-STR data. Two classical partitioning techniques: Centroid-based partitioning technique and Representative object-based partitioning technique are evaluated. The k-Means and the k-Modes algorithms are the fundamental algorithms for the centroid-based partitioning technique, whereas the k-Medoids is a representative object-based partitioning technique. The three algorithms above are experimented and evaluated in partitioning Y-STR haplogroups and Y-STR Surname data. The overall results show that the centroid-based partitioning technique is better than the representative object-based partitioning technique in clustering Y-STR data. |
| first_indexed | 2024-03-09T14:46:36Z |
| format | Article |
| id | doaj.art-8d2680bceded47bca02205226105ca5e |
| institution | Directory Open Access Journal |
| issn | 2600-8238 |
| language | English |
| last_indexed | 2024-03-09T14:46:36Z |
| publishDate | 2010-04-01 |
| publisher | UiTM Press |
| record_format | Article |
| series | Malaysian Journal of Computing |
| spelling | doaj.art-8d2680bceded47bca02205226105ca5e2023-11-27T05:01:18ZengUiTM PressMalaysian Journal of Computing2600-82382010-04-011627310.24191/mjoc.v1.0005CENTRE-BASED HARD CLUSTERING ALGORITHMS FOR Y-STR DATAAli Seman0Zainab Abu Bakar1 Azizian Mohd Sapawi2Department of Computer Sciences, Faculty of Computer and Mathematical Sciences, Universiti Teknologi MARA (UiTM) 40450 Shah Alam, SelangorDepartment of Computer Sciences, Faculty of Computer and Mathematical Sciences, Universiti Teknologi MARA (UiTM) 40450 Shah Alam, SelangorDepartment of Computer Sciences, Faculty of Computer and Mathematical Sciences, Universiti Teknologi MARA (UiTM) 40450 Shah Alam, SelangorThis paper presents Centre-based hard clustering approaches for clustering Y-STR data. Two classical partitioning techniques: Centroid-based partitioning technique and Representative object-based partitioning technique are evaluated. The k-Means and the k-Modes algorithms are the fundamental algorithms for the centroid-based partitioning technique, whereas the k-Medoids is a representative object-based partitioning technique. The three algorithms above are experimented and evaluated in partitioning Y-STR haplogroups and Y-STR Surname data. The overall results show that the centroid-based partitioning technique is better than the representative object-based partitioning technique in clustering Y-STR data.https://mjoc.uitm.edu.my/main/images/journal/vol1-2010/07-Centre-Based-Hard-Clustering-for-Y-STR-Data-Ali-Seman.pdfcentre-based clusteringk-meansk-modesk-medoidsy-str data |
| spellingShingle | Ali Seman Zainab Abu Bakar Azizian Mohd Sapawi CENTRE-BASED HARD CLUSTERING ALGORITHMS FOR Y-STR DATA Malaysian Journal of Computing centre-based clustering k-means k-modes k-medoids y-str data |
| title | CENTRE-BASED HARD CLUSTERING ALGORITHMS FOR Y-STR DATA |
| title_full | CENTRE-BASED HARD CLUSTERING ALGORITHMS FOR Y-STR DATA |
| title_fullStr | CENTRE-BASED HARD CLUSTERING ALGORITHMS FOR Y-STR DATA |
| title_full_unstemmed | CENTRE-BASED HARD CLUSTERING ALGORITHMS FOR Y-STR DATA |
| title_short | CENTRE-BASED HARD CLUSTERING ALGORITHMS FOR Y-STR DATA |
| title_sort | centre based hard clustering algorithms for y str data |
| topic | centre-based clustering k-means k-modes k-medoids y-str data |
| url | https://mjoc.uitm.edu.my/main/images/journal/vol1-2010/07-Centre-Based-Hard-Clustering-for-Y-STR-Data-Ali-Seman.pdf |
| work_keys_str_mv | AT aliseman centrebasedhardclusteringalgorithmsforystrdata AT zainababubakar centrebasedhardclusteringalgorithmsforystrdata AT azizianmohdsapawi centrebasedhardclusteringalgorithmsforystrdata |