Sciweavers

3963 search results - page 518 / 793
» Designing for learning
Sort
View
120
Voted
ICML
2007
IEEE
16 years 5 months ago
Efficient inference with cardinality-based clique potentials
Many collective labeling tasks require inference on graphical models where the clique potentials depend only on the number of nodes that get a particular label. We design efficien...
Rahul Gupta, Ajit A. Diwan, Sunita Sarawagi
ICML
2006
IEEE
16 years 5 months ago
Graph model selection using maximum likelihood
In recent years, there has been a proliferation of theoretical graph models, e.g., preferential attachment and small-world models, motivated by real-world graphs such as the Inter...
Adam Kalai, Ivona Bezáková, Rahul Sa...
SIGCSE
2009
ACM
119views Education» more  SIGCSE 2009»
16 years 5 months ago
The summer academy for advancing deaf and hard of hearing in computing
Deaf and hard of hearing students are an underrepresented group in computing and face extra challenges in university-level computing courses. This paper describes a 9-week Summer ...
Anna Cavender, Richard E. Ladner, Robert I. Roth
139
Voted
KDD
2006
ACM
170views Data Mining» more  KDD 2006»
16 years 5 months ago
Classification features for attack detection in collaborative recommender systems
Collaborative recommender systems are highly vulnerable to attack. Attackers can use automated means to inject a large number of biased profiles into such a system, resulting in r...
Robin D. Burke, Bamshad Mobasher, Chad Williams, R...
KDD
2006
ACM
165views Data Mining» more  KDD 2006»
16 years 5 months ago
Training linear SVMs in linear time
Linear Support Vector Machines (SVMs) have become one of the most prominent machine learning techniques for highdimensional sparse data commonly encountered in applications like t...
Thorsten Joachims