Sciweavers

4128 search results - page 162 / 826
» Learning and using relational theories
Sort
View
120
Voted
KDD
1995
ACM
135views Data Mining» more  KDD 1995»
15 years 4 months ago
Rough Sets Similarity-Based Learning from Databases
Manydata mining algorithms developed recently are based on inductive learning methods. Very few are based on similarity-based learning. However, similarity-based learning accrues ...
Xiaohua Hu, Nick Cercone
113
Voted
ALT
2007
Springer
15 years 9 months ago
Learning and Verifying Graphs Using Queries with a Focus on Edge Counting
We consider the problem of learning and verifying hidden graphs and their properties given query access to the graphs. We analyze various queries (edge detection, edge counting, sh...
Lev Reyzin, Nikhil Srivastava
93
Voted
ICML
2010
IEEE
15 years 1 months ago
Learning Markov Logic Networks Using Structural Motifs
Markov logic networks (MLNs) use firstorder formulas to define features of Markov networks. Current MLN structure learners can only learn short clauses (4-5 literals) due to extre...
Stanley Kok, Pedro Domingos
COLT
2007
Springer
15 years 7 months ago
Minimax Bounds for Active Learning
This paper analyzes the potential advantages and theoretical challenges of “active learning” algorithms. Active learning involves sequential sampling procedures that use infor...
Rui Castro, Robert D. Nowak
ICC
2007
IEEE
120views Communications» more  ICC 2007»
15 years 7 months ago
Dynamic Network Selection using Kernels
—We present a new algorithm for vertical handover and dynamic network selection, based on a combination of multiattribute utility theory, kernel learning and stochastic gradient ...
Eric van den Berg, Praveen Gopalakrishnan, Byungsu...