Sciweavers

2027 search results - page 327 / 406
» Learning and Generalization with the Information Bottleneck
Sort
View
SIGCSE
2009
ACM
107views Education» more  SIGCSE 2009»
15 years 10 months ago
Foss 101: engaging introductory students in the open source movement
Can engaging students in free and open source software (FOSS) pique their interest in computer science? This paper describes an introductory computer science course that introduce...
Ralph Morelli, Trishan R. de Lanerolle
KDD
2008
ACM
128views Data Mining» more  KDD 2008»
15 years 10 months ago
Scaling up text classification for large file systems
: We combine the speed and scalability of information retrieval with the generally superior classification accuracy offered by machine learning, yielding a two-phase text classifie...
George Forman, Shyamsundar Rajaram
KDD
2008
ACM
192views Data Mining» more  KDD 2008»
15 years 10 months ago
Partial least squares regression for graph mining
Attributed graphs are increasingly more common in many application domains such as chemistry, biology and text processing. A central issue in graph mining is how to collect inform...
Hiroto Saigo, Koji Tsuda, Nicole Krämer
KDD
2005
ACM
168views Data Mining» more  KDD 2005»
15 years 10 months ago
Nomograms for visualizing support vector machines
We propose a simple yet potentially very effective way of visualizing trained support vector machines. Nomograms are an established model visualization technique that can graphica...
Aleks Jakulin, Martin Mozina, Janez Demsar, Ivan B...
KDD
2004
ACM
126views Data Mining» more  KDD 2004»
15 years 10 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...