Top-down decision tree learning as information based boosting

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.292, Iss.2, 2003-01, pp. : 447-464

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Compositions with superlinear deterministic top-down tree transformations

By Danyi G. Fulop Z.

Theoretical Computer Science, Vol. 194, Iss. 1, 1998-03 ,pp. : 57-85

Elsevier

Access to resources Recommend Favorite

Shape preserving top-down tree transducers

By Fulop Z. Gazdag Z.

Theoretical Computer Science, Vol. 304, Iss. 1, 2003-07 ,pp. : 315-339

Elsevier

Access to resources Recommend Favorite

On the equivalence problem for letter-to-letter top-down tree transducers

By Andre Y. Bossut F.

Theoretical Computer Science, Vol. 205, Iss. 1, 1998-08 ,pp. : 207-229

Elsevier

Access to resources Recommend Favorite

Deterministic top-down tree transducers with iterated look-ahead

By Slutzki G. Vagvolgyi S.

Theoretical Computer Science, Vol. 143, Iss. 2, 1995-06 ,pp. : 285-308

Elsevier

Access to resources Recommend Favorite

An efficient top-down search algorithm for learning Boolean networks of gene expression

By Nam Dougu

Machine Learning, Vol. 65, Iss. 1, 2006-10 ,pp. : 229-245

Springer Publishing Company

Access to resources Recommend Favorite