Sciweavers

1413 search results - page 208 / 283
» A Theory for Memory-Based Learning
Sort
View
WWW
2008
ACM
16 years 6 months ago
Ranking refinement and its application to information retrieval
We consider the problem of ranking refinement, i.e., to improve the accuracy of an existing ranking function with a small set of labeled instances. We are, particularly, intereste...
Rong Jin, Hamed Valizadegan, Hang Li
WWW
2007
ACM
16 years 6 months ago
Generative models for name disambiguation
Name ambiguity is a special case of identity uncertainty where one person can be referenced by multiple name variations in different situations or even share the same name with ot...
Yang Song, Jian Huang 0002, Isaac G. Councill, Jia...
KDD
2004
ACM
170views Data Mining» more  KDD 2004»
16 years 6 months ago
Why collective inference improves relational classification
Procedures for collective inference make simultaneous statistical judgments about the same variables for a set of related data instances. For example, collective inference could b...
David Jensen, Jennifer Neville, Brian Gallagher
CHI
2008
ACM
16 years 6 months ago
Experience sampling for building predictive user models: a comparative study
Experience sampling has been employed for decades to collect assessments of subjects' intentions, needs, and affective states. In recent years, investigators have employed au...
Ashish Kapoor, Eric Horvitz
LATA
2010
Springer
16 years 1 months ago
Three Learnable Models for the Description of Language
Abstract. Learnability is a vital property of formal grammars: representation classes should be defined in such a way that they are learnable. One way to build learnable represent...
Alexander Clark