Stratified sampling for data mining on the deep web

Proceedings - IEEE International Conference on Data Mining, ICDM

Volumn , Issue , 2010, Pages 324-333

  Liu, Tantan ^a   Wang, Fan ^a   Agrawal, Gagan ^a  

^a The Ohio State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALLOCATION METHODS; ASSOCIATION MINING; DATA DISSEMINATION; DATA MINING PROBLEMS; DATA SETS; DATA SOURCE; DEEP WEB; ESTIMATION ERRORS; MINING TASKS; RULE MINING; SIMPLE RANDOM SAMPLING; STRATIFIED SAMPLING;

ALGORITHMS; COSTS; DATA MINING; ESTIMATION;

WORLD WIDE WEB;

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

References (25)

1. Foto N. Afrati, Paraskevas V. Lekeas, and Chen Li. Adaptive-sampling algorithms for answering aggregation queries on web sites. Data Knowl. Eng., 64(2):462-490, 2008. (Pubitemid 350297498)
2. Rakesh Agrawal and Ramakrishnan Srikant. Fast algorithms for mining association rules. In Proceedings of the 20th International Conference on Very Large Data Bases, pages 487-499, 1994.
3. Ziv Bar-Yossef and Maxim Gurevich. Mining search engine query logs via suggestion sampling. Proc. VLDB Endow., 1(1):54-65, 2008.
4. Stephen D. Bay and Michael J. Pazzani. Detecting group differences: Mining contrast sets. Data Mining and Knowledge Discovery, 5(3):213-246, 2001.
5. M. K. Bergman. The Deep Web: Surfacing Hidden Value. Journal of Electronic Publishing, 7, 2001.
6. Mario Boley and Henrik Grosskreutz. A randomized approach for approximating the number of frequent sets. In ICDM '08: Proceedings of the 2008 Eighth IEEE International Conference on Data Mining, pages 43-52, Washington, DC, USA, 2008. IEEE Computer Society.
7. D. Braga, S. Ceri, F. Daniel, and D. Martinenghi. Optimization of Multidomain Queries on the Web. VLDB Endowment, 1:562-673, 2008.
8. R. E. Caflisch. Monte carlo and quasi-monte carlo methods. Acta Numerica, 7:1-49, 1998.
9. Andrea Cali and Davide Martinenghi. Querying Data under Access Limitations. In Proceedings of the 24th International Conference on Data Engineering, pages 50-59, 2008.
10. Bin Chen, Peter Haas, and Peter Scheuermann. A new two-phase sampling based algorithm for discovering association rules. In KDD '02: Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining, pages 462-468, New York, NY, USA, 2002. ACM.
11. W. Cochran. Sampling Techniques. Wiley and Sons, 1977.
12. Arjun Dasgupta, Gautam Das, and Heikki Mannila. A random walk approach to sampling hidden databases. In SIGMOD '07: Proceedings of the 2007 ACM SIGMOD international conference on Management of data, pages 629-640, New York, NY, USA, 2007. ACM. (Pubitemid 47630840)
13. Arjun Dasgupta, Xin Jin, Bradley Jewell, Nan Zhang, and Gautam Das. Unbiased estimation of size and other aggregates over hidden web databases. In SIGMOD '10: Proceedings of the 2010 international conference on Management of data, pages 855-866, New York, NY, USA, 2010. ACM.
14. Arjun Dasgupta, Nan Zhang, and Gautam Das. Leveraging count information in sampling hidden databases. In ICDE '09: Proceedings of the 2009 IEEE International Conference on Data Engineering, pages 329-340, Washington, DC, USA, 2009. IEEE Computer Society.
15. Loekito Elsa and Bailey James. Mining influential attributes that capture class and group contrast behaviour. In CIKM '08: Proceeding of the 17th ACM conference on Information and knowledge management, pages 971-980, New York, NY, USA, 2008. ACM.
16. E.K. Foreman. Survey sampling principles. Marcel Dekker publishers, 1991.
17. Ruoming Jin, Leonid Glimcher, Chris Jermaine, and Gagan Agrawal. New sampling-based estimators for olap queries. In ICDE, page 18, 2006. (Pubitemid 44539810)
18. Shantanu Joshi and Christopher M. Jermaine. Robust stratified sampling plans for low selectivity queries. In ICDE, pages 199-208, 2008.
19. Bing Liu. Web Data Mining: Exploring Hyperlinks, Contents, and Usage Data (Data-Centric Systems and Applications). Springer-Verlag New York, Inc., Secaucus, NJ, USA, 2006.
20. Srinivasan Parthasarathy. Efficient progressive sampling for association rules. In ICDM '02: Proceedings of the 2002 IEEE International Conference on Data Mining, page 354, Washington, DC, USA, 2002. IEEE Computer Society.
21. William H. Press and Glennys R. Farrar. Recursive stratified sampling for multidimensional monte carlo integration. Comput. Phys., 4(2):190-195, 1990.
22. Hannu Toivonen. Sampling large databases for association rules. In The VLDB Journal, pages 134-145. Morgan Kaufmann, 1996.
23. Fan Wang, Gagan Agrawal, Ruoming Jin, and Helen Piontkivska. Snpminer: A domain-specific deep web mining tool. In Proceedings of the 7th IEEE International Conference on Bioinformatics and Bioengineering, pages 192-199, 2007.
24. Mingxi Wu and Chris Jermaine. Guessing the extreme values in a data set: a bayesian method and its applications. VLDB J., 18(2):571-597, 2009.
25. Mohammed J. Zaki. Scalable algorithms for association mining. IEEE Transactions on Knowledge and Data Engineering, 12:372-390, 2000.