Data Mining_ Concepts and Techniques - Jiawei Han [387]
[CDK+99] Chakrabarti, S.; Dom, B.E.; Kumar, S.R.; Raghavan, P.; Rajagopalan, S.; Tomkins, A.; Gibson, D.; Kleinberg, J.M., Mining the web's link structure, COMPUTER 32 (1999) 60–67.
[CGC94] Chaturvedi, A.; Green, P.; Carroll, J., k-means, k-medians and k-modes: Special cases of partitioning multiway data, In: The Classification Society of North America (CSNA) Meeting Presentation Houston, TX. (1994).
[CGC01] Chaturvedi, A.; Green, P.; Carroll, J., k-modes clustering, J. Classification 18 (2001) 35–55.
[CH67] Cover, T.; Hart, P., Nearest neighbor pattern classification, IEEE Trans. Information Theory 13 (1967) 21–27.
[CH92] Cooper, G.; Herskovits, E., A Bayesian method for the induction of probabilistic networks from data, Machine Learning 9 (1992) 309–347.
[CH07] Cook, D.J.; Holder, L.B., Mining Graph Data. (2007) John Wiley & Sons .
[Cha03a] Chakrabarti, S., Mining the Web: Discovering Knowledge from Hypertext Data. (2003) Morgan Kaufmann .
[Cha03b] Chatfield, C., The Analysis of Time Series: An Introduction. 6th ed. (2003) Chapman & Hall .
[CHN+96] Cheung, D.W.; Han, J.; Ng, V.; Fu, A.; Fu, Y., A fast distributed algorithm for mining association rules, In: Proc. 1996 Int. Conf. Parallel and Distributed Information Systems Miami Beach, FL. (Dec. 1996), pp. 31–44.
[CHNW96] Cheung, D.W.; Han, J.; Ng, V.; Wong, C.Y., Maintenance of discovered association rules in large databases: An incremental updating technique, In: Proc. 1996 Int. Conf. Data Engineering (ICDE’96) New Orleans, LA. (Feb. 1996), pp. 106–114.
[CHY96] Chen, M.S.; Han, J.; Yu., P.S., Data mining: An overview from a database perspective, IEEE Trans. Knowledge and Data Engineering 8 (1996) 866–883.
[CK98] Carey, M.; Kossman, D., Reducing the braking distance of an SQL query engine, In: Proc. 1998 Int. Conf. Very Large Data Bases (VLDB’98) New York. (Aug. 1998), pp. 158–169.
[CKT06] Chakrabarti, D.; Kumar, R.; Tomkins, A., Evolutionary clustering, In: Proc. 2006 ACM SIGKDD Int. Conf. Knowledge Discovery in Databases (KDD’06) Philadelphia, PA. (Aug. 2006), pp. 554–560.
[Cle93] Cleveland, W., Visualizing Data. (1993) Hobart Press .
[CSZ06] Chapelle, O.; Schölkopf, B.; Zien, A., Semi-supervised Learning. (2006) MIT Press, Cambridge, MA .
[CM94] Curram, S.P.; Mingers, J., Neural networks, decision tree induction and discriminant analysis: An empirical comparison, J. Operational Research Society 45 (1994) 440–450.
[CMC05] Cao, H.; Mamoulis, N.; Cheung, D.W., Mining frequent spatio-temporal sequential patterns, In: Proc. 2005 Int. Conf. Data Mining (ICDM’05) Houston, TX. (Nov. 2005), pp. 82–89.
[CMS09] Croft, B.; Metzler, D.; Strohman, T., Search Engines: Information Retrieval in Practice. (2009) Addison-Wesley, Boston .
[CN89] Clark, P.; Niblett, T., The CN2 induction algorithm, Machine Learning 3 (1989) 261–283.
[Coh95] Cohen, W., Fast effective rule induction, In: Proc. 1995 Int. Conf. Machine Learning (ICML’95) Tahoe City, CA. (July 1995), pp. 115–123.
[Coo90] Cooper, G.F., The computational complexity of probabilistic inference using Bayesian belief networks, Artificial Intelligence 42 (1990) 393–405.
[CPS98] Cios, K.; Pedrycz, W.; Swiniarski, R., Data Mining Methods for Knowledge Discovery. (1998) Kluwer Academic .
[CR95] Chauvin, Y.; Rumelhart, D., Backpropagation: Theory, Architectures, and Applications. (1995) Lawrence Erlbaum .
[Cra89] Crawford, S.L., Extensions to the CART algorithm, Int. J. Man-Machine Studies 31 (Aug. 1989) 197–217.
[CRST06] Chen, B.-C.; Ramakrishnan, R.; Shavlik, J.W.; Tamma, P., Bellwether analysis: Predicting global aggregates from local regions, In: Proc. 2006 Int. Conf. Very Large Data Bases (VLDB’06) Seoul, Korea. (Sept. 2006), pp. 655–666.
[CS93a] Chan, P.K.; Stolfo, S.J., Experiments on multistrategy learning by metalearning, In: Proc. 2nd. Int. Conf. Information and Knowledge Management (CIKM’93) Washington, DC. (Nov. 1993), pp. 314–323.
[CS93b] Chan, P.K.; Stolfo, S.J., Toward multi-strategy