Recursive Partition and Symbolic Data Analysis-Reference-Cited by-同舟云学术

Recursive Partition and Symbolic Data Analysis

Published:1994 Issue: Volume: Page:277-284
ISSN:1431-8814
Container-title:New Approaches in Classification and Data Analysis
language:
Short-container-title:

Author:

Ciampi A.,Diday E.,Lebbe J.,Vignes R.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-51175-2_32

Reference7 articles.

1. BREIMAN, L., FRIEDMAN, J.H., OLSHEN, R. AND STONE, C.J. (1984): Classification and Regression Trees, Wadsworth, Belmont, Ca.

2. CIAMPI, A. (1992): Constructing prediction trees from data: the RECPAM approach. Proceedings of the Prague ’91 Summer School of Computational Aspects of Model Choice, 107–155, Physica-Verlag/Springer.

3. CIAMPI, A., HENDRICKS, L. & LOU, Z. (1992): Tree -growing for the multivariate model: the RECPAM approach. COMPSTAT 1992, Proceedings in Computational Statistics.

4. DIDAY, E. (1987): The symbolic approach in clustering and related methods of data analysis: the basic choices, in Proceedings of the First Conference of IFCS, Thechnical Univ. of Aachen, Bock H. ed.

5. DIDAY, E. (1992): From data to knowledge: new objects for a statistical analysis, in Proceedings of NTTS conference, EUROSTAT, Weichselberger, K., Klösgen, W. (eds.), Gesellschaft für mathematik und datenverarbeitung MBH.

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Growing a tree classifier with imprecise data;Pattern Recognition Letters;2000-08

2. Tree-Growing with Probabilistically Imprecise Data;Studies in Classification, Data Analysis, and Knowledge Organization;1996

3. On the Computational Hardness of Learning from Structured Symbolic Data;Studies in Classification, Data Analysis, and Knowledge Organization;1996