Set cover algorithms for very large datasets

International Conference on Information and Knowledge Management, Proceedings

Volumn , Issue , 2010, Pages 479-488

  Cormode, Graham ^a   Karloff, Howard ^a   Wirth, Anthony ^b  

^a AT AND T LABS RESEARCH   (United States)

^b UNIVERSITY OF MELBOURNE   (Australia)

Author keywords

Disk friendly; Greedy heuristic; Set cover

Indexed keywords

DATA QUALITY; DATA SETS; DISK FRIENDLY; GREEDY ALGORITHMS; GREEDY HEURISTICS; LARGE DATASETS; MACHINE-LEARNING; MODERN DISKS; NP-HARD; OPTIMAL SOLUTIONS; RANDOM ACCESS; SET COVER;

ALGORITHMS; KNOWLEDGE MANAGEMENT; MANAGEMENT SCIENCE; OPTIMIZATION;

DISKS (STRUCTURAL COMPONENTS);

EID: 78651264283     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1871437.1871501     Document Type: Conference Paper

References (15)

1. B. Berger, J. Rompel, and P. Shor. Efficient NC algorithms for set cover with applications to learning and geometry. Journal of Computer and System Sciences, 49(3):454-477, 1994.
2. T. Brijs, G. Swinnen, K. Vanhoof, and G. Wets. Using association rules for product assortment decisions: A case study. In Knowledge Discovery and Data Mining, pages 254-60, 1999.
3. A. Broder and M. Mitzenmacher. Survey: Network applications of bloom filters: A survey. Internet Mathematics, 1(4), 2003.
4. F. Chierichetti, R. Kumar, and A. Tomkins. Max-Cover in Map-Reduce. In Proceedings of the 19th International Conference on World Wide Web, pages 231-240. ACM, 2010.
5. U. Feige. A threshold of In n for approximating set cover. Journal of the ACM, 45(4):634-652, 1998.
6. K. Geurts, G. Wets, T. Brijs, and K. Vanhoof. Profiling high frequency accident locations using association rules. In Proceedings of the 82nd Annual Transportation Research Board, page 18pp, January 2003.
7. B. Goethals. Frequent itemset mining dataset repository. http://fimi.cs.helsinki.fi/data.
8. L. Golab, H. Karloff, F. Korn, D. Srivastava, and B. Yu. On generating near-optimal tableaux for conditional functional dependencies. In Proceedings of Very Large Databases Conference (VLDB), 2008.
9. F. Gomes, C. Meneses, P. Pardalos, and G. Viana. Experimental analysis of approximation algorithms for the vertex cover and set covering problems. Computers & Operations Research, 33(12):3520-3534, 2006.
10. T. Grossman and A. Wool. Computational experience with approximation algorithms for the set covering problem. European Journal of Operational Research, 101(1):81-92, 1997.
11. D. Johnson. Approximation algorithms for combinatorial problems. Journal of Computer and System, Sciences, 9(3):256-278, 1974.
12. C. Lucchese, S. Orlando, R. Perego, and F. Silvestri. Webdocs: a real-life huge transactional dataset. In Proceedings of the ICDM Workshop in Frequent Itemset Mining Implementations, 2004.
13. M. Mihail. Set cover with requirements and costs evolving over time. In Proceedings of the Second International Workshop on Approximation Algorithms for Combinatorial Optimization Problems: RANDOM-APPROX, pages 63-72, 1999.
14. K. Munagala, S. Babu, R. Motwani, and J. Widom. The pipelined set cover problem. Technical Report 2003-65, Stanford InfoLab, October 2003.
15. B. Saha and L. Getoor. On Maximum Coverage in the streaming model & application to multi-topic blog-watch. In 2009 SIAM International Conference on Data Mining (SDM09), April 2009.