English  |  正體中文  |  简体中文  |  Items with full text/Total items : 51896/87052 (60%)
Visitors : 8465400      Online Users : 312
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    Please use this identifier to cite or link to this item: http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/112117


    Title: Heuristics-Based Schema Extraction for Deep Web Query Interfaces
    Authors: Jou, Chichang;Cheng, Yucheng
    Keywords: Deep Web, Query Interface, Schema Extraction, Heuristic Rules, String Similarity
    Date: 2017-08-04
    Issue Date: 2017-11-15 02:10:59 (UTC+8)
    Abstract: Along with the fast popularity of the internet, contents
    inside web databases also increase quickly. These data,
    hidden behind the query interfaces, are called Deep Web. Volumes of deep web contents were estimated to be around 500 times those of surface web. In order to obtain the dynamic contents which satisfy the conditions imposed by the elements of the interface, the internet users must fill in valid values. This is the reason why these contents are not collected by the search engines. Many deep web contents related applications, like contents collection, topic-focused crawling, and data integration, are based on understanding the schema of these query interfaces. The schema needs to cover mappings of input elements and labels, data types of valid input values, and range constraints of the input values, etc. We propose a Heuristics-based deep web query interface Schema Extraction system (HSE) that identifies labels, elements, mappings among labels and elements, and relationships among elements. In HSE, Texts surrounding elements are collected as candidate labels.
    We propose a string similarity definition and dynamic
    similarity threshold setup to cleanse or modify candidate labels. Elements, candidate labels, and new lines in the query interface are streamlined to produce its Interface Expression (IEXP). By combining the users' view and the designer’s view, with the aid of semantic information, we then build heuristic rules to extract schema from IEXP of query interfaces in the ICQ dataset. These rules are constructed through utilizing (1) the characteristics of labels and elements, and (2) the spatial, group, and range relationships of labels and elements. Our schema not only helps extracting contents of the deep web, but also benefits the processes of schema matching and schema merging. The experimental results on the TEL-8 dataset show that HSE produces effective performance.
    Relation: 
    Appears in Collections:[資訊管理學系暨研究所] 會議論文

    Files in This Item:

    There are no files associated with this item.

    All items in 機構典藏 are protected by copyright, with all rights reserved.


    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library & TKU Library IR teams. Copyright ©   - Feedback