Finding dependent test items: An information theory based approach

Proceedings of the 5th International Conference on Educational Data Mining, EDM 2012

Volumn , Issue , 2012, Pages

  Sun, Xiaoxun ^a  

^a Australian Council for Educational Research   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

DATA MINING; FORESTRY; INFORMATION THEORY; STUDENTS;

DEPENDENCY TREES; DISTANCE METRICS; ITEM SETS; NEW APPROACHES; RESPONSE DATA; SYNTHETIC DATASETS;

TREES (MATHEMATICS);

EID: 85084012936     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (4)

1. C. Chow and C. Liu. Approximating discrete probability distributions with dependence trees. IEEE Transactions on Information Theory, 14(3):462–467, 1968.
2. B. Cui, Y. Li, and Z. Zhang. Summarizing frequent patterns using profiles. In Database Systems for Advanced Applications, 11th International Conference, DASFAA, 2006.
3. N. Friedman, D. Geiger, and M. Goldszmid. Bayesian network classifiers. Machine Learning, 29:131–163, 1997.
4. K. Huang, I. King, and M. Lyu. Constructing a large node chow-liu tree based on frequent itemsets. In Proceedings of the International Conference on Neural Information Processing, 2002.