Crawling Objects From An LBS Website Through Public KNN Web Search Interface Auditing Scheme
Abstract
This work addresses the issue of crawling all items productively from a LBS site, through people in general kNN web look interface it gives. In particular, we create crawling algorithm for 2D and higher-dimensional spaces, separately, and show through hypothetical examination that the overhead of our algorithms can be limited by a component of the quantity of measurements and the quantity of crept articles, paying little mind to the basic appropriations of the items. We likewise extend the algorithms to use situations where certain helper data about the fundamental information dispersion, e.g., the populace density of a zone which is regularly decidedly associated with the thickness of LBS items, is accessible.
References
Mcdonalds, “Mcdonalds page, http://www.mcdonalds.com/,†[Accessed: Aug. 6, 2014]. [Online]. Available: nurlfhttp://www.mcdonalds.com/us/ en/restaurant locator.htmlg
S. Byers, J. Freire, and C. T. Silva, “Efficient acquisition of web data through restricted query interfaces,†in Poster Proceedings of the Tenth International World Wide Web Conference, WWW 10, Hong Kong, China, May 1-5, 2001, 2001. [Online]. Available: http://www10.org/cdrom/posters/1051.pdf
W. D. Bae, S. Alkobaisi, S. H. Kim, S. Narayanappa, and C. Shahabi, “Web data retrieval: solving spatial range queries using k-nearest neighbor searches,†Geoinformatica, vol. 13, no. 4, pp. 483–514, 2009.
G. E. Glasses, “Great eye glasses page, http://www.greateyeglasses.com/shop/search.php,†[Accessed: Jan. 20, 2014]. [Online]. Available: nurlfhttp: //www.greateyeglasses.com/shop/search.phpg
Yahoo, “Yahoo local page, https://local.yahoo.com/,†[Accessed: Dec. 2012]. [Online]. Available: nurlfhttps: //local.yahoo.com/g [6] U. Census, “Us census, http://www.census.gov/cgibin/ geo/shapefiles2013/layers.cgi,†[Accessed: Dec. 2013]. [Online]. Available: nurlfhttp://www.census.gov/cgi-bin/geo/shapefiles2013/layers.cgig
L. Devroye, “Sample-based non-uniform random variate generation,†in Proceedings of the 18th conference on Winter simulation. ACM, 1986, pp. 260–265.
L. Barbosa and J. Freire, “Siphoning hidden-web data through keyword-based interfaces,†in SBBD, 2004, pp. 309–321.
A. Ntoulas, P. Pzerfos, and J. Cho, “Downloading textual hidden web content through keyword queries,†in Digital Libraries, 2005. JCDL’05. Proceedings of the 5th ACM/IEEE-CS Joint Conference on. IEEE, 2005, pp. 100–109.
K. Vieira, L. Barbosa, J. Freire, and A. Silva, “Siphon++: a hidden-webcrawler for keyword-based interfaces,†in Proceedings of the 17th ACM conference on Information and knowledge management. ACM, 2008, pp. 1361–1362.
L. Jiang, Z. Wu, Q. Feng, J. Liu, and Q. Zheng, “Efficient deep web crawling using reinforcement learning,†in Advances in Knowledge Discovery and Data Mining. Springer, 2010, pp. 428– 439.
S. Raghavan and H. Garcia-Molina, “Crawling the hidden web,†in VLDB 2001, Proceedings of 27th International Conference on Very Large Data Bases, September 11-14, 2001, Roma, Italy, 2001, pp. 129–138. [Online]. Available: http: //www.vldb.org/conf/2001/P129.pdf
S. W. Liddle, D. W. Embley, D. T. Scott, and S. H. Yau, “Extracting data behind web forms,†in Conceptual Modeling - ER 2002, 21st International Conference on Conceptual Modeling, Tampere, Finland, October 7-11, 2002, Proceedings, 2002, pp. 402–413. [Online]. Available: http://dx.doi.org/10. 1007/978-3-540-45275-1 35
P. Wu, J. Wen, H. Liu, and W. Ma, “Query selection techniques for efficient crawling of structured web sources,†in Proceedings of the 22nd International Conference on Data Engineering, ICDE 2006, 3-8 April 2006, Atlanta, GA, USA, 2006, p. 47. [Online]. Available: http://dx.doi.org/10.1109/ICDE.2006.124
M. A´ lvarez, J. Raposo, A. Pan, F. Cacheda, F. Bellas, and V. Carneiro, “Crawling the content hidden behind web forms,†in Computational Science and Its Applications–ICCSA 2007. Springer, 2007, pp. 322–333.
Refbacks
- There are currently no refbacks.
Copyright © 2013, All rights reserved.| ijseat.com
International Journal of Science Engineering and Advance Technology is licensed under a Creative Commons Attribution 3.0 Unported License.Based on a work at IJSEat , Permissions beyond the scope of this license may be available at http://creativecommons.org/licenses/by/3.0/deed.en_GB.
Â