检索结果-内蒙古大学图书馆

Using Linked Data for Integrating Educational Medical web databases Based on BioMedical Ontologies

COMPUTER JOURNAL 2017年第3期60卷 369-388页

作者： Al Fayez, Reem Q. Joy, Mike Univ Jordan Dept Comp Informat Syst Amman 11942 Jordan Univ Warwick Dept Comp Sci Coventry CV4 7AL W Midlands England

Open data are playing a vital role in different communities, including governments, businesses and education. This revolution has had a high impact on the education field. Recently, Linked Data are being adopted for publishing and connecting data on the web by exposing and connecting data, which were not previously linked. In the context of education, applying Linked Data to the growing amount of open data used for learning is potentially highly beneficial. This paper proposes a system that tackles the challenges of data acquisition and integration from distributed web data sources into one linked data set. The application domain of this work is medical education, and the focus is on integrating educational content in the form of articles published in online educational libraries and web 2.0 content that can be used for education. The process of integrating a collection of heterogeneous resources is to create links that connect the resources collected from distributed web data sources based on their semantics. The proposed system harvests metadata from distributed web sources and enriches it with concepts from biomedical ontologies, such as Systematized Nomenclature of Medicine-Clinical Terms (SNOMED CT), that enable its linking. The final result of building this system is a linked data set of more than 10 000 resources collected from PubMed Library, YouTube channels and Blogging platforms. The final linked data set is evaluated by developing information retrieval methods that exploit the SNOMED CT hierarchical relations for accessing and querying the data set. Ontology-based browsing method has been developed for exploring the data set, and the browsing results have been clustered to evaluate its linkages. Furthermore, ontology-based query searching method has been developed and tested to enhance the discoverability of the data. The results were promising and had shown that using SNOMED CT for integrating distributed resources on the web is beneficial.

关键词： Linked Data biomedical ontologies medical education web databases data model data integration

来源：评论

学校读者我要写书评

暂无评论

A Tree-Based WQI Modeling Approach for Integrating web databases 17

A Tree-Based WQI Modeling Approach for Integrating Web Datab...

引用

17th International Conference on Information Fusion (FUSION)

作者： Marin-Castro, Heidy M. Sosa-Sosa, Victor J. Lopez-Arevalo, Ivan Natl Polytech Inst Ctr Res & Adv Studies Informat Technol Lab Victoria City Tamaulipas Mexico

ISBN: (纸本)9781479916344

Everyday, more and more specialized databases (car rental, hotels, airfares, etc.) are available on the web and can be only queried by means of a web Query Interface (WQI). Since in the web is increasing the number of domain-specific databases, it is getting very complicated for end users to explore the information stored in them. In this context, research efforts are focused on building a single (unified) specific-domain WQI that allows user to query and integrate information available in different web databases. The construction of such integrated WQI, for a given domain, involves several complex tasks, specially the extraction, representation, understanding and mapping of semantic content of each individual WQI associated to a web database. Previous approaches have considered hierarchical models to build integrated WQI, preserving the ancestor-descendant relationships in individual WQIs. In this work, we propose a novel tree-based approach for automatic construction of a hierarchical model of visual content of WQIs, representing their components in a clear and concise form. In the proposed approach, the Document Object Model(DOM) tree of each WQI considered in the integration process is processed by a specialized web resource to obtain relevant visual information in the WQI such as fields (UIs), groups of UIs and super-groups as well as their corresponding labels. This process is guided by a set of 8 design heuristic rules for the right identification of labels and components. Experiments to evaluate the proposed strategy were conducted on the ICQ and Tel-8 datasets of UIUC repository. Our results showed that the proposed tree-based approach for representing the visual components in a WQI has more than 94% of accuracy, improving current reported approaches and making easier the integration process of domain-specific WQIs.

关键词： databases Engines HTML Rendering (computer graphics) Semantics Vectors Visualization Water quality index web databases HyperText Markup Language Engines Database Semantics Visualization webs World Wide web congenital web hierarchical models web resources

来源：评论

学校读者我要写书评

暂无评论

Personalized ranking in web databases: establishing and utilizing an appropriate workload

引用

DISTRIBUTED AND PARALLEL databases 2013年第1期31卷 47-70页

作者： Telang, Aditya Chakravarthy, Sharma Li, Chengkai Univ Texas Arlington Dept Comp Sci & Engg Arlington TX 76019 USA

The emergence of the deep web has given a new connotation to the concept of ranking database query results. Earlier approaches for ranking either resorted to analyzing frequencies of database values and query logs or establishing user profiles. In contrast, an integrated approach, based on the notion of a similarity model, for holistically supporting user- and query-dependent ranking has been recently proposed (Telang et al. in IEEE Transactions on Knowledge and Data Engineering (TKDE), 2011). An important component of this framework is a workload consisting of ranking functions, wherein each function represents an individual user's preferences towards the results of a specific query. At the time of answering a query for which no prior ranking function exists, the similarity model is employed, and is expected to ensure a good quality of ranking as long as a ranking function for a very similar user-query pair exists in this workload. In this paper, we address the problem of determining an appropriate set of user-query pairs to form a workload of ranking functions to support user- and query-dependent ranking for web databases. We propose a novel metric, termed workload goodness, that quantifies the notion of a "good" workload into an absolute value. The process of finding such a workload of optimal goodness is a combinatorially explosive problem;therefore, we propose a heuristic solution, and advance three approaches for determining an acceptable workload, in a static as well as a dynamic environment. We discuss the effectiveness of our proposal analytically as well as experimentally over two web databases.

关键词： Ranking web databases Similarity model Workload

来源：评论

学校读者我要写书评

暂无评论

Cross-blockchain protocol for public registries

引用

INTERNATIONAL JOURNAL OF web INFORMATION SYSTEMS 2020年第5期16卷 571-610页

作者： Konashevych, Oleksii Univ Bologna Bologna Italy

Purpose The purpose of this paper is to present a concept of the protocol for public registries based on blockchain. New database protocol aims to use the benefits of blockchain technologies and ensure their interoperability. Design/methodology/approach This paper is framed with design science research (DSR). The primary method is exaptation, i.e. adoption of solutions from other fields. The research is looking into existing technologies which are applied here as elements of the protocol: Name-Value Storage (NVS), Berkley DB, RAID protocol, among others. The choice of NVS as a reference technology for creating a database over blockchain is based on the analysis and comparison with two other similar technologies Bigchain and Amazon QLDB. Findings The proposed mechanism allows creating a standard database over a bundle of distributed ledgers. It ensures a blockchain agnostic approach and uses the benefits of various blockchain technologies in one ecosystem. In this scheme, blockchains play the role of journal storages (immutable log), whereas the overlaid database is the indexed storage. The distinctive feature of such a system is that in blockchain, users can perform peer-to-peer transactions directly in the ledger using blockchain native mechanism of user access management with public-key cryptography (blockchain does not require to administrate its database). Originality/value This paper presents a new method of creating a public peer-to-peer database across a bundle of distributed ledgers.

关键词： web databases Blockchain Electronic government Digital authority Public registry Smart law

来源：评论

学校读者我要写书评

暂无评论

Breaking the Top-k Barrier of Hidden web databases

Breaking the Top-k Barrier of Hidden Web Databases

引用

29th IEEE International Conference on Data Engineering (ICDE)

作者： Thirumuruganathan, Saravanan Zhang, Nan Das, Gautam Univ Texas Arlington Arlington TX 76019 USA Qatar Comp Res Inst Rayyan Qatar

ISBN: (纸本)9781467349093;9781467349086

A large number of web databases are only accessible through proprietary form-like interfaces which require users to query the system by entering desired values for a few attributes. A key restriction enforced by such an interface is the top-k output constraint -i.e., when there are a large number of matching tuples, only a few (top-k) of them are preferentially selected and returned by the website, often according to a proprietary ranking function. Since most web database owners set k to be a small value, the top-k output constraint prevents many interesting third-party (e. g., mashup) services from being developed over real-world web databases. In this paper we consider the novel problem of "digging deeper" into such web databases. Our main contribution is the meta-algorithm GetNext that can retrieve the next ranked tuple from the hidden web database using only the restrictive interface of a web database without any prior knowledge of its ranking function. This algorithm can then be called iteratively to retrieve as many top ranked tuples as necessary. We develop principled and efficient algorithms that are based on generating and executing multiple reformulated queries and inferring the next ranked tuple from their returned results. We provide theoretical analysis of our algorithms, as well as extensive experimental results over synthetic and real-world databases that illustrate the effectiveness of our techniques.

关键词： web databases deep web Database tuple websites Prior Learning database owner Theoretical analysis

来源：评论

学校读者我要写书评

暂无评论

RunayaySoft Adaptive system for supporting the selection of enrichment activities in educative environments

引用

INTERNATIONAL JOURNAL OF web INFORMATION SYSTEMS 2019年第1期15卷 103-131页

作者： Gonzalez Vargas, Juan Camilo Carrillo-Ramos, Angela Fabregat, Ramon Camargo, Lizzeth Garcia Cepero, Maria Caridad Pavlich-Mariscal, Jaime A. Pontificia Univ Javeriana Dept Syst Engn Bogota Colombia Univ Girona Inst Informat & Applicat Girona Spain Pontificia Univ Javeriana Dept Syst & Comp Engn Bogota Colombia Pontificia Univ Javeriana Dept Educ Bogota Colombia

Purpose The purpose of this paper is to describe a support system to the selection of enrichment activities in educational environment called RunayaySoft, where Runayay comes from the word Quechua that means develop and Soft as it is an informatics tool that supports the educational institutions and their students, in the selection of activities that allow foster some of their skills based on their interests, learning styles, aptitudes, multiple intelligences, preferences and so on. Moreover, it suggests institutions about the activities that they should make in their building considering student ' s characteristics and the agreements that they have. Design/methodology/approach It does a diagnostic for identifying which characteristics are going to be considered to students and institutions. Then, it generates adaptive profiles with the aim of generating suggestions of enrichment activities that allow to boost some of their skills. For the students were considered their preferences, learning style, aptitude, multiple intelligences and interests. In the case of institutions were the agreements, resources and activities that they develop. Based on this information, it defines the relations for the generation of suggestions of activities toward students, where it does the prioritization of which activities should be considered. Findings For validating the system, it was done as a functional prototype that generates suggestions to students, as well as educative institutions, through a satisfaction test student assess if they agree or disagree with the suggestions given. With that assessment, it is validated the relationship between student's characteristics, activity and institution are related for generating activities suggestions.

关键词： web databases web data integration web-based education

来源：评论

学校读者我要写书评

暂无评论

Extracting and Integrating Structured Information from web databases Using Rule-Based Semantic Annotations

Extracting and Integrating Structured Information from Web D...

引用

Annual Conference of the IEEE Industrial Electronics Society

作者： Benjamin Donz Dietmar Bruckner Institute of Computer Technology University of Technology

ISBN: (纸本)9781479902255

The Semantic web is envisioned to be the next evolutionary step of the Word Wide web. It will allow programs to access information and interact with services similar to the way people use the Internet today. The required standards have already been developed, and also large databases containing factual information have been published in the appropriate format. However, more casual, every-day information like that published by used car dealerships, resellers, and other data contained in web databases is not available yet. We believe that bringing this type of information to the Semantic web could greatly increase its use and help bring it into people's everyday lives. In this paper we present a model for such web databases and show how to integrate these sites into the landscape of the Semantic web by transparently converting and forwarding queries to conventional web databases.

关键词： Semantic web Semantic Annotation Semantic Information Extraction On-Demand Information Extraction Information Integration web databases semantic networks

来源：评论

学校读者我要写书评

暂无评论

SMARTINT: using mined attribute dependencies to integrate fragmented web databases

引用

JOURNAL OF INTELLIGENT INFORMATION SYSTEMS 2012年第3期38卷 575-599页

作者： Gummadi, Ravi Khulbe, Anupam Kalavagattu, Aravind Salvi, Sanil Kambhampati, Subbarao Arizona State Univ Dept Comp Sci & Engn Tempe AZ 85287 USA

Many web databases can be seen as providing partial and overlapping information about entities in the world. To answer queries effectively, we need to integrate the information about the individual entities that are fragmented over multiple sources. At first blush this is just the inverse of traditional database normalization problem-rather than go from a universal relation to normalized tables, we want to reconstruct the universal relation given the tables (sources). The standard way of reconstructing the entities will involve joining the tables. Unfortunately, because of the autonomous and decentralized way in which the sources are populated, they often do not have Primary Key-Foreign Key relations. While tables may share attributes, naive joins over these shared attributes can result in reconstruction of many spurious entities thus seriously compromising precision. Our system, SI is aimed at addressing the problem of data integration in such scenarios. Given a query, our system uses the Approximate Functional Dependencies (AFDs) to piece together a tree of relevant tables to answer it. The result tuples produced by our system are able to strike a favorable balance between precision and recall.

关键词： web databases Loss of PK/FK Information integration

来源：评论

学校读者我要写书评

暂无评论

Automatic construction of vertical search tools for the Deep web

引用

IEEE LATIN AMERICA TRANSACTIONS 2018年第2期16卷 574-584页

作者： Marin, H. M. Sosa, V. J. Nuno, M. A. Univ Politecn Victoria Victoria Tamaulipas Mexico CINVESTAV LTI Victoria Tamaulipas Mexico Univ Politecn Victoria Ingn Victoria Tamaulipas Mexico

With the constant increase in the volume of information available on the web, it is more dificult to find the specific information related to a given domain. Users are facing the problem of information overload, in which a query about a specialized subject (local information, e-commerce: hotels, airlines, car rental;science: biology, mathematics, medicine, etc.) on a web search engine, it returns a lot of web pages or results that in most of the cases are outside the domain of interest. This is one reason why the vertical search tools have become a necessity for users that seek specific-domain information from diferent databases available in the web through input sources called web Query Interfaces (ICWs). This paper describes an approach for automatic integration of ICWs, a crucial task to construct vertical search tools. The proposed methodology is validated by realizing a vertical search prototype called VSearch that allows users to transparently query multiple web databases in a specific-domain through a unified ICW. The proposed approach for automatic ICWs integration is based on: i) a hierarchical model called AEV for modeling the visual content of ICW;ii) semantic clustering for the identification of relationships between fields in ICWs;and iii) a field homogenization and unification process of AEV schemes for the construction of a unified ICW. The VSearch prototype was implemented and evaluated using a study case. The experimental results demonstrate the high precision in the integration phase and an efective methodology to create a functional vertical search tool for a given domain.

关键词： Vertical Search Tool web databases web Query Interfaces Automatic Integration VSearch

来源：评论

学校读者我要写书评

暂无评论

One Size Does Not Fit All: Toward User- and Query-Dependent Ranking for web databases

引用

IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING 2012年第9期24卷 1671-1685页

作者： Telang, Aditya Li, Chengkai Chakravarthy, Sharma Univ Texas Arlington Dept Comp Sci & Engn Arlington TX 76019 USA

With the emergence of the deep web, searching web databases in domains such as vehicles, real estate, etc., has become a routine task. One of the problems in this context is ranking the results of a user query. Earlier approaches for addressing this problem have used frequencies of database values, query logs, and user profiles. A common thread in most of these approaches is that ranking is done in a user-and/or query-independent manner. This paper proposes a novel query- and user-dependent approach for ranking query results in web databases. We present a ranking model, based on two complementary notions of user and query similarity, to derive a ranking function for a given user query. This function is acquired from a sparse workload comprising of several such ranking functions derived for various user-query pairs. The model is based on the intuition that similar users display comparable ranking preferences over the results of similar queries. We define these similarities formally in alternative ways and discuss their effectiveness analytically and experimentally over two distinct web databases.

关键词： Automated ranking web databases user similarity query similarity workload

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：