Comparison of Different Partitional Algorithms Based on Efficiency
Nasreen Taj M.B
, Neelambike S
- mean, K-mean, Partitional algorithm, cluster analysis
In this paper we describe cluster analysis and compare different Partitional algorithms based on their efficiency by considering gene data. For the Partitional algorithms we are going to give DNA sequences of one or two animals (like human, rat, monkey) as input. Here we take the input, DNA sequence for different animals, from the website www.ncbi.nlm.nih.gov which is a Government website. The Partitional algorithms compare the similarity between the genes and form clusters. Then find the time taken for clustering and find effective cluster using the above methods. Using the efficiency in time we conclude that which method is best for finding effective cluster.
"Comparison of Different Partitional Algorithms Based on Efficiency ", IJSDR - International Journal of Scientific Development and Research (www.IJSDR.org), ISSN:2455-2631, Vol.2, Issue 7, page no.106 - 110, July-2017, Available :https://ijsdr.org/papers/IJSDR1707014.pdf
Volume 2
Issue 7,
July-2017
Pages : 106 - 110
Paper Reg. ID: IJSDR_170601
Published Paper Id: IJSDR1707014
Downloads: 000347193
Research Area: Engineering
Country: davangere, Karnataka, India
ISSN: 2455-2631 | IMPACT FACTOR: 9.15 Calculated By Google Scholar | ESTD YEAR: 2016
An International Scholarly Open Access Journal, Peer-Reviewed, Refereed Journal Impact Factor 9.15 Calculate by Google Scholar and Semantic Scholar | AI-Powered Research Tool, Multidisciplinary, Monthly, Multilanguage Journal Indexing in All Major Database & Metadata, Citation Generator
Publisher: IJSDR(IJ Publication) Janvi Wave
