Comparative Analysis of Clustering Algorithm for Wind Power

Authors(2) :-Dr. Sumathy P, Senthilkumar P

Data mining is the process of automatically finding useful information in large data repositories. In the field of software data analysis is considered as a very useful and important tool as the task of processing large volume of data is rather tough and it has accelerated the interest of application of such analysis. The purpose of deploying data mining techniques is discovering important patterns from datasets and also provides capabilities to predict the outcome of a future observation. The process of clustering the requirements allows reducing the cost of software development and maintenance. Clustering is a division of data into groups of similar objects. Representing the data by fewer clusters necessarily loses certain fine details, but achieves simplification. It models data by its clusters. Data modeling puts clustering in a historical perspective rooted in mathematics, statistics, and numerical analysis. In this paper, we can implement two clustering algorithms such as centroid based K-Means clustering and representative object based Fuzzy C means clustering are compared to real time wind datasets. These algorithms are evaluated in terms of time, accuracy, error rate and random index values. FCM can produce efficient results than K-means algorithm.

Authors and Affiliations

Dr. Sumathy P
Assitant Professor, BDU, Trichirappali, Tamilnadu, India
Senthilkumar P
M. Phil Scholar, BDU, Trichirappalli,Tamilnadu, India

Data Clustering, Modeling Scheme, K-Means Clustering, Fuzzy C Means Clustering, Centroid Based Calculation

  1. Berkhin, Pavel. "A survey of clustering data mining techniques." Grouping multidimensional data 25 (2006): 71.
  2. Guo, Chonghui, and Li Peng. "A hybrid clustering algorithm based on dimensional reduction and k-harmonic means." Wireless Communications, Networking and Mobile Computing, 2008.WiCOM'08.4th International Conference on.IEEE, 2008.
  3. Zhang, Bin, Meichun Hsu, and UmeshwarDayal. "K-harmonic means-a data clustering algorithm." Hewlett-Packard Labs Technical Report HPL-1999-124(1999).
  4. Zhang, Dao-Qiang, and Song-Can Chen. "Clustering incomplete data using kernel-based fuzzy c-means algorithm." Neural Processing Letters 18.3 (2003): 155-162.
  5. Ng, Andrew Y., Michael I. Jordan, and Yair Weiss. "On spectral clustering: Analysis and an algorithm." Advances in neural information processing systems. 2002.
  6. Sithara, E. P., and KA Abdul Nazeer. "ahybridkharmonic means with abcclustering algorithm using an optimal kvalue for high performance clustering."
  7. EMAMI, Hojjat, Sina DAMI, and Hosseinshirazi. "k-harmonic means data clustering with imperialist competitive algorithm."
  8. Thakare, Anuradha D., and Rohini S. Hanchate. "Introducing Hybrid model for Data Clustering using K-Harmonic Means and Gravitational Search Algorithms." International Journal of Computer Applications 88.17 (2014).
  9. Bankapalli, Jyothi, R. VenuBabu, and S. Anjali Devi. "Combining k-harmonic mean and hierarchical algorithms for robust and efficient data clustering with cohesion selfmerging." International Journal on Computer Science and Engineering 3.6 (2011): 2544-2553.
  10. Yadav, Ritu, and Anuradha Sharma. "Advanced methods to improve performance of k-means algorithm: A review." Global Journal of Computer Science and Technology 12.9 (2012).

Publication Details

Published in : Volume 3 | Issue 6 | July-August 2018
Date of Publication : 2018-08-30
License:  This work is licensed under a Creative Commons Attribution 4.0 International License.
Page(s) : 565-574
Manuscript Number : CSEIT1836106
Publisher : Technoscience Academy

ISSN : 2456-3307

Cite This Article :

Dr. Sumathy P, Senthilkumar P, "Comparative Analysis of Clustering Algorithm for Wind Power", International Journal of Scientific Research in Computer Science, Engineering and Information Technology (IJSRCSEIT), ISSN : 2456-3307, Volume 3, Issue 6, pp.565-574, July-August-2018.
Journal URL : http://ijsrcseit.com/CSEIT1836106

Article Preview

Follow Us

Contact Us