CFP last date
20 May 2024
Call for Paper
June Edition
IJCA solicits high quality original research papers for the upcoming June edition of the journal. The last date of research paper submission is 20 May 2024

Submit your paper
Know more
The week's pick
Responsive image
Enhancing Privacy Preservation: Multi-Attribute Protection with P-Sensitive K-Anonymity

Twinkle Patel Kiran Amin
Random Articles
Reseach Article

Knowledge base Construction using Hidden Web Retrieval Technique

by Shrina Patel, Amit Ganatar
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 114 - Number 11
Year of Publication: 2015
Authors: Shrina Patel, Amit Ganatar
10.5120/20025-2078

Shrina Patel, Amit Ganatar . Knowledge base Construction using Hidden Web Retrieval Technique. International Journal of Computer Applications. 114, 11 ( March 2015), 30-36. DOI=10.5120/20025-2078

@article{ 10.5120/20025-2078,
author = { Shrina Patel, Amit Ganatar },
title = { Knowledge base Construction using Hidden Web Retrieval Technique },
journal = { International Journal of Computer Applications },
issue_date = { March 2015 },
volume = { 114 },
number = { 11 },
month = { March },
year = { 2015 },
issn = { 0975-8887 },
pages = { 30-36 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume114/number11/20025-2078/ },
doi = { 10.5120/20025-2078 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T22:52:30.940745+05:30
%A Shrina Patel
%A Amit Ganatar
%T Knowledge base Construction using Hidden Web Retrieval Technique
%J International Journal of Computer Applications
%@ 0975-8887
%V 114
%N 11
%P 30-36
%D 2015
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Relations of algorithms for hidden web-focused information retrieval develop with it. When the stage the information retrieval, a huge difficulty arises and that is the information that one hidden web page can enclose manifold areas with extremely dissimilar information content. Hence the page has to be split into measurement and these parts examined separately for the results to be more precise. Web page segmentation and correlated technique have Therefore this paper suggests a combined approach that creates use of structural features and the visual features. It build a visual DOM tree on which the data records are recognized based on their structural similarity . The structure of these data records are reserved so that personage data items can be group effortlessly and precisely based on their visual features Which hidden web source do we intend at the information indispensable to access the data at the back web form and the type of interface. We proposed algorithm narrative vision based page segmentation (NVIPS) and also comparison DOM tree, VIPS.

References
  1. Bowman, Chelsea Hicks, Matthew Scheffer, Anne H. H. Ngu, Quan Z. Sheng," Discovery and Cataloging of Deep Web Sources" IEEE IRI 2012, August 8-10, 2012.
  2. Y. Li, Y. Wang and J. Du, "E-FFC: an enhanced form-focused crawler for domain-specific deep web databases," Published in Journal of Intelligent Information Systems, Springer, pp. 1-26, 2012.
  3. Q. Huanga, Q. Li, H. Li and Z. Yan, "An Approach to incrementaldeep Web Crawling Based on Incremental Harvest Model,"Published in International Workshop on Information andelectronics Engineering, Elsevier Ltd. , pp. 1081–1087, 2011.
  4. K. K. Bhatia, A. K. Sharma and R. Madaan. "AKSHR: A novelframework for a Domain-specific Hidden Web Crawler," inproceedings of the 1st International Conference on Parallel,Distributed and Grid Computing (PDGC), IEEE, pp. 307-312,2010.
  5. J. Madhavan, D. Ko, L. Kot, V. Ganapathy, A. Rasmussen and A. Halevy, "Google's Deep Web Crawl," In Proceedings of verylarge Data Bases (VLDB) Endowment, ACM, pp. 1241-1252,2008.
  6. Sergio Flesca, eliomasciari, and Andrea Tagarelli,"A Fuzzy Logic Approach To Wrapping Pdf Documents" Ieee Transactions On Knowledge And Data Engineering, VOL. 23, NO. 12, DECEMBER 2011.
  7. Jer Lang Hong," Data Extraction for Hidden Web Using wordnet" IEEE Transactions On Systems, Man, And Cybernetics—Part C: Applications And Reviews, vol. 41, no. 6, november 2011.
  8. Gang Liu, Kai Liu, Yuan-yuan Dang," Research on discovering Hidden web entries Based ontopic crawling and ontology" 978-1-4244-8165-1/11/-2011 IEEE.
  9. Barbosa, L. , Nguyen, H. , Nguyen, T. , Pinnamaneni, R. , Freire, J. : Creating and exploring web form repositories. In: Proceedings of the 2010 international conference on Management of data. Pp. 1175–1178. SIGMOD '10, ACM, New York, NY, USA (2010), http://doi. acm. org/ 10. 1145/1807167. 1807311.
  10. Nan Zhang and Gautam Das. Exploration of hidden web repositories. PVLDB, 4(12):1506{1507, 2011.
  11. UC Berkeley. Invisible or Deep Web: What it is, Why it exists, How to find it, and Its inherent ambiguity. Available at http://www. lib. berkeley. edu/teachinglib/Guides/Internet/ invisibleweb. html, July 2006.
  12. Tantan Liu and Gagan Agrawal, "Stratified K-means Clustering Over A Deep Web Data Source" KDD'12, August 12–16, 2012, Beijing, China.
  13. Ritu Khare Yuan An Il-Yeol Song"Understanding Deep Web Search Interfaces" SIGMOD Record, March 2010 (Vol. 39, No. 1).
  14. Fajar Ardian, Sourav S Bhowmick," Efficient Maintenance of Common Keys in Archives of Continuous Query Results from Deep Websites" 978-1-4244-8960-2/11/- 2011 IEEE
  15. Tim Furche, Georg Gottlob, Giovanni Grasso, Xiaonan Guo, Giorgio Orsi, Christian Schallhart "Automated Form Understanding for the Deep Web" WWW 2012, April 16–20, 2012, Lyon, France.
  16. Radhouane Boughammoura, Lobna Hlaoua, Mohamed Nazih Omri ""Information Technology and e-Services (icites), 2012 International Conference IEEE- 24-26 March 2012.
Index Terms

Computer Science
Information Sciences

Keywords

Hidden web crawling web database DOM tree VIPS VIPS

Powered by PhDFocusTM