Using Tarjan's Red Rule for Fast Dependency Tree Construction
暂无分享,去创建一个
[1] Andrew W. Moore,et al. Efficient Algorithms for Minimizing Cross Validation Error , 1994, ICML.
[2] Catherine Blake,et al. UCI Repository of machine learning databases , 1998 .
[3] C. N. Liu,et al. Approximating discrete probability distributions with dependence trees , 1968, IEEE Trans. Inf. Theory.
[4] Raghu Ramakrishnan,et al. Proceedings : KDD 2000 : the Sixth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, August 20-23, 2000, Boston, MA, USA , 2000 .
[5] Geoff Hulten,et al. Learning from Infinite Data in Finite Time , 2001, NIPS.
[6] Nir Friedman,et al. Learning Bayesian Network Structure from Massive Datasets: The "Sparse Candidate" Algorithm , 1999, UAI.
[7] Robert E. Tarjan,et al. Data structures and network algorithms , 1983, CBMS-NSF regional conference series in applied mathematics.
[8] Marina Meila-Predoviciu,et al. Learning with Mixtures of Trees , 1999 .
[9] Marina Meila,et al. An Accelerated Chow and Liu Algorithm: Fitting Tree Distributions to High-Dimensional Sparse Data , 1999, ICML.
[10] Fazlollah M. Reza,et al. Introduction to Information Theory , 2004, Lecture Notes in Electrical Engineering.
[11] Geoff Hulten,et al. Mining high-speed data streams , 2000, KDD '00.
[12] Nir Friedman,et al. Bayesian Network Classification with Continuous Attributes: Getting the Best of Both Discretization and Parametric Fitting , 1998, ICML.
[13] Geoff Hulten,et al. A General Method for Scaling Up Machine Learning Algorithms and its Application to Clustering , 2001, ICML.
[14] Andrew W. Moore,et al. Hoeffding Races: Accelerating Model Selection Search for Classification and Function Approximation , 1993, NIPS.