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

Bibliography
Aha D. W., Kibler D., and Albert M. K., Instancebased learning algorithms,
Machine Learning 6(1):37-66, 1991.
A1-Sultan K. S., A tabu search approach to the clustering problem, Pattern
Recognition 28:1443-1451, 1995.
Al-Sultan K. S., and Khan M. M., Computational experience on four algorithms
for the hard clustering problem, Pattern Recognition Letters 17(3):295-308,
1996.
Ali K. M., and Pazzani M. J., Error reduction through learning multiple
descriptions, Machine Learning 24(3):173-202, 1996.
Almuallim H., An ecient algorithm for optimal pruning of decision trees,
Artificial Intelligence 83(2):347-362, 1996.
Almuallim H., and Dietterich T. G., Learning Boolean concepts in the presence
of many irrelevant features, Artificial Intelligence 69(1-2):279-306, 1994.
Alsabti K., Ranka S., and Singh V., CLOUDS: A decision tree classifier for large
datasets, Conference on Knowledge Discovery and Data Mining ( KDD -98),
August 1998.
An A., and Wang Y., Comparisons of classification methods for screening
potential compounds, IEEE International Conference on Data Mining ,
2001.
Anand R., Methrotra K., Mohan C. K., and Ranka S., Ecient classification for
multiclass problems using modular neural networks, IEEE Trans Neural
Networks 6(1):117-125, 1995.
Anderson J. A., and Rosenfeld E., Talking Nets : An Oral History of Neural
Network Research , Cambridge, MA: MIT Press, 2000.
Antwarg L., Rokach L., and Shapira B., Attribute-driven hidden markov model
trees for intention prediction, IEEE Transactions on Systems, Man, and
Cybernetics, Part C 42(6):1103-1119, 2012.
Ashenhurst R. L., The decomposition of switching functions, Technical report,
Bell Laboratories BL -1(11), pp. 541-602, 1952.
Athanasopoulos D., Probabilistic Theory , Piraeus: Stamoulis, 1991.
Attneave F., Applications of Information Theory to Psychology , California: Holt,
Rinehart and Winston, 1959.
273