Full-Text Search:
Home|Journal Papers|About CNKI|User Service|FAQ|Contact Us|中文
《Journal of Data Acquisition and Processing》 2015-01
Add to Favorite Get Latest Update

Discovery of Matrix-Weighted Positive and Negative Association Patterns from Educational Data Based on Mutual Information

Yu Ru;Huang Mingxuan;Huang Lixia;Department of Culture and Transmission,Guangxi College of Education;Office of Administrative Management,Guangxi College of Education;Office of Scientific Research Management,Guangxi College of Education;Teaching Affairs Office,Guangxi College of Education;  
The mutual information model is introduced into the educational data association patterns mining.A new mining algorithm of the matrix-weighted positive and negative association patterns from educational data is presented based on mutual information model,and the related theorems and their proof are given.The algorithm overcomes the defects of the existing algorithms for weighted association patterns.It pays special attention to the various weights of the itemset in database,and also uses a new evaluation standard of positive and negative association patterns.Hence the positive and negative association patterns obtained from the educational data get closer to reality.Analysis on these patterns shows that,the potential educational and teaching rules,as well as educational development trend are discovered,providing a scientific basis for management,decision-making and teaching reform in education.Experiment results on real educational data demonstrate that the proposed algorithm is effective and reliable,with important potential value in the educational data processing and analyzing.
【Fund】: 国家自然科学基金(61262028)资助项目;; 广西自然科学基金(2012GXNSFAA053235)资助项目;; 广西教育厅科研(2013LX236 201203YB225)资助项目;; 广西高校优秀人才计划(桂教人[2011]40号)资助项目
【CateGory Index】: TP311.13
Download(CAJ format) Download(PDF format)
CAJViewer7.0 supports all the CNKI file formats; AdobeReader only supports the PDF format.
©2006 Tsinghua Tongfang Knowledge Network Technology Co., Ltd.(Beijing)(TTKN) All rights reserved