47 search results - page 1 / 10 » Optimal Structure Identification With Greedy Search |
JMLR
2002
13 years 4 months ago
2002
In this paper we prove the so-called "Meek Conjecture". In particular, we show that if a DAG H is an independence map of another DAG G, then there exists a finite sequen...
ICTAI
2010
IEEE
13 years 2 months ago
2010
IEEE
This work deals with a new technique for the estimation of the parameters and number of components in a finite mixture model. The learning procedure is performed by means of a expe...
KDD
2007
ACM
14 years 5 months ago
2007
ACM
We propose frameworks and algorithms for identifying communities in social networks that change over time. Communities are intuitively characterized as "unusually densely kni...
DAWAK
2006
Springer
13 years 8 months ago
2006
Springer
We consider the problem of concurrent execution of multiple frequent itemset queries. If such data mining queries operate on overlapping parts of the database, then their overall I...
ML
2006
ACM
13 years 5 months ago
2006
ACM
We present a new algorithm for Bayesian network structure learning, called Max-Min Hill-Climbing (MMHC). The algorithm combines ideas from local learning, constraint-based, and sea...