HAN
21-bib-633-672-9780123814791
2011/6/1
3:27
Page 655
#23
Bibliography
655
[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.
HAN
21-bib-633-672-9780123814791
2011/6/1
3:27
Page 656
#24
656
Bibliography
[LV88]
W. Y. Loh and N. Vanichsetakul. Tree-structured classificaiton via generalized discrimi-
nant analysis. J. American Statistical Association, 83:715–728, 1988.
[LZ05]
Z. Li and Y. Zhou. PR-Miner: Automatically extracting implicit programming rules
and detecting violations in large software code. In
Proc. 2005 ACM SIGSOFT Symp.
Foundations of Software Engineering (FSE’05), Lisbon, Portugal, Sept. 2005.
[MA03]
S. Mitra and T. Acharya.
Data Mining: Multimedia, Soft Computing, and Bioinformatics.
John Wiley & Sons, 2003.
[MAE05]
A. Metwally, D. Agrawal, and A. El Abbadi. Efficient computation of frequent and
top-
k elements in data streams. In
Proc. 2005 Int. Conf. Database Theory (ICDT’05),
pp. 398–412, Edinburgh, Scotland, Jan. 2005.
[Mac67]
J. MacQueen. Some methods for classification and analysis of multivariate observations.
In
Proc. 5th Berkeley Symp. Math. Stat. Prob., 1:281–297, Berkeley, CA, 1967.
[Mag94]
J. Magidson. The CHAID approach to segmentation modeling: CHI-squared automatic
interaction detection. In R. P. Bagozzi (ed.), Advanced Methods of Marketing Research,
pp. 118–159. Blackwell Business, 1994.
[Man00]
H. Mannila. Theoretical frameworks of data mining.
SIGKDD Explorations, 1:30–32,
2000.
[MAR96]
M. Mehta, R. Agrawal, and J. Rissanen. SLIQ: A fast scalable classifier for data mining.
In Proc. 1996 Int. Conf. Extending Database Technology (EDBT’96), pp. 18–32, Avignon,
France, Mar. 1996.
[Mar09]
S. Marsland. Machine Learning: An Algorithmic Perspective. Chapman & Hall/CRC, 2009.
[MB88]
G. J. McLachlan and K. E. Basford. Mixture Models: Inference and Applications to
Clustering. John Wiley & Sons, 1988.
[MC03]
M. V. Mahoney and P. K. Chan. Learning rules for anomaly detection of hostile net-
work traffic. In Proc. 2003 Int. Conf. Data Mining (ICDM’03), Melbourne, FL, Nov.
2003.
[MCK
+
04]
N. Mamoulis, H. Cao, G. Kollios, M. Hadjieleftheriou, Y. Tao, and D. Cheung. Min-
ing, indexing, and querying historical spatiotemporal data. In Proc. 2004 ACM SIGKDD
Int. Conf. Knowledge Discovery in Databases (KDD’04), pp. 236–245, Seattle, WA, Aug.
2004.
[MCM83]
R. S. Michalski, J. G. Carbonell, and T. M. Mitchell. Machine Learning, An Artificial
Intelligence Approach, Vol. 1. Morgan Kaufmann, 1983.
[MCM86]
R. S. Michalski, J. G. Carbonell, and T. M. Mitchell.
Machine Learning, An Artificial
Intelligence Approach, Vol. 2. Morgan Kaufmann, 1986.
[MD88]
M. Muralikrishna and D. J. DeWitt. Equi-depth histograms for extimating selectiv-
ity factors for multi-dimensional queries. In Proc. 1988 ACM-SIGMOD Int. Conf.
Management of Data (SIGMOD’88), pp. 28–36, Chicago, IL, June 1988.
[Mei03]
M. Meilˇa. Comparing clusterings by the variation of information. In
Proc. 16th Annual
Conf. Computational Learning Theory (COLT’03), pp. 173–187, Washington, DC, Aug.
2003.
[Mei05]
M. Meilˇa. Comparing clusterings: An axiomatic view. In Proc. 22nd Int. Conf. Machine
Learning (ICML’05), pp. 577–584, Bonn, Germany, 2005.
[Men03]
J. Mena.
Investigative Data Mining with Security and Criminal Detection. Butterworth-
Heinemann, 2003.