Sciweavers

121 search results - page 6 / 25
» Iterative Learning from Positive Data and Negative Counterex...
Sort
View
EUROCOLT
1999
Springer
13 years 12 months ago
Mind Change Complexity of Learning Logic Programs
The present paper motivates the study of mind change complexity for learning minimal models of length-bounded logic programs. It establishes ordinal mind change complexity bounds ...
Sanjay Jain, Arun Sharma
IEAAIE
2001
Springer
14 years 5 days ago
Selecting a Relevant Set of Examples to Learn IE-Rules
The growing availability of online text has lead to an increase in the use of automatic knowledge acquisition approaches from textual data, as in Information Extraction (IE). Some ...
Jordi Turmo, Horacio Rodríguez
ICGI
2010
Springer
13 years 8 months ago
Generalizing over Several Learning Settings
We recapitulate regular one-shot learning from membership and equivalence queries, positive and negative finite data. We present a meta-algorithm that generalizes over as many sett...
Anna Kasprzik
SDM
2007
SIAM
198views Data Mining» more  SDM 2007»
13 years 9 months ago
Learning from Time-Changing Data with Adaptive Windowing
We present a new approach for dealing with distribution change and concept drift when learning from data sequences that may vary with time. We use sliding windows whose size, inst...
Albert Bifet, Ricard Gavaldà
FSKD
2008
Springer
174views Fuzzy Logic» more  FSKD 2008»
13 years 8 months ago
A Hybrid Re-sampling Method for SVM Learning from Imbalanced Data Sets
Support Vector Machine (SVM) has been widely studied and shown success in many application fields. However, the performance of SVM drops significantly when it is applied to the pr...
Peng Li, Pei-Li Qiao, Yuan-Chao Liu