Journal of Instrumentation Technology & Innovations
Mining Educational Data to Analyze Students‟ Performance
Abstract
Data Mining Strategy can be utilized in various fields to extricate the necessary information from the huge dataset. One of the useful fields of data mining is education. It is useful in educational field so that a pattern can be generated from the data. Placement of a student in graduation plays a very important role in the life of a student. Prediction whether the student will be able to get placed or not becomes the significant use of educational data mining. Various algorithms like Decision Tree Algorithm, K Nearest Neighbor algorithm and Random Forest Algorithm are used to predict the result. It helped to understand the significance and impact of various algorithm for specific dataset in terms of accuracy.References (26)
- Surjeet Kumar Yadav, Brijesh Bharadwaj, Saurabh Pal; Data Mining Application:A Comparative study for predicting student’s performance; International Journal of Innovative Te chnology & Creative Engineering (ISSN:2045-711) VOL.1 NO.12 DECEMBER, 2012
- Jyoti Bansode; Mining Educational Data to Predict Student‘s Academic Performance; International Journal on Recent and Innovation Trends in Computing and Communication Volume: 4 Issue: 1, 2016;
- Amjad Abu Saa; Educa tional Data Mining & Students’ Performance Prediction; International Journal of Advanced Computer Science and Applications Vol. 7, No. 5, 2016 0 10 20 30 40 50 60 70 80 KNN Random Forest Decision Tree Accuracy Score by Algorithms Mining Educational Data to Analyze Students Performance Bhardwaj and Moud © STM Journals 2021. All Rights Reserved 16
- Mohammed M. Abu Tair, Alaa M. El -Hales; Mining Educational Data to Improve Students’ Performance; International J ournal of Information and Communication Technology Research Volume 2 No. 2, 2012.
- Hart P (1968) The condensed nearest neighbor rule. IEEE Trans Inform Theory 14:515–516
- Agrawal R, Srikant R (1994) Fast algorithms for mining association rules. In: Proceedings of the 20th VLDB conference, pp 487–499
- Ahmed S, Coenen F, Leng PH (2006) Tree -based partitioning of date for association rule mining. Knowl Inf Syst 10(3):315–331
- Banerjee A, Merugu S, Dhillon I, Ghosh J (2005) Clustering with Bregman divergen ces. J Mach Learn Res 6:1705–1749
- Bezdek JC, Chuah SK, Leep D (1986) Generalized k -nearest neighbor rules. Fuzzy Sets Syst 18(3):237–256.
- Bloch DA, Olshen RA, Walker MG (2002) Risk estimation for classification trees. J Comput Graph Stat 11:263–288
- Bonchi F, Lucchese C (2006) On condensed representations of constrained frequent patterns. Knowl Inf Syst 9(2):180–201
- Breiman L (1968) Probability theory. Addison -Wesley, Reading. Republished (1991) in Classics of mathematics. SIAM, Philadelphia
- Breiman L (1999) Prediction games and arcing classifiers. Neural Comput 11(7):1493–1517
- Breiman L, Friedman JH, Olshen RA, Stone CJ (1984) Classification and regression trees. Wadsworth, Belmont
- Brin S, Page L (1998) The anatomy of a large -scale hypertextualWeb Search Sng ine. Comput Networks
- https://data-flair.training/blogs/data-mining-algorithms/
- https://www.kdnuggets.com/2015/05/top-10-data-mining-algorithms-explained.html/3
- Umarani, J., and Karpagam, K., “Investigation of User Identification Methods in Pre-Processing Phase of Web Usage Mining.” International Journal of Engineering Science and Computing, 2016, Vol.6, Issue.08, pp: 2954-2956.
- Sriram, R., and Malliga, R., “Innovative Pre -Processing Technique and Efficient Unique User Identification Algorithm for Web Usage Mining.” International Journal of Advanced Research in Computer Science and Software Engineering, 2016, Vol.6, Issue.02, pp: 85-91.
- Rathi, A., and Raipurkar, A., “Approach for processing of Web Usage Data.” International Research Journal of Engineering and Technology (IRJET), 2016, Vol.3, Issue.07, pp: 339-343
- https://en.wikipedia.org/wiki/Data_mining#cite_note-10
- Kuramochi M, Karypis G (2005) Gene Classification usi ng Expression Profiles: A Feasibility Study. Int J Artif Intell Tools 14(4):641–660
- Gondek D, Hofmann T (2007) Non-redundant data clustering. Knowl Inf Syst 12(1):1–24
- Fung G, Stoeckel J (2007) SVM feature selection for classification of SPECT images of Alzheimer’s disease using spatial information. Knowl Inf Syst 11(2):243–258
- Langville AN, Meyer CD (2006) Google’s PageRank and beyond: the science of search engine rankings. Princeton University Press, Princeton
- Washio T, Nakanishi K, Motoda H (2005) Associ ation rules based on levelwise subspace clustering. In: Proceedings. of 9th European conference on principles and practice of knowledge discovery in databases. LNAI, vol 3721, pp. 692–700 Springer, Heidelberg