Connections between mining frequent itemsets and learning generative models

Proceedings - IEEE International Conference on Data Mining, ICDM

Volumn , Issue , 2007, Pages 571-576

  Laxman, Srivatsan ^a   Naldurg, Prasad ^a   Sripada, Raja ^a   Venkatesan, Ramarathnam ^a  

^a MICROSOFT RESEARCH INDIA   (India)

Author keywords

[No Author keywords available]

Indexed keywords

BENCHMARK DATA; FREQUENCY PATTERNS; FREQUENT ITEMSETS MINING; GENERATIVE MODELING; INTERNATIONAL CONFERENCES; ITEM SETS; MINING FREQUENT ITEMSETS; PATTERN DISCOVERY; PROBABILITY MASS FUNCTIONS; STATISTICAL SIGNIFICANCE TEST;

ADMINISTRATIVE DATA PROCESSING; DATA MINING; DECISION SUPPORT SYSTEMS; EDUCATION; IMAGE RETRIEVAL; INFORMATION MANAGEMENT; RISK ASSESSMENT; SEARCH ENGINES; STANDARDS;

MINING;

EID: 49749084331     PISSN: 15504786     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDM.2007.83     Document Type: Conference Paper

References (11)

1. R. Agrawal, T. Imielinski, and A. Swami. Mining association rules between sets of items in large databases. In Proceedings of the ACM SIGMOD Conference on Management of Data, pages 207-216, May 1993.
2. W. DuMouchel and D. Pregibon. Empirical bayes screening for multi-item associations. In Knowledge Discovery and Data Mining, pages 67-76, 2001.
3. D. Hand, H. Mannila, and P. Smyth. Principles of data mining. MIT Press, Cambridge, MA, USA, 2001.
4. J. Hipp, U. Güntzer, and G. Nakhaeizadeh. Algorithms for association rule mining - a general survey and comparison. SIGKDD Explorations, 2(1):58-64, July 2000.
5. S. Laxman, P. Naldurg, R. Sripada, and R. Venkatesan. Connections between mining frequent itemsets and learning generative models. Technical Report MSR-TR-2007-100, Microsoft Research, 2007.
6. S. Laxman, P. S. Sastry, and K. P. Unnikrishnan. Discovering frequent episodes and learning Hidden Markov Models: A formal connection. IEEE Transactions on Knowledge and Data Engineering, 17(11):1505-1517, Nov. 2005.
7. B. Liu, W. Hsu, and Y. Ma. Pruning and summarizing the discovered associations. In Knowledge Discovery and Data Mining, pages 125-134, 1999.
8. H. Mannila. Theoretical frameworks for data mining. SIGKDD Explor. Newsl., 1(2):30-32, 2000.
9. P. Naldurg, S. Schwoon, S. Rajamani, and J. Lambert. Netra: Seeing through access control. In ACM Workshop on Formal Methods for Security Engineering FMSE 2006, Virginia, USA, 2006.
10. C. Silverstein, S. Brin, and R. Motwani. Beyond market baskets: Generalizing association rules to dependence rules. Data Mining Knowledge Discovery, 2(1):39-68, 1998.
11. X. Sun and A. B. Nobel. Significance and recovery of block structures in binary matrices with noise. Technical report, Department of Statistics and Operations Research, UNC Chapel Hill, 2005.