A framework for synthesizing arbitrary Boolean expressions induced by frequent itemsets

Proceedings of the 3rd Indian International Conference on Artificial Intelligence, IICAI 2007

Volumn , Issue , 2007, Pages 5-23

  Adhikari, Animesh ^a   Rao, P R ^b  

^a Smt Parvatibai Chowgule College   (India)

^b GOA UNIVERSITY   (India)

Author keywords

Conditional patterns; Data mining; Synthesis

Indexed keywords

BOOLEAN EXPRESSIONS; CONDITIONAL PATTERNS; ITEM SETS; SYNTHETIC DATABASE; TRANSACTIONAL DATABASE;

ARTIFICIAL INTELLIGENCE; DATA MINING; SYNTHESIS (CHEMICAL);

DATABASE SYSTEMS;

EID: 72449169018     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (17)

1. Agrawal, R., Imielinski, T., Swami, A.: Mining association rules between sets of items in large databases. In: Proceedings of ACM SIGMOD Conf. Management of Data (1993) 207-216
2. Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: Proceedings of the International Conference on Very Large Data Bases (1994) 487-499
3. Feller, W.: An introduction to probability theory and its applications. 3rd edn. vol. 1, Wiley (1968)
4. Frequent itemset mining dataset repository, http://fimi.cs.helsinki.fi/ data
5. FIMI 2004, http://fimi.cs.helsinki.fi/src/
6. Gregg, J.R.: Ones and zeros: Understanding Boolean algebra, digital circuits, and the logic of sets. Wiley-IEEE Press (1998)
7. Han, J., Pei, J., Yiwen, Y.: Mining frequent patterns without candidate generation. In: Proceedings ACM SIGMOD Conf. Management of Data (2000) 1-12
8. Liu, C.L.: Elements of discrete mathematics. 2nd edn. McGraw-Hill (1985)
9. Muhonen, J., Toivonen, H.: Closed non-derivable itemsets. In: Proceedings of PKDD (2006) 601-608
10. Pavlov, D., Mannila, H., Smyth, P.: Probabilistics models for query approximation with large sparse binary data sets. In: Proceedings of Sixteenth Conference on Uncertainty in Artificial Intelligence (2000)
11. st International Conference on Very Large Data Bases (1995) 432-443
12. Shima, Y., Mitsuishi, S., Hirata, K., Harao, M., Suzuki, E., Arikawa, S.: Extracting minimal and closed monotone dnf formulas. In: Proceedings of International Conference on Discovery Science, vol. 3245 (2004) 298-305
13. Wang, K., Zhou, S., He, Y.: Hierarchical classification of real life documents. In: Proceedings of the 1st (SIAM) International Conference on Data Mining (2001) 1-16
14. Wu, X., Zhang, C., Zhang, S.: Efficient mining of both positive and negative association rules. ACM Transactions on Information Systems 22(3) (2004) 381-405
15. Wu, X., Wu, Y., Wang, Y., Li, Y.: Privacy-aware market basket data set generation: A feasible approach for inverse frequent set mining. In: Proceedings of SIAM International Conference on Data Mining (2005) 103-114
16. Wu, X., Zhang, C., Zhang, S.: Database classification for multi-database mining. Information Systems 30(1) (2005) 71-88
17. Zhao, L., Zaki, M.J., Ramakrishnan, M.: BLOSOM: A framework for mining arbitrary Boolean expressions. In: Proceedings of KDD (2006) 827-832