检索结果-南通市图书馆

A Novel Ranking Framework for linked data from Relational databases

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Tsinghua Science and Technology 2010年第6期15卷 642-649页

作者：张静马春娥赵晨婷张军易力毛新生 IBM China Development Laboratory

This paper investigates the problem of ranking linked data from relational databases using a rank-ing framework. The core idea is to group relationships by their types, then rank the types, and finally rank the instances attached to each type. The ranking criteria for each step considers the mapping rules and heterogeneous graph structure of the data web. Tests based on a social network dataset show that the linked data ranking is effective and easier for people to understand. This approach benefits from utilizing relationships deduced from mapping rules based on table schemas and distinguishing the relationship types, which results in better ranking and visualization of the linked data.

关键词： linked data ranking relational databases (RDB) mapping rules

Refining linked data with Games with a Purpose

在线全文

学校读者我要写书评

暂无评论

data Intelligence 2020年第3期2卷 417-442页

作者： Irene Celino Gloria Re Calegari Andrea Fiano Cefriel Milano 20126Italy

With the rise of linked data and knowledge graphs,the need becomes compelling to find suitable solutions to increase the coverage and correctness of data sets,to add missing knowledge and to identify and remove *** approaches-mostly relying on machine learning and natural language processing techniques-have been proposed to address this refinement goal;they usually need a partial gold standard,i.e.,some“ground truth”to train automatic *** standards are manually constructed,either by involving domain experts or by adopting crowdsourcing and human computation *** this paper,we present an open source software framework to build Games with a Purpose for linked data refinement,i.e.,Web applications to crowdsource partial ground truth,by motivating user participation through fun *** detail the impact of this new resource by explaining the specific data linking“purposes”supported by the framework(creation,ranking and validation of links)and by defining the respective crowdsourcing tasks to achieve those *** also introduce our approach for incremental truth inference over the contributions provided by players of Games with a Purpose(also abbreviated as GWAP):we motivate the need for such a method with the specificity of GWAP *** crowdsourcing;we explain and formalize the proposed process,explain its positive consequences and illustrate the results of an experimental comparison with state-of-the-art *** show this resource’s versatility,we describe a set of diverse applications that we built on top of it;to demonstrate its reusability and extensibility potential,we provide references to detailed documentation,including an entire tutorial which in a few hours guides new adopters to customize and adapt the framework to a new use case.

关键词： Human computation Games with a purpose linked data Knowledge graph data refinement data linking Truth inference

Querying linked data Based on Hierarchical Multi-Hop Ranking Model

在线全文

学校读者我要写书评

暂无评论

Journal of Shanghai Jiaotong university(Science) 2018年第4期23卷 568-576页

作者： LI Junxian WANG Wei WANG dingjing School of Computer Jiangsu University of Science and Technology Zhenjiang 212003 Jiangsu China School of Computer Science Fudan University Shanghai 200433 China Yangzhou Polytechnic College Yangzhou 225009 Jiangsu China

How to query linked data effectively is a challenge due to its heterogeneous *** are three types of heterogeneities,i.e.,different structures representing entities,different predicates with the same meaning and different literal formats used in *** based on ontology mapping or Information Retrieval(IR) cannot deal with all types of *** these limitations,we propose a hierarchical multi-hop language model(HMPM).It discriminates among three types of predicates,descriptive predicates,out-associated predicates and in-associated predicates,and generates multi-hop models for them *** predicates' similarities between the query and entity are organized into a hierarchy,with predicate types on the first level and predicates of this type on the second *** candidates are ranked in ascending *** evaluated HMPM in three datasets,DBpedia,linked MDB and *** results of experiments show that the effectiveness and generality of HMPM outperform the existing approaches.

关键词： hierarchical multi-hop ranking model(HMPM) linked data language model

A linked data-based approach for clinical treatment selecting support

在线全文

学校读者我要写书评

暂无评论

Journal of Management Analytics 2014年第4期1卷 301-316页

作者： Lihong Jiang Ling Li Hongming Cai Hua Liu Jingyuan Hu Cheng Xie School of Software Shanghai Jiao Tong UniversityShanghaiChina College of Business&Public Administration Old Dominion UniversityNorfolkUSA Renji Hospital Shanghai Jiao Tong UniversityShanghaiChina

Treatment plan selection is a complex process because it sometimes needs sufficient experience and clinical *** it is even harder for doctors to select an appropriate treatment plan for certain patients since doctors might encounter difficulties in obtaining the right information and analyzing the diverse clinical *** order to improve the effectiveness of clinical decision making in complicated information system environments,we first propose a linked data-based approach for treatment plan *** approach integrates the patients’clinical records in hospitals with open linked data sources out of ***,based on the linked data net,treatment plan selection is carried on aided by similar historical therapy ***,we reorganize the electronic medical records of 97 colon cancer patients using the linked data model and count the similarity of these records to help treatment *** experiment shows the usability of our method in supporting clinical decisions.

关键词： linked data cancer treatment semantic web case-based reasoning clinical decision support

基于linked data的数据完整性评估新方法

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

吉林大学学报（工学版） 2020年第5期50卷 1826-1831页

作者：袁满胡超仇婷婷东北石油大学计算机与信息技术学院黑龙江大庆163318

为更加高效、准确地对数据完整性进行评估,通过对国内外完整性评估技术和方法的研究,本文基于linked data的数据特点,提出了用于数据完整性评估的β算法和用于隐含数据挖掘的Dam算法,并从理论上分析证明了算法的有效性和准确性。最后,... 详细信息

为更加高效、准确地对数据完整性进行评估,通过对国内外完整性评估技术和方法的研究,本文基于linked data的数据特点,提出了用于数据完整性评估的β算法和用于隐含数据挖掘的Dam算法,并从理论上分析证明了算法的有效性和准确性。最后,将东北石油大学教务数据发布为linked data作为验证数据进行实验,与文献中两种完整性评估算法进行了比对,结果表明:评估完整性提高约6%,评估效率平均提高约40倍,验证了本文算法的准确性和高效性。本文提出的基于linked data的数据完整性评估算法不仅能保证数据评估的准确性,同时能大幅度提高计算效率。

关键词：计算机软件数据质量数据完整性 linked data

linked data-based Slide Repository： The Episodic Slide Retrieval Using the Episodic Keyword Networks

在线全文

学校读者我要写书评

暂无评论

Journal of Control Science and Engineering 2016年第1期4卷 36-49页

作者： Tomohiro Iwasa Yudai Kato Shun Shiramatsu Tadaehika Ozono Toramatsu Shintani Department of Computer Science and Engineering Graduate School of Engineering Nagoya Institute of Technology Gokiso-choShowa-ku Nagoya Aichi 466-8555 Japan

This paper focuses on developing a system that allows presentation authors to effectively retrieve presentation slides for reuse from a large volume of existing presentation materials. We assume episodic memories of the authors can be used as contextual keywords in query expressions to efficiently dig out the expected slides for reuse rather than using only the part-of-slide-descriptions-based keyword queries. As a system, a new slide repository is proposed, composed of slide material collections, slide content data and pieces of information from authors＇ episodic memories related to each slide and presentation together with a slide retrieval application enabling authors to use the episodic memories as part of queries. The result of our experiment shows that the episodic memory-used queries can give more discoverability than the keyword-based queries. Additionally, an improvement model is discussed on the slide retrieval for further slide-finding efficiency by expanding the episodic memories model in the repository taking in the links with the author-and-slide-related data and events having been post on the private and social media sites.

关键词： Slide Retrieval linked data-based Slide Repository Episodic Keyword Networks linked data episodic memories social media life event.

A RESTful proxy and data model for linked sensor data

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

International Journal of Digital Earth 2013年第3期6卷 233-254页

作者： Krzysztof Janowicz Arne Broring Christoph Stasch Sven Schade Thomas Everding Alejandro Llaves Department of Geography University of CaliforniaSanta BarbaraCAUSA North Initiative for Geospatial Open Source Software MunsterGermany Faculty ITC University of TwenteEnschedeTheNetherlands Institute for Geoinformatics University of MunsterMunsterGermany Joint Research Centre Institute for Environment and SustainabilityIspraItaly

The vision of a Digital Earth calls for more dynamic information systems,new sources of information,and stronger capabilities for their *** networks have been identified as a major information source for the Digital Earth,while Semantic Web technologies have been proposed to facilitate *** far,sensor data are stored and published using the Observations&Measurements standard of the Open Geospatial Consortium(OGC)as data *** the advent of Volunteered Geographic Information and the Semantic Sensor Web,work on an ontological model gained importance within Sensor Web Enablement(SWE).In contrast to data models,an ontological approach abstracts from implementation details by focusing on modeling the physical world from the perspective of a particular *** restrict the interpretation of vocabularies toward their intended *** ongoing paradigm shift to linked Sensor data complements this *** questions have to be addressed:(1)how to refer to changing and frequently updated data sets using Uniform Resource Identifiers,and(2)how to establish meaningful links between those data sets,that is,observations,sensors,features of interest,and observed properties?In this paper,we present a linked data model and a RESTful proxy for OGC’s Sensor Observation Service to improve integration and inter-linkage of observation data for the Digital Earth.

关键词： Digital Earth geospatial data integration spatial data infrastructure earth observation data exchange models linked data semantic enablement

Multidimensional and quantitative interlinking approach for linked Geospatial data

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

International Journal of Digital Earth 2017年第9期10卷 923-943页

作者： Yunqiang Zhu A-Xing Zhu Jia Song Jie Yang Min Feng Kai Sun Jingqu Zhang Zhiwei Hou Hongwei Zhao State Key Laboratory of Resources and Environmental Information System Institute of Geographic Sciences and Natural Resources ResearchChinese Academy of SciencesBeijingPeople’s Republic of China Jiangsu Center for Collaborative Innovation in Geographical Information Resource Development and Application NanjingPeople’s Republic of China Department of Geography University of Wisconsin–MadisonMadisonWIUSA College of Resource and Environment University of Chinese Academy of SciencesBeijingPeople’s Republic of China School of Computer Global Land Cover FacilityDepartment of GeographyUniversity of MarylandCollege ParkMDUSA South China Normal University GuangzhouPeople’s Republic of China

linked data is known as one of the best solutions for multisource and heterogeneous web data integration and discovery in this era of Big ***,data interlinking,which is the most valuable contribution of linked data,remains incomplete and *** study proposes a multidimensional and quantitative interlinking approach for linked data in the geospatial *** to the characteristics and roles of geospatial data in data discovery,eight elementary data characteristics are adopted as data interlinking *** elementary characteristics are further combined to form compound and overall data interlinking *** data interlinking type possesses one specific predicate to indicate the actual relationship of linked data and uses data similarity to represent the correlation degree ***,geospatial data interlinking can be expressed by a directed edge associated with a relation predicate and a similarity *** approach transforms existing simple and qualitative geospatial data interlinking into complete and quantitative interlinking and promotes the establishment of high-quality and trusted linked Geospatial *** approach is applied to build data intra-links in the Chinese National Earth System Scientific data Sharing Network(NSTI-GEO)and data-links in NSTI-GEO with the Chinese Meteorological data Network and National Population and Health Scientific data Sharing Platform.

关键词： Geospatial data linked data interlinking type link predicate data similarity

Wahi, a discrete global grid gazetteer built using linked open data

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

International Journal of Digital Earth 2017年第5期10卷 490-503页

作者： Benjamin Adams Department of Computer Science Centre for eResearchThe University of AucklandAucklandNew Zealand

Discrete global grid systems have become an important component of Digital Earth ***,previously there has not existed an easy way to map between named places(toponyms)and the cells of a discrete global grid *** lack of such a tool has limited the opportunities to synthesize social place-based data with the more standard Earth and environmental science data currently being analyzed in Digital Earth *** paper introduces Wāhi,the first gazetteer to map entities from the GeoNames database to multiple discrete global grid systems.A gazetteer service is presented that exposes the grid system and the associated gazetteer data as linked data.A set of use cases for the discrete global grid gazetteer is discussed.

关键词： Discrete global grid gazetteer linked data place toponym Digital Earth