Estimating aggregates over multiple sets

Proceedings - IEEE International Conference on Data Mining, ICDM

Volumn , Issue , 2008, Pages 761-766

  Cohen, Edith ^a   Kaplan, Haim ^b  

^a AT AND T LABS RESEARCH   (United States)

^b TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

DATA SETS; HYPERTEXT DOCUMENTS; MARKET BASKET; MEASUREMENT DATA; MULTIPLE SET; TIME PERIODS;

HYPERTEXT SYSTEMS; MINING;

INFORMATION MANAGEMENT;

EID: 67049114678     PISSN: 15504786     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDM.2008.110     Document Type: Conference Paper

References (24)

1. K. S. Beyer, P. J. Haas, B. Reinwald, Y. Sismanis, and R. Gemulla. On synopses for distinct-value estimation under multiset operations. In SIGMOD, pages 199-210. ACM, 2007. (Pubitemid 47630807)
2. B. Bloom. Space/time tradeoffs in in hash coding with allowable errors. Communications of the ACM, 13:422-426, 1970.
3. A. Z. Broder. On the resemblance and containment of documents. In Proceedings of the Compression and Complexity of Sequences, pages 21-29. ACM, 1997.
4. A. Z. Broder. Identifying and filtering near-duplicate documents. In Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching, pages 1-10. Springer, 2000.
5. M. S. Charikar. Similarity estimation techniques from rounding algorithms. In Proc. 34th Annual ACM Symposium on Theory of Computing, pages 380-388. ACM, 2002. (Pubitemid 35009398)
6. A. Chowdhury, O. Frieder, D. Grossman, and M. C. McCabe. Collection statistics for fast duplicate document detection. ACM Transactions on Information Systems, 20(1):171-191, 2002. (Pubitemid 44642301)
7. E. Cohen. Size-estimation framework with applications to transitive closure and reachability. J. Comput. System Sci., 55:441-453, 1997. (Pubitemid 127432363)
8. E. Cohen, N. Duffield, H. Kaplan, C. Lund, and M. Thorup. Variance optimal sampling based estimation of subset sums. In Proc. 20th ACM-SIAMSymposium on Discrete Algorithms. ACM-SIAM, 2009.
9. E. Cohen and H. Kaplan. Summarizing data using bottom sketches. In Proceedings of the 26th PODC Conference, 2007.
10. E. Cohen and H. Kaplan. Tighter estimation using bottom-k sketches. In Proceedings of the 34th VLDB Conference, 2008.
11. J. G. Conrad and C. P. Schriber. Constructing a text corpus for inexact duplicate detection. In SIGIR 2004, pages 582- 583, 2004.
12. T. Dasu, T. Johnson, S. Muthukrishnan, and V. Shkapenyuk. Mining database structure; or, how to build a data quality browser. In SIGMOD, pages 240-251. ACM, 2002. (Pubitemid 34985551)
13. N. Duffield, M. Thorup, and C. Lund. Priority sampling for estimating arbitrary subset sums. J. Assoc. Comput. Mach., 54(6), 2007.
14. L. Fan, P. Cao, J. Almeida, and A. Z. Broder. Summary cache: a scalable wide-area Web cache sharing protocol. IEEE/ACM Transactions on Networking, 8(3):281-293, 2000. IEEE/ACM Transactions on Networking, 8(3):281-293, 2000.
15. J. Feigenbaum, S. Kannan, M. Strauss, and M. Viswanathan. An approximate L1-difference algorithm for massive datastreams. In Proc. 40th IEEE Annual Symposium on Foundations of Computer Science, pages 501-511. IEEE, 1999. (Pubitemid 30539956)
16. M. R. Henzinger. Finding near-duplicate web pages: a largescale evaluation of algorithms. In SIGIR, pages 284-291, 2006.
17. D. G. Horvitz and D. J. Thompson. A generalization of sampling without replacement from a finite universe. Journal of the American Statistical Association, 47(260):663-685, 1952.
18. A. Kolcz, A. Chowdhury, and J. Alspector. Improved robustness of signature-based near-replica detection via lexicon randomization. In SIGKDD 2004, pages 605-610, 2004. (Pubitemid 40114978)
19. P. Li and K. W. Church. A sketch algorithm for estimating two-way and multi-way associations. Computational Linguistics, 33:305-354, 2007.
20. U. Manber. Finding similar files in a large file system. In Usenix Conference, pages 1-10, 1994.
21. G. S. Manku, A. Jain, and A. D. Sarma. Detecting nearduplicates for web crawling. In Proceedings of the 16th International World Wide Web Conference (WWW), 2007.
22. The Netflix Prize. &z.ast;http://www.netflixprize.com/.
23. S. Schleimer, D.Wilkerson, and A. Aiken. Winnowing: local algorithms for document fingerprinting. In SIGMOD, pages 76-85, 2003.
24. M. Szegedy. The DLT priority sampling is essentially optimal. In Proc. 38th Annual ACM Symposium on Theory of Computing, pages 150-158. ACM, 2006 (Pubitemid 44306548)