Pattern comparison in data mining: A survey

Research and Trends in Data Mining Technologies and Applications

Volumn , Issue , 2006, Pages 86-120

  Ntoutsi, Irene ^a   Pelekis, Nikos ^a   Theodoridis, Yannis ^a  

^a UNIVERSITY OF PIRAEUS   (Greece)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84899164346     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.4018/978-1-59904-271-8.ch004     Document Type: Chapter

References (57)

1. Aggarwal, C.C. (2005). On change diagnosis in evolving data streams. IEEE Transactions on Knowledge and Data Engineering, 17, 587-600.
2. Agrawal, R., Imielinski, T., & Swami, A. (1993). Mining association rules between sets of items in large databases. In Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data (pp. 207-216). Washington, DC: ACM.
3. st International Conference on Very Large Data Bases (pp. 502-514). Zurich, Switzerland: Morgan Kaufmann.
4. th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (pp. 287-291). San Diego, CA: ACM.
5. rd International Conference on Data Warehousing and Knowledge Discovery (pp. 51-60). Munich, Germany: Springer.
6. Baron, S., & Spiliopoulou, M. (2002). Monitoring the results of the KDD process: An overview of pattern evolution, In J. Meij (Ed.), Dealing with the data flood: mining data, text and multimedia (pp. 845-863). The Hague, The Netherlands: STT.
7. Baron, S., & Spiliopoulou, M. (2003). Monitoring the evolution of Web usage patterns. In B. Berendt, A. Hotho, D. Mladenic, M. Someren, M. Spiliopoulou, & G. Stumme (Eds.), Proceedings of Web Mining: From Web to Semantic Web, 1st European Web Mining Forum (pp. 181-200). Cavtat-Dubrovnik, Croatia: Springer.
8. th East European Conference on Advances in Databases and Information Systems (pp. 253-265). Dresden, Germany: Springer.
9. th European Conference on Principles and Practice of Knowledge Discovery in Databases (pp. 96-499). Pisa, Italy: Springer.
10. Breiman, L., Friedman, J., Olshen, R., & Stone, C. (1984). Classification and regression trees. Belmont, CA: Wadsworth International Group.
11. Catania, B., & Maddalena, A. (2006). Pattern management: Practice and challenges. In J. Darmont & O. Boussaïd (Eds.), Processing and managing complex data for decision support (pp. 280-317). Hershey, PA: Idea Group Publishing.
12. rd European Conference on Principles and Practice of Knowledge Discovery in Databases (pp. 295-300). Prague, Czech Republic: Springer.
13. th International Conference on Data Engineering (pp. 106-114). New Orleans, LA: IEEE Computer Society.
14. th International Conference on Database Systems for Advanced Applications (pp. 185-194). Melbourne, Australia: World Scientific.
15. nd International Conference on Knowledge Discovery and Data Mining (pp. 307-310). Portland, OR: AAAI Press.
16. D'Agostino, R.B., & Stephens, M.A. (Eds.). (1986). Goodness-of-fit techniques. New York: Marcel Dekker.
17. Dongen, S.V. (2000). Performance criteria for graph clustering and Markov cluster experiments. Technical Report. Amsterdam: Center for Mathematics and Computer Science.
18. Dunham, M.H. (2003). Data mining: Introductory and advanced topics. Upper Saddle River, NJ: Prentice-Hall.
19. Hunt, E.B., Marin, J., & Stone, P.T. (1966). Experiments in induction. New York: Academic Press.
20. Fayyad, U.M., Piatetsky-Shapiro, G., & Smyth, P. (1996). From data mining to knowledge discovery: An overview. In U.M. Fayyad, G. Piatetsky-Shapiro, P. Smyth, & R. Uthurusamy (Eds.), Advances in knowledge discovery and data mining (pp. 1-34). Newport Beach, CA: AAAI/MIT Press.
21. Fowlkes, E.B., & Mallows, C.L. (1983). A method for comparing two hierarchical clusterings. Journal of the American Statistical Association, 78, 553-569.
22. Gabow, H.N., & Tarjan, R.E. (1989). Faster scaling algorithms for network problems. SIAM Journal of Computation, 18, 1013-1036.
23. th ACM SIGACT-SIG-MOD-SIGART Symposium on Principles of Database Systems (pp. 126-137). Philadelphia: ACM Press.
24. th International Conference on Data Engineering (pp. 439-448). San Diego, CA: IEEE Computer Society.
25. Ganti, V., & Ramakrishnan, R. (2002). Mining and monitoring evolving data. In J. Abello, P.M. Pardalos, & M.G.C. Resende (Eds.), Handbook of massive data sets (pp. 593-642.). Norwell, MA: Kluwer Academic.
26. Gehrke, J., Ganti, V., Ramakrishnan, R., & Loh, W.-Y. (1999). Boat-optimistic decision tree construction. In A. Delis, C. Faloutsos, & S. Ghandeharizadeh (Eds.), In Proceedings of the ACM SIGMOD International Conference on Management of Data (pp. 169-180). Philadelphia: ACM Press.
27. Gupta, G.K., Strehl, A., & Ghosh, J. (1999). Distance-based clustering of association rules. In Proceedings of ANNIE 1999, Intelligent Engineering Systems Through Artificial Neural Networks 9 (pp. 759-764).
28. Han, J., & Kamber, M. (2000). Data mining: Concepts and techniques. San Francisco: Morgan Kaufmann.
29. Jain, K., Murty, M.N., & Flynn, P.J. (1999). Data clustering: A review. ACM Computer Surveys, 31(3), 264-323.
30. Kuhn, H. (1955). Hungarian method for the assignment problem. Naval Research Quarterly, 2, 83-97.
31. th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (pp. 16-22). San Diego, CA: ACM.
32. th International Conference on Data Engineering. Birmingham, UK: IEEE Computer Society.
33. Li, T., Ogihara, M., & Zhu, S. (2003). Association-based similarity testing and its applications. Intelligent Data Analysis, 7, 209-232.
34. th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (pp. 335-340). San Francisco: ACM.
35. Liu, B., Ma, Y., & Lee, R. (2001). Analyzing the interestingness of association rules from the temporal dimension. In N. Cercone, T.Y. Lin, & X. Wu (Eds.), In Proceedings of the 2001 IEEE International Conference on Data Mining (pp. 377-384). San Jose, CA: IEEE Computer Society.
36. Loh, W.-Y., & Shih, Y.-S. (1997). Split selection methods for classification trees. Statistica Sinica, 7, 815-840.
37. Loh, W.-Y., & Vanichsetakul, N. (1988). Tree-structured classification via generalized discriminant analysis (with discussion). Journal of the American Statistical Association, 83, 715-728.
38. Lyman, P., & Varian, H.R. (2003). How much information. Retrieved January 30, 2006, from http://www.sims.berkeley.edu/research/projects/how-much-info.
39. th Annual Conference on Computational Learning Theory (pp. 173-187). Washington, DC: Springer.
40. nd International Conference on Machine Learning (pp. 577-584). Bonn, Germany: ACM.
41. Meila, M., & Heckerman, D. (2001). An experimental comparison of model-based clustering methods. Machine Learning, 42, 9-29.
42. Mirkin, B. (1996). Mathematical classification and clustering. London: Kluwer Academic Press.
43. Mitchell, T. (1997). Machine learning. New York: McGraw-Hill.
44. th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (pp. 218-227). Chicago: ACM.
45. th European Conference on Principles of Data Mining (pp. 566-574). Lyon, France: Springer.
46. Rand W.M. (1971). Objective criteria for the evaluation of clustering methods. Journal of the American Statistical Association, 66, 846-850.
47. nd International Conference on Conceptual Modeling (pp. 77-90). Chicago: Springer.
48. rd International Conference on Knowledge Discovery and Data Mining (pp. 187-190). Newport Beach, CA: AAAI Press.
49. th International Workshop on Database and Expert Systems Applications (pp. 310-315). Vienna, Austria: IEEE Computer Society.
50. Toivonen, H. (1996). Sampling large databases for association rules. In T.M. Vijayaraman, A.P. Buchmann, C. Mohan, & N.L. Sarda (Eds.), In Proceedings of 1996 International Conference on Very Large Data Bases (pp. 134-145). Bombay, India: Morgan Kaufmann.
51. Toivonen, H., Klemettinen, M., Ronkainen, P., Hatonen, K., & Mannila, H. (1995). Pruning and grouping of discovered association rules. Workshop Notes of the ECML-95 Workshop on Statistics, Machine Learning, and Knowledge Discovery (pp. 47-52). Heraklion, Greece: Mlnet.
52. Utgoff, P.E. (1989). Incremental induction of decision trees. Machine Learning, 4, 161-186.
53. Utgoff, P.E., Berkman, N.C., & Clouse, J.A. (1997). Decision tree induction based on efficient tree restructuring. Machine Learning, 29, 5-44.
54. Wallace, D.L. (1983). Comment. Journal of the American Statistical Association, 78, 569-576.
55. st International Conference on Very Large Data Bases (pp. 709-720). Trondheim, Norway: ACM.
56. Zaki, M., & Hsiao, C.-J. (2005). Efficient algorithms for mining closed itemsets and their lattice structure. IEEE Transactions on Knowledge and Data Engineering, 17, 462-478.
57. nd International Conference on Machine Learning (pp. 1028-1035). Bonn, Germany: ACM.