Home           Contact us           FAQs           
   Journal Page   |   Aims & Scope   |   Author Guideline   |   Editorial Board   |   Search
2014 (Vol. 7, Issue: 5)
Article Information:

Performance Comparison of Clustering Techniques

Sambourou Massinanke and Lu Zhimao
Corresponding Author:  Sambourou Massinanke 

Key words:  Data clustering, k-medoids clustering and data of Y-STR, k-modes clustering, , , ,
Vol. 7 , (5): 963-969
Submitted Accepted Published
January 29, 2013 March 14, 2013 February 05, 2014

Data mining consists to extracting or “mining” information from large quantity of data. Clustering is one of the most significant research areas in the domain of data mining. Clustering signifies making groups of objects founded on their features where the objects of the same groups are similar and those belonging in different groups are not similar. This study reviews two Clustering Algorithms of the representative clustering techniques: K-modes and K-medoids algorithms. The two algorithms are experimented and evaluated on partitioning Y-STR data. All these algorithms are compared according to the following factors: certain number times of run, precision and recall. The global results show that K-mode clustering is better than the k-medoid in clustering Y-STR data.
Abstract PDF HTML
  Cite this Reference:
Sambourou Massinanke and Lu Zhimao, 2014. Performance Comparison of Clustering Techniques.  Research Journal of Applied Sciences, Engineering and Technology, 7(5): 963-969.
    Advertise with us
ISSN (Online):  2040-7467
ISSN (Print):   2040-7459
Submit Manuscript
   Current Information
   Sales & Services
   Contact Information
  Executive Managing Editor
  Email: admin@maxwellsci.com
  Publishing Editor
  Email: support@maxwellsci.com
  Account Manager
  Email: faisalm@maxwellsci.com
  Journal Editor
  Email: admin@maxwellsci.com
  Press Department
  Email: press@maxwellsci.com
Home  |  Contact us  |  About us  |  Privacy Policy
Copyright © 2009. MAXWELL Science Publication, a division of MAXWELLl Scientific Organization. All rights reserved