1283 search results - page 50 / 257 » Learning Voting Trees |
ICML
1999
IEEE
14 years 8 months ago
1999
IEEE
Lbr is a lazy semi-naive Bayesian classi er learning technique, designed to alleviate the attribute interdependence problem of naive Bayesian classi cation. To classify a test exa...
ACL
2001
13 years 9 months ago
2001
Named entity (NE) recognition is a task in which proper nouns and numerical information in a document are detected and classified into categories such as person, organization, loc...
ICML
2003
IEEE
14 years 28 days ago
2003
IEEE
AUC(Area Under the Curve) of ROC(Receiver Operating Characteristics) has been recently used as a measure for ranking performanceof learning algorithms. In this paper, wepresent a ...
SAC
2005
ACM
14 years 1 months ago
2005
ACM
: This paper presents a system for induction of forest of functional trees from data streams able to detect concept drift. The Ultra Fast Forest of Trees (UFFT) is an incremental a...
ILP
1997
Springer
13 years 11 months ago
1997
Springer
Abstract. We present a logical approach to graph theoretical learning that is based on using alphabetic substitutions for modelling graph morphisms. A classi ed graph is represente...