✦ LIBER ✦

A fast splitting procedure for classification trees

✍ Scribed by FRANCESCO MOLA; ROBERTA SICILIANO

Book ID: 110373075
Publisher: Springer US
Year: 1997
Tongue: English
Weight: 584 KB
Volume: 7
Category: Article
ISSN: 0960-3174
DOI: 10.1023/a:1018590219790

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Families of splitting criteria for class

Families of splitting criteria for classification trees

✍ Y.-S. Shih 📂 Article 📅 1999 🏛 Springer US 🌐 English ⚖ 131 KB

A procedure for improving generalization

A procedure for improving generalization in classification trees

✍ C.J. Mantas; J.M. Mantas Ruiz; F. Rojas 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 422 KB

Adaptive binary tree for fast SVM multic

Adaptive binary tree for fast SVM multiclass classification

✍ Jin Chen; Cheng Wang; Runsheng Wang 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 270 KB

Selecting the best splits for classifica

Selecting the best splits for classification trees with categorical variables

✍ Yu-Shan Shih 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 76 KB

A fast procedure for the calculation of

A fast procedure for the calculation of similarity coefficients in automatic classification

✍ Peter Willett 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 719 KB

A fast algorithm for Steiner trees

✍ L. Kou; G. Markowsky; L. Berman 📂 Article 📅 1981 🏛 Springer-Verlag 🌐 English ⚖ 248 KB

Given an undirected distance graph G = (V, E, d) and a set S, where V is the set of vertices in G, E is the set of edges in G, d is a distance function which maps E into the set of nonnegative numbers and S___ V is a subset of the vertices of V, the Steiner tree problem is to find a tree of G that s