Name
Abstract | ||
|---|---|---|
This paper addresses three questions. Is it useful to attempt to learn a Bayesian network structure with hundreds of thousands of nodes? How should such structure search proceed practically? The third question arises out of our approach to the second: how can Frequent Sets (Agrawal et al., 1993), which are extremely popular in the area of descriptive data mining, be turned into a probabilistic model?Large sparse datasets with hundreds of thousands of records and attributes appear in social networks, warehousing, supermarket transactions and web logs. The complexity of structural search made learning of factored probabilistic models on such datasets unfeasible. We propose to use Frequent Sets to significantly speed up the structural search. Unlike previous approaches, we not only cache n-way sufficient statistics, but also exploit their local structure. We also present an empirical evaluation of our algorithm applied to several massive datasets. |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1145/1015330.1015406 | ICML |
Keywords | Field | DocType |
social network,probabilistic model,data mining,graphical model,bayesian network,sufficient statistic,sparse data | Data mining,Computer science,Cache,Artificial intelligence,Probabilistic logic,Sparse matrix,Speedup,Pattern recognition,Exploit,Bayesian network,Statistical model,Graphical model,Machine learning | Conference |
ISBN | Citations | PageRank |
1-58113-838-5 | 27 | 2.07 |
References | Authors | |
20 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Anna Goldenberg | 1 | 276 | 26.12 |
| Andrew Moore | 2 | 7647 | 894.46 |