CENTRE-BASED HARD CLUSTERING ALGORITHMS FOR Y-STR DATA

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...

Full description

Bibliographic Details
Main Authors: Ali Seman, Zainab Abu Bakar, Azizian Mohd Sapawi
Format: Article
Language:English
Published: UiTM Press 2010-04-01
Series:Malaysian Journal of Computing
Subjects:
centre-based clustering
k-means
k-modes
k-medoids
y-str data
Online Access:https://mjoc.uitm.edu.my/main/images/journal/vol1-2010/07-Centre-Based-Hard-Clustering-for-Y-STR-Data-Ali-Seman.pdf

Internet

https://mjoc.uitm.edu.my/main/images/journal/vol1-2010/07-Centre-Based-Hard-Clustering-for-Y-STR-Data-Ali-Seman.pdf

Similar Items