HAN
21-bib-633-672-9780123814791
2011/6/1
3:27
Page 641
#9
Bibliography
641
[CWL
+
08]
G. Cong, L. Wang, C.-Y. Lin, Y.-I. Song, and Y. Sun. Finding question-answer pairs
from online forums. In Proc. 2008 Int. ACM SIGIR Conf. Research and Development
in Information Retrieval (SIGIR’08), pp. 467–474, Singapore, July 2008.
[CYHH07]
H. Cheng, X. Yan, J. Han, and C.-W. Hsu. Discriminative frequent pattern analysis for
effective classification. In Proc. 2007 Int. Conf. Data Engineering (ICDE’07), pp. 716–725,
Istanbul, Turkey, Apr. 2007.
[CYHY08]
H. Cheng, X. Yan, J. Han, and P. S. Yu. Direct discriminative pattern mining for effective
classification. In Proc. 2008 Int. Conf. Data Engineering (ICDE’08), pp. 169–178, Cancun,
Mexico, Apr. 2008.
[CYZ
+
08]
C. Chen, X. Yan, F. Zhu, J. Han, and P. S. Yu. Graph OLAP: Towards online analytical
processing on graphs. In Proc. 2008 Int. Conf. Data Mining (ICDM’08), pp. 103–112,
Pisa, Italy, Dec. 2008.
[Dar10]
A. Darwiche. Bayesian networks.
Communications of the ACM, 53:80–90, 2010.
[Das91]
B. V. Dasarathy.
Nearest Neighbor (NN) Norms: NN Pattern Classification Techniques.
IEEE Computer Society Press, 1991.
[Dau92]
I. Daubechies. Ten Lectures on Wavelets. Capital City Press, 1992.
[DB95]
T. G. Dietterich and G. Bakiri. Solving multiclass learning problems via error-correcting
output codes. J. Artificial Intelligence Research, 2:263–286, 1995.
[DBK
+
97]
H. Drucker, C. J. C. Burges, L. Kaufman, A. Smola, and V. N. Vapnik. Support vec-
tor regression machines. In M. Mozer, M. Jordan, and T. Petsche (eds.), Advances in
Neural Information Processing Systems 9, pp. 155–161. Cambridge, MA: MIT Press,
1997.
[DE84]
W. H. E. Day and H. Edelsbrunner. Efficient algorithms for agglomerative hierarchical
clustering methods. J. Classification, 1:7–24, 1984.
[De01]
S. Dzeroski and N. Lavrac (eds.).
Relational Data Mining. New York: Springer, 2001.
[DEKM98]
R. Durbin, S. Eddy, A. Krogh, and G. Mitchison.
Biological Sequence Analysis: Probability
Models of Proteins and Nucleic Acids. Cambridge University Press, 1998.
[Dev95]
J. L. Devore.
Probability and Statistics for Engineering and the Sciences (4th ed.). Duxbury
Press, 1995.
[Dev03]
J. L. Devore. Probability and Statistics for Engineering and the Sciences (6th ed.). Duxbury
Press, 2003.
[DH73]
W. E. Donath and A. J. Hoffman. Lower bounds for the partitioning of graphs.
IBM J.
Research and Development, 17:420–425, 1973.
[DH00]
P. Domingos and G. Hulten. Mining high-speed data streams. In
Proc. 2000 ACM
SIGKDD Int. Conf. Knowledge Discovery in Databases (KDD’00), pp. 71–80, Boston, MA,
Aug. 2000.
[DHL
+
01]
G. Dong, J. Han, J. Lam, J. Pei, and K. Wang. Mining multi-dimensional constrained
gradients in data cubes. In Proc. 2001 Int. Conf. Very Large Data Bases (VLDB’01),
pp. 321–330, Rome, Italy, Sept. 2001.
[DHL
+
04]
G. Dong, J. Han, J. Lam, J. Pei, K. Wang, and W. Zou. Mining constrained gradients in
multi-dimensional databases. IEEE Trans. Knowledge and Data Engineering, 16:922–938,
2004.
[DHS01]
R. O. Duda, P. E. Hart, and D. G. Stork.
Pattern Classification (2nd ed.). John Wiley &
Sons, 2001.
HAN
21-bib-633-672-9780123814791
2011/6/1
3:27
Page 642
#10
642
Bibliography
[DJ03]
T. Dasu and T. Johnson.
Exploratory Data Mining and Data Cleaning. John Wiley &
Sons, 2003.
[DJMS02]
T. Dasu, T. Johnson, S. Muthukrishnan, and V. Shkapenyuk. Mining database struc-
ture; or how to build a data quality browser. In Proc. 2002 ACM-SIGMOD Int. Conf.
Management of Data (SIGMOD’02), pp. 240–251, Madison, WI, June 2002.
[DL97]
M. Dash and H. Liu. Feature selection methods for classification.
Intelligent Data
Analysis, 1:131–156, 1997.
[DL99]
G. Dong and J. Li. Efficient mining of emerging patterns: Discovering trends and dif-
ferences. In Proc. 1999 Int. Conf. Knowledge Discovery and Data Mining (KDD’99),
pp. 43–52, San Diego, CA, Aug. 1999.
[DLR77]
A. P. Dempster, N. M. Laird, and D. B. Rubin. Maximum likelihood from incomplete
data via the EM algorithm. J. Royal Statistical Society, Series B, 39:1–38, 1977.
[DLY97]
M. Dash, H. Liu, and J. Yao. Dimensionality reduction of unsupervised data. In Proc.
1997 IEEE Int. Conf. Tools with AI (ICTAI’97), pp. 532–539, Newport Beach, CA, IEEE
Computer Society, 1997.
[DM02]
D. Dasgupta and N. S. Majumdar. Anomaly detection in multidimensional data using
negative selection algorithm. In
Proc. 2002 Congress on Evolutionary Computation
(CEC’02), Chapter 12, pp. 1039–1044, Washington, DC, 2002.
[DNR
+
97]
P. Deshpande, J. Naughton, K. Ramasamy, A. Shukla, K. Tufte, and Y. Zhao. Cubing
algorithms, storage estimation, and storage and processing alternatives for OLAP. Bull.
Technical Committee on Data Engineering, 20:3–11, 1997.
[Dob90]
A. J. Dobson.
An Introduction to Generalized Linear Models. Chapman & Hall, 1990.
[Dob01]
A. J. Dobson.
An Introduction to Generalized Linear Models (2nd ed.). Chapman & Hall,
2001.
[Dom94]
P. Domingos. The RISE system: Conquering without separating. In Proc. 1994 IEEE
Int. Conf. Tools with Artificial Intelligence (TAI’94), pp. 704–707, New Orleans, LA,
1994.
[Dom99]
P. Domingos. The role of Occam’s razor in knowledge discovery. Data Mining and
Knowledge Discovery, 3:409–425, 1999.
[DP96]
P. Domingos and M. Pazzani. Beyond independence: Conditions for the optimality
of the simple Bayesian classifier. In Proc. 1996 Int. Conf. Machine Learning (ML’96),
pp. 105–112, Bari, Italy, July 1996.
[DP97]
J. Devore and R. Peck.
Statistics: The Exploration and Analysis of Data. Duxbury Press,
1997.
[DP07]
G. Dong and J. Pei. Sequence Data Mining. New York: Springer, 2007.
[DR99]
D. Donjerkovic and R. Ramakrishnan. Probabilistic optimization of top N queries. In
Proc. 1999 Int. Conf. Very Large Data Bases (VLDB’99), pp. 411–422, Edinburgh, UK,
Sept. 1999.
[DR05]
I. Davidson and S. S. Ravi. Clustering with constraints: Feasibility issues and the
k-means algorithm. In
Proc. 2005 SIAM Int. Conf. Data Mining (SDM’05), Newport
Beach, CA, Apr. 2005.
[DT93]
V. Dhar and A. Tuzhilin. Abstract-driven pattern discovery in databases. IEEE Trans.
Knowledge and Data Engineering, 5:926–938, 1993.