Crawling Deep Web Content Through Query Forms Jun Liu, Zhaohui Wu, Lu Jiang, Qinghua Zheng and Xiao Liu Speaker: Lu Jiang Xi’an Jiaotong University P. R. China
Outline Background n Related work n Minimum Executable Pattern n Adaptive Crawling Algorithm n Experimental results n Conclusions n
Outline Background n Related work n Minimum Executable Pattern n Adaptive Crawling Algorithm n Experimental results n Conclusions n
What is the Deep Web n Deep Web (or Hidden Web) refers to World Wide Web content that is not part of the surface Web which is directly indexed by search engines.
Why the Deep Web n n Organizes high-quality content Significant piece of the Web Data retrieval in Deep Web [Michael K. Bergman, 2001]
What is the problem? n n n Ordinary crawlers retrieve content only in Surface Web. Challenge: make the Deep Web accessible to web search. A Practical solution: Deep Web crawling
Outline Background n Related work n Minimum Executable Pattern n Adaptive Crawling Algorithm n Experimental results n Conclusions n
Related Work n The prior knowledge-based query methods: n n n generate queries under the guidance of prior knowledge E. g. HIdden Web Exposer [Raghavan, 2001] The non-prior knowledge methods n n generate new query by analyzing the data records returned from the previous queries E. g. Deep Web crawler [Ntoulas, 2005]
Outline Background n Related work n Minimum Executable Pattern n Adaptive Crawling Algorithm n Experimental results n Conclusions n
The idea of the MEP n Previous work is based on either the genetic textbox or the entire query form. n n n For genetic textbox: the harvest rate (capability of obtaining new records) of queries are relatively low and simplex. For entire form. incorrectness of filling out the entire form is excessive. A proper granularity of pattern is required.
What is the MEP n n n Query Form. A query form F is a query interface of Deep Web, which can be defined as a set of all elements in it. where ei is an element of F such as a checkbox, text box or radio button. Executable Pattern (EP). is an executable pattern if the deep web database returns the corresponding results after the query with value assignments of elements in it is issued. Minimum Executable Pattern (MEP). Given is an executable pattern , then it is a MEP iff any proper subset of it is not an executable pattern.
MEP Classification n Two types of the MEP. n n If there is an infinite domain element (text box) in MEP set, then the MEP is called infinite domain MEP (IMEP). If all its element are finite domain (radio button, check boxes), then the MEP is called finite domain MEP (FMEP).
What is the MEP 6 FMEPs 5 IMEPs 1 IMEP
Outline Background n Related work n Minimum Executable Pattern n Adaptive Crawling Algorithm n Experimental results n Conclusions n
What is a Query n The ith query to database is implemented using MEP mep and its corresponding keyword vector kv. n n E. g. qi(mep(keywords), ”art”). The harvest rate of a query is the ability of obtaining new records.
Overall Algorithm Data Accumulation Phase Prediction Phase
How does a Crawler Work Obtained x new records while accessing records. q (mep(keywords), ”art”). The harvest rateon until stop condition isysatisfied Iteration goes and extracted records are used to art evaluate query candidate. Harvest rate = x/y.
Overall Algorithm Prediction Phase
Pattern Harvest Rate n Pattern harvest rate of the mep, depends on the pattern mep itself, rather than choice of keyword vectors. n n E. g. MEP(Keywords) and MEP(Abstract) Two approaches to predict the value. n n Continuous prediction Weighted prediction
Keyword Vector Harvest Rate n n Keyword vector harvest rate represents the conditional harvest rate of kv among all candidate keyword vectors of the given mep. n E. g. given the MEP(keywords), find out which kv will bring the most new records. The estimation of kv harvest rate consists of two parts n Calculate how many records containing kv has been downloaded (Sample. DF) Sampling n Estimate how many records containing kv reside in Deep Web (Keyword Capability) Zipf Law n Keyword Vector Harvest rate = Keyword Capability – Sample. DF
Convergence Analysis n n When to terminate crawling the Deep web database, especially when the size of target database is unknown? S is the record numeber of Deep Web Database Crawler Bottleneck! ak is the cumulated fraction of new records mk is the fraction of records returned by the kth query n If we assume mk is constant, We have:
Outline Background n Related work n Minimum Executable Pattern n Adaptive Crawling Algorithm n Experimental results n Conclusions n
Effectiveness URL Size Harvest NO. of Queries http: //www. jos. org. cn 1, 380 143 http: //cjc. ict. ac. cn 2, 523 13 http: //www. jdxb. cn 424 16 730, 000 399 http: //www. paperopen. com 743, 444 http: //vod. xjtu. edu. cn 700 311 http: //music. xjtu. edu. cn 154, 000 146, 967 386
Comparison with state of art method We believe MEP method with multi-MEP outperforms than that with a single one of the multi-MEP
Outline Background n Related work n Minimum Executable Pattern n Adaptive Crawling Algorithm n Experimental results n Conclusions n
Conclusion n n The novel concept of MEP provides a foundation to study Deep Web crawling through query forms. The adaptive crawling method and its related prediction algorithm offer a efficient way to crawling Deep Web content through query forms.
Thanks You!
Appendix Here comes the Appendix
MEP Generation Algorithm
Examples of Prediction
Comparison with LVS method
Continues Prediction n mep 1 0. 33 The current harvest rate of a MEP totally depends on the harvest rate of the latest issued query by the MEP. mep 2 0. 33 mep 3 Issue a query via mep 1 and get 200 record 30 record assessing 100 records assessing 250 records 200/250 = 0. 8 0. 33 Accessing new record rate = 30/100 = 0. 3 0. 55 0. 22 0. 40 0. 29 mep 1 = 0. 3/(0. 22+0. 3) = 0. 40 mep 1 = 0. 8/(0. 33+0. 8) = 0. 55 mep 2 = 0. 22/(0. 22+0. 3) = 0. 29 mep 2 = 0. 33/(0. 33+0. 8) = 0. 22 mep 3 = 0. 22/(0. 22+0. 3) = 0. 29 mep 3 = 0. 33/(0. 33+0. 8) = 0. 22
Weighted Prediction n The current harvest rate of a MEP depends on all its previous harvest rates of issued query by the MEP.
Sample. DF Calculation n n document frequency of observed keyword vector kv in sample croups {d 1, . . . , ds}. where kvxk is the corresponding Boolean vector of kv in dk, and similarly mepx is the Boolean vector of mep. n n ith dimension of vector kv contains in document corresponding dimension of vector kvx is assigned to 1. 0 otherwise; ith dimension of mep is infinite domain mep then the corresponding position is assigned to 1. 0 otherwise.
Sample. DF Calculation Example n n n kx = (a, b) mep = (student id, exam id, subject) Four documents D 1, D 2, D 3 and D 4 D 1 has both Student ID a and Exam ID b D 2 has only Student ID a D 3 has only Exam ID b D 4 has neither Student ID a and Exam ID b mepx = (1, 1, 0) D 1 kvx 1 (1, 1, 0) cos<(1, 1, 0), (1, 1, 0)> = 1 D 2 kvx 2 (1, 0, 0) cos<(1, 0, 0), (1, 1, 0)> = 0. 707 D 3 kvx 3 (0, 1, 0) cos<(0, 1, 0), (1, 1, 0)> = 0. 707 D 4 kvx 4 (0, 0, 0) cos<(0, 0, 0), (1. 1. 0)> = 0 Sample. DF((a, b)| mep) = 1+0. 707+0 = 2. 414
Keyword Capability Estimation n Keyword capability = Keyword capability denote capability of obtaining records. (differ from harvest rate) n |Dt| is Cartesian product of values of finite element in MEP n n For FMEP: f = 1 For IMEP: Zipf-Mandelbrot Law to estimate f
Скачать презентацию Crawling Deep Web Content Through Query Forms Jun
9c6f5de7568a2f5e1d190634152db8f7.ppt