HAN
21-bib-633-672-9780123814791
2011/6/1
3:27
Page 645
#13
Bibliography
645
[Fri77]
J. H. Friedman. A recursive partitioning decision rule for nonparametric classifiers.
IEEE
Trans. Computer, 26:404–408, 1977.
[Fri01]
J. H. Friedman. Greedy function approximation: A gradient boosting machine.
Ann.
Statistics, 29:1189–1232, 2001.
[Fri03]
N. Friedman. Pcluster: Probabilistic agglomerative clustering of gene expression profiles.
In Technical Report 2003-80, Hebrew University, 2003.
[FRM94]
C. Faloutsos, M. Ranganathan, and Y. Manolopoulos. Fast subsequence matching in
time-series databases. In
Proc. 1994 ACM-SIGMOD Int. Conf. Management of Data
(SIGMOD’94), pp. 419–429, Minneapolis, MN, May 1994.
[FS93]
U. Fayyad and P. Smyth. Image database exploration: Progress and challenges. In
Proc.
AAAI’93 Workshop Knowledge Discovery in Databases (KDD’93), pp. 14–27, Washington,
DC, July 1993.
[FS97]
Y. Freund and R. E. Schapire. A decision-theoretic generalization of on-line learning and
an application to boosting.
J. Computer and System Sciences, 55:119–139, 1997.
[FS06]
R. Feldman and J. Sanger.
The Text Mining Handbook: Advanced Approaches in Analyzing
Unstructured Data. Cambridge University Press, 2006.
[FSGM
+
98]
M. Fang, N. Shivakumar, H. Garcia-Molina, R. Motwani, and J. D. Ullman. Computing
iceberg queries efficiently. In Proc. 1998 Int. Conf. Very Large Data Bases (VLDB’98),
pp. 299–310, New York, NY, Aug. 1998.
[FW94]
J. Furnkranz and G. Widmer. Incremental reduced error pruning. In
Proc. 1994 Int.
Conf. Machine Learning (ICML’94), pp. 70–77, New Brunswick, NJ, 1994.
[FWFY10]
B. C. M. Fung, K. Wang, A. W.-C. Fu, and P. S. Yu.
Introduction to Privacy-Preserving
Data Publishing: Concepts and Techniques. Chapman & Hall/CRC, 2010.
[FYM05]
R. Fujimaki, T. Yairi, and K. Machida. An approach to spacecraft anomaly detec-
tion problem using kernel feature space. In Proc. 2005 Int. Workshop Link Discovery
(LinkKDD’05), pp. 401–410, Chicago, IL, 2005.
[Gal93]
S. I. Gallant.
Neural Network Learning and Expert Systems. Cambridge, MA: MIT Press,
1993.
[Gat00]
B. Gates. Business @ the Speed of Thought: Succeeding in the Digital Economy. Warner
Books, 2000.
[GCB
+
97]
J. Gray, S. Chaudhuri, A. Bosworth, A. Layman, D. Reichart, M. Venkatrao, F. Pellow,
and H. Pirahesh. Data cube: A relational aggregation operator generalizing group-by,
cross-tab and sub-totals. Data Mining and Knowledge Discovery, 1:29–54, 1997.
[GFKT01]
L. Getoor, N. Friedman, D. Koller, and B. Taskar. Learning probabilistic models of rela-
tional structure. In Proc. 2001 Int. Conf. Machine Learning (ICML’01), pp. 170–177,
Williamstown, MA, 2001.
[GFS
+
01]
H. Galhardas, D. Florescu, D. Shasha, E. Simon, and C.-A. Saita. Declarative data clean-
ing: Language, model, and algorithms. In Proc. 2001 Int. Conf. Very Large Data Bases
(VLDB’01), pp. 371–380, Rome, Italy, Sept. 2001.
[GG92]
A. Gersho and R. M. Gray.
Vector Quantization and Signal Compression. Kluwer
Academic, 1992.
[GG98]
V. Gaede and O. G¨unther. Multidimensional access methods. ACM Computing Surveys,
30:170–231, 1998.
HAN
21-bib-633-672-9780123814791
2011/6/1
3:27
Page 646
#14
646
Bibliography
[GGR99]
V. Ganti, J. E. Gehrke, and R. Ramakrishnan. CACTUS—clustering categorical data
using summaries. In Proc. 1999 Int. Conf. Knowledge Discovery and Data Mining
(KDD’99), pp. 73–83, San Diego, CA, 1999.
[GGRL99]
J. Gehrke, V. Ganti, R. Ramakrishnan, and W.-Y. Loh. BOAT—optimistic decision
tree construction. In Proc. 1999 ACM-SIGMOD Int. Conf. Management of Data
(SIGMOD’99), pp. 169–180, Philadelphia, PA, June 1999.
[GHL06]
H. Gonzalez, J. Han, and X. Li. Flowcube: Constructuing RFID flowcubes for multi-
dimensional analysis of commodity flows. In Proc. 2006 Int. Conf. Very Large Data Bases
(VLDB’06), pp. 834–845, Seoul, Korea, Sept. 2006.
[GHLK06]
H. Gonzalez, J. Han, X. Li, and D. Klabjan. Warehousing and analysis of massive RFID
data sets. In Proc. 2006 Int. Conf. Data Engineering (ICDE’06), p. 83, Atlanta, GA, Apr.
2006.
[GKK
+
01]
R. L. Grossman, C. Kamath, P. Kegelmeyer, V. Kumar, and R. R. Namburu.
Data Mining
for Scientific and Engineering Applications. Kluwer Academic, 2001.
[GKR98]
D. Gibson, J. M. Kleinberg, and P. Raghavan. Clustering categorical data: An approach
based on dynamical systems. In Proc. 1998 Int. Conf. Very Large Data Bases (VLDB’98),
pp. 311–323, New York, NY, Aug. 1998.
[GM99]
A. Gupta and I. S. Mumick.
Materialized Views: Techniques, Implementations, and
Applications. Cambridge, MA: MIT Press, 1999.
[GMMO00]
S. Guha, N. Mishra, R. Motwani, and L. O’Callaghan. Clustering data streams. In
Proc.
2000 Symp. Foundations of Computer Science (FOCS’00), pp. 359–366, Redondo Beach,
CA, 2000.
[GMP
+
09]
J. Ginsberg, M. H. Mohebbi, R. S. Patel, L. Brammer, M. S. Smolinski, and L. Brilliant.
Detecting influenza epidemics using search engine query data. Nature, 457:1012–1014,
Feb. 2009.
[GMUW08]
H. Garcia-Molina, J. D. Ullman, and J. Widom.
Database Systems: The Complete Book
(2nd ed.). Prentice Hall, 2008.
[GMV96]
I. Guyon, N. Matic, and V. Vapnik. Discoverying informative patterns and data cleaning.
In U. M. Fayyad, G. Piatetsky-Shapiro, P. Smyth, and R. Uthurusamy (eds.),
Advances in
Knowledge Discovery and Data Mining, pp. 181–203. AAAI/MIT Press, 1996.
[Gol89]
D. Goldberg.
Genetic Algorithms in Search, Optimization, and Machine Learning. Read-
ing, MA: Addison-Wesley, 1989.
[GR04]
D. A. Grossman and O. Frieder. Information Retrieval: Algorithms and Heuristics. New
York: Springer, 2004.
[GR07]
P. D. Grunwald and J. Rissanen.
The Minimum Description Length Principle. Cambridge,
MA: MIT Press, 2007.
[GRG98]
J. Gehrke, R. Ramakrishnan, and V. Ganti. RainForest: A framework for fast decision tree
construction of large datasets. In
Proc. 1998 Int. Conf. Very Large Data Bases (VLDB’98),
pp. 416–427, New York, NY, Aug. 1998.
[GRS98]
S. Guha, R. Rastogi, and K. Shim. CURE: An efficient clustering algorithm for large
databases. In
Proc. 1998 ACM-SIGMOD Int. Conf. Management of Data (SIGMOD’98),
pp. 73–84, Seattle, WA, June 1998.