Dependency trees in sub-linear time and bounded memory

This publication has 6 references indexed in Scilit:

• Tractable learning of large Bayes net structures from sparse data
  Published by Association for Computing Machinery (ACM) ,2004
• Learning from Infinite Data in Finite Time
  Published by MIT Press ,2002
• Mining high-speed data streams
  Published by Association for Computing Machinery (ACM) ,2000
• Efficient Algorithms for Minimizing Cross Validation Error
  Published by Elsevier ,1994
• Data Structures and Network Algorithms
  Published by Society for Industrial & Applied Mathematics (SIAM) ,1983
• Approximating discrete probability distributions with dependence trees
  IEEE Transactions on Information Theory, 1968