Tiling Databases
Authors:
- 1 January 2004
- book chapter
- Published by Springer Nature
- p. 278-289
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Constraint-Based Mining of Formal Concepts in Transactional Data2004
- Mining Frequent Patterns without Candidate Generation: A Frequent-Pattern Tree ApproachData Mining and Knowledge Discovery, 2004
- The maximum edge biclique problem is NP-completeDiscrete Applied Mathematics, 2003
- Information-theoretic co-clustering2003
- The Pattern Ordering Problem2003
- LPMiner: an algorithm for finding frequent itemsets using length-decreasing support constraint2002
- KDD-Cup 2000 organizers' reportACM SIGKDD Explorations Newsletter, 2000
- Complexity and Approximation1999
- A threshold of ln n for approximating set coverJournal of the ACM, 1998
- Communication Complexity1996