3250 search results - page 122 / 650 » Parameterized Learning Complexity |
123
Voted
ECML
1998
Springer
15 years 6 months ago
1998
Springer
: Image understanding often requires extensive background knowledge. The problem addressed in this paper is such knowledge can be acquired. We discuss how relational machine learni...
122
click to vote
KDD
2006
ACM
16 years 2 months ago
2006
ACM
We describe a data mining system to detect frauds that are camouflaged to look like normal activities in domains with high number of known relationships. Examples include accounti...
115
click to vote
ML
2000
ACM
15 years 2 months ago
2000
ACM
Twenty-two decision tree, nine statistical, and two neural network algorithms are compared on thirty-two datasets in terms of classification accuracy, training time, and (in the ca...
132
click to vote
JAIR
2002
15 years 2 months ago
2002
We develop, analyze, and evaluate a novel, supervised, specific-to-general learner for a simple temporal logic and use the resulting algorithm to learn visual event definitions fr...
122
click to vote
NIPS
2004
15 years 3 months ago
2004
act out the core search problem of active learning schemes, to better understand the extent to which adaptive labeling can improve sample complexity. We give various upper and low...