Latent association graph inference for binary transaction data

This publication has 15 references indexed in Scilit:

• Visualizing big network traffic data using frequent pattern mining and hypergraphs
  Computing, 2013
• A simple algorithm to generate the minimal separators and the maximal cliques of a chordal graph
  Information Processing Letters, 2011
• Mining Frequent Patterns without Candidate Generation: A Frequent-Pattern Tree Approach
  Data Mining and Knowledge Discovery, 2004
• Scalable algorithms for association mining
  IEEE Transactions on Knowledge and Data Engineering, 2000
• P lya-like urns and the Ewens' sampling formula
  Journal of Mathematical Biology, 1984
• Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
  SIAM Journal on Computing, 1984
• Algorithmic Aspects of Vertex Elimination on Graphs
  SIAM Journal on Computing, 1976
• Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
  SIAM Journal on Computing, 1972
• The sampling theory of selectively neutral alleles
  Theoretical Population Biology, 1972
• Estimation of the Means of Dependent Variables
  The Annals of Mathematical Statistics, 1958