An information-theoretic approach to finding informative noisy tiles in binary databases

Proceedings of the 10th SIAM International Conference on Data Mining, SDM 2010

Volumn , Issue , 2010, Pages 153-164

  Kontonasios, Kleanthis Nikolaos ^a   De Bie, Tijl ^a  

^a UNIVERSITY OF BRISTOL   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

DATABASE SYSTEMS; INFORMATION THEORY;

FREQUENT ITEMSET MINING; INFORMATION-THEORETIC APPROACH; INFORMATIVE NESS; ITEM SETS; ITEMSET; OBJECTIVE AND SUBJECTIVE EVALUATIONS; REAL LIFE DATA;

DATA MINING;

EID: 84857188919     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611972801.14     Document Type: Conference Paper

References (23)

1. R. Agrawal, T. Imieliski, and A. Swami. Mining association rules between sets of items in large databases. In Proc. of the 1993 ACM SIGMOD, pages 207-216, NY, USA, 1993. ACM Press.
2. R. Agrawal and R. Srikant. Fast algorithms for mining association rules in large databases. In Jorge B. Bocca, Matthias Jarke, and Carlo Zaniolo, editors, Proc. of 20th VLDB, Sept.1994, Santiago de Chile, Chile, pages 487-499. Morgan Kaufmann, 1994.
3. T. De Bie. Explicit probabilistic models for databases and networks. Tech. rep., University of Bristol, 2009.
4. H. Cheng, P.S. Yu, and J. Han. Ac-close: Efficiently mining approximate closed itemsets by core pattern recovery. In International Conference in Data Mining (ICDM06), pages 839-844, 2006.
5. A. Gallo, T. De Bie, and N. Cristianini. MINI: Mining informative non-redundant itemsets. In Proceedings of the 13th ACM SIGKDD conference on knowledge discovery and data mining (KDD09), 2007.
6. F. Geerts, B. Goethals, and T. Mielikinen. Tiling databases. In Discovery Science, 2004.
7. A. Gionis, H. Mannila, T. Mielikinen, and P. Tsaparas. Assessing data mining results via swap randomization. ACM Transactions on Knowledge Discovery from Data (TKDD), 1(3), 2007.
8. S. Hanhijarvi, M. Ojala, N. Vuokko, K. Puolamaki, N. Tatti, and H. Mannila. Tell me something I don't know: Randomization strategies for iterative data mining. In Proc. of the 15th ACM SIGKDD conference on knowledge discovery and data mining (KDD09), 2009.
9. E.T. Jaynes. On the rationale of maximum-entropy methods. Proceedings of the IEEE, 70, 1982.
10. S. Khuller, A. Moss, and J. Naor. The budgeted maximum coverage problem. Information Processing Letters, 70, 1999.
11. A. Koopman and A. Siebes. Characteristic relational patterns. In Proceeding of the 15th ACM SIGKDD International Conference on Knowledge discovery and data mining (KDD09), 2009.
12. J. Liu, S. Paulsen, W. Wang, A. Nobel, and J. Prins. Mining approximate frequent itemsets from noisy data. In Intenational Conference in Data Mining (ICDM05), pages 721-724, 2005.
13. A. Siebes M. van Leeuwen. Streamkrimp: Detecting change in data streams. In Proceedings of the International Conference on Principles and Practice of Knowledge Discovery in Databases (PKDD08), 2008.
14. H. Mannila, H. Toivonen, and A.I. Verkamo. Efficient algorithms for discovering association rules. In Us-ama M. Fayyad and Ramasamy Uthurusamy, editors, AAAI Workshop on Knowledge Discovery in Databases (KDD-94), pages 181-192, Seattle, Washington, 1994. AAAI Press.
15. M. Ojala, N. Vuokko, A. Kallio, N. Haiminen, and H. Mannila. Randomization of real-valued matrices for assessing the significance of data mining results. In SIAM Data Mining Conference, pages 494-505, 2008.
16. A. K. Poernomo and V. Gopalkrishnan. Efficient computation of partial-support for mining interesting itemsets. In Siam International Conference on Data Mining (SDM09), 2009.
17. A.K. Poernomo and V. Gopalkrishnan. Towards efficient proportional fault-tolerant frequent itemset mining. In Proceeding of the 15th ACM SIGKDD International Conference on Knowledge discovery and data mining (KDD09), 2009.
18. G. Rasch. On general laws and the meaning of measurement in psychology. In Proc. of the Fourth Berkeley Symposium on Mathematical Statistics and Probability, IV, 1961.
19. R. Gupta, G. Fang, B. Field, M. Steinbach, and V. Kumar. Quantitative evaluation of approximate frequent pattern mining algorithms. In Proceeding of the 14th ACM SIGKDD International Conference on Knowledge discovery and data mining (KDD08), pages 301-309, 2008.
20. A. Siebes, J. Vreeken, and M. van Leeuwen. Item sets that compress. In SI AM Conference on Data Mining, 2006.
21. G.I. Webb. Discovering significant patterns. Machine Learning, 68(1), 2007.
22. A. B. Nobel X. Sun. On the size and recovery of submatrices of ones in a random binary matrix. Journal of Machine Learning Research, 9:2431-2453, 2008.
23. C. Yang, U. Fayyad, and P. Bradley. Efficient discovery of error-tolerant frequent itemsets in high dimensions. In Proceeding of the 7th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining Conference (KDD01), pages 194-203, 2001.