Partitional clustering algorithms for highly similar and sparseness Y-Short Tandem Repeat Data / Ali Seman
Clustering is an overlapping method found in many areas such as data mining, machine learning, pattern recognition, bioinformatics and information retrieval. The goal of clustering is to group any similar objects into a cluster, while the other objects that are not similar in the different clusters....
Main Author: | Seman, Ali |
---|---|
Format: | Book Section |
Language: | English |
Published: |
Institute of Graduate Studies, UiTM
2013
|
Subjects: | |
Online Access: | http://ir.uitm.edu.my/id/eprint/19128/ http://ir.uitm.edu.my/id/eprint/19128/1/ABS_ALI%20SEMAN%20TDRA%20VOL%204%20IGS%2013.pdf |
Similar Items
-
Partitional clustering algorithms for highly similar and sparseness y-short tandem repeat data / Ali Seman
by: Seman, Ali
Published: (2013) -
Analysis of Y-chromosomal short tandem repeat (Y-STR) polymorphisms among Orang Asli population in Taman Negara and Jerantut of Pahang / Siti Hajar Noor Alshurdin
by: Noor Alshurdin, Siti Hajar
Published: (2014) -
Short tandem repeat (STR) analysis of chimerism in allogeneic peripheral blood stem cell transplant in UKMMC Kuala Lumpur
by: Hamidah, NH, et al.
Published: (2011) -
Cluster Analysis of Data Points using Partitioning and Probabilistic Model-based Algorithms
by: Raheem, Ajiboye Adeleke, et al.
Published: (2014) -
The profiling of short tandem repeats (STRS) fromnext-generation sequencing (NGS) data by establishing a whole genome STRS pipeline for forensic bioinformatics
by: Nur Nabilah A.,, et al.
Published: (2016)