A generative pattern model for mining binary datasets

Proceedings of the ACM Symposium on Applied Computing

Volumn , Issue , 2010, Pages 1109-1110

  Lucchese, Claudio ^a   Orlando, Salvatore ^b   Perego, Raffaele ^a  

^a ISTI CNR   (Italy)

^b CA' FOSCARI UNIVERSITY OF VENICE   (Italy)

Author keywords

matrix decomposition; top k pattern mining

Indexed keywords

APPLICATION FIELDS; ASSOCIATED COSTS; DATA SETS; EFFICIENT ALGORITHM; HIGH QUALITY; MATRIX DECOMPOSITION; PATTERN MINING; RECURRENT PATTERNS; RELEVANT PATTERNS;

ALGORITHMS;

EID: 77954731191     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1774088.1774320     Document Type: Conference Paper

References (5)

1. H. Cheng, PS. Yu, and J. Han. AC-Close: Efficiently Mining Approximate Closed Itemsets by Core Pattern Recovery. In Proc. of ICDM, pages 839-844, 2006.
2. R. Gupta, G. Fang, B. Field, M. Steinbach, and V. Kumar. Quantitative evaluation of approximate frequent pattern mining algorithms. In Proc. of KDD, pages 301-309, 2008.
3. P. Miettinen, T. Mielikainen, A. Gionis, G. Das, and H. Mannila. The discrete basis problem. IEEE TKDE, 20(10):1348-1362, Oct. 2008.
4. Jorma Rissanen. Stochastic Complexity in Statistical Inquiry Theory. World Scientific Publishing Co., Inc., River Edge, NJ, USA, 1989.
5. Y. Xiang, R. Jin, D. Fuhry, and F. Dragan. Succinct summarization of transactional databases: an overlapped hyperrectangle scheme. In Proc. of KDD, pages 758-766, 2008.