Sciweavers

15 search results - page 3 / 3
» On the Hardness of Learning with Rounding over Small Modulus
Sort
View
PROMISE
2010
14 years 4 months ago
On the value of learning from defect dense components for software defect prediction
BACKGROUND: Defect predictors learned from static code measures can isolate code modules with a higher than usual probability of defects. AIMS: To improve those learners by focusi...
Hongyu Zhang, Adam Nelson, Tim Menzies
MM
2009
ACM
203views Multimedia» more  MM 2009»
15 years 2 months ago
Distance metric learning from uncertain side information with application to automated photo tagging
Automated photo tagging is essential to make massive unlabeled photos searchable by text search engines. Conventional image annotation approaches, though working reasonably well o...
Lei Wu, Steven C. H. Hoi, Rong Jin, Jianke Zhu, Ne...
KDD
2004
ACM
154views Data Mining» more  KDD 2004»
15 years 10 months ago
Diagnosing extrapolation: tree-based density estimation
There has historically been very little concern with extrapolation in Machine Learning, yet extrapolation can be critical to diagnose. Predictor functions are almost always learne...
Giles Hooker
KDD
2008
ACM
193views Data Mining» more  KDD 2008»
15 years 10 months ago
A family of dissimilarity measures between nodes generalizing both the shortest-path and the commute-time distances
This work introduces a new family of link-based dissimilarity measures between nodes of a weighted directed graph. This measure, called the randomized shortest-path (RSP) dissimil...
Luh Yen, Marco Saerens, Amin Mantrach, Masashi Shi...
MOBICOM
2006
ACM
15 years 3 months ago
Analysis and implications of student contact patterns derived from campus schedules
Characterizing mobility or contact patterns in a campus environment is of interest for a variety of reasons. Existing studies of these patterns can be classified into two basic a...
Vikram Srinivasan, Mehul Motani, Wei Tsang Ooi