Sciweavers

1683 search results - page 59 / 337
» Learning with Mixtures of Trees
Sort
View
FLAIRS
2010
15 years 6 months ago
Generalized Non-impeding Noisy-AND Trees
To specify a Bayes net (BN), a conditional probability table (CPT), often of an effect conditioned on its n causes, needs assessed for each node. Its complexity is generally expon...
Yang Xiang
IJCAI
2003
15 years 5 months ago
Information Extraction from Web Documents Based on Local Unranked Tree Automaton Inference
Information extraction (IE) aims at extracting specific information from a collection of documents. A lot of previous work on 10 from semi-structured documents (in XML or HTML) us...
Raymond Kosala, Maurice Bruynooghe, Jan Van den Bu...
ML
2006
ACM
132views Machine Learning» more  ML 2006»
15 years 4 months ago
A suffix tree approach to anti-spam email filtering
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...
Rajesh Pampapathi, Boris Mirkin, Mark Levene
IJCSS
2000
79views more  IJCSS 2000»
15 years 4 months ago
Impact of learning set quality and size on decision tree performances
Abstract. The quality of a decision tree is usually evaluated through its complexity and its generalization accuracy. Tree-simpli
Marc Sebban, Richard Nock, Jean-Hugues Chauchat, R...
PODS
2010
ACM
170views Database» more  PODS 2010»
15 years 9 months ago
A learning algorithm for top-down XML transformations
A generalization from string to trees and from languages to translations is given of the classical result that any regular language can be learned from examples: it is shown that ...
Aurélien Lemay, Sebastian Maneth, Joachim N...