Databases Reference
In-Depth Information
[LLS00]
T.-S. Lim, W.-Y. Loh, and Y.-S. Shih. A comparison of prediction accuracy, complex-
ity, and training time of thirty-three old and new classification algorithms.
Machine
Learning
, 40:203-228, 2000.
[LM97]
K. Laskey and S. Mahoney. Network fragments: Representing knowledge for construct-
ing probabilistic models. In
Proc. 13th Annual Conf. Uncertainty in Artificial Intelligence
,
pp. 334-341, San Francisco, CA, Aug. 1997.
[LM98a]
H. Liu and H. Motoda.
Feature Selection for Knowledge Discovery and Data Mining
.
Kluwer Academic, 1998.
[LM98b]
H. Liu and H. Motoda (eds.).
Feature Extraction, Construction, and Selection: A Data
Mining Perspective
. Kluwer Academic, 1998.
[LNHP99]
L. V. S. Lakshmanan, R. Ng, J. Han, and A. Pang. Optimization of constrained fre-
quent set queries with 2-variable constraints. In
Proc. 1999 ACM-SIGMOD Int. Conf.
Management of Data (SIGMOD'99)
, pp. 157-168, Philadelphia, PA, June 1999.
[L-NK03]
D. Liben-Nowell and J. Kleinberg. The link prediction problem for social networks. In
Proc. 2003 Int. Conf. Information and Knowledge Management (CIKM'03)
, pp. 556-559,
New Orleans, LA, Nov. 2003.
[Los01]
D. Loshin.
Enterprise Knowledge Management: The Data Quality Approach
. Morgan
Kaufmann, 2001.
[LP97]
A. Lenarcik and Z. Piasta. Probabilistic rough classifiers with mixture of discrete and
continuous variables. In T. Y. Lin and N. Cercone (eds.),
Rough Sets and Data Mining:
Analysis for Imprecise Data
, pp. 373-383, Kluwer Academic, 1997.
[LPH02]
L. V. S. Lakshmanan, J. Pei, and J. Han. Quotient cube: How to summarize the semantics
of a data cube. In
Proc. 2002 Int. Conf. Very Large Data Bases (VLDB'02)
, pp. 778-789,
Hong Kong, China, Aug. 2002.
[LPWH02]
J. Liu, Y. Pan, K. Wang, and J. Han. Mining frequent itemsets by opportunistic projec-
tion. In
Proc. 2002 ACM SIGKDD Int. Conf. Knowledge Discovery in Databases (KDD'02)
,
pp. 239-248, Edmonton, Alberta, Canada, July 2002.
[LPZ03]
L. V. S. Lakshmanan, J. Pei, and Y. Zhao. QC-Trees: An efficient summary structure
for semantic OLAP. In
Proc. 2003 ACM-SIGMOD Int. Conf. Management of Data
(SIGMOD'03)
, pp. 64-75, San Diego, CA, June 2003.
[LS95]
H. Liu and R. Setiono. Chi2: Feature selection and discretization of numeric attributes.
In
Proc. 1995 IEEE Int. Conf. Tools with AI (ICTAI'95)
, pp. 388-391, Washington, DC,
Nov. 1995.
[LS97]
W. Y. Loh and Y. S. Shih. Split selection methods for classification trees.
Statistica Sinica
,
7:815-840, 1997.
[LSBZ87]
P. Langley, H. A. Simon, G. L. Bradshaw, and J. M. Zytkow.
Scientific Discovery:
Computational Explorations of the Creative Processes
. Cambridge, MA: MIT Press, 1987.
[LSL95]
H. Lu, R. Setiono, and H. Liu. Neurorule: A connectionist approach to data mining. In
Proc. 1995 Int. Conf. Very Large Data Bases (VLDB'95)
, pp. 478-489, Zurich, Switzerland,
Sept. 1995.
[LSW97]
B. Lent, A. Swami, and J. Widom. Clustering association rules. In
Proc. 1997 Int. Conf.
Data Engineering (ICDE'97)
, pp. 220-231, Birmingham, England, Apr. 1997.
[Lux07]
U. Luxburg. A tutorial on spectral clustering.
Statistics and Computing
, 17:395-416,
2007.
