The VLDB Journal

, Volume 15, Issue 3, pp 250–262

Dependency trees in sub-linear time and bounded memory

Authors

    • IBM Haifa Labs
  • Andrew Moore
    • Robotics InstituteCarnegie-Mellon University
Regular Paper

DOI: 10.1007/s00778-005-0170-8

Cite this article as:
Pelleg, D. & Moore, A. The VLDB Journal (2006) 15: 250. doi:10.1007/s00778-005-0170-8
  • 55 Views

Abstract

We focus on the problem of efficient learning of dependency trees. Once grown, they can be used as a special case of a Bayesian network, for PDF approximation, and for many other uses. Given the data, a well-known algorithm can fit an optimal tree in time that is quadratic in the number of attributes and linear in the number of records. We show how to modify it to exploit partial knowledge about edge weights. Experimental results show running time that is near-constant in the number of records, without significant loss in accuracy of the generated trees.

Keywords

Data miningProbably approximately correct learningFast algorithmsDependency trees

Copyright information

© Springer-Verlag 2006