Tiling Databases

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3245, Issue , 2004, Pages 278-289

  Geerts, Floris ^a   Goethals, Bart ^b   Mielikäinen, Taneli ^a  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

^b UNIVERSITY OF HELSINKI   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; COMPUTATIONAL COMPLEXITY; PARALLEL PROCESSING SYSTEMS;

EXPERIMENTAL EVALUATION; INTERESTINGNESS; LARGE DATABASE; OPTIMAL SOLUTIONS; REAL DATA SETS;

DATABASE SYSTEMS;

EID: 35048813595     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30214-8_22     Document Type: Article

References (19)

1. R. Agrawal, H. Mannila, R. Srikant, H. Toivonen, and A.I. Verkamo. Fast discovery of association rules. In Advances in Knowledge Discovery and Data Mining, chapter 12, pages 307-328. AAAI/MIT Press, 1996.
2. G. Ausiello, P. Crescenzi, V. Kann, A. Marchetti-Spaccamela, and M. Protasi. Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties. Springer-Verlag, 1999.
3. J. Besson, C. Robardet, and J.-F. Boulicaut. Constraint-based mining of formal concepts in transactional data. Proceedings of PAKDD'04, pages 615-624, 2004.
4. C.L. Blake and C.J. Merz. UCI repository of machine learning databases. http://www.ics.uci.edu/~mlearn/MLRepository.html, 1998.
5. I.S. Dhillon, S. Mallela, and D.S. Modha. Information-theoretic co-clustering. Proceedings of KDD'03, pages 89-98, 2003.
6. U. Feige. A threshold of Inn for approximating set cover. Journal of the Association for Computing Machinery, 45(4):634-652, 1998.
7. J. Han, J. Pei, Y. Yin, and R. Mao. Mining frequent patterns without candidate generation: A frequent-pattern tree approach. Data Mining and Knowledge Discovery, 8(1):53-87, 2004.
8. J. Han, J. Wang, Y. Lu, and P. Tzvetkov. Mining top-k frequent closed patterns without minimum support. In Proceedings of ICDM'02, pages 211-218, 2002.
9. R. Kohavi, C. Brodley, B. Frasca, L. Mason, and Z. Zheng. KDD-Cup 2000 organizers' report: Peeling the onion. SIGKDD Explorations, 2(2):86-98, 2000. http://www.ecn.purdue.edu/KDDCUP.
10. E. Kushilevitz and N. Nisan. Communication Complexity. Cambridge, 1996.
11. T. Mielikäinen and H. Mannila. The pattern ordering problem. In Proceedings of PKDD'03, volume 2838 of Lecture Notes in Artificial Intelligence, pages 327-338. Springer-Verlag, 2003.
12. J. Orlin. Containment in graph theory: covering graphs with cliques. Indigationes Mathematicae, 39:211-128, 1977.
13. R. Peeters. The maximum edge biclique is NP-complete. Discrete Applied Mathematics, 131:651-654, 2003.
14. D. Ron, N. Mishra, and R. Swaminathan. On conjunctive clustering. Proceedings of COLT'03, pages 448-462, 2003.
15. M. Seno and G. Karypis. LPMiner: An algorithm for finding frequent itemsets using length-decreasing support constraint. Proceedings of ICDM'01, pages 505-512, 2001.
16. P.-N. Tan, V. Kumar, and J. Srivastava. Selecting the right interestingness measure for association patterns. In Proceedings of KDD'02, pages 32-41, 2002.
17. J. Wang and G. Karypis. BAMBOO: Accelerating closed itemset mining by deeply pushing the length-decreasing support constraint. Proceedings of SIAM DM'04, 2004.
18. M.J. Zaki. Scalable algorithms for association mining. IEEE TKDE, 12(3):372-390, 2000.
19. M.J. Zaki and C.-J. Hsiao. CHARM: An efficient algorithms for closed itemset mining. In R. Grossman, J. Han, V. Kumar, H. Mannila, and R. Motwani, editors, Proceedings of SIAM DM'02, 2002.