Sciweavers

4090 search results - page 677 / 818
» Blended Learning Design
Sort
View
KDD
2004
ACM
126views Data Mining» more  KDD 2004»
14 years 9 months ago
Turning CARTwheels: an alternating algorithm for mining redescriptions
We present an unusual algorithm involving classification trees-CARTwheels--where two trees are grown in opposite directions so that they are joined at their leaves. This approach ...
Naren Ramakrishnan, Deept Kumar, Bud Mishra, Malco...
KDD
2004
ACM
302views Data Mining» more  KDD 2004»
14 years 9 months ago
Redundancy based feature selection for microarray data
In gene expression microarray data analysis, selecting a small number of discriminative genes from thousands of genes is an important problem for accurate classification of diseas...
Lei Yu, Huan Liu
KDD
2004
ACM
162views Data Mining» more  KDD 2004»
14 years 9 months ago
Discovering Links Between Lexical and Surface Features in Questions and Answers
Information retrieval systems, based on keyword match, are evolving to question answering systems that return short passages or direct answers to questions, rather than URLs point...
Soumen Chakrabarti
KDD
2003
ACM
243views Data Mining» more  KDD 2003»
14 years 9 months ago
Accurate decision trees for mining high-speed data streams
In this paper we study the problem of constructing accurate decision tree models from data streams. Data streams are incremental tasks that require incremental, online, and any-ti...
João Gama, Pedro Medas, Ricardo Rocha
KDD
2003
ACM
135views Data Mining» more  KDD 2003»
14 years 9 months ago
Efficiently handling feature redundancy in high-dimensional data
High-dimensional data poses a severe challenge for data mining. Feature selection is a frequently used technique in preprocessing high-dimensional data for successful data mining....
Lei Yu, Huan Liu