59 search results - page 5 / 12 » Learning Tree Augmented Naive Bayes for Ranking |
ECML
2007
Springer
15 years 5 months ago
2007
Springer
Given a binary classification task, a ranker sorts a set of instances from highest to lowest expectation that the instance is positive. We propose a lexicographic ranker, LexRank,...
107
click to vote
ML
2006
ACM
14 years 11 months ago
2006
ACM
We present an approach to email filtering based on the suffix tree data structure. A method for the scoring of emails using the suffix tree is developed and a number of scoring and...
103
click to vote
SIGIR
2004
ACM
15 years 5 months ago
2004
ACM
In this paper we study the problem of finding most topical named entities among all entities in a document, which we refer to as focused named entity recognition. We show that th...
IJAR
2010
14 years 9 months ago
2010
In this paper we present TANC, i.e., a tree-augmented naive credal classifier based on imprecise probabilities; it models prior near-ignorance via the Extreme Imprecise Dirichlet ...
JMLR
2010
14 years 6 months ago
2010
Massive Online Analysis (MOA) is a software environment for implementing algorithms and running experiments for online learning from evolving data streams. MOA includes a collecti...