András London
ABSTRACT
In this paper, we define a modified PageRank algorithm as a data mining technique with the aim of evaluating the achievements of students and generate a ranking between them. We applied our method to the data set of a complex administrational system that contains numerous well detailed data of several schools in public education. In order that the method can be applied, we constructed a directed, weighted network of students, where edges of the network represent the comparability of the students in an appropriate way. We compared the results of our method with the standard statistical techniques that are used for rating and ranking the students and observed that our method gives a clearer picture about their educational achievements. Further advantages of graph based data mining techniques in educational systems are also highlighted.
- S. Boccaletti, V. Latora, Y. Moreno, M. Chavez and D. U. Hwang, "Complex networks: Structure and dynamics", Physics reports, vol. 424, no. 4, pp. 175--308, 2006Google Scholar
Cross Ref
- E. Estrada. The structure of complex networks: theory and applications. New York, Oxford University Press, 2011 Google ScholarDigital Library
- M. E. J. Newman, "The structure and function of complex networks", SIAM Review vol. 45, no.2, pp. 167--256, 2003Google ScholarDigital Library
- S. Brin and L. Page, "The anatomy of a large-scale hypertextual web search engine", Computer networks and ISDN systems, vol. 30, no. 1, pp. 107--117, 1998 Google ScholarDigital Library
- P. Chen, H. Xie, S. Maslov and S. Redner, "Finding scientific gems with Google's PageRank algorithm", Journal of Informetrics, vol. 1, no. 1, pp. 8--15, 2007Google ScholarCross Ref
- D. Walker, H. Xie, K. K. Yan and S. Maslov, "Ranking scientific publications using a model of network traffic", Journal of Statistical Mechanics: Theory and Experiment, P06010, 2007Google ScholarCross Ref
- A. London, J. Németh and T. Németh, "Time-dependent network algorithm for ranking in sports", accepted for publication in Acta Cybernetica, 2014Google Scholar
- S. Motegi and N. Masuda, "A network-based dynamical ranking system for competitive sports", Scientific Reports, vol. 2, 2012Google ScholarCross Ref
- F. Radicchi, "Who is the best player ever? A complex network analysis of the history of professional tennis", PLoS One, vol. 6, no. 2, e17249, 2011Google ScholarCross Ref
- T. Csendes and E. Antal, "Pagerank based network algorithms for weighted graphs with applications to wine tasting and scientometrics", in Proc. of the 8th International Conference on Applied Informatics, 2010, pp. 209--216.Google Scholar
- A. London and T. Csendes, "HITS based network algorithm for evaluating the professional skills of wine tasters", in Proc. of the IEEE 8th International Symposium on Applied Computational Intelligence and Informatics, 2013, pp. 197--200.Google ScholarCross Ref
- C. Romero and S. Ventura, "Educational data mining: A survey from 1995 to 2005", Expert Systems with Applications, vol. 33, no.1, pp. 135--146, 2007 Google ScholarDigital Library
- J. R. Norris. Markov chains. New York, Cambridge University Press, 1998Google Scholar
- M. G. Kendall, "A new measure of rank correlation", Biometrika, vol. 30, pp. 81--93, 1938Google ScholarCross Ref
- J. M. Kleinberg, "Authoritative sources in a hyperlinked environment", Journal of the ACM, vol. 46, no. 5, pp. 604--632, 1999 Google ScholarDigital Library
- R. Lempel and S. Moran, "The stochastic approach for link-structure analysis (SALSA) and the TKC effect", Computer Networks, vol. 33, no. 1, pp. 387--401, 2000 Google ScholarDigital Library
Index Terms
- Student evaluation by graph based data mining of administrational systems of education
Recommendations
Mining fuzzy specific rare itemsets for education data
Association rule mining is an important data analysis method for the discovery of associations within data. There have been many studies focused on finding fuzzy association rules from transaction databases. Unfortunately, in the real world, one may ...
Mining uncertain data for constrained frequent sets
IDEAS '09: Proceedings of the 2009 International Database Engineering & Applications SymposiumData mining aims to search for implicit, previously unknown, and potentially useful pieces of information---such as sets of items that are frequently co-occurring together---that are embedded in data. The mined frequent sets can be used in the discovery ...
Mining Rank Data
The problem of frequent pattern mining has been studied quite extensively for various types of data, including sets, sequences, and graphs. Somewhat surprisingly, another important type of data, namely rank data, has received very little attention in ...
Comments