HAN
21-bib-633-672-9780123814791
2011/6/1
3:27
Page 635
#3
Bibliography
635
[AS94a]
R. Agrawal and R. Srikant. Fast algorithm for mining association rules in large databases.
In Research Report RJ 9839, IBM Almaden Research Center, San Jose, CA, June 1994.
[AS94b]
R. Agrawal and R. Srikant. Fast algorithms for mining association rules. In Proc. 1994
Int. Conf. Very Large Data Bases (VLDB’94), pp. 487–499, Santiago, Chile, Sept. 1994.
[AS95]
R. Agrawal and R. Srikant. Mining sequential patterns. In
Proc. 1995 Int. Conf. Data
Engineering (ICDE’95), pp. 3–14, Taipei, Taiwan, Mar. 1995.
[AS96]
R. Agrawal and J. C. Shafer. Parallel mining of association rules: Design, imple-
mentation, and experience. IEEE Trans. Knowledge and Data Engineering, 8:962–969,
1996.
[AS00]
R. Agrawal and R. Srikant. Privacy-preserving data mining. In
Proc. 2000 ACM-
SIGMOD Int. Conf. Management of Data (SIGMOD’00), pp. 439–450, Dallas, TX, May
2000.
[ASS00]
E. Allwein, R. Shapire, and Y. Singer. Reducing multiclass to binary: A unifying approach
for margin classifiers. Journal of Machine Learning Research, 1:113–141, 2000.
[AV07]
D. Arthur and S. Vassilvitskii. K-means++: The advantages of careful seeding. In
Proc. 2007 ACM-SIAM Symp. on Discrete Algorithms (SODA’07), pp. 1027–1035, Tokyo,
2007.
[Avn95]
S. Avner. Discovery of comprehensible symbolic rules in a neural network. In Proc. 1995
Int. Symp. Intelligence in Neural and Biological Systems, pp. 64–67, Washington, DC,
1995.
[AY99]
C. C. Aggarwal and P. S. Yu. A new framework for itemset generation. In Proc. 1998 ACM
Symp. Principles of Database Systems (PODS’98), pp. 18–24, Seattle, WA, June 1999.
[AY01]
C. C. Aggarwal and P. S. Yu. Outlier detection for high dimensional data. In
Proc.
2001 ACM-SIGMOD Int. Conf. Management of Data (SIGMOD’01), pp. 37–46, Santa
Barbara, CA, May 2001.
[AY08]
C. C. Aggarwal and P. S. Yu. Privacy-Preserving Data Mining: Models and Algorithms.
New York: Springer, 2008.
[BA97]
L. A. Breslow and D. W. Aha. Simplifying decision trees: A survey.
Knowledge Engineering
Rev., 12:1–40, 1997.
[Bay98]
R. J. Bayardo. Efficiently mining long patterns from databases. In
Proc. 1998 ACM-
SIGMOD Int. Conf. Management of Data (SIGMOD’98), pp. 85–93, Seattle, WA, June
1998.
[BB98]
A. Bagga and B. Baldwin. Entity-based cross-document coreferencing using the vector
space model. In Proc. 1998 Annual Meeting of the Association for Computational Lin-
guistics and Int. Conf. Computational Linguistics (COLING-ACL’98), Montreal, Quebec,
Canada, Aug. 1998.
[BB01]
P. Baldi and S. Brunak. Bioinformatics: The Machine Learning Approach (2nd ed.).
Cambridge, MA: MIT Press, 2001.
[BB02]
C. Borgelt and M. R. Berthold. Mining molecular fragments: Finding relevant sub-
structures of molecules. In Proc. 2002 Int. Conf. Data Mining (ICDM’02), pp. 211–218,
Maebashi, Japan, Dec. 2002.
[BBD
+
02]
B. Babcock, S. Babu, M. Datar, R. Motwani, and J. Widom. Models and issues in data
stream systems. In Proc. 2002 ACM Symp. Principles of Database Systems (PODS’02),
pp. 1–16, Madison, WI, June 2002.
[BC83]
R. J. Beckman and R. D. Cook. Outlier
...s. Technometrics, 25:119–149, 1983.
HAN
21-bib-633-672-9780123814791
2011/6/1
3:27
Page 636
#4
636
Bibliography
[BCC10]
S. Buettcher, C. L. A. Clarke, and G. V. Cormack.
Information Retrieval: Implementing
and Evaluating Search Engines. Cambridge, MA: MIT Press, 2010.
[BCG01]
D. Burdick, M. Calimlim, and J. Gehrke. MAFIA: A maximal frequent itemset algo-
rithm for transactional databases. In Proc. 2001 Int. Conf. Data Engineering (ICDE’01),
pp. 443–452, Heidelberg, Germany, Apr. 2001.
[BCP93]
D. E. Brown, V. Corruble, and C. L. Pittard. A comparison of decision tree classifiers
with backpropagation neural networks for multimodal classification problems. Pattern
Recognition, 26:953–961, 1993.
[BD01]
P. J. Bickel and K. A. Doksum.
Mathematical Statistics: Basic Ideas and Selected Topics,
Vol. 1. Prentice-Hall, 2001.
[BD02]
P. J. Brockwell and R. A. Davis. Introduction to Time Series and Forecasting (2nd ed.).
New York: Springer, 2002.
[BDF
+
97]
D. Barbar´a, W. DuMouchel, C. Faloutsos, P. J. Haas, J. H. Hellerstein, Y. Ioannidis,
H. V. Jagadish, T. Johnson, R. Ng, V. Poosala, K. A. Ross, and K. C. Servcik. The New
Jersey data reduction report. Bull. Technical Committee on Data Engineering, 20:3–45,
Dec. 1997.
[BDG96]
A. Bruce, D. Donoho, and H.-Y. Gao. Wavelet analysis. IEEE Spectrum, 33:26–35, Oct.
1996.
[BDJ
+
05]
D. Burdick, P. Deshpande, T. S. Jayram, R. Ramakrishnan, and S. Vaithyanathan. OLAP
over uncertain and imprecise data. In Proc. 2005 Int. Conf. Very Large Data Bases
(VLDB’05), pp. 970–981, Trondheim, Norway, Aug. 2005.
[Ben08]
S. Benninga.
Financial Modeling (3rd. ed.). Cambridge, MA: MIT Press, 2008.
[Ber81]
J. Bertin.
Graphics and Graphic Information Processing. Walter de Gruyter, Berlin, 1981.
[Ber03]
M. W. Berry.
Survey of Text Mining: Clustering, Classification, and Retrieval. New York:
Springer, 2003.
[Bez81]
J. C. Bezdek. Pattern Recognition with Fuzzy Objective Function Algorithms. Plenum
Press, 1981.
[BFOS84]
L. Breiman, J. Friedman, R. Olshen, and C. Stone.
Classification and Regression Trees.
Wadsworth International Group, 1984.
[BFR98]
P. Bradley, U. Fayyad, and C. Reina. Scaling clustering algorithms to large databases.
In
Proc. 1998 Int. Conf. Knowledge Discovery and Data Mining (KDD’98), pp. 9–15,
New York, Aug. 1998.
[BG04]
I. Bhattacharya and L. Getoor. Iterative record linkage for cleaning and integration.
In
Proc. SIGMOD 2004 Workshop on Research Issues on Data Mining and Knowledge
Discovery (DMKD’04), pp. 11–18, Paris, France, June 2004.
[B-G05]
I. Ben-Gal. Outlier detection. In O. Maimon and L. Rockach (eds.),
Data Mining and
Knowledge Discovery Handbook: A Complete Guide for Practitioners and Researchers.
Kluwer Academic, 2005.
[BGKW03]
C. Bucila, J. Gehrke, D. Kifer, and W. White. DualMiner: A dual-pruning algorithm for
itemsets with constraints. Data Mining and Knowledge Discovery, 7:241–272, 2003.
[BGMP03]
F. Bonchi, F. Giannotti, A. Mazzanti, and D. Pedreschi. ExAnte: Anticipated data
reduction in constrained pattern mining. In Proc. 7th European Conf. Principles and
Pratice of Knowledge Discovery in Databases (PKDD’03), Vol. 2838/2003, pp. 59–70,
Cavtat-Dubrovnik, Croatia, Sept. 2003.