Bibliography - Data Mining with Decision Trees: Theory and Applications - page 294

Quinlan J. R., Decision trees and multivalued attributes, In Machine Intelligence ,
J. Richards (ed.), Vol. 11, pp. 305-318, Oxford, England: Oxford Univ.
Press, 1988.
Quinlan J. R., Unknown attribute values in induction, In Proceedings of the Sixth
International Machine Learning Workshop Cornell , A. Segre (ed.), New
York: Morgan Kaufmann, 1989.
Quinlan J. R., C4.5: Programs for Machine Learning , Los Altos: Morgan
Kaufmann, 1993.
Quinlan J. R., Bagging, Boosting, and C4.5, In Proceedings of the Thirteenth
National Conference on Artificial Intelligence , pp. 725-730, 1996.
Quinlan J. R., and Rivest R. L., Inferring decision trees using the minimum
description length principle, Information and Computation 80:227-248,
1989.
Ragavan H., and Rendell L., Look ahead feature construction for learning hard
concepts, In Proceedings of the Tenth International Machine Learning
Conference , pp. 252-259, Los Altos: Morgan Kaufman, 1993.
Rahman A. F. R., and Fairhurst M. C., A new hybrid approach in combining
multiple experts to recognize handwritten numerals, Pattern Recognition
Letters 18:781-790, 1997.
Ramamurti V., and Ghosh J., Structurally adaptive modular networks for
non-stationary environments, IEEE Transactions on Neural Networks
10(1):152-160, 1999.
Rand W. M., Objective criteria for the evaluation of clustering methods, Journal
of the American Statistical Association , 66:846-850, 1971.
Rao R., Gordon D., and Spears W., For every generalization action, is there really
an equal or opposite reaction? Analysis of conservation law, In Proc. of the
Twelfth International Conference on Machine Learning , pp. 471-479, Los
Altos: Morgan Kaufmann, 1995.
Rastogi R., and Shim K., PUBLIC: A decision tree classifier that integrates build-
ing and pruning, Data Mining and Knowledge Discovery 4(4):315-344, 2000.
Ratsch G., Onoda T., and Muller K. R., Soft margins for Adaboost, Machine
Learning 42(3):287-320, 2001.
Ray S., and Turi R. H., Determination of number of clusters in K-means clustering
and application in color image segmentation, Monash University, 1999.
R'enyi A., Probability Theory , Amsterdam: North-Holland, 1970.
Ridgeway G., Madigan D., Richardson T., and O'Kane J., Interpretable boosted
naive bayes classification, In Proceedings of the Fourth International Con-
ference on Knowledge Discovery and Data Mining , pp. 101-104, 1998.
Rissanen J., Stochastic Complexity and Statistical Inquiry , Singapore: World
Scientific, 1989.
Rodriguez J. J., Kuncheva L. I., and Alonso C. J., Rotation forest: A new classifier
ensemble method, IEEE Transactions on Pattern Analysis and Machine
Intelligence 28(10):1619-1630, 2006.
Rokach L., and Kisilevich S., Initial profile generation in recommender systems
using pairwise comparison, IEEE Transactions on Systems, Man, and
Cybernetics, Part C: Applications and Reviews 42(6):1854-1859, 2012.