1986 search results - page 173 / 398 » Modelling Learning Subjects as Relationships |
154
click to vote
KDD
2002
ACM
16 years 5 months ago
2002
ACM
In this paper we propose a scaling-up method that is applicable to essentially any induction algorithm based on discrete search. The result of applying the method to an algorithm ...
193
click to vote
COLT
1994
Springer
15 years 8 months ago
1994
Springer
Inductive Logic Programming (ILP) involves the construction of first-order definite clause theories from examples and background knowledge. Unlike both traditional Machine Learnin...
250
click to vote
ICDE
2005
IEEE
16 years 6 months ago
2005
IEEE
Schema Matching is the problem of identifying corresponding elements in different schemas. Discovering these correspondences or matches is inherently difficult to automate. Past s...
155
click to vote
CORR
2002
Springer
15 years 4 months ago
2002
Springer
This position paper argues that the Baldwin effect is widely misunderstood by the evolutionary computation community. The misunderstandings appear to fall into two general categor...
149
click to vote
UAI
2003
15 years 6 months ago
2003
Many practitioners who use EM and related algorithms complain that they are sometimes slow. When does this happen, and what can be done about it? In this paper, we study the gener...