Information Technology Reference
In-Depth Information
588 Advanced Artificial Intelligence
Carbonell, J.G. (1983) Learning by analogy: formulating and generalizing plans from
past experience. In R.S. Michalski, J.G. Carbonell and T.M. Mitchell (editors),
Machine Learning: An Artificial Intelligence Approach
, Tioga.
Carbonell, J.G. (1986) Analogy in problem solving. In R.S. Michalski, J.G. Carbonell
and T.M. Mitchell (editors),
Machine Learning: An Artificial Intelligence Approach
,
Morgan Kaufmann.
Carbonell, J.G. (1989) Introduction: paradigms for machine learning. Artificial
Intelligence, 40(1): 1-9.
Carnap. R. (1950)
Logical foundations of probability
. The University of Chicago Press.
Caruana, R. A., L.J. Eshelman and J.D. Schaffer. (1989) Representation and hidden bias
II: eliminating defining length bias in genetic search. In
Proceedings of IJCAI-89
,
Detroit, Michigan, USA.
Catlett, J. (1991) Overpruning large decision trees. In
Proceedings of IJCAI-91
, 764-769.
Chang, C.L. and R.C. Lee. (1973)
Symbolic Logic and Mechanical Theorem Proving
.
Academic Press.
Chen H., P. Tino and X. Yao (2009) Probabilistic Classification Vector Machines.
IEEE
Transactions on Neural Networks
,
20
(6):901-914.
Chen W., K.S. Decker. (2006) Analyzing characteristics of task structures to develop
GPGP coordination mechanisms.
AAMAS 2006
: 662-669.
Cheung D.W., J. Han, V. Ng, A. Fu, and Y. Fu. (1996) A Fast Distributed Algorithm for
Mining Association Rules.
Fourth Int'l Conf. Parallel and Distributed Information
Systems,
Dec. pp31-42.
Cheung D. W., V. T. Ng, A. W. Fu, and Y. Fu. (1996) Efficient Mining of Association
Rules in Distributed Databases.
IEEE Transactions On Knowledge And Data
, 8:911-922.
Cheung, D., K. Hu, and S. Xia. (1998) Asynchronous Parallel Algorithm for Mining
Association Rules on Shared-Memory Multi-Processors.
Engineering
Proc. 10th ACM Symp.
Parallel Algorithms and Architectures
, ACM Press, New York, 1998, pp. 279-288.
Cheung D.W
.
and Y. Xiao. (1999) Effect of Data Distribution in Parallel Mining of
Association,
Data Mining and Knowledge Discovery
, Kluwer Academic Publishers, 3,
291-314.
Chien, S.A. (1989) Using and refining simplifications: explanation-based learning of
plans in intractable domains. In
Proceedings of IJCAI-89
, Detroit, Michigan, USA.
Chickering, D and Heckerman, D. (1996) Efficient approximations for the marginal
likelihood of incomplete data given a Bayesian network.
Technical Report MSR-TR-
96-08
, Microsoft Research, Redmond, WA.
Clark, P. and T. Niblett. (1989) The CN2 induction algorithm.
Machine Learning
, 3(4):
261.
Cohen, W.W. (1988) Generalizing number and learning from multiples in explanation
based learning. In
Proceedings of ICML-88
, San Mateo, CA.
Cook, D.J. (1991) The base selection task in analogical learning. In
Proceedings of
IJCAI-91
, 790-795.
Cooper, M.C. (1989) An optimal k-consistency algorithm.
Artificial Intelligence
, 41: 89-
95.
Cooper, Greg F. and Herskovits, E. (1992) A Bayesian Method for the Induction of
Probabilistic Networks from Data.
Machine Learning
, 1992(9): 309-347