CFP last date
20 January 2025
Reseach Article

A Study of Out of School Children Problem in Rajasthan using K-means clustering with Genetic Algorithm

by Astha Pareek, Amita Sharma, Manish Gupta
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 144 - Number 8
Year of Publication: 2016
Authors: Astha Pareek, Amita Sharma, Manish Gupta
10.5120/ijca2016910403

Astha Pareek, Amita Sharma, Manish Gupta . A Study of Out of School Children Problem in Rajasthan using K-means clustering with Genetic Algorithm. International Journal of Computer Applications. 144, 8 ( Jun 2016), 9-16. DOI=10.5120/ijca2016910403

@article{ 10.5120/ijca2016910403,
author = { Astha Pareek, Amita Sharma, Manish Gupta },
title = { A Study of Out of School Children Problem in Rajasthan using K-means clustering with Genetic Algorithm },
journal = { International Journal of Computer Applications },
issue_date = { Jun 2016 },
volume = { 144 },
number = { 8 },
month = { Jun },
year = { 2016 },
issn = { 0975-8887 },
pages = { 9-16 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume144/number8/25198-2016910403/ },
doi = { 10.5120/ijca2016910403 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T23:47:04.821221+05:30
%A Astha Pareek
%A Amita Sharma
%A Manish Gupta
%T A Study of Out of School Children Problem in Rajasthan using K-means clustering with Genetic Algorithm
%J International Journal of Computer Applications
%@ 0975-8887
%V 144
%N 8
%P 9-16
%D 2016
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Clustering technique has been broadly used in numerous disciplines, such as science, statistic, software engineering and other social sciences in order to identify natural groups in large amounts of data. K-means is one of the most generally used partitioning clustering algorithms that tries to locate a user specific number of clusters (k), which are represented by their centroids, by minimizing the square error function. There are two straightforward approaches to cluster center initialization i.e. either to choose the initial values arbitrarily or else to choose the first k samples of the data points. Both approaches cause the algorithm to converge to sub optimal solutions. In contrast Genetic algorithm is one of the most frequently used transformative calculations which perform worldwide research to discover the result to a clustering issue. The algorithm normally begins with an arrangement of haphazardly developed individuals called the populace and design consecutive, new eras of the populace by genetic operations for example population selection, fitness function, crossover and mutation. This paper compares K-means and genetic algorithm based data clustering. A new algorithm is proposed known as genetic algorithm K-means (GAKM).Comparison was done of the basis of external, internal and time complexity.

References
  1. XIAO FENG LI., CHAN XIN., and LI LI YANG. 2010. Study of Data Ming Classification based on Genetic Algorithm”, 20IO 3rd International Conference on Advanced Computer Theory and Engineering(ICACTE), 978-1-4244-6542-2/$26.00 © 2010 IEEE
  2. BARAHATE SACHIN R and SHELAKE VIJAY M. 2012. A survey and future vision of data mining in educational field, 978-0-7695-4640-7/12,IEEE.
  3. A. K. Jain and R. C. DUBES. 1988. Algorithms for Clustering Data. Englewood Cliffs, NJ: Prentice-Hall..
  4. S. Z. SELIM and M. A. ISMAIL. 1984.K-means type algorithms: a generalized convergence theorem and characterization of local optimality, in IEEE Transaction on Pattern Analysis and Machine Intelligence, vol. 6, No. 1, 81--87.
  5. JIEMING ZHOU., J.G., and X.CHEN. 2009. An Enhancement of K-means Clustering Algorithm, in Business Intelligence and Financial Engineering, BIFE '09. International Conference on, Beijing.
  6. S. RAY., and R. H. TURI. 1999. Determination of number of clusters in k-means clustering and application in colour image segmentation, In Proceedings of the 4th International Conference on Advances in Pattern Recognition and Digital Techniques, 1999, 137-143.
  7. WANG, J., and X, SU. 2011. An improved K-means clustering algorithm, In 3rd International Conference on Communication Software and Networks (ICCSN), Xi'an.
  8. DONG, J., and M. QI. 2009. K-means Optimization clustering algorithm, in 3rd International Conference Algorithm for Solving Clustering Problem," in Second International Workshop on Knowledge Discovery and Data Mining (WKDD), Moscow.
  9. YOGITA CHAUHAN., VAIBHAV CHAURASIA., and CHETAN AGARWAL. 2014. A Survey Of K-Means And GA-KM The Hybrid Clustering Algorithm, International journal of scientific and technology research volume 3, issue 6, ISSN 2277-8616.
  10. JENN-LONG, LIU., YU-TZU HSU., and CHIH-LUNG. 2012.Development of Evolutionary Data Mining Algorithms and their Applications to Cardiac Disease Diagnosis”, WCCI 2012 IEEE World Congress on Computational Intelligence.
  11. RAJASHREE DASH., and RASMITADAS. 2012. Comparative Analysis of K-means and Genetic Algorithm Based Data Clustering, International Journal of Advanced Computer and Mathematical Sciences ISSN 2230-9624. Vol 3, Issue 2, 257-265.
  12. MUKHERJEE D. 2011. Reducing out-of-school children in India, National University of Educational Planning and Administration, Delhi.
  13. BASUMATARY R. 2012. School dropout across Indian state and UTs: An econometric study, Int. Res. J. Social Sci., Vol. 1(4), 28-35.
  14. UNESCO www.unesco.org(2013)
  15. BOKOVA., and BUSH. 2012. Literacy is key to unlocking the cycle of poverty, at http://www.chron.com/ opinion/outlook/article /Literacy-is-key-to-unlocking-the -cycle-of-poverty-3848564. php (2012)
Index Terms

Computer Science
Information Sciences

Keywords

Clustering K-means Genetic Algorithm Dropout never enrollment.