Databases Reference
In-Depth Information
[JW02a] G. Jeh and J. Widom. SimRank: A measure of structural-context similarity. In
Proc.
2002 ACM SIGKDD Int. Conf. Knowledge Discovery and Data Mining (KDD'02)
,
pp. 538-543, Edmonton, Alberta, Canada, July 2002.
[JW02b] R. A. Johnson and D. A. Wichern.
Applied Multivariate Statistical Analysis
(5th ed.).
Prentice Hall, 2002.
[Kam09] C. Kamath.
Scientific Data Mining: A Practical Perspective
. Society for Industrial and
Applied Mathematic (SIAM), 2009.
[Kas80] G. V. Kass. An exploratory technique for investigating large quantities of categorical
data.
Applied Statistics
, 29:119-127, 1980.
[KBDM09] B. Kulis, S. Basu, I. Dhillon, and R. Mooney. Semi-supervised graph clustering: A kernel
approach.
Machine Learning
, 74:1-22, 2009.
[Kec01] V. Kecman.
Learning and Soft Computing
. Cambridge, MA: MIT Press, 2001.
[Kei97] D. A. Keim. Visual techniques for exploring databases. In
Tutorial Notes, 3rd Int. Conf.
Knowledge Discovery and Data Mining (KDD'97)
, Newport Beach, CA, Aug. 1997.
[Ker92] R. Kerber. ChiMerge: Discretization of numeric attributes. In
Proc. 1992 Nat. Conf.
Artificial Intelligence (AAAI'92)
, pp. 123-128, San Jose, CA, 1992.
[KF09] D. Koller and N. Friedman.
Probabilistic Graphical Models: Principles and Techniques
.
Cambridge, MA: MIT Press, 2009.
[KH95] K. Koperski and J. Han. Discovery of spatial association rules in geographic informa-
tion databases. In
Proc. 1995 Int. Symp. Large Spatial Databases (SSD'95)
, pp. 47-66,
Portland, ME, Aug. 1995.
[KH97] I. Kononenko and S. J. Hong. Attribute selection for modeling.
Future Generation
Computer Systems
, 13:181-195, 1997.
[KH09] M.-S. Kim and J. Han. A particle-and-density based evolutionary clustering method for
dynamic networks. In
Proc. 2009 Int. Conf. Very Large Data Bases (VLDB'09)
, Lyon,
France, Aug. 2009.
[KHC97] M. Kamber, J. Han, and J. Y. Chiang. Metarule-guided mining of multi-dimensional
association rules using data cubes. In
Proc. 1997 Int. Conf. Knowledge Discovery and
Data Mining (KDD'97)
, pp. 207-210, Newport Beach, CA, Aug. 1997.
[KHK99] G. Karypis, E.-H. Han, and V. Kumar. CHAMELEON: A hierarchical clustering algo-
rithm using dynamic modeling.
COMPUTER
, 32:68-75, 1999.
[KHY
C
08] H. Kargupta, J. Han, P. S. Yu, R. Motwani, and V. Kumar.
Next Generation of Data
Mining
. Chapman & Hall/CRC, 2008.
[KJ97]
R. Kohavi and G. H. John. Wrappers for feature subset selection.
Artificial Intelligence
,
97:273-324, 1997.
[KJSY04]
H. Kargupta, A. Joshi, K. Sivakumar, and Y. Yesha.
Data Mining: Next Generation
Challenges and Future Directions
. Cambridge, MA: AAAI/MIT Press, 2004.
[KK01]
M. Kuramochi and G. Karypis. Frequent subgraph discovery. In
Proc. 2001 Int. Conf.
Data Mining (ICDM'01)
, pp. 313-320, San Jose, CA, Nov. 2001.
[KKW
C
10]
H. S. Kim, S. Kim, T. Weninger, J. Han, and T. Abdelzaher. NDPMine: Efficiently min-
ing discriminative numerical features for pattern-based classification. In
Proc. 2010
European Conf. Machine Learning and Principles and Practice of Knowledge Discovery
in Databases (ECMLPKDD'10)
, Barcelona, Spain, Sept. 2010.
[KKZ09]
H.-P. Kriegel, P. Kroeger, and A. Zimek. Clustering high-dimensional data: A survey on
subspace clustering, pattern-based clustering, and correlation clustering.
ACM Trans.
Knowledge Discovery from Data (TKDD)
, 3(1):1-58, 2009.
