HAN
21-bib-633-672-9780123814791
2011/6/1
3:27
Page 657
#25
Bibliography
657
[MFS95]
D. Malerba, E. Floriana, and G. Semeraro. A further comparison of simplification meth-
ods for decision tree induction. In D. Fisher and H. Lenz (eds.), Learning from Data: AI
and Statistics. Springer Verlag, 1995.
[MH95]
J. K. Martin and D. S. Hirschberg. The time complexity of decision tree induction. In
Technical Report ICS-TR 95-27, pp. 1–27, Department of Information and Computer
Science, University of California, Irvine, CA, Aug. 1995.
[MH09]
H. Miller and J. Han. Geographic Data Mining and Knowledge Discovery (2nd ed.).
Chapman & Hall/CRC, 2009.
[Mic83]
R. S. Michalski. A theory and methodology of inductive learning. In R. S. Michalski,
J. G. Carbonell, and T. M. Mitchell (eds.), Machine Learning: An Artificial Intelligence
Approach, Vol. 1, pp. 83–134. Morgan Kaufmann, 1983.
[Mic92]
Z. Michalewicz.
Genetic Algorithms +
Data Structures =
Evolution Programs. Springer
Verlag, 1992.
[Mil98]
R. G. Miller. Survival Analysis. Wiley-Interscience, 1998.
[Min89]
J. Mingers. An empirical comparison of pruning methods for decision-tree induction.
Machine Learning, 4:227–243, 1989.
[Mir98]
B. Mirkin. Mathematical classification and clustering.
J. Global Optimization, 12:105–
108, 1998.
[Mit96]
M. Mitchell. An Introduction to Genetic Algorithms. Cambridge, MA: MIT Press, 1996.
[Mit97]
T. M. Mitchell. Machine Learning. McGraw-Hill, 1997.
[MK91]
M. Manago and Y. Kodratoff. Induction of decision trees from complex structured data.
In G. Piatetsky-Shapiro and W. J. Frawley (eds.),
Knowledge Discovery in Databases,
pp. 289–306. AAAI/MIT Press, 1991.
[MLSZ06]
Q. Mei, C. Liu, H. Su, and C. Zhai. A probabilistic approach to spatiotemporal theme
pattern mining on weblogs. In Proc. 15th Int. Conf. World Wide Web (WWW’06),
pp. 533–542, Edinburgh, Scotland, May 2006.
[MM95]
J. Major and J. Mangano. Selecting among rules induced from a hurricane database.
J. Intelligent Information Systems, 4:39–52, 1995.
[MM02]
G. Manku and R. Motwani. Approximate frequency counts over data streams. In
Proc.
2002 Int. Conf. Very Large Data Bases (VLDB’02), pp. 346–357, Hong Kong, China, Aug.
2002.
[MN89]
M. M´ezard and J.-P. Nadal. Learning in feedforward layered networks: The tiling
algorithm. J. Physics, 22:2191–2204, 1989.
[MO04]
S. C. Madeira and A. L. Oliveira. Biclustering algorithms for biological data analysis: A
survey. IEEE/ACM Trans. Computational Biology and Bioinformatics, 1(1):24–25, 2004.
[MP69]
M. L. Minsky and S. Papert. Perceptrons: An Introduction to Computational Geometry.
Cambridge, MA: MIT Press, 1969.
[MRA95]
M. Metha, J. Rissanen, and R. Agrawal. MDL-based decision tree pruning. In
Proc.
1995 Int. Conf. Knowledge Discovery and Data Mining (KDD’95), pp. 216–221, Montreal,
Quebec, Canada, Aug. 1995.
[MRS08]
C. D. Manning, P. Raghavan, and H. Schutze. Introduction to Information Retrieval.
Cambridge University Press, 2008.
[MS03a]
M. Markou and S. Singh. Novelty detection: A review—part 1: Statistical approaches.
Signal Processing, 83:2481–2497, 2003.
HAN
21-bib-633-672-9780123814791
2011/6/1
3:27
Page 658
#26
658
Bibliography
[MS03b]
M. Markou and S. Singh. Novelty detection: A review—part 2: Neural network based
approaches. Signal Processing, 83:2499–2521, 2003.
[MST94]
D. Michie, D. J. Spiegelhalter, and C. C. Taylor. Machine Learning, Neural and Statistical
Classification. Chichester, England: Ellis Horwood, 1994.
[MT94]
R. S. Michalski and G. Tecuci.
Machine Learning, A Multistrategy Approach, Vol. 4.
Morgan Kaufmann, 1994.
[MTV94]
H. Mannila, H. Toivonen, and A. I. Verkamo. Efficient algorithms for discovering asso-
ciation rules. In
Proc. AAAI’94 Workshop Knowledge Discovery in Databases (KDD’94),
pp. 181–192, Seattle, WA, July 1994.
[MTV97]
H. Mannila, H. Toivonen, and A. I. Verkamo. Discovery of frequent episodes in event
sequences.
Data Mining and Knowledge Discovery, 1:259–289, 1997.
[Mur98]
S. K. Murthy. Automatic construction of decision trees from data: A multi-disciplinary
survey. Data Mining and Knowledge Discovery, 2:345–389, 1998.
[Mut05]
S. Muthukrishnan. Data Streams: Algorithms and Applications. Now Publishers, 2005.
[MXC
+
07]
Q. Mei, D. Xin, H. Cheng, J. Han, and C. Zhai. Semantic annotation of frequent patterns.
ACM Trans. Knowledge Discovery from Data (TKDD), 15:321–348, 2007.
[MY97]
R. J. Miller and Y. Yang. Association rules over interval data. In
Proc. 1997 ACM-
SIGMOD Int. Conf. Management of Data (SIGMOD’97), pp. 452–461, Tucson, AZ, May
1997.
[MZ06]
Q. Mei and C. Zhai. A mixture model for contextual text mining. In Proc. 2006
ACM SIGKDD Int. Conf. Knowledge Discovery in Databases (KDD’06), pp. 649–655,
Philadelphia, PA, Aug. 2006.
[NB86]
T. Niblett and I. Bratko. Learning decision rules in noisy domains. In M. A. Brammer
(ed.),
Expert Systems ’86: Research and Development in Expert Systems III, pp. 25–34.
British Computer Society Specialist Group on Expert Systems, Dec. 1986.
[NBW06]
M. Newman, A.-L. Barabasi, and D. J. Watts. The Structure and Dynamics of Networks.
Princeton University Press, 2006.
[NC03]
C. C. Noble and D. J. Cook. Graph-based anomaly detection. In
Proc. 2003 ACM
SIGKDD Int. Conf. Knowledge Discovery and Data Mining (KDD’03), pp. 631–636,
Washington, DC, Aug. 2003.
[New10]
M. Newman. Networks: An Introduction. Oxford University Press, 2010.
[NG04]
M. E. J. Newman and M. Girvan. Finding and evaluating community structure in
networks. Physical Rev. E, 69:113–128, 2004.
[NGE-R09]
J. Neville, B. Gallaher, and T. Eliassi-Rad. Evaluating statistical tests for within-network
classifiers of relational data. In Proc. 2009 Int. Conf. Data Mining (ICDM’09), pp. 397–
406, Miami, FL, Dec. 2009.
[NH94]
R. Ng and J. Han. Efficient and effective clustering method for spatial data mining. In
Proc. 1994 Int. Conf. Very Large Data Bases (VLDB’94), pp. 144–155, Santiago, Chile,
Sept. 1994.
[NJW01]
A. Y. Ng, M. I. Jordan, and Y. Weiss. On spectral clustering: Analysis and an algorithm.
In T. G. Dietterich, S. Becker, and Z. Ghahramani (eds.),
Advances in Neural Information
Processing Systems 14. pp. 849–856, Cambridge, MA: MIT Press, 2001.
[NK04]
S. Nijssen and J. Kok. A quick start in frequent structure mining can make a difference.
In Proc. 2004 ACM SIGKDD Int. Conf. Knowledge Discovery in Databases (KDD’04),
pp. 647–652, Seattle, WA, Aug. 2004.