Sciweavers

31 search results - page 4 / 7
» Tractable learning of large Bayes net structures from sparse...
Sort
View
KDD
1998
ACM
147views Data Mining» more  KDD 1998»
13 years 11 months ago
ADtrees for Fast Counting and for Fast Learning of Association Rules
Abstract: The problem of discovering association rules in large databases has received considerable research attention. Much research has examined the exhaustive discovery of all a...
Brigham S. Anderson, Andrew W. Moore
COLT
2004
Springer
14 years 25 days ago
Regularization and Semi-supervised Learning on Large Graphs
We consider the problem of labeling a partially labeled graph. This setting may arise in a number of situations from survey sampling to information retrieval to pattern recognition...
Mikhail Belkin, Irina Matveeva, Partha Niyogi
LREC
2010
145views Education» more  LREC 2010»
13 years 9 months ago
Generic Ontology Learners on Application Domains
In ontology learning from texts, we have ontology-rich domains where we have large structured domain knowledge repositories or we have large general corpora with large general str...
Francesca Fallucchi, Maria Teresa Pazienza, Fabio ...
ICML
2005
IEEE
14 years 8 months ago
Learning class-discriminative dynamic Bayesian networks
In many domains, a Bayesian network's topological structure is not known a priori and must be inferred from data. This requires a scoring function to measure how well a propo...
John Burge, Terran Lane
SIGMOD
2004
ACM
262views Database» more  SIGMOD 2004»
14 years 7 months ago
The Next Database Revolution
Database system architectures are undergoing revolutionary changes. Most importantly, algorithms and data are being unified by integrating programming languages with the database ...
Jim Gray