Sciweavers

4523 search results - page 16 / 905
» Using randomization in the teaching of data structures and a...
Sort
View
AIED
2005
Springer
14 years 2 months ago
Educational Data Mining: a Case Study
In this paper, we show how using data mining algorithms can help discovering pedagogically relevant knowledge contained in databases obtained from Web-based educational systems. Th...
Agathe Merceron, Kalina Yacef
ICOIN
2004
Springer
14 years 1 months ago
On Generating Random Network Structures: Connected Graphs
Abstract. In this paper we present the set of base algorithms for generating connected random graphs (RG). RG can be used for testing different algorithms on networks. The fast al...
Alexey S. Rodionov, Hyunseung Choo
FIMI
2004
175views Data Mining» more  FIMI 2004»
13 years 10 months ago
CT-PRO: A Bottom-Up Non Recursive Frequent Itemset Mining Algorithm Using Compressed FP-Tree Data Structure
Frequent itemset mining (FIM) is an essential part of association rules mining. Its application for other data mining tasks has also been recognized. It has been an active researc...
Yudho Giri Sucahyo, Raj P. Gopalan
SIGCSE
2004
ACM
188views Education» more  SIGCSE 2004»
14 years 1 months ago
Buffer pools and file processing projects for an undergraduate data structures course
This paper presents a family of programming projects appropriate to a sophomore-level data structures course, centered around the concept of a buffer pool serving as the access i...
Clifford A. Shaffer