Association rules network: Definition and applications

Statistical Analysis and Data Mining

Volumn 1, Issue 4, 2009, Pages 260-279

  Pandey, Gaurav ^a   Chawla, Sanjay ^b   Poon, Simon ^b   Arunasalam, Bavani ^b   Davis, Joseph G ^b  

^a University of Minnesota   (United States)

^b UNIVERSITY OF SYDNEY   (Australia)

Author keywords

Association rules; Association rules network; Data mining

Indexed keywords

DATA MINING;

ASSOCIATION RULE ALGORITHM; ASSOCIATION RULE NETWORK; CASE-STUDIES; DATA MINING PROCESS; DIRECTED HYPERGRAPHS; STATISTICAL THEORY;

ASSOCIATION RULES;

EID: 62249090283     PISSN: 19321872     EISSN: 19321864     Source Type: Journal    
DOI: 10.1002/sam.10027     Document Type: Article

References (41)

1. J. Han and M. Kamber, Data Mining, Concepts and Trends, Morgan Kaufmann, 2001.
2. A. Koutsoyiannis, Theory of Econometrics, (2nd ed.), Palgrave, 2001.
3. R. Agrawal and R. Srikant, Fast algorithms for mining association rules, Proceedings 20th International Conference Very Large Data Bases, VLDB, Morgan Kaufmann, 1994, 487-499.
4. R. Agrawal, T. Imieliński, and A. Swami, Mining association rules between sets of items in large databases, SIGMOD Rec 22(2) (1993), 207-216.
5. P. Tan, M. Steinbach, and V. Kumar, Introduction to Data Mining, Addison-Wesley, 2006.
6. R. Sapsford and V. Jupp, Data Collection and Analysis, Sage Publications, 2006.
7. S. Chawla, B. Arunasalam, and J. Davis, Mining Open source Software (OSS) Data using Association Rules Network, in Advances in Knowledge Discovery and Data Mining, 7th Pacific-Asia Conference, PAKDD'03, 2003, 461-466.
8. S. Chawla, J. Davis, and G. Pandey, On local pruning of association rules using directed hypergraphs, in Proceedings of the 20th IEEE International Conference on Data Engineering, Boston, 2004, 832.
9. M. J. Zaki, Generating non-redundant association rules, Proceedings of the Sixth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, ACM Press, 2000, 34-43.
10. S. Jaroszewicz and D. A. Simovici, Pruning redundant association rules using maximum entropy principle, in Advances in Knowledge Discovery and Data Mining, 6th Pacific-Asia Conference, PAKDD'02, Taipei, Taiwan, 2002, 135-147.
11. A. N. Pasquier, Y. Bastide, R. Taouil, and L. Lakhal, Discovering frequent closed itemsets for association rules, Proceeding of the 7th International Conference on Database Theory, Springer-Verlag, 1999, 398-416.
12. M. J. Zaki and C.-J. Hsiao, ChARM: An efficient algorithm for closed association rule mining, in Proceedings of the SIAM International Conference on Data Mining (SDM), 2002.
13. J. Pei, J. Han, and R. Mao, CLOSET: an efficient algorithm for mining frequent closed itemsets, in ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery, 2000, 21-30.
14. H. Xiong, P.-N. Tan, and V. Kumar, Hyperclique pattern discovery, Data Mining Knowl Discov J 13(2) (2006), 219-242.
15. Y. Ke, J. Cheng and W. Ng, Mining quantitative correlated patterns using an information-theoretic approach, in Proceedings of the 12th ACM SIGKDD Conference, 2006, 227-236.
16. G. Piatetsky-Shapiro and C. J. Matheus, The interestingness of deviations, in Proceedings of the AAAI-94 Workshop on Knowledge Discovery in Databases, 1994, 25-36.
17. P. Tan, V. Kumar, and J. Srivastava, Selecting the right objective measure for association analysis. Inf Syst 29(4) (2004), 293-313.
18. L. Geng and H. J. Hamilton, Interestingness measures for data mining: A survey, ACM Comput Surv 38(3) (2006), Article 9.
19. A. Silberschatz and A. Tuzhilin, On subjective measures of interestingness in knowledge discovery, in Proceedings of the First International Conference on Knowledge Discovery and Data Mining, 1995, 275-281.
20. S. Jaroszewicz and D. A. Simovici, Interestingness of frequent itemsets using Bayesian networks as background knowledge, in Proceedings of the Tenth ACM SIGKDD Conference, 2004, 178-186.
21. C. Wang and S. Parthasarathy, Summarizing itemset patterns using probabilistic models, in Proceedings of the 12th ACM SIGKDD Conference, 2006, 730-735.
22. X. Yan, H. Cheng, J. Han, and D. Xin, Summarizing itemset patterns: a profile-based approach, in Proceeding of the Eleventh ACM SIGKDD Conference, 2005, 314-323.
23. E.-H. Han, G. Karypis, V. Kumar, and B. Mobasher, Clustering based on association rule hypergraphs, in Proceedings SIGMOD Workshop Research Issues on Data Mining and Knowledge Discovery (DMKD '97), 1997.
24. D. Xin, J. Han, X. Yan, and H. Cheng. Mining compressed frequent-pattern sets, in Proceedings of 31st International Conference on Very Large Databases (VLDB), 2005, 709-720.
25. G. Gupta, A. Strehl, and J. Ghosh, Distance based clustering of association rules, Intelligent Engineering Systems Through Artificial Neural Networks, Proceedings of ANNIE 1999, Vol. 9, ASME Press, 1999, 759-764.
26. A. Berrado and G. Runger, Using metarules to to group discovered association rules, Data Mining Knowledge Discovery (DMKD), Vol. 14-3, Springer, 2007, 409-431.
27. G. Gallo, G. Longo, and S. Pallottino, Directed hypergraphs and applications, Discrete Appl Math 42(2) (1993), 177-201.
28. M. Zaki and M. Ogihara, Theoretical foundations of association rules, in Proceedings of 3rd SIGMOD'98 Workshop on Research Issues in Data Mining and Knowledge Discovery (DMKD'98), Seattle, Washington, June 1998.
29. D. Gunopulos, H. Mannila, R. Khardon, and H. Toivonen, Data mining, hypergraph transversals, and machine learning, in Proceedings of ACM PODS, 1997, 209-216.
30. G. I. G. Ausiello and U. Nanni, Dynamic maintenance of directed hypergraphs, Theor Comput Sci 72(2-3) (1990), 97-117.
31. M. Ramaswamy, S. Sarkar, and Y. Chen, Using directed hypergraphs to verify rule-based expert systems, IEEE TKDE 9(2) (1997), 221-237.
32. D. Heckerman, Bayesian networks for data mining, Data Mining Knowl Discov 1 (1997), 79-119.
33. G. Ausiello, G. F. Italiano, and U. Nanni, Hypergraph traversal revisited: Cost measures and dynamic algorithms, Lect Notes Comput Sci 1450 (1998), 1-16.
34. R. Cooley, B. Mobasher, and J. Srivastava, Data preparation for mining world wide web browsing patterns, Knowledge and Information Systems (1), 1999, 5-32.
35. A. Dutoit and B. Bruegge, Communication metrics for software development, IEEE Trans Softw Eng 24(8) (1998), 615-628.
36. G. Karypis and V. Kumar, Multilevel k-way hypergraph partitioning, ACM IEEE Design Automation Conference (DAC), 1999, 343-348.
37. R. L. Gorsuch, Factor Analysis, Hillsdale, NJ, Erlbaum, 1983.
38. S. K. Poon, J. G. Davis, and B. Choi, Understanding of IT complementarities using augmented Endogenous Growth Framework, in The Proceedings of the 26th International Conference on Information Systems (ICIS2005), Las Vegas, 11-14 December, 2005, 659-671.
39. ABS (Australian Bureaus of Statistics), Business Longitudinal Survey, Australian Bureau of Statistics, Cat. NO 8141.0, 2000.
40. OECD, Measuring Productivity (OECD Manual): Measuring of Aggregate and Industry Level Productivity Growth, Paris, OECD, 2001.
41. R. Baron and D. Kenny, Moderator-mediator variable distinction in social psychology research: Conceptual, strategic, and statistical considerations, J Pers Soc Psychol 51 (1986), 1173-1182.