Databases Reference
In-Depth Information
[HMM86]
J. Hong, I. Mozetic, and R. S. Michalski.
Incremental learning of attribute-based
descriptions
from
examples,
the
method
and
user's
guide.
In
Report
ISG
85-5,
UIUCDCS-F-86-949
,
Department
of
Computer
Science,
University
of
Illinois
at
Urbana-Champaign, 1986.
[HMS66]
E. B. Hunt, J. Marin, and P. T. Stone.
Experiments in Induction
. Academic Press, 1966.
[HMS01]
D. J. Hand, H. Mannila, and P. Smyth.
Principles of Data Mining
(
Adaptive Computation
and Machine Learning
). Cambridge, MA: MIT Press, 2001.
[HN90]
R. Hecht-Nielsen.
Neurocomputing
. Reading, MA: Addison-Wesley, 1990.
[Hor08]
R. Horak.
Telecommunications and Data Communications Handbook
(2nd ed.). Wiley-
Interscience, 2008.
[HP07]
M. Hua and J. Pei. Cleaning disguised missing data: A heuristic approach. In
Proc.
2007 ACM SIGKDD Intl. Conf. Knowledge Discovery and Data Mining (KDD'07)
,
pp. 950-958, San Jose, CA, Aug. 2007.
[HPDW01]
J. Han, J. Pei, G. Dong, and K. Wang. Efficient computation of iceberg cubes with
complex measures.
In
Proc.
2001 ACM-SIGMOD Int.
Conf.
Management of Data
(SIGMOD'01)
, pp. 1-12, Santa Barbara, CA, May 2001.
[HPS97]
J. Hosking, E. Pednault, and M. Sudan. A statistical perspective on data mining.
Future
Generation Computer Systems
, 13:117-134, 1997.
[HPY00]
J. Han, J. Pei, and Y. Yin. Mining frequent patterns without candidate generation. In
Proc. 2000 ACM-SIGMOD Int. Conf. Management of Data (SIGMOD'00)
, pp. 1-12,
Dallas, TX, May 2000.
[HRMS10]
M. Hay, V. Rastogi, G. Miklau, and D. Suciu. Boosting the accuracy of differentially-
private queries through consistency. In
Proc. 2010 Int. Conf. Very Large Data Bases
(VLDB'10)
, pp. 1021-1032, Singapore, Sept. 2010.
[HRU96]
V. Harinarayan, A. Rajaraman, and J. D. Ullman. Implementing data cubes efficiently. In
Proc. 1996 ACM-SIGMOD Int. Conf. Management of Data (SIGMOD'96)
, pp. 205-216,
Montreal, Quebec, Canada, June 1996.
[HS05]
J. M. Hellerstein and M. Stonebraker.
Readings in Database Systems
(4th ed.). Cam-
bridge, MA: MIT Press, 2005.
[HSG90]
S. A. Harp, T. Samad, and A. Guha. Designing application-specific neural networks
using the genetic algorithm. In D. S. Touretzky (ed.),
Advances in Neural Information
Processing Systems II
, pp. 447-454. Morgan Kaufmann, 1990.
[HT98]
T. Hastie and R. Tibshirani. Classification by pairwise coupling.
Ann. Statistics
, 26:451-
471, 1998.
[HTF09]
T. Hastie, R. Tibshirani, and J. Friedman.
The Elements of Statistical Learning: Data
Mining, Inference, and Prediction
(2nd ed.). Springer Verlag, 2009.
[Hua98]
Z. Huang. Extensions to the
k
-means algorithm for clustering large data sets with
categorical values.
Data Mining and Knowledge Discovery
, 2:283-304, 1998.
[Hub94]
C. H. Huberty.
Applied Discriminant Analysis
. Wiley-Interscience, 1994.
[Hub96]
B. B. Hubbard.
The World According to Wavelets
. A. K. Peters, 1996.
[HWB
C
04]
J. Huan, W. Wang, D. Bandyopadhyay, J. Snoeyink, J. Prins, and A. Tropsha. Min-
ing spatial motifs from protein structure graphs. In
Proc. 8th Int. Conf. Research in
Computational Molecular Biology (RECOMB)
, pp. 308-315, San Diego, CA, Mar. 2004.
