Sciweavers

1209 search results - page 87 / 242
» Semi-Supervised Learning with Trees
Sort
View
ECAI
2004
Springer
13 years 11 months ago
Yet More Efficient EM Learning for Parameterized Logic Programs by Inter-Goal Sharing
Abstract. In previous research, we presented a dynamicprogramming-based EM (expectation-maximization) algorithm for parameterized logic programs, which is based on the structure sh...
Yoshitaka Kameya, Taisuke Sato, Neng-Fa Zhou
AIIA
1995
Springer
13 years 11 months ago
Learning Programs in Different Paradigms using Genetic Programming
Genetic Programming (GP) is a method of automatically inducing programs by representing them as parse trees. In theory, programs in any computer languages can be translated to par...
Man Leung Wong, Kwong-Sak Leung
ISSRE
2007
IEEE
13 years 9 months ago
Using Machine Learning to Support Debugging with Tarantula
Using a specific machine learning technique, this paper proposes a way to identify suspicious statements during debugging. The technique is based on principles similar to Tarantul...
Lionel C. Briand, Yvan Labiche, Xuetao Liu
ECML
2003
Springer
14 years 1 months ago
Logistic Model Trees
Abstract. Tree induction methods and linear models are popular techniques for supervised learning tasks, both for the prediction of nominal classes and continuous numeric values. F...
Niels Landwehr, Mark Hall, Eibe Frank
ECAI
2006
Springer
13 years 11 months ago
Semantic Tree Kernels to Classify Predicate Argument Structures
Recent work on Semantic Role Labeling (SRL) has shown that syntactic information is critical to detect and extract predicate argument structures. As syntax is expressed by means of...
Alessandro Moschitti, Bonaventura Coppola, Daniele...