IGTree: Using Trees for Compression and Classification in Lazy Learning Algorithms

E-ISSN： 1573-7462|11|1-5|407-423

ISSN： 0269-2821

Source： Artificial Intelligence Review, Vol.11, Iss.1-5, 1997-02, pp. : 407-423

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

Related content

Discretisation in Lazy Learning Algorithms

By Ting K.M.

Artificial Intelligence Review, Vol. 11, Iss. 1-5, 1997-02 ,pp. : 157-174

Springer Publishing Company

Access to resources Recommend Favorite

PAC-Bayesian Compression Bounds on the Prediction Error of Learning Algorithms for Classification

By Graepel Thore

Machine Learning, Vol. 59, Iss. 1-2, 2005-05 ,pp. : 55-76

Springer Publishing Company

Access to resources Recommend Favorite

Intelligent Selection of Instances for Prediction Functions in Lazy Learning Algorithms

By Zhang J.

Artificial Intelligence Review, Vol. 11, Iss. 1-5, 1997-02 ,pp. : 175-191

Springer Publishing Company

Access to resources Recommend Favorite

Using Model Trees for Classification

By Frank E. Wang Y. Inglis S. Holmes G. Witten I.H.

Machine Learning, Vol. 32, Iss. 1, 1998-07 ,pp. : 63-76

Springer Publishing Company

Access to resources Recommend Favorite

Lazy Learning of Bayesian Rules

By Zheng Z.

Machine Learning, Vol. 41, Iss. 1, 2000-10 ,pp. : 53-84

Springer Publishing Company

Access to resources Recommend Favorite