Learning approximate MRFs from large transactional data

Authors:
Chao Wang;Srinivasan Parthasarathy
Affiliations:
Department of Computer Science and Engineering, The Ohio State University;Department of Computer Science and Engineering, The Ohio State University
Venue:
ICML'06 Proceedings of the 2006 conference on Statistical network analysis
Year:
2006

Citing 4
Cited 1

Multilevel k-way partitioning scheme for irregular graphs

Journal of Parallel and Distributed Computing
Beyond Independence: Probabilistic Models for Query Approximation on Binary Transaction Data

IEEE Transactions on Knowledge and Data Engineering
Tractable learning of large Bayes net structures from sparse data

ICML '04 Proceedings of the twenty-first international conference on Machine learning
The case for anomalous link discovery

ACM SIGKDD Explorations Newsletter

Incorporating occupancy into frequent pattern mining for high quality pattern recommendation

Proceedings of the 21st ACM international conference on Information and knowledge management

Quantified Score

Hi-index	0.00

Visualization

Abstract