Centre-based hard clustering algorithms for Y-STR data / Ali Seman, Zainab Abu Bakar and Azizian Mohd. Sapawi
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...
Saved in:
Main Authors: | Seman, Ali, Abu Bakar, Zainab, Mohd. Sapawi, Azizian |
---|---|
Format: | Article |
Language: | English |
Published: |
Faculty of Computer and Mathematical Sciences
2010
|
Online Access: | https://ir.uitm.edu.my/id/eprint/11101/1/11101.pdf https://ir.uitm.edu.my/id/eprint/11101/ https://mjoc.uitm.edu.my/ |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
The optimal performance of multi-layer neural network for speaker-independent isolated spoken Malay parliamentary speech / Noraini Seman Zainab Abu Bakar ...[et al.]
by: Seman, Noraini, et al.
Published: (2010) -
Partitional clustering algorithms for highly similar and sparseness Y-Short Tandem Repeat Data / Ali Seman
by: Seman, Ali
Published: (2013) -
Partitional clustering algorithms for highly similar and sparseness y-short tandem repeat data / Ali Seman
by: Seman, Ali
Published: (2013) -
Case Study : Demica / Nurin Syamimi Sapawi
by: Sapawi, Nurin Syamimi
Published: (2021) -
Extensions to the K-AMH algorithm for numerical clustering
by: Seman, Ali, et al.
Published: (2018)