Sciweavers

436 search results - page 64 / 88
» Mining autograding data in computer science education
Sort
View
SDM
2009
SIAM
175views Data Mining» more  SDM 2009»
15 years 6 months ago
Low-Entropy Set Selection.
Most pattern discovery algorithms easily generate very large numbers of patterns, making the results impossible to understand and hard to use. Recently, the problem of instead sel...
Hannes Heikinheimo, Jilles Vreeken, Arno Siebes, H...
EDM
2010
154views Data Mining» more  EDM 2010»
14 years 8 months ago
Can We Get Better Assessment From A Tutoring System Compared to Traditional Paper Testing? Can We Have Our Cake (Better Assessme
Dynamic assessment (DA) has been advocated as an interactive approach to conduct assessments to students in the learning systems as it can differentiate student proficiency at a fi...
Mingyu Feng, Neil T. Heffernan
WEBI
2004
Springer
15 years 3 months ago
An Integrated Approach to Discovery in Complex Information Spaces
As the amount of available data continues to increase, more and more effective means for discovering important patterns and relationships within that data are required. Although t...
Daryl H. Hepting, Cory J. Butz
CORR
2004
Springer
118views Education» more  CORR 2004»
14 years 9 months ago
Understanding Search Trees via Statistical Physics
We study the random m-ary search tree model (where m stands for the number of branches of the search tree), an important problem for data storage in computer science, using a varie...
Satya N. Majumdar, David S. Dean, Paul L. Krapivsk...
PAKDD
2009
ACM
134views Data Mining» more  PAKDD 2009»
15 years 6 months ago
On Link Privacy in Randomizing Social Networks.
Many applications of social networks require relationship anonymity due to the sensitive, stigmatizing, or confidential nature of relationship. Recent work showed that the simple ...
Xiaowei Ying, Xintao Wu