Active learning based frequent itemset mining over the deep web

Proceedings - International Conference on Data Engineering

Volumn , Issue , 2011, Pages 219-230

  Liu, Tantan ^a   Agrawal, Gagan ^a  

^a The Ohio State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ACTIVE LEARNING; DATA DISSEMINATION; DATA SETS; DATA SOURCE; DEEP WEB; FREQUENT ITEMSET MINING; KEY CHARACTERISTICS; MEMORY COST; QUERY INTERFACES; RELATIONAL DATABASE; SAMPLING-BASED METHOD; STREAMING DATA;

USER INTERFACES; WIRELESS SENSOR NETWORKS;

WORLD WIDE WEB;

EID: 79957820915     PISSN: 10844627     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDE.2011.5767919     Document Type: Conference Paper

References (37)

1. 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.
2. Ziv Bar-Yossef and Maxim Gurevich. Mining search engine query logs via suggestion sampling. Proc. VLDB Endow., 1(1):54-65, 2008.
3. M. K. Bergman. The Deep Web: Surfacing Hidden Value. Journal of Electronic Publishing, 7, 2001.
4. 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.
5. D. Braga, S. Ceri, F. Daniel, and D. Martinenghi. Optimization of Multidomain Queries on the Web. VLDB Endowment, 1:562-673, 2008.
6. Andrea Cali and Davide Martinenghi. Querying Data under Access Limitations. In Proceedings of the 24th International Conference on Data Engineering, pages 50-59, 2008.
7. Venkatesan T. Chakaravarthy, Vinayaka Pandit, and Yogish Sabharwal. Analysis of sampling techniques for association rule mining. In ICDT '09: Proceedings of the 12th International Conference on Database Theory, pages 276-283, New York, NY, USA, 2009. ACM.
8. 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.
9. W. Cochran. Sampling Techniques. Wiley and Sons, 1977.
10. Ido Dagan and Sean P. Engelson. Committee-based sampling for training probabilistic classifiers. In In Proceedings of the Twelfth International Conference on Machine Learning, pages 150-157. Morgan Kaufmann, 1995.
11. 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)
12. 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.
13. Sanjoy Dasgupta and Daniel Hsu. Hierarchical sampling for active learning. In Proceedings of the 25th International Conference on Machine learning, pages 208-215, 2008.
14. Maria florina Balcan, Andrei Broder, and Tong Zhang. Margin based active learning. In Proc. of the 20 th Conference on Learning Theory, 2007.
15. Yoav Freund and David Haussler. Selective sampling using the query by committee algorithm. In Machine Learning, pages 133-168, 1997. (Pubitemid 127506338)
16. Yoav Freund, H. Sebastian Seung, Eli Shamir, and Naftali Tishby. Selective sampling using the query by committee algorithm. In Machine Learning, pages 133-168, 1995. (Pubitemid 127506338)
17. Jiawei Han, Jian Pei, and Yiwen Yin. Mining frequent patterns without candidate generation. In Proceedings of the 2000 ACM SIGMOD international conference on Management of data, SIGMOD '00, pages 1-12, New York, NY, USA, 2000. ACM.
18. B. He, Z. Zhang, and K. C.-C. Chang. Knocking the door to the deep web: Integrating web query interfaces. In Proceedings of the 2004 SIGMOD, pages 913-914, 2004.
19. H. He, W. Meng, C. Yu, and Z. Wu. Automatic integration of web search interfaces with wise integrator. The international Journal on Very Large Data Bases, 12:256-273, 2004. (Pubitemid 39394594)
20. David Heckerman. A bayesian approach to learning causal networks. In In Uncertainty in AI: Proceedings of the Eleventh Conference, pages 285-295, 1995.
21. A. Kementsietsidis, F. Neven, D. Van de Craen, and S. Vansummeren. Scalable multi-query optimization for exploratory queries over federated scientific databases. VLDB Endowment, 1:16-27, 2008.
22. 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.
23. J. Madhavan, L. Afanasiev, L. Antova, and A. Halevy. Harnessing the deep web: Present and future. In 4th Biennial Conference on Innovative Data Systems Research (CIDR), 2009.
24. J. Madhavan, D. Ko, L. Kot, V. Ganapathy, A. Rasmussen, and A. Halevy. Google's Deep Web Crawl. VLDB Endowment, 1:1241-1252, 2008.
25. Andrew Kachites Mccallum. Employing em in pool-based active learning for text classification. In In Proceedings of the 15th International Conference on Machine Learning, pages 350-358. Morgan Kaufmann, 1998.
26. Brian Peacock Merran Evans, N. A. J. Hastings. Wiley-interscience, 1993.
27. 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.
28. Judea Pearl. Probabilistic reasoning in intelligent systems: networks of plausible inference. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, 1988.
29. J.A. Rice. Mathematical statistics and data analysis. Duxbury Press, 2006.
30. Sunita Sarawagi and Anuradha Bhamidipaty. Interactive deduplication using active learning. In KDD '02: Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining, pages 269-278, New York, NY, USA, 2002. ACM.
31. U. Srivastava, K. Munagala, J. Widom, and R. Motwani. Query optimization over web services. In Proceedings of the 32nd VLDB, pages 355-366, 2006.
32. P. P. Talukdar, M. Jacob, M. S. Mehmood, K. Crammer, Z. G. Ives, F. Pereira, and S. Guha. Learning to create data-integrating queries. VLDB Endowment, 1:785-796, 2008.
33. Hannu Toivonen. Sampling large databases for association rules. In The VLDB Journal, pages 134-145. Morgan Kaufmann, 1996.
34. Simon Tong and Daphne Koller. Active learning for parameter estimation in bayesian networks. In In NIPS, pages 647-653, 2001.
35. R. Varadarajan, V. Hristidis, and L. Raschid. Explaining and reformulating authority flow queries. In Proceedings of the 2008 ICDE, pages 883-892, 2008.
36. 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.
37. Mohammed J. Zaki. Scalable algorithms for association mining. IEEE Transactions on Knowledge and Data Engineering, 12:372-390, 2000.