Association-based similarity testing and its applications

Intelligent Data Analysis

Volumn 7, Issue 3, 2003, Pages 209-232

  Li, Tao ^a   Ogihara, Mitsunori ^a   Zhu, Shenghuo ^a  

^a University of Rochester   (United States)

Author keywords

association; distributed data mining; heterogeneous; maximal frequent itemset; similarity measure

Indexed keywords

ASSOCIATION REACTIONS; MAPPING;

CATEGORICAL DATABASE; DISTRIBUTED DATA MINING; GENERIC APPROACH; HETEROGENEOUS; INFORMATION ENTROPY; MAXIMAL FREQUENT ITEMSETS; SIMILARITY MEASURE; SYNTHETIC DATASETS;

DATA MINING;

EID: 34548714163     PISSN: 1088467X     EISSN: 15714128     Source Type: Journal    
DOI: 10.3233/ida-2003-7304     Document Type: Article

References (57)

1. C.C. Aggarwal, J.L.Wolf, P.S.Yu, C. Procopiuc and J.S. Park, Fast algorithms for projected clustering, inACMSIGMOD Conference, 1999, pp. 61-72.
2. R. Agrawal, C. Faloutsos and A. Swami, Efficient similarity search in sequence databases, in Proceedings of 4th International Conference on Foundations of Data Organization and Algorithms, Springer-Verlag, Lecture Notes in Computer Science 730, 1993, pp. 69-84.
3. R. Agrawal, T. Imielinski and A. Swami, Mining associations between sets of items in massive databases, in Proceedings of the ACM-SIGMOD 1993 International Conference on Management of Data, 1993, pp. 207-216.
4. R. Agrawal, H. Mannila, R. Srikant, H. Toivonen and A.I. Verkamo, Fast discovery of association rules, in Advances in Knowledge Discovery and Data Mining, AAAI/MIT Press, 1996, pp. 307-328.
5. R. Agrawal and R. Srikant, Fast algorithms for mining association rules in large databases, in Proceedings of 20th Conference on Very Large Databases, 1994, pp. 487-499.
6. J.S. Albus, A new approach to manipulator control: The cerebellar model articlatioon controller (CMAC), Trans. of the ASME, J. Dynamic Systems, Meaasurement, and Control 97(3) (Sep. 1975), 220-227.
7. R.J. Bayardo, Efficiently mining long patterns from databases, in ACM SIGMOD, 1998, pp. 85-93.
8. R.J. Bayardo Jr. and R. Agrawal, Mining the most interesting rules, in Proceedings of 5th International Conference on Knowledge Discovery and Data Mining, ACM Press, New York, NY, 1999, pp. 145-154.
9. C. Blake and C. Merz, UCI repository of machine learning databases, 1998.
10. D. Boes, F. Graybill and A. Mood, Introduction to the Theory of Statistics, McGraw-Hill, New York, 1974.
11. D. Burdick, M. Calimlim and J. Gehrke, MAFIA: A maximal frequent itemset algorithm for transactional databases, in ICDE, 2001, pp. 443-452.
12. P. Chan and S. Stolfo, Meta-learning for multistrategy and parallel learning, in Proceedings of the Second International Workshop on Multistrategy Learning, 1993.
13. D. Cheung, J. Han, V.T. Ng and A.W.F.an Y. Fu, Fast distributed algorithm for mining association rules, in International Conference on Parallel and Distributed Information Systems, 1996, pp. 31-42.
14. E. Cohen, M. Datar, S. Fujiwara, A. Gionis, P. Indyk, R. Motwani, J.D. wullman and C. Yang, Finding interesting associations without support pruning, IEEE Trasactions on Knowledge and Data Engineering 13(1) (2001), 64-78.
15. G. Das, D. Gunopulos and H. Mannila, Finding similar time series, in Principles of Data Mining and Knowledge Discovery, 1997, pp. 88-100.
16. G. Das and H. Mannila, Context-based similarity methods for categorical attributes, in PKDD, D.Z. et al, ed., 2000, pp. 201-211.
17. G. Das, H. Mannila and P. Ronkainen, Similarity of attributes by external probes, in Proceedings of 4th International Conference on Knowledge Discovery and Data Mining, Los Alamitos, CA, IEEE Comptuer Society Press, 1998, pp. 23-29.
18. B. Efron and R.J. Tibshirani, An introduction to the bootstrap, Chapman & Hall, 1993.
19. M.L. Fredman and R.E. Tarjan, Fibonacci heaps and their uses in improve network algorithms, Journal of the Association for Computing Machinery 34 (1987), 595-615.
20. A. Fu, R. Kwong and J. Tang, Mining n most interesting itemsets, in Proceedings of 12th International Symposium on Methodologies for Intelligent Systems, Springer-Verlag Lecture Notes in Computer Science 1932, 2000, pp. 59-67.
21. H.N. Gabow and R.E. Tarjan, Faster scaling algorithms for network problems, SIAM Journal on Computing 18 (1989), 1013-1036.
22. V. Ganti, J. Gehrke and R. Ramakrishnan, A framework for measuring changes in data characteristics, in Proceedings of 18th Symposium on Principles of Database Systems, ACM Press, 1999, pp. 126-137.
23. D.Q. Goldin and P.C. Kanellakis, On similarity queries for time-series data: Constraint specification and implementation, in Proceedings of the 1st International Conference on Principles and Practice of Constraint Programming (CP'95), volume 976 of LNCS, Cassis, France, Springer Verlag, 1995, pp. 137-153.
24. R. Goldman, N. Shivakumar, S. Venkatasubramanian and H. Garcia-Molina, Proximity search in databases, in Proceedings of 24th Conference on Very Large Databases, Morgan Kaufmann, 1998, pp. 26-37.
25. K. Gouda and M.J. Zaki, Efficiently mining maximal frequent itemsets, in ICDM, 2001, pp. 163-170.
26. E. Han, G. Karypis and V. Kumar, Scalable parallel data mining for association rules, in ACM SIGMOD Conference, ACM Press, 1997, pp. 277-288.
27. J. Han, J. Pei and Y. Yin, Mining frequent patterns without candidate generation, in ACM SIGMOD Conference, ACM Press, 2000, pp. 1-12.
28. J. Hartigan, Clustering Algorithms, Wiley, 1975.
29. J. Hipp, U. G̈untzer and U. Grimmer, Data quality mining-making a virtue of necessity, in Proceedings of the 6th ACMSIGMODWorkshop on Research Issues in Data Mining and Knowledge Discovery (DMKD 2001), Santa Barbara, California, May 20 2001, pp. 52-57.
30. J. Hipp, U. G̈untzer and G. Nakhaeizadeh, Algorithms for association rule mining-a general survey and comparison, SIGKDD Explorations 2(1) (2000), 58-63.
31. M. Houtsma and A. Swami, Set-oriented mining of association rules. Research Report RJ 9567, IBM Almaden Research Center, San Jose, CA, Oct. 1993.
32. H.V. Jagadish, A.O. Mendelzon and T. Milo, Similarity-based queries, in Proceedings of 14th Symposium on Principles of Database Systems, ACM Press, 1995, pp. 36-45.
33. A. Jain and R. Dubes, Algorithms for Clustering Data. Prentice Hall, 1988.
34. M.I. Jordan, ed., Learning in Graphical Models, Kluwer Academic Publishers, 1998.
35. M.-Y. Kao, T.-W. Lam,W.-K. Sung and H.-F. Ting, A decomposition theorem for maximum weight bipartite matchings, SIAM Journal on Computing 31(1) (2001), 18-26.
36. H. Kargupta and P. Chan, eds, Advances in Distributed and Parallel Data Mining, AAAI Press, 2000.
37. H. Kargupta, B. Park, D. Hershbereger and E. Johnson, Collective data mining: A new perspective toward distributed data mining, in Advances in Distributed and Parallel Data Mining, H. Kargupta and P. Chan, eds, AAAI Press, 2000, pp. 133-184.
38. T. Li, S. Zhu and M. Ogihara, A new distributed data mining model based on similarity, in: the 18th ACM Symposium on Applied Computing (SAC), Melbourne, Florida, USA, 2003, pp. 432-436.
39. H. Mannila and P. Ronkainen, Similarity of event sequences, in TIME, 1997, pp. 136-139.
40. S. McClean, B. Scotney, K. Greer and R. Pairceir, Conceptual clustering of heterogeneous distributed databases, in Workshop on Ubiquitous Data Mining, PAKDD01, 2001.
41. S. Parthasarathy and M. Ogihara, Clustering distributed homogeneous datasets, in Proceedings of the Fourth European Conference on Principles of Data Mining and Knowledge Discovery, D.A. Zighed, H.J. Komorowski and J.M. Zytkow, eds, Springer-Verlag Lecture Notes in Computer Science 1910, 2000, pp. 566-574.
42. S. Parthasarathy and M. Ogihara, Exploiting dataset similarity for distributed mining, in Parallel and Distributed Processing, 15 IPDPS 2000 Workshops Proceedings, J.D.P.R. et al., ed., Springer-Verlag, Lecture Notes in Computer Science 1800, 2000, pp. 390-398.
43. F. Provost, Distributed data mining: Scaling up and beyond, in Advances in Distributed Data Mining, H. Kargupta and P. Chan, ed, AAAI/MIT Press, 2000, pp. 3-27.
44. F.J. Provost, D. Jensen and T. Oates, Efficient progressive sampling, in Knowledge Discovery and Data Mining, 1999, pp. 23-32.
45. M.B.R. Wirth and J. Hipp, When distribution is part of the semantics: A new problem class for distributed knowledge discovery, in In Proceedings of workshop on Ubiquitous Data Mining for Mobile and Distributed Environments, PKDD/ECML 2001, 2001.
46. D. Rafiei and A. Mendelzon, Similarity-based queries for time series data, 1997, pp. 13-25.
47. R. Ronkainen, Attribute Similarity and Event Sequence Similarity in Data Mining, Ph.lic. thesis, University of Helsinki, 1998, Available as Report C-1998-42, University of Helsinki, Department of Computer Science, October, 1998.
48. J. Seiferas, A large bibliography on theory/foundations of computer science, http://liinwww.ira.uka.de/bibliography/Theory/Seiferas/index.html.
49. R. Srikant and R. Agrawal, Mining quantitative association rules in large relational tables, in SIGMOD-96, 1996, pp. 1-12.
50. R. Subramonian, Defining diff as a data mining primitive, in Proceedings of 4th International Conference on Knowledge Discovery and Data Mining, AAAI Press, Menlo Park, CA, 1998, pp. 334-338.
51. H. Toivonen, Sampling large databases for association rules, in The VLDB Journal, 1996, pp. 134-145.
52. M. Zaki and C. Ho, eds, Large-Scale Parallel Data Mining, Springer, 2000.
53. M. Zaki, S. Parthasarathy, M. Ogihara and W. Li, New algorithms for fast discovery of association rules, in Proceedings of 3rd International Conference on Knowledge Discovery and Data Mining, Los Alamitos, CA, IEEE Computer Society Press, Los Alamitos, CA, 1997, pp. 283-286.
54. M. Zaki, S. Parthasarathy, M. Ogihara and W. LI, Parallel algorithms for discovery of association rules, Data Mining and Knowledge Discovery 1 (1998), 343-373.
55. M.J. Zaki and M. Ogihara, Theoretical foundations of association rules, in Proceedings of the SIGMOD'98 Workshop on Research Issues in Data Mining and Knowledge Discovery (DMKD), 1998, pp. 7:1-7:8.
56. M.J. Zaki, S. Parthasarathy,W. Li and M. Ogihara, Evaluation of sampling for data mining of association rules, Technical Report TR617, 1996.
57. S. Zhu, T. Li and M. Ogihara, CoFD: An algorithm for non-distance based clustering in high dimensional spaces, in 4th International Conference of DataWarehousing and Knowledge Discovery (DaWaK 2002), Y. Kambayashi,W.Winiwarter and M. Arikawa, eds, vol. 2454 of LNCS, Aix-en-Provence, France, Springer-Verlag, September 2002, pp. 52-62.