HAN
21-bib-633-672-9780123814791
2011/6/1
3:27
Page 639
#7
Bibliography
639
[CCS93]
E. F. Codd, S. B. Codd, and C. T. Salley. Beyond decision support.
Computer World,
27(30):5–12, July 1993.
[CD97]
S. Chaudhuri and U. Dayal. An overview of data warehousing and OLAP technology.
SIGMOD Record, 26:65–74, 1997.
[CDH
+
02]
Y. Chen, G. Dong, J. Han, B. W. Wah, and J. Wang. Multidimensional regression analysis
of time-series data streams. In Proc. 2002 Int. Conf. Very Large Data Bases (VLDB’02),
pp. 323–334, Hong Kong, China, Aug. 2002.
[CDH
+
06]
Y. Chen, G. Dong, J. Han, J. Pei, B. W. Wah, and J. Wang. Regression cubes with
lossless compression and aggregation. IEEE Trans. Knowledge and Data Engineering,
18:1585–1599, 2006.
[CDI98]
S. Chakrabarti, B. E. Dom, and P. Indyk. Enhanced hypertext classification using hyper-
links. In Proc. 1998 ACM-SIGMOD Int. Conf. Management of Data (SIGMOD’98),
pp. 307–318, Seattle, WA, June 1998.
[CDK
+
99]
S. Chakrabarti, B. E. Dom, S. R. Kumar, P. Raghavan, S. Rajagopalan, A. Tomkins,
D. Gibson, and J. M. Kleinberg. Mining the web’s link structure. COMPUTER, 32:60–67,
1999.
[CGC94]
A. Chaturvedi, P. Green, and J. Carroll.
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]
A. Chaturvedi, P. Green, and J. Carroll.
k-modes clustering.
J. Classification, 18:35–55,
2001.
[CH67]
T. Cover and P. Hart. Nearest neighbor pattern classification. IEEE Trans. Information
Theory, 13:21–27, 1967.
[CH92]
G. Cooper and E. Herskovits. A Bayesian method for the induction of probabilistic
networks from data. Machine Learning, 9:309–347, 1992.
[CH07]
D. J. Cook and L. B. Holder. Mining Graph Data. John Wiley & Sons, 2007.
[Cha03a]
S. Chakrabarti. Mining the Web: Discovering Knowledge from Hypertext Data. Morgan
Kaufmann, 2003.
[Cha03b]
C. Chatfield.
The Analysis of Time Series: An Introduction (6th ed.). Chapman & Hall,
2003.
[CHN
+
96]
D. W. Cheung, J. Han, V. Ng, A. Fu, and Y. Fu. A fast distributed algorithm for mining
association rules. In Proc. 1996 Int. Conf. Parallel and Distributed Information Systems,
pp. 31–44, Miami Beach, FL, Dec. 1996.
[CHNW96]
D. W. Cheung, J. Han, V. Ng, and C. Y. Wong. Maintenance of discovered association
rules in large databases: An incremental updating technique. In Proc. 1996 Int. Conf.
Data Engineering (ICDE’96), pp. 106–114, New Orleans, LA, Feb. 1996.
[CHY96]
M. S. Chen, J. Han, and P. S. Yu. Data mining: An overview from a database perspective.
IEEE Trans. Knowledge and Data Engineering, 8:866–883, 1996.
[CK98]
M. Carey and D. Kossman. Reducing the braking distance of an SQL query engine. In
Proc. 1998 Int. Conf. Very Large Data Bases (VLDB’98), pp. 158–169, New York, Aug.
1998.
[CKT06]
D. Chakrabarti, R. Kumar, and A. Tomkins. Evolutionary clustering. In Proc. 2006
ACM SIGKDD Int. Conf. Knowledge Discovery in Databases (KDD’06), pp. 554–560,
Philadelphia, PA, Aug. 2006.
[Cle93]
W. Cleveland. Visualizing Data. Hobart Press, 1993.
HAN
21-bib-633-672-9780123814791
2011/6/1
3:27
Page 640
#8
640
Bibliography
[CSZ06]
O. Chapelle, B. Sch¨olkopf, and A. Zien.
Semi-supervised Learning. Cambridge, MA: MIT
Press, 2006.
[CM94]
S. P. Curram and J. Mingers. Neural networks, decision tree induction and discrim-
inant analysis: An empirical comparison.
J. Operational Research Society, 45:440–450,
1994.
[CMC05]
H. Cao, N. Mamoulis, and D. W. Cheung. Mining frequent spatio-temporal sequential
patterns. In Proc. 2005 Int. Conf. Data Mining (ICDM’05), pp. 82–89, Houston, TX, Nov.
2005.
[CMS09]
B. Croft, D. Metzler, and T. Strohman. Search Engines: Information Retrieval in Practice.
Boston: Addison-Wesley, 2009.
[CN89]
P. Clark and T. Niblett. The CN2 induction algorithm.
Machine Learning, 3:261–283,
1989.
[Coh95]
W. Cohen. Fast effective rule induction. In Proc. 1995 Int. Conf. Machine Learning
(ICML’95), pp. 115–123, Tahoe City, CA, July 1995.
[Coo90]
G. F. Cooper. The computational complexity of probabilistic inference using Bayesian
belief networks. Artificial Intelligence, 42:393–405, 1990.
[CPS98]
K. Cios, W. Pedrycz, and R. Swiniarski. Data Mining Methods for Knowledge Discovery.
Kluwer Academic, 1998.
[CR95]
Y. Chauvin and D. Rumelhart.
Backpropagation: Theory, Architectures, and Applications.
Lawrence Erlbaum, 1995.
[Cra89]
S. L. Crawford. Extensions to the CART algorithm. Int. J. Man-Machine Studies,
31:197–217, Aug. 1989.
[CRST06]
B.-C. Chen, R. Ramakrishnan, J. W. Shavlik, and P. Tamma. Bellwether analysis: Predict-
ing global aggregates from local regions. In Proc. 2006 Int. Conf. Very Large Data Bases
(VLDB’06), pp. 655–666, Seoul, Korea, Sept. 2006.
[CS93a]
P. K. Chan and S. J. Stolfo. Experiments on multistrategy learning by metalearning. In
Proc. 2nd. Int. Conf. Information and Knowledge Management (CIKM’93), pp. 314–323,
Washington, DC, Nov. 1993.
[CS93b]
P. K. Chan and S. J. Stolfo. Toward multi-strategy parallel & distributed learning
in sequence analysis. In
Proc. 1st Int. Conf. Intelligent Systems for Molecular Biology
(ISMB’93), pp. 65–73, Bethesda, MD, July 1993.
[CS96]
M. W. Craven and J. W. Shavlik. Extracting tree-structured representations of trained
networks. In D. Touretzky, M. Mozer, and M. Hasselmo (eds.), Advances in Neural
Information Processing Systems. Cambridge, MA: MIT Press, 1996.
[CS97]
M. W. Craven and J. W. Shavlik. Using neural networks in data mining.
Future
Generation Computer Systems, 13:211–229, 1997.
[CS-T00]
N. Cristianini and J. Shawe-Taylor.
An Introduction to Support Vector Machines and Other
Kernel-Based Learning Methods. Cambridge University Press, 2000.
[CSZ
+
07]
Y. Chi, X. Song, D. Zhou, K. Hino, and B. L. Tseng. Evolutionary spectral clustering by
incorporating temporal smoothness. In Proc. 2007 ACM SIGKDD Intl. Conf. Knowledge
Discovery and Data Mining (KDD’07), pp. 153–162, San Jose, CA, Aug. 2007.
[CTTX05]
G. Cong, K.-Lee Tan, A. K. H. Tung, and X. Xu. Mining top-
k covering rule groups
for gene expression data. In Proc. 2005 ACM-SIGMOD Int. Conf. Management of Data
(SIGMOD’05), pp. 670–681, Baltimore, MD, June 2005.