Sciweavers

1209 search results - page 94 / 242
» Semi-Supervised Learning with Trees
Sort
View
PAKDD
2005
ACM
96views Data Mining» more  PAKDD 2005»
14 years 1 months ago
Kernels over Relational Algebra Structures
Abstract. In this paper we present a novel and general framework based on concepts of relational algebra for kernel-based learning over relational schema. We exploit the notion of ...
Adam Woznica, Alexandros Kalousis, Melanie Hilario
ILP
2004
Springer
14 years 1 months ago
First Order Random Forests with Complex Aggregates
Random forest induction is a bagging method that randomly samples the feature set at each node in a decision tree. In propositional learning, the method has been shown to work well...
Celine Vens, Anneleen Van Assche, Hendrik Blockeel...
AGI
2008
13 years 9 months ago
Transfer Learning and Intelligence: an Argument and Approach
In order to claim fully general intelligence in an autonomous agent, the ability to learn is one of the most central capabilities. Classical machine learning techniques have had ma...
Matthew E. Taylor, Gregory Kuhlmann, Peter Stone
WWW
2005
ACM
14 years 8 months ago
Focused crawling by exploiting anchor text using decision tree
Focused crawlers are considered as a promising way to tackle the scalability problem of topic-oriented or personalized search engines. To design a focused crawler, the choice of s...
Jun Li, Kazutaka Furuse, Kazunori Yamaguchi
ICDIM
2007
IEEE
14 years 2 months ago
Pattern-based decision tree construction
Learning classifiers has been studied extensively the last two decades. Recently, various approaches based on patterns (e.g., association rules) that hold within labeled data hav...
Dominique Gay, Nazha Selmaoui, Jean-Françoi...