A unifying framework for mining approximate top-κ binary patterns

IEEE Transactions on Knowledge and Data Engineering

Volumn 26, Issue 12, 2014, Pages 2900-2913

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

^a ISTI CNR   (Italy)

^b CA' FOSCARI UNIVERSITY OF VENICE   (Italy)

Author keywords

0 1 data; approximate top k patterns; communities in bipartite networks; MDL; Mining methods and algorithms

Indexed keywords

0-1 DATA; APPROXIMATE TOP-K PATTERNS; BIPARTITE NETWORK; MDL; MINING METHODS AND ALGORITHMS;

EID: 84908252781     PISSN: 10414347     EISSN: None     Source Type: Journal    
DOI: 10.1109/TKDE.2013.181     Document Type: Article

References (28)

1. P. Miettinen, T. Mielikainen, A. Gionis, G. Das, and H. Mannila, "The discrete basis problem," IEEE Trans. Knowl. Data Eng., vol. 20, no. 10, pp. 1348-1362, Oct. 2008.
2. Y. Xiang, R. Jin, D. Fuhry, and F. F. Dragan, "Summarizing transactional databases with overlapped hyperrectangles," Data Min. Knowl. Discov., vol. 23, no. 2, pp. 215-251, Sep. 2011.
3. C. Lucchese, S. Orlando, and R. Perego, "Mining top-k patterns from binary datasets in presence of noise," in Proc. SDM SIAM, 2010, pp. 165-176.
4. P. Miettinen and J. Vreeken, "Model order selection for Boolean matrix factorization," in Proc. KDD, New York, NY, USA, 2011, pp. 51-59.
5. H. Cheng, P. S. Yu, and J. Han, "AC-Close: Efficiently mining approximate closed itemsets by core pattern recovery," in Proc. ICDM, Hong Kong, China, 2006, pp. 839-844.
6. C. Lucchese, S. Orlando, and R. Perego, "A generative pattern model for mining binary datasets," in Proc. SAC, Sierre, Switzerland, 2010, pp. 1109-1110.
7. Y. Xiang, R. Jin, D. Fuhry, and F. F. Dragan, "Succinct summarization of transactional databases: An overlapped hyperrectangle scheme," in Proc. KDD, Las Vegas, NV, USA, 2008, pp. 758-766.
8. J. Rissanen, "Modeling by shortest data description," Automatica, vol. 14, no. 5, pp. 465-471, 1978.
9. M. J. Zaki and C.-J. Hsiao, "Efficient algorithms for mining closed itemsets and their lattice structure," IEEE Trans. Knowl. Data Eng., vol. 17, no. 4, pp. 462-478, Apr. 2005.
10. P.-N. Tan,M. Steinbach, and V. Kumar, Introduction to Data Mining. Boston, MA, USA: Addison-Wesley, 2006.
11. R. Gupta, G. Fang, B. Field, M. Steinbach, and V. Kumar, "Quantitative evaluation of approximate frequent pattern mining algorithms," in Proc. KDD, Las Vegas, NV, USA, 2008, pp. 301-309.
12. W. Fan et al., "Direct mining of discriminative and essential frequent patterns via model-based search tree," in Proc. KDD, Las Vegas, NV, USA, 2008, pp. 230-238.
13. T. Hofmann, "Probabilistic latent semantic indexing," in Proc. SIGIR, Berkeley, CA, USA, 1999, pp. 50-57.
14. D. M. Blei, A. Y. Ng, and M. I. Jordan, "Latent Dirichlet allocation," J. Mach. Learn. Res., vol. 3, pp. 993-1022, Jan. 2003.
15. A. Hyvärinen, J. Karhunen, and E. Oja, Independent Component Analysis. New York, NY, USA: John and Wiley, 2001.
16. H. Hiisila and E. Bingham, "Dependencies between transcription factor binding sites: Comparison between ICA, NMF, PLSA and frequent sets," in Proc. ICDM, Washington, DC, USA, 2004, pp. 114-121.
17. Z. Y. Zhang, T. Li, C. Ding, X. W. Ren, and X. S. Zhang. "Binary matrix factorization for analyzing gene expression data," Data Min. Knowl. Discov., vol. 20, no. 1, pp. 28-52, 2010.
18. J. Seppänen, E. Bingham, and H. Mannila, "A simple algorithm for topic identification in 0-1 data," in Proc. PKDD, Cavtat-Dubrovnik, Croatia, 2003, pp. 423-434.
19. F. Geerts, B. Goethals, and T. Mielikäinen, "Tiling databases," in Proc. Discov. Sci., Padova, Italy, pp. 278-289, 2004.
20. T. Li, "A general model for clustering binary data," in Proc. KDD, Chicago, IL, USA, 2005, pp. 188-197.
21. A. Gionis, H. Mannila, and J. Seppänen, "Geometric and combinatorial tiles in 0-1 data," in Proc. PKDD, Pisa, Italy, 2004, pp. 173-184.
22. A. Siebes, J. Vreeken, and M. van Leeuwen, "Item sets that compress," in Proc. SDM SIAM, 2006.
23. J. Vreeken, M. van Leeuwen, and A. Siebes, "KRIMP: Mining itemsets that compress," Data Min. Knowl. Discov., vol. 23, no. 1, pp. 169-214, 2011.
24. S. Hanhijärvi et al., "Tell me something i don't know: Randomization strategies for iterative data mining," in Proc. KDD, Paris, France, 2009, pp. 379-388.
25. N. Tatti and J. Vreeken, "Comparing apples and oranges-Measuring differences between data mining results," in Proc. ECML-PKDD, Berlin, Germany, 2011, pp. 398-413.
26. P. Miettinen, "Dynamic Boolean matrix factorizations," in Proc. ICDM, Washington, DC, USA, 2012, pp. 519-528.
27. C. Cheng, U. Fayyad, and P. Bradley, "Efficient discovery of errortolerant frequent itemsets in high dimensions," in Proc. KDD, San Francisco, CA, USA, 2001, pp. 194-203.
28. M. Steinbach, P. Tan, and V. Kumar, "Support envelopes: A technique for exploring the structure of association patterns," in Proc. KDD, New York, NY, USA, 2004, pp. 296-305.