HAN
21-bib-633-672-9780123814791
2011/6/1
3:27
Page 661
#29
Bibliography
661
[PTVF07]
W. H. Press, S. A. Teukolosky, W. T. Vetterling, and B. P. Flannery.
Numerical Recipes:
The Art of Scientific Computing. Cambridge: Cambridge University Press, 2007.
[PY10]
S. J. Pan and Q. Yang. A survey on transfer learning.
IEEE Trans. Knowledge and Data
Engineering, 22:1345–1359, 2010.
[Pyl99]
D. Pyle.
Data Preparation for Data Mining. Morgan Kaufmann, 1999.
[PZC
+
03]
J. Pei, X. Zhang, M. Cho, H. Wang, and P. S. Yu. Maple: A fast algorithm for maximal
pattern-based clustering. In Proc. 2003 Int. Conf. Data Mining (ICDM’03), pp. 259–266,
Melbourne, FL, Dec. 2003.
[QC-J93]
J. R. Quinlan and R. M. Cameron-Jones. FOIL: A midterm report. In
Proc. 1993
European Conf. Machine Learning (ECML’93), pp. 3–20, Vienna, Austria, 1993.
[QR89]
J. R. Quinlan and R. L. Rivest. Inferring decision trees using the minimum description
length principle. Information and Computation, 80:227–248, Mar. 1989.
[Qui86]
J. R. Quinlan. Induction of decision trees. Machine Learning, 1:81–106, 1986.
[Qui87]
J. R. Quinlan. Simplifying decision trees. Int. J. Man-Machine Studies, 27:221–234, 1987.
[Qui88]
J. R. Quinlan. An empirical comparison of genetic and decision-tree classifiers. In Proc.
1988 Int. Conf. Machine Learning (ICML’88), pp. 135–141, Ann Arbor, MI, June 1988.
[Qui89]
J. R. Quinlan. Unknown attribute values in induction. In
Proc. 1989 Int. Conf. Machine
Learning (ICML’89), pp. 164–168, Ithaca, NY, June 1989.
[Qui90]
J. R. Quinlan. Learning logic definitions from relations.
Machine Learning, 5:139–166,
1990.
[Qui93]
J. R. Quinlan. C4.5: Programs for Machine Learning. Morgan Kaufmann, 1993.
[Qui96]
J. R. Quinlan. Bagging, boosting, and C4.5. In Proc. 1996 Nat. Conf. Artificial Intelligence
(AAAI’96), Vol. 1, pp. 725–730, Portland, OR, Aug. 1996.
[RA87]
E. L. Rissland and K. Ashley. HYPO: A case-based system for trade secret law. In
Proc.
1st Int. Conf. Artificial Intelligence and Law, pp. 60–66, Boston, MA, May 1987.
[Rab89]
L. R. Rabiner. A tutorial on hidden Markov models and selected applications in speech
recognition. Proc. IEEE, 77:257–286, 1989.
[RBKK95]
S. Russell, J. Binder, D. Koller, and K. Kanazawa. Local learning in probabilistic networks
with hidden variables. In Proc. 1995 Joint Int. Conf. Artificial Intelligence (IJCAI’95),
pp. 1146–1152, Montreal, Quebec, Canada, Aug. 1995.
[RC07]
R. Ramakrishnan and B.-C. Chen. Exploratory mining in cube space. Data Mining and
Knowledge Discovery, 15:29–54, 2007.
[Red92]
T. Redman.
Data Quality: Management and Technology. Bantam Books, 1992.
[Red01]
T. Redman.
Data Quality: The Field Guide. Digital Press (Elsevier), 2001.
[RG03]
R. Ramakrishnan and J. Gehrke.
Database Management Systems (3rd ed.). McGraw-Hill,
2003.
[RGN10]
L. De Raedt, T. Guns, and S. Nijssen. Constraint programming for data mining and
machine learning. In Proc. 2010 AAAI Conf. Artificial Intelligence (AAAI’10), pp. 1671–
1675, Atlanta, GA, July 2010.
[RH01]
V. Raman and J. M. Hellerstein. Potter’s wheel: An interactive data cleaning system. In
Proc. 2001 Int. Conf. Very Large Data Bases (VLDB’01), pp. 381–390, Rome, Italy, Sept.
2001.
[RH07]
A. Rosenberg and J. Hirschberg. V-measure: A conditional entropy-based external
cluster evaluation measure. In Proc. 2007 Joint Conf. Empirical Methods in Natural Lan-
guage Processing and Computational Natural Language Learning (EMNLP-CoNLL’07),
pp. 410–420, Prague, Czech Republic, June 2007.
HAN
21-bib-633-672-9780123814791
2011/6/1
3:27
Page 662
#30
662
Bibliography
[RHS01]
J. F. Roddick, K. Hornsby, and M. Spiliopoulou. An updated bibliography of tempo-
ral, spatial, and spatio-temporal data mining research. In J. F. Roddick and K. Hornsby
(eds.), TSDM 2000, Lecture Notes in Computer Science 2007, pp. 147–163. New York:
Springer, 2001.
[RHW86]
D. E. Rumelhart, G. E. Hinton, and R. J. Williams. Learning internal representations by
error propagation. In D. E. Rumelhart and J. L. McClelland (eds.),
Parallel Distributed
Processing. Cambridge, MA: MIT Press, 1986.
[Rip96]
B. D. Ripley.
Pattern Recognition and Neural Networks. Cambridge University Press,
1996.
[RM86]
D. E. Rumelhart and J. L. McClelland. Parallel Distributed Processing. Cambridge, MA:
MIT Press, 1986.
[RMS98]
S. Ramaswamy, S. Mahajan, and A. Silberschatz. On the discovery of interesting pat-
terns in association rules. In Proc. 1998 Int. Conf. Very Large Data Bases (VLDB’98),
pp. 368–379, New York, Aug. 1998.
[RN95]
S. Russell and P. Norvig.
Artificial Intelligence: A Modern Approach. Prentice-Hall, 1995.
[RNI09]
M. Radovanovi´c, A. Nanopoulos, and M. Ivanovi´c. Nearest neighbors in high-
dimensional data: The emergence and influence of hubs. In Proc. 2009 Int. Conf.
Machine Learning (ICML’09), pp. 865–872, Montreal, Quebec, Canada, June 2009.
[Ros58]
F. Rosenblatt. The perceptron: A probabilistic model for information storage and
organization in the brain. Psychological Rev., 65:386–498, 1958.
[RS89]
C. Riesbeck and R. Schank. Inside Case-Based Reasoning. Lawrence Erlbaum, 1989.
[RS97]
K. Ross and D. Srivastava. Fast computation of sparse datacubes. In Proc. 1997 Int. Conf.
Very Large Data Bases (VLDB’97), pp. 116–125, Athens, Greece, Aug. 1997.
[RS98]
R. Rastogi and K. Shim. Public: A decision tree classifer that integrates building and
pruning. In Proc. 1998 Int. Conf. Very Large Data Bases (VLDB’98), pp. 404–415,
New York, Aug. 1998.
[RS01]
F. Ramsey and D. Schafer.
The Statistical Sleuth: A Course in Methods of Data Analysis.
Duxbury Press, 2001.
[RSC98]
K. A. Ross, D. Srivastava, and D. Chatziantoniou. Complex aggregation at multiple gran-
ularities. In
Proc. Int. Conf. Extending Database Technology (EDBT’98), pp. 263–277,
Valencia, Spain, Mar. 1998.
[Rus06]
J. C. Russ. The Image Processing Handbook (5th ed.). CRC Press, 2006.
[SA95]
R. Srikant and R. Agrawal. Mining generalized association rules. In Proc. 1995 Int. Conf.
Very Large Data Bases (VLDB’95), pp. 407–419, Zurich, Switzerland, Sept. 1995.
[SA96]
R. Srikant and R. Agrawal. Mining sequential patterns: Generalizations and perfor-
mance improvements. In Proc. 5th Int. Conf. Extending Database Technology (EDBT’96),
pp. 3–17, Avignon, France, Mar. 1996.
[SAM96]
J. Shafer, R. Agrawal, and M. Mehta. SPRINT: A scalable parallel classifier for data min-
ing. In Proc. 1996 Int. Conf. Very Large Data Bases (VLDB’96), pp. 544–555, Bombay,
India, Sept. 1996.
[SAM98]
S. Sarawagi, R. Agrawal, and N. Megiddo. Discovery-driven exploration of OLAP data
cubes. In Proc. Int. Conf. Extending Database Technology (EDBT’98), pp. 168–182,
Valencia, Spain, Mar. 1998.