An advanced ilrcpsd technique for bridging the competency and cognitive skills of students in higher education

  • Abstract
  • Keywords
  • References
  • PDF
  • Abstract

    Data mining refers to the extraction of meaningful knowledge from large data sources as it may contain hidden potential facts. In general the analysis of data mining can either be predictive or descriptive. Predictive analysis of data mining interprets the inference of the existing results so as to identify the future outputs and the descriptive analysis of data mining interprets the intrinsic characteristics or nature of the data. Clustering is one of the descriptive analysis techniques of data mining which groups the objects of similar types in such a way that objects in a cluster are closer to each other than the objects of other clusters.  K-means is the most popular and widely used clustering algorithm that starts by selecting the k-random initial centroids as equal to number of clusters given by the user. It then computes the distance between initial centroids with the remaining data objects and groups the data objects into the cluster centroids with minimum distance. This process is repeated until there is no change in the cluster centroids or cluster members. But, still k-means has been suffered from several issues such as optimum number of k, random initial centroids, unknown number of iterations, global optimum solutions of clusters and more importantly the creation of meaningful clusters when dealing with the analysis of datasets from various domains. The accuracy involved with clustering should never be compromised. Thus, in this paper, a novel classification via clustering algorithm called Iterative Linear Regression Clustering with Percentage Split Distribution (ILRCPSD) is introduced as an alternate solution to the problems encountered in traditional clustering algorithms. The proposed algorithm is examined over an educational dataset to identify the hidden group of students having similar cognitive and competency skills.  The performance of the proposed algorithm is well-compared with the accuracy of the traditional k-means clustering in terms of building meaningful clusters and to prove its real time usefulness.

  • Keywords

    Pearson Correlation, EDM, Clustering, PSD, Silhouette Distance

  • References

      [1] Romero, Cristóbal, and Sebastián Ventura. "Educational data mining: a review of the state of the art." IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews) 40, no. 6 (2010): 601-618.

      [2] Allen, Karen Neuman, and Bruce D. Friedman. "Affective learning: A taxonomy for teaching social work values." Journal of Social Work Values and Ethics 7, no. 2 (2010): 1-12.

      [3] Bolin, A.U., Khramtsova, I. and Saarnio, D., "Using student journals to stimulate authentic learning: Balancing Bloom's cognitive and affective domains.” Teaching of Psychology (2005): 154-159.

      [4] Yadav, Jyoti, and Monika Sharma. "A Review of K-mean Algorithm." International Journal of Engineering Trends and Technology (2013): 2972-2976.

      [5] Wu, Xiaohong, Bin Wu, Jun Sun, Shengwei Qiu, and Xiang Li. "A hybrid fuzzy K-harmonic means clustering algorithm." Applied Mathematical Modelling 39 (2015): 3398-3409.

      [6] Prabha, K. Arun, and N. Karthikeyani Visalakshi. "Improved Particle Swarm Optimization Based K-Means Clustering IEEE (2014): 59-63.

      [7] Chawla, Sanjay, and Aristides Gionis. "k-means-: A Unified Approach to Clustering and Outlier Detection." In SIAM, (2013): 189-197.

      [8] Khandare, Anand D. "Modified K-means algorithm for emotional intelligence mining." IEEE (2015): 1-3.

      [9] Kou, Gang, Yi Peng, and Guoxun Wang. "Evaluation of clustering algorithms for financial risk analysis using MCDM methods." Information Sciences 275 (2014):1-12.

      [10] Ansari, Zahid, M. F. Azeem, Waseem Ahmed, and A. Vinaya Babu. "Quantitative evaluation of performance and validity indices for clustering the web navigational sessions." World of Computer Science and Information Technology Journal (2011): 217-226.





Article ID: 8984
DOI: 10.14419/ijet.v7i1.3.8984

Copyright © 2012-2015 Science Publishing Corporation Inc. All rights reserved.