Sciweavers

2090 search results - page 116 / 418
» Learning with attribute costs
Sort
View
COLING
2002
13 years 9 months ago
Unsupervised Named Entity Classification Models and their Ensembles
This paper proposes an unsupervised learning model for classifying named entities. This model uses a training set, built automatically by means of a small-scale named entity dicti...
Jae-Ho Kim, In-Ho Kang, Key-Sun Choi
INLG
2004
Springer
14 years 2 months ago
Overgenerating Referring Expressions Involving Relations and Booleans
Abstract. We present a new approach to the generation of referring expressions containing attributive, type and relational properties combined by conjunctions, disjunctions and neg...
Sebastian Varges
KES
2004
Springer
14 years 2 months ago
Mining Positive and Negative Fuzzy Association Rules
While traditional algorithms concern positive associations between binary or quantitative attributes of databases, this paper focuses on mining both positive and negative fuzzy ass...
Peng Yan, Guoqing Chen, Chris Cornelis, Martine De...
PERVASIVE
2011
Springer
13 years 11 hour ago
Using Decision-Theoretic Experience Sampling to Build Personalized Mobile Phone Interruption Models
We contribute a method for approximating users’ interruptibility costs to use for experience sampling and validate the method in an application that learns when to automatically ...
Stephanie Rosenthal, Anind K. Dey, Manuela M. Velo...
ML
1998
ACM
13 years 8 months ago
On Restricted-Focus-of-Attention Learnability of Boolean Functions
In the k-Restricted-Focus-of-Attention (k-RFA) model, only k of the n attributes of each example are revealed to the learner, although the set of visible attributes in each example...
Andreas Birkendorf, Eli Dichterman, Jeffrey C. Jac...