Divisive Approach of Clustering for Educational Data

In the field of data mining, clustering of educational data has not given much of the importance. Considering the growth of educational field as a business, clustering of educational data must be focused as it can give effective results as in the case of mining enrolled students on the basis of education they undertake. A new algorithm is proposed and implemented by us for clustering educational data. This algorithm is based on a continuous looping procedure. Raw dataset is assigned to clustering algorithm initially and a novel cluster is identified for partition whose cluster high degree is less. Then improvement of degree of cluster is carried out. In this algorithm on the basis of homogeneity, cluster high degree is defined. Experiment is carried out on educational data, which provides good high degree clusters.

[1]  Andrew W. Moore,et al.  X-means: Extending K-means with Efficient Estimation of the Number of Clusters , 2000, ICML.

[2]  Andreas Rudolph,et al.  Techniques of Cluster Algorithms in Data Mining , 2002, Data Mining and Knowledge Discovery.

[3]  Jianhong Wu,et al.  Subspace clustering for high dimensional categorical data , 2004, SKDD.

[4]  Igor Jurisica,et al.  Binary tree-structured vector quantization approach to clustering and visualizing microarray data , 2002, ISMB.

[5]  Cevdet Aykanat,et al.  Hypergraph Models and Algorithms for Data-Pattern-Based Clustering , 2004, Data Mining and Knowledge Discovery.

[6]  Jinyuan You,et al.  CLOPE: a fast and effective clustering algorithm for transactional data , 2002, KDD.

[7]  Ke Wang,et al.  Clustering transactions using large items , 1999, CIKM '99.

[8]  Sudipto Guha,et al.  ROCK: a robust clustering algorithm for categorical attributes , 1999, Proceedings 15th International Conference on Data Engineering (Cat. No.99CB36337).

[9]  G. Karypis,et al.  Clustering In A High-Dimensional Space Using Hypergraph Models , 2004 .

[10]  Adrian E. Raftery,et al.  How Many Clusters? Which Clustering Method? Answers Via Model-Based Cluster Analysis , 1998, Comput. J..

[11]  Jayanta Basak,et al.  Interpretable hierarchical clustering by constructing an unsupervised decision tree , 2005, IEEE Transactions on Knowledge and Data Engineering.

[12]  Anil K. Jain,et al.  Algorithms for Clustering Data , 1988 .

[13]  Geoffrey J. McLachlan,et al.  Finite Mixture Models , 2019, Annual Review of Statistics and Its Application.

[14]  Padhraic Smyth,et al.  Model selection for probabilistic clustering using cross-validated likelihood , 2000, Stat. Comput..

[15]  Heikki Mannila,et al.  Probabilistic modeling of transaction data with applications to profiling, visualization, and prediction , 2001, KDD '01.

[16]  Jiawei Han,et al.  CLARANS: A Method for Clustering Objects for Spatial Data Mining , 2002, IEEE Trans. Knowl. Data Eng..

[17]  Renée J. Miller,et al.  LIMBO: Scalable Clustering of Categorical Data , 2004, EDBT.

[18]  Miguel Á. Carreira-Perpiñán,et al.  Practical Identifiability of Finite Mixtures of Multivariate Bernoulli Distributions , 2000, Neural Computation.

[19]  Qiang Yang,et al.  Cluster cores-based clustering for high dimensional data , 2004, Fourth IEEE International Conference on Data Mining (ICDM'04).