Sciweavers

2180 search results - page 43 / 436
» Algorithms for discovering bucket orders from data
Sort
View
ICDM
2005
IEEE
199views Data Mining» more  ICDM 2005»
14 years 2 months ago
CoLe: A Cooperative Data Mining Approach and Its Application to Early Diabetes Detection
We present CoLe, a cooperative data mining approach for discovering hybrid knowledge. It employs multiple different data mining algorithms, and combines results from them to enhan...
Jie Gao, Jörg Denzinger, Robert C. James
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
AIRS
2006
Springer
14 years 7 days ago
Natural Document Clustering by Clique Percolation in Random Graphs
Document clustering techniques mostly depend on models that impose explicit and/or implicit priori assumptions as to the number, size, disjunction characteristics of clusters, and/...
Wei Gao, Kam-Fai Wong
SODA
2004
ACM
124views Algorithms» more  SODA 2004»
13 years 10 months ago
Family trees: an ordered dictionary with optimal congestion, locality, degree, and search time
We consider the problem of storing an ordered dictionary data structure over a distributed set of nodes. In contrast to traditional sequential data structures, distributed data st...
Kevin C. Zatloukal, Nicholas J. A. Harvey
ICDCS
2007
IEEE
14 years 2 months ago
Uniform Data Sampling from a Peer-to-Peer Network
Uniform random sample is often useful in analyzing data. Usually taking a uniform sample is not a problem if the entire data resides in one location. However, if the data is distr...
Souptik Datta, Hillol Kargupta