Policies are declarations of constraints on the behaviour of components within distributed systems, and are often used to capture norms within agent-based systems. A few machine-processable representations for policies have been proposed, but they tend to be either limited in the types of policies that can be expressed or limited by the complexity of associated reasoning mechanisms. In this paper, we argue for a language that sufficiently expresses the types of policies essential in practical systems, and which enables both policy-governed decisionmaking and policy analysis within the bounds of decidability.We then propose an OWL-based representation of policies that meets these criteria using and a reasoning mechanism that uses a novel combination of ontology consistency checking and query answering. In this way, agent-based systems can be developed that operate flexibly and effectively in policy-constrainted environments.
OWL-POLAR: Semantic Policies for Agent Reasoning
OWL-POLAR: Semantic Policies for Agent Reasoning
semantic web
Optimize First, Buy Later: Analyzing Metrics to Ramp-up Very Large Knowledge Bases
Enhong Chen
Enhong Chen
Enhong
0fc9e9054f39ec4d12089e502a2f95331d624f39
Melanie Courtot
Melanie Courtot
Melanie
563aaf4c870555e19ca68d19bd37cb59778862fc
Stanford University
Stanford University
Jamie Taylor
Jamie Taylor
Jamie
dd485fcb6436ae2a96fe33a418ee96e3f5293be1
Sujoy Basu
Sujoy Basu
Sujoy
1a003cb0d0e378cdf1a86985f2b91a1f46c3cb11
Politecnico di Milano
Politecnico di Milano
Tsinghua University
Tsinghua University
Tsinghua University Shenzhen
Tsinghua University, Shenzhen
semantic web
Assessing Trust in Uncertain Information
On the Semantic Web, decision makers (humans or software agents alike) are faced with the challenge of examining large volumes of information originating from heterogeneous sources with the goal of ascertaining trust in various pieces of information. While previous work has focused on simple models for review and rating systems, we introduce a new trust model for rich, complex and uncertain information.We present the challenges raised by the new model, and the results of an evaluation of the first prototype implementation under a variety of scenarios.
Assessing Trust in Uncertain Information
Zemanta
Zemanta
Forgetting Fragments from Evolving Ontologies
linked open data
semantic web
Ontologies underpin the semantic web; they define the concepts and their relationships contained in a data source. An increasing number of ontologies are available on-line, but an ontology that combines information from many different sources can grow extremely large. As an ontology grows larger, more resources are required to use it, and its response time becomes slower. Thus, we present and evaluate an on-line approach that forgets fragments from an OWL ontology that are infrequently or no longer used, or are cheap to relearn, in terms of time and resources. In order to evaluate our approach, we situate it in a controlled simulation environment, RoboCup OWLRescue, which is an extension of the widely used RoboCup Rescue platform, which enables agents to build ontologies automatically based on the tasks they are required to perform. We benchmark our approach against other comparable techniques and show that agents using our approach spend less time forgetting concepts from their ontology, allowing them to spend more time deliberating their actions, to achieve a higher average score in the simulation environment.
named entity
Forgetting Fragments from Evolving Ontologies
classification
Jens Wissmann
Jens Wissmann
Jens
a78cc5aef93a952c8290d3d56b9d453e4893587b
Combining Approximation and Relaxation in SemanticWeb Path Queries
fluid Operations
fluid Operations
Liang Du
Liang Du
Liang
Yongchun Xu
Yongchun Xu
Yongchun
5ac35e64c1fb85d5d1442a6013cedf6187a623df
Thomas Eiter
Thomas Eiter
Thomas
f0758dd5ba72906f9f5b2ee040211578590965eb
Chiara Ghidini
Chiara Ghidini
Chiara
aca9efa3e5a984c2a05baeb389b092d70b0e76fa
Zhi Jin
Zhi Jin
Zhi
e37e77f786c36b4a1d05be0a7bbbd1a771f920a8
Rolf Sint
Rolf Sint
Rolf
656c89c40e4b957bd00e85800f4d52d20a58c5b0
SPARQL Query Optimization on Top of DHTs
University of Science and Technology of China
University of Science and Technology of China
Konstantinos N. Vavliakis
Konstantinos N. Vavliakis
Konstantinos
c5718991c92225d1bfebc54d2b276e338c76d432
Samantha Bail
Samantha Bail
Samantha
3eb298593f1ca8d13b94206d401d01555ffa2e89
Rahul Parundekar
Rahul Parundekar
Rahul
3bc761798435bfd162757fa4c05ec714129d2698
North Carolina State University
North Carolina State University
Zhiqiang Gao
Zhiqiang Gao
Zhiqiang
Break
Kaifeng Xu
Kaifeng Xu
Kaifeng
39d1604f9d5688fe6376e6a1091d94d33ac69a41
INRIA LIG
INRIA LIG
INRIA and LRI (Universite Paris-Sud and CNRS)
INRIA and LRI (Universite Paris-Sud and CNRS)
Industry Invited Talk: Jay Katzen
Stefan Warwas
Stefan Warwas
Stefan
325a8b3e5e30f7f267606742615b10e8e2cd7305
modeling
RDF
Organizations today collect and store large amounts of data in various formats and locations, however they are sometimes required to locate all instances of a certain type of data. Data classification enables efficient retrieval of information when needed. This work presents a reference implementation for enterprise data classification using Semantic Web technologies. We demonstrate automatic discovery and classification of Personally Identifiable Information (PII) in relational databases, using a classification model in RDF/OWL describing the elements to discover and classify. At the end of the process the results are also stored in RDF, enabling simple navigation between the input model and the findings in different databases. Recorded demo link: https://www.research.ibm.com/haifa/info/demos/ piidiscovery_full.htm
NeON
Classification
Enterprise Data Classification Using Semantic Web Technologies
RelationalOWL
Enterprise Data Classification Using Semantic Web Technologies
Semantic Techniques
Optimizing Enterprise-scale OWL 2 RL Reasoning in a Relational Database System
Optimizing Enterprise-scale OWL 2 RL Reasoning in a Relational Database System
OWL 2 RL was standardized as a less expressive but scalable subset of OWL 2 that allows a forward-chaining implementation. However, building an enterprise-scale forward-chaining based inference engine that can 1) take advantage of modern multi-core computer architectures, and 2) efficiently update inference for additions remains a challenge. In this paper, we present an OWL 2 RL inference engine implemented inside the Oracle database system, using novel techniques for parallel processing that can readily scale on multi-core machines and clusters. Additionally, we have added support for efficient incremental maintenance of the inferred graph after triple additions. Finally, to handle the increasing number of owl:sameAs relationships present in Semantic Web datasets, we have provided a hybrid in-memory/disk based approach to efficiently compute compact equivalence closures. We have done extensive testing to evaluate these new techniques; the test results demonstrate that our inference engine is capable of performing efficient inference over ontologies with billions of triples using a modest hardware configuration.
semantic web
Kalina Bontcheva
Kalina Bontcheva
Kalina
ca40a5f5c913e833a0419992909b3c53354bf853
Lightning Talks
Zareen Syed
Zareen Syed
Zareen
1aa4a58a436c1e0cfd47711f53684b6ff7be3678
IBM Research, Haifa
IBM Research-Haifa
Latifur Khan
Latifur Khan
Latifur
99d0484f13da0c5b984724da6183afd5b6d60fee
Ming Zhang
Ming Zhang
Ming
c8865e56cde6e00629cc860c53169518d66b84d9
University of Liverpool
University of Liverpool
Nadejda Nikitina
Nadejda Nikitina
Nadejda
a15ae9abc8032e73fe02ac509b2bf9640d7c0247
Zhisheng Huang
Zhisheng Huang
Zhisheng
238a59a17bd96fbb93f39aa9dba2f6847a8d261c
Birkbeck College
Birkbeck College
Henry S. Thompson
Henry S. Thompson
Henry
4400745c067648d5a44a7a94a07ba2378e570f94
Supporting Natural Language Processing with Background Knowledge: Coreference Resolution Case
Joshua Shinavier
Joshua Shinavier
Joshua
11c0cc3cb1abd1c021923b1aeece41d6953dc560
Tobias Kowatsch
Tobias Kowatsch
Tobias
4bb622bd6adb323048584baeafb3ae0b37417610
Free University of Bozen-Bolzano
Free University of Bozen-Bolzano
Ignazio Palmisano
Ignazio Palmisano
Ignazio
ca70fcd05971e567bf1c33a8e97707ecee6b7af9
Holger Wache
Holger Wache
Holger
612ab1009b9f9bb7c31f53982a6de846e572dfff
Blaz Fortuna
Blaz Fortuna
Blaz
ad1e1215f5349d2c3aad14363a36706b7653becc
Accenture Technology Labs
Accenture Technology Labs
semantic web
Using Reformulation Trees to Optimize Queries over Distributed Heterogeneous Sources
Using Reformulation Trees to Optimize Queries over Distributed Heterogeneous Sources
information integration
In order to effectively and quickly answer queries in environments with distributed RDF/OWL, we present a query optimization algorithm to identify the potentially relevant Semantic Web data sources using structural query features and a term index. This algorithm is based on the observation that the join selectivity of a pair of query triple patterns is often higher than the overall selectivity of these two patterns treated independently. Given a rule goal tree that expresses the reformulation of a conjunctive query, our algorithm uses a bottom-up approach to estimate the selectivity of each node. It then prioritizes loading of selective nodes and uses the information from these sources to further constrain other nodes. Finally, we use an OWL reasoner to answer queries over the selected sources and their corresponding ontologies. We have evaluated our system using both a synthetic data set and a subset of the real-world Billion Triple Challenge data.
source selectivity
query optimization
query reformulation
Zhe Wu
Zhe Wu
Zhe
2a75691aae4e9aff54cc59adeb52e3c9c75ffc40
Carole Goble
Carole Goble
Carole
4699824a3759895701ccaaa26c2ba7aaa5397b80
Semantic annotation
Semantic-based Mobile Mashup Platform
Mobile devices contain more personal data such as GPS location, contacts and music, with which users can create innovative and pragmatic mashup applications for different areas such as social networking, E-commerce, and entertainment. We propose a semantic-based mobile mashup platform which enables users to create mashup applications by simply selecting service nodes, linking them together and configuring some connection parameters. Our platform also offers a recommendation mechanism on linkable services by adding semantic annotation to service description, so that users do not need to read specifications of web services in order to find out linkable ones. Therefore, users can focus more on the innovation and practicability of their mashup applications, which will surely result in the emergence of abundant mobile mashup applications.
web service
mashup recommendation
mobile mashup
Semantic-based Mobile Mashup Platform
Auto-experimentation of KDD Workflows based on Ontological Planning
Garlik Ltd
Garlik Ltd
Manolis Koubarakis
Manolis Koubarakis
Manolis
92ea611cf55f95a0ffd94eca818bb9d8a3f9a735
Friedrich-Schiller-Universität Jena
Friedrich-Schiller-Universität Jena
Saltlux Inc
Saltlux Inc
Emmanuel Pietriga
Emmanuel Pietriga
Emmanuel
Jacky Snoep
Jacky Snoep
Jacky
452906106fb463e354b8f7ec63ebd1f0d2ab6e69
recommendation systems
semantic web applications
dbpedia
dbrec - Music Recommendations Using DBpedia
This paper describes the theoretical background and the implementation of dbrec, a music recommendation system built on top of DBpedia, offering recommendations for more than 39,000 bands and solo artists. We discuss the various challenges and lessons learnt while building it, providing relevant insights for people developing applications consuming Linked Data. Furthermore, we provide a user-centric evaluation of the system, notably by comparing it to last.fm.
linked data
semantic distance
dbrec - Music Recommendations Using DBpedia
semantic web
Jan Hidders
Jan Hidders
Jan
6abe460287858dbde52be25c68f376b83dc198da
Jose Julio Alferes
Jose Julio Alferes
Jose
90006b80834d12ce5b86b77881da8faaf5ce235e
Jianfeng Du
Jianfeng Du
Jianfeng
16d55e1e1f6f6ba54684273630bdad2b1f153f04
W3C
W3C
SPARQL
RDF
AnQL: SPARQLing up annotated RDF
AnQL: SPARQLing up annotated RDF
Starting from the general framework for annotated RDF(S) which we have presented in previous work, we address the development of a query language - AnQL - that is inspired by SPARQL, including several features of SPARQL 1.1. As a side effect we propose formal definitions of the semantics of these features (subqueries, aggregates, assignment, solution modifiers) which could serve as a basis for the ongoing work in SPARQL 1.1. We demonstrate the value of such a framework by comparing our approach to previously proposed extensions of SPARQL and show that AnQL generalises and extends them.
Adam Marcus
Adam Marcus
Adam
0ab75a707766dda52bd08f4509736440b3f8d095
Cassia Trojahn
Cassia Trojahn
Cassia
8645231151124deb3f16b5836d0b52ae5ea42a83
semantic web
Causal Knowledge Modeling for Traditional Chinese Medicine using OWL 2
owl 2
Causal Knowledge Modeling for Traditional Chinese Medicine using OWL 2
rule reasoning
tcm
Unlike Western Medicine, those in Traditional Chinese Medicine (TCM) are based on inherent rules or patterns, which can be considered as causal links. Existing approaches tend to apply computational methods on semantic ontology to do knowledge mining, but it cannot perfectly make use of internal principles in TCM. When it comes to knowledge representation, we can transform this inherent knowledge into causal graphs. In this paper, we present an approach to build a TCM knowledge model with the capability of rule reasoning using OWL 2. In particular, we focused on the causal relations among syndrome and symptoms, changes between syndromes. We evaluated our approach by giving two typical use cases and implemented them using Jena, a Java framework supporting RDF, OWL, and including a rule-based inference engine. The evaluation results suggested that our approach clearly displayed the causal relations in TCM and shows a great potential in TCM knowledge mining.
causal knowledge modeling
HP Labs Bristol
HP Labs Bristol
National University of Colombia
National University of Colombia
Preference-based Web Service Composition: A Middle Ground Between Execution and Search
Much of the AI-related work on Web Service Composition (WSC) relates it to an Artificial Intelligence (AI) planning problem, where the composition is primarily done offline prior to execution. Recent research on WSC has argued convincingly for the importance of optimizing quality of service and user preferences. While some of this optimization can be done offline, many interesting and useful optimizations are data-dependent, and must be done following execution of at least some information-providing services. In this paper, we examine this class of WSC problems, attempting to bridge the gap between offline composition and online information gathering with a view to producing high-quality compositions without excessive data gathering. Our investigation is performed in the context of an existing preference-based Hierarchical Task Networks (HTNs) WSC system. Our experiments show an improvement in both the quality and speed of finding a composition.
semantic web
Preference-based Web Service Composition: A Middle Ground Between Execution and Search
Soeren Auer
Soeren Auer
Soeren
09ac456515dee0896e8eba4b06ae589bef2069cf
Gregor Leban
Gregor Leban
Gregor
64aa9ecb2485d939eb0cd5fb584dc77c13c0e81e
Nigel Shadbolt
Nigel Shadbolt
Nigel
e966302104bd52f060f0e4545e8299f2d54ee3ae
dependency linguistics
semantic annotation
In this paper we present a method for semantic annotation of texts, which is based on a deep linguistic analysis (DLA) and Inductive Logic Programming (ILP). The combination of DLA and ILP have following benefits: Manual selection of learning features is not needed. The learning procedure has full available linguistic information at its disposal and it is capable to select relevant parts itself. Learned extraction rules can be easily visualized, understood and adapted by human. A description, implementation and initial evaluation of the method are the main contributions of the paper.
Towards Semantic Annotation Supported by Dependency Linguistics and ILP
information extraction
semantic web
inductive logic programming
machine learning
Towards Semantic Annotation Supported by Dependency Linguistics and ILP
Kunal Verma
Kunal Verma
Kunal
Zhichun Wang
Zhichun Wang
Zhichun
Daniel Izquierdo
Daniel Izquierdo
Daniel
644a69c39b2d5e3f722156ad65fa080ccf3d97a6
Eric Prud'hommeaux
Eric Prud'hommeaux
Eric
e2d67791b2a0ce3441c0c770f94daa130b4e6d95
KAIST
KAIST
Javier D. Fernandez
Javier D. Fernandez
Javier
009bf2ef0c6215fe25149bae749fe3550ca231e1
Marta Sabou
Marta Sabou
Marta
19f8655880a3531e2a1d6eb329f44d5d6b88324b
INRIA Rhone-Alpes
INRIA Rhone-Alpes
HANNE - A Holistic Application for Navigational Knowledge Engineering
Although research towards the reduction of the knowledge acquisition bottleneck in ontology engineering is advancing, a central issue remains unsolved: Light-weight processes for collaborative knowledge engineering by a massive user base. In this demo, we present HANNE, a holistic application that implements all necessary prerequisites for Navigational Knowledge Engineering and thus reduces the complexity of creating expressive knowledge by disguising it as navigation. HANNE enables users and domain experts to navigate over knowledge bases by selecting examples. From these examples, formal OWL class expressions are created and refined by a scalable Iterative Machine Learning approach. When saved by users, these class expressions form an expressive OWL ontology, which can be exploited in numerous ways: as navigation suggestions for users, as a hierarchy for browsing, as input for a team of ontology editors.
HANNE - A Holistic Application for Navigational Knowledge Engineering
semantic web
SAOR: Template Rule Optimisations for Distributed Reasoning over 1 Billion Linked Data Triples
SAOR: Template Rule Optimisations for Distributed Reasoning over 1 Billion Linked Data Triples
In this paper, we discuss optimisations of rule-based materialisation approaches for reasoning over large static RDF datasets. We generalise and reformalise what we call the "partial-indexing" approach to scalable rule-based materialisation: the approach is based on a separation of terminological data, which has been shown in previous and related works to enable highly scalable and distributable reasoning for specific rulesets; in so doing, we provide some completeness propositions with respect to semi-naive evaluation. We then show how related work on template rules - T-Box-specific dynamic rulesets created by binding the terminological patterns in the static ruleset - can be incorporated and optimised for the partial-indexing approach. We evaluate our methods using LUBM(10) for RDFS, pD* (OWL Horst) and OWL 2 RL, and thereafter demonstrate pragmatic distributed reasoning over 1.12 billion Linked Data statements for a subset of OWL 2 RL/RDF rules we argue to be suitable for Web reasoning.
Hajo Rijgersberg
Hajo Rijgersberg
Hajo
345d931feb33633e47b7d0e679d545ec03e6cd97
Ontology similarity in the alignment space
Paea Lependu
Paea Lependu
Paea
12dfbfa0172c5a29107cd3aec7a2058914263ff6
Nicholas R. Jennings
Nicholas R. Jennings
Nicholas
ba977726904667077573fd4f04ae87efc681e02f
James P. Mcglothlin
James P. Mcglothlin
James
f689c67704c965fb3dbe7e89c18817f9893e31ad
Nathalie Hernandez
Nathalie Hernandez
Nathalie
fa8025e323181773e4b1bf02b4365c975fe1e921
Break
Universite de Rennes 1
Universite de Rennes 1
Guillermo Alvaro
Guillermo Alvaro
Guillermo
c401c9b3a13a1d1ab604c539832dce3f2a8183ea
semantic web
Experience of Using OWL Ontologies for Automated Inference of Routine Pre-Operative Screening Tests
We describe our experience of designing and implementing a knowledge-based pre-operative assessment decision support system. We developed the system using semantic web technology, including modular ontologies developed in the OWL Web Ontology Language, the OWL Java Application Programming Interface and an automated logic reasoner. Using ontologies at the core of the system's architecture permits to efficiently manage a vast repository of pre-operative assessment domain knowledge, including classification of surgical procedures, classification of morbidities, and guidelines for routine pre-operative screening tests. Logical inference on the domain knowledge, according to individual patient's medical context (medical history combined with planned surgical procedure) enables to generate personalised patients' reports, consisting of a risk assessment and clinical recommendations, including relevant pre-operative screening tests.
Experience of Using OWL Ontologies for Automated Inference of Routine Pre-Operative Screening Tests
Wei-Qi Wei
Wei-Qi Wei
Wei-Qi
Semantic Media Asset Management: playence Media
Oxford University
Oxford University
Zhejiang University
Zhejiang University
Hybrid Graph based Keyword Query Interpretation on RDF
Hybrid Graph based Keyword Query Interpretation on RDF
Adopting keyword query interface to semantic search on RDF data can help users keep away from learning the SPARQL query syntax and understanding the complex and fast evolving data schema. The existing approaches are divided into two categories: instance-based approaches and schema-based approaches. The instance-based approaches relying on the original RDF graph can generate precise answers but take a long processing time. In contrast, the schema-based approaches relying on the reduced summary graph require much less processing time but cannot always generate correct answers. In this paper, we propose a novel approach based on a hybrid graph which can achieve significant improvements on processing time with a limited accuracy drop compared with instance-based approaches, and meanwhile, can achieve promising accuracy gains at an affordable time cost compared with schema-based approaches.
Dmitriy Zheleznyakov
Dmitriy Zheleznyakov
Dmitriy
c8f195227b13e30b2955356caba8b682de34e59b
Prateek Jain
Prateek Jain
Prateek
6c501e43c250bd849f5749df9464f728466b203b
Building applications over Linked Data often requires a mapping between the application model and the ontology underlying the source dataset in the Linked Data cloud. This mapping can be defined in many ways. For instance, by describing the application model as a view over the source dataset, by giving mappings in the form of dependencies between the two datasets, or by inference rules that infer the application model from the source dataset. Explicitly formulating these mappings demands a comprehensive understanding of the underlying schemas (RDF ontologies) of the source and target datasets. This task can be supported by integrating the process of schema exploration into the mapping process and help the application designer with finding the implicit relationships that she wants to map. This paper describes Fusion - a framework for closing the gap between the application model and the underlying ontologies in the Linked Data cloud. Fusion simplifies the definition of mappings by providing a visual user interface that integrates the exploratory process and the mapping process. Its architecture allows the creation of new applications through the extension of existing Linked Data with additional data.
rdf mapping
data management
semantic web
Fusion - Visually Exploring and Eliciting Relationships in Linked Data
data interaction
Fusion - Visually Exploring and Eliciting Relationships in Linked Data
linked data
The Web of Data currently coming into existence through the Linked Open Data (LOD) effort is a major milestone in realizing the Semantic Web vision. However, the development of applications based on LOD faces difficulties due to the fact that the different LOD datasets are rather loosely connected pieces of information. In particular, links between LOD datasets are almost exclusively on the level of instances, and schema-level information is being ignored. In this paper, we therefore present a system for finding schema-level links between LOD datasets in the sense of ontology alignment. Our system, called BLOOMS, is based on the idea of bootstrapping information already present on the LOD cloud. We also present a comprehensive evaluation which shows that BLOOMS outperforms state-of-the-art ontology alignment systems on LOD datasets. At the same time, BLOOMS is also competitive compared with these other systems on the Ontology Evaluation Alignment Initiative Benchmark datasets.
semantic web
Ontology Alignment for Linked Open Data
Ontology Alignment for Linked Open Data
University of Brighton
University of Brighton
Andriy Nikolov
Andriy Nikolov
Andriy
f711448173546302efd026ff3b508fd8e50f1927
James P. McCusker
James P. McCusker
James
77efda547240484d1caee8193429b71f609e7003
Research Track: Ontologies in Linked Data
Evren Sirin
Evren Sirin
Evren
199129950aa1a391f5e9ca3fce00a2e4c17f678c
Benjamin Grosof
Benjamin Grosof
Benjamin
50495cfb238dba18ff8f27d5d8f896683c981cf8
Robert Stevens
Robert Stevens
Robert
9f6b7929ac641ad6368aa4cf6c7bbc9c4398ca0e
The Polish interface for Linked Open Data
The Polish interface for Linked Open Data
This paper describes an application which aims at producing Polish descriptions for the data available as Linked Open Data, the MusicBrainz knowledge base contents in particular.
Time-Oriented Question Answering from Clinical Narratives Using Semantic-Web Techniques
Annabel Bourde
Annabel Bourde
Annabel
International Workshop on Evaluation of Semantic Technologies
Christian Becker
Christian Becker
Christian
c2df82e9aa69743b6f7d82a5dca62abcc2bd5959
Mihai Radulescu
Mihai Radulescu
Mihai
dec70699bf56c5fb1fd5ed6c89c9891cadb96466
Universität Klagenfurt
Universität Klagenfurt
Zhi Nie
Zhi Nie
Zhi
Semantic Web Challenge
Atanas Kiryakov
Atanas Kiryakov
Atanas
a74d5c2fa0c492439d220a82dbc3db8ffcdbc5d1
Pankaj Mehra
Pankaj Mehra
Pankaj
3cac7affcba7c4e7d4311cba4b58c46bc1c0437a
Thomas Kurz
Thomas Kurz
Thomas
4f8f59594c4c16680f1065809ff9d303f8a8cacd
Avalanche: Putting the Spirit of the Web back into Semantic Web Querying
Avalanche: Putting the Spirit of the Web back into Semantic Web Querying
Traditionally Semantic Web applications either included a web crawler or relied on external services to gain access to the Web of Data. Recent efforts, have enabled applications to query the entire Semantic Web for up-to-date results. Such approaches are based on either centralized indexing of semantically annotated metadata or link traversal and URI dereferencing as in the case of Linked Open Data. They pose a number of limiting assumptions, thus breaking the openness principle of the Web. In this demo we present a novel technique called Avalanche, designed to allow a data surfer to query the Semantic Web transparently. The technique makes no prior assumptions about data distribution. Specifically, Avalanche can perform "live" queries over the Web of Data. First, it gets on-line statistical information about the data distribution, as well as bandwidth availability. Then, it plans and executes the query in a distributed manner trying to quickly provide first answers.
Joao Leite
Joao Leite
Joao
8344b1a3d86184677b39581018617d8ad43e8303
Faith Lawrence
Faith Lawrence
Faith
Anni Yasmin Turhan
Anni Yasmin Turhan
Anni
cc6a50e14fb902bd4e891b0fbfbdb4b318401b90
Hassan Ait Kaci
Hassan Ait Kaci
Hassan
66974b5ca22a039efb7ca78dbc199397f44b983a
Marco Faella
Marco Faella
Marco
ea62850ae3b047770c4c09cab4169c29ff76eed9
Amit P. Sheth
Amit P. Sheth
Amit
c903202d3919813029e4dc56efbe0a2b2443074c
Fang Wei
Fang Wei
Fang
9137a4b2aac6b233c9f0b37b032aa83cc4eb9964
Royal Irish Academy
Royal Irish Academy
Stijn Heymans
Stijn Heymans
Stijn
78e68b596b44edb8094661009afd331853c1d667
semantic web
Semantic similarity and relatedness measures between ontology concepts are useful in many research areas. While similarity only considers subsumption relations to assess how two objects are alike, relatedness takes into account a broader range of relations (e.g., part-of). In this paper, we present a framework, which maps the feature-based model of similarity into the information theoretic domain. A new way of computing IC values directly from an ontology structure is also introduced. This new model, called Extended Information Content (eIC) takes into account the whole set of semantic relations defined in an ontology. The proposed framework enables to rewrite existing similarity measures that can be augmented to compute semantic relatedness. Upon this framework, a new measure called FaITH (Feature and Information THeoretic) has been devised. Extensive experimental evaluations confirmed the suitability of the framework.
A Feature and Information Theoretic Framework for Semantic Similarity and Relatedness
A Feature and Information Theoretic Framework for Semantic Similarity and Relatedness
STEREO: a SaT-based tool for an optimal solution of the sERvice selEctiOn problem
We present STEREO, a system that offers an expressive formalism and implements techniques firmly grounded on logic to solve the Service Selection Problem (SSP). STEREO adopts the Local-As-View approach (LAV) to represent services' functionality as views on ontology concepts, while user requests are expressed as conjunctive queries on these concepts. Additionally, users can describe their preferences, which are used to rank the solutions. We discuss the LAV formulation of SSP; then, we illustrate the encoding of SSP as a logical theory whose models are in correspondence with the problem solutions, and in presence of preferences, the best models are in correspondence with the best-ranked solutions. We demonstrate STEREO and the properties of modern SAT solvers that provide an efficient and scalable solution to SSP.
STEREO: a SaT-based tool for an optimal solution of the sERvice selEctiOn problem
Semantic Web Challenge
Ulrich Walther
Ulrich Walther
Ulrich
65f4d55c80cdf5ddd30e4a96b1f3d985e1403d94
Open Innovation and Semantic Web: Problem Solver Search on Linked Data
Open Innovation and Semantic Web: Problem Solver Search on Linked Data
The novel practice of Open Innovation on the Web has imposed new challenges to known expert search approaches. At the same time, many potential sources of evidence about users' interest and expertise (e.g., research papers, blogs, activities) are becoming ubiquitously present as Linked Data. In this paper we present a research effort for suggesting the right way to search for potential Open Innovation problem solvers in Linked Data sources, by looking at the structure of available data sources. In addition, we seek to develop ways of suggesting domains of expertise that are in some way relevant to the domain of the Open Innovation problem, in order to enable a cross-domain solution transfer.
semantic web
University of Texas at Dallas
University of Texas at Dallas
Xingzhi Sun
Xingzhi Sun
Xingzhi
725dcccc1b1fb88222804c8c237eec0e55ff1d3a
Ulf Morgenstern
Ulf Morgenstern
Ulf
a39f23553157cacc0df1abba7d77f624c80e9694
Olga Krebs
Olga Krebs
Olga
fc9924d3e0c21ecb6d4d38f46f7df7784df2c40a
Hai Tao Zheng
Hai Tao Zheng
Hai Tao
eb2de215210998592a7025397f4c5593dcb5a6a8
Yue Pan
Yue Pan
Yue
Mathias Niepert
Mathias Niepert
Mathias
08696cc17cc699db05c034d2d7828a60dbc1f6bf
Gearoid Hynes
Gearoid Hynes
Gearoid
78f7eea5cda74c6912341f44f8d52726fa977248
Linked Data
Most of the data on the Web is stored in relational databases. In order to make the Semantic Web grow we need to provide easy-to-use tools to convert those databases into linked data, so that even people with little knowledge of the semantic web can use them. Some programs able to convert relational databases into RDF files have been developed, but the user still has to link manually the database attribute names to existing ontology properties and this generated "linked data" is not actually linked with external relevant data. We propose here a method to associate automatically attribute names to existing ontology entities in order to complete the automation of the conversion of databases. We also present a way - rather basic, but with low error rate - to add links automatically to relevant data from other data sets.
Semantic Integration
Automated Mapping Generation for Converting Databases into Linked Data
Semantic Web
Database
Automated Mapping Generation for Converting Databases into Linked Data
Social dynamics in conferences: analyses of data from the Live Social Semantics application
Declarative Semantics for the Rule Interchange Format Production Rule Dialect
Declarative Semantics for the Rule Interchange Format Production Rule Dialect
semantic web
The Rule Interchange Format Production Rule Dialect (RIF-PRD) is a W3C Recommendation to define production rules for the Semantic Web, whose semantics is defined operationally via labeled terminal transition systems. In this paper, we introduce a declarative logical characterization of the full default semantics of RIF-PRD based on Answer Set Programming (ASP), including matching, conflict resolution and acting. Our proposal to the semantics of RIF-PRD enjoys several features. Being based on ASP, it enables a straightforward integration with Logic Pro- gramming rule based technology, namely for reasoning and acting with ontologies. Then, its full declarative logical character facilitates the in- vestigation of formal properties of RIF-PRD itself. Furthermore, it turns out that our characterization based on ASP is flexible enough so that new conflict resolution semantics for RIF-PRD can easily be defined and encoded. Finally, it immediately serves as the declarative specification of an implementation, whose prototype we developed.
Independent Consultant at Seattle Area
Independent Consultant at Seattle Area
Ulrich Lampe
Ulrich Lampe
Ulrich
3cb1962fd02b0b84a7011c52cbe5ad882c80218c
Alexandre Passant
Alexandre Passant
Alexandre
0cfa0c4363ecc5d6a0250fdac77c4267cab8a4dd
Salzburg Research
Salzburg Research
Epimorphics Ltd
Epimorphics Ltd
Yuan Fang Li
Yuan Fang Li
Yuan Fang
5b712cb4f914d39c5ebdc4f61e20a43d2d926acf
Bhavani Thuraisingham
Bhavani Thuraisingham
Bhavani
b7461b7b01dfa88ddde27fac264fc1ee0ed9abdc
Freddy Priyatna
Freddy Priyatna
Freddy
ae49099977b46024157a9bbea469b1f06030531b
Break
Jinan El Hachem
Jinan El Hachem
Jinan
OWL 2 - Theory and Practice
Riccardo Rosati
Riccardo Rosati
Riccardo
347c5f7b49d6802f343668845c30c5e610d28a7f
Daniel Winkler
Daniel Winkler
Daniel
620772a1eed70e45315fbb0c70cc5711a5c12975
Mathieu d'Aquin
Mathieu d'Aquin
Mathieu
e61cc68181adeb9fbbddc539a6fa01dd24b299c8
Harold R. Solbrig
Harold R. Solbrig
Harold
06b74f5b11c277cadad978a06df9e1817146d2f4
Kewu Sun
Kewu Sun
Kewu
Ten Ways to Make your Semantic App Addictive
Rob Shearer
Rob Shearer
Rob
60a65ecef9d429eed8c078ba2b839e75aed3f97f
National Technical University of Athens
National Technical University of Athens
Paul-Andre Mellies
Paul-Andre Mellies
Paul-Andre
V.S. Subrahmanian
V.S. Subrahmanian
V.S.
579652e4ad1e669385951dbcb0dcafe5476e31ea
Philippe Cudre Mauroux
Philippe Cudre Mauroux
Philippe
cd093dfee55f5ac86ec10c79157bff2ad1107ec9
Rensselaer Polytechnic Institute
Rensselaer Polytechnic Institute
Jeff Z. Pan
Jeff Z. Pan
Jeff
e409b5eceff3b8cf4be69005301c6984fa6ceae3
Mark Greaves
Mark Greaves
Mark
e95bfaadf4186955aeff505efcc450528cefcd52
Mapping Master: a Flexible Approach for Mapping Spreadsheets to OWL
Self-Service Development of Linked Data Applications with the Information Workbench
A Semantic Web Repository for Managing and Querying Aligned Knowledge
A Semantic Web Repository for Managing and Querying Aligned Knowledge
Ontology alignment is the task of matching concepts and terminology from multiple ontologies. Ontology alignment is especially relevant in the semantic web domain as RDF documents and OWL ontologies are quite heterogeneous, yet often describe related concepts. The end goal for ontology matching is to allow the knowledge sets to interoperate. To achieve this goal, it is necessary for queries to return results that include knowledge, and inferred knowledge, from multiple datasets and terminologies, using the alignment information. Furthermore, ontology alignment is not an exact science, and concept matchings often involve uncertainty. The goal of this paper is to provide a semantic web repository that supports applying alignments to the dataset and reasoning with alignments. Our goal is to provide high performance queries that return results that include inference across alignment matchings, and rank results using certainty information. Our semantic web repository uses distributed inference and probabilistic reasoning to allow datasets to be efficiently updated with ontology alignments. We materialize the inferred, aligned data and make it available in efficient queries.
Andy Seaborne
Andy Seaborne
Andy
d84b2e439ae33d719820f02e60a47ed39ad98e67
Christian Fritz
Christian Fritz
Christian
d8ca05aa77976e68571a405994b53911cec8f08b
Introduction to the Semantic Web
Katharina Siorpaes
Katharina Siorpaes
Katharina
9e0cf1db7ae7fea47ab28f639f63aa4f799e7b8c
3rd International Workshop on Social Data on the Web
From Knowledge Capture to Semantic Applications: The Evolution of Semantic MediaWiki
In-Use/2
Michael Uschold
Michael Uschold
Michael
dec13295cf321695245e9fce5dc7648f0ecaf7b6
Wei Shen
Wei Shen
Wei
Industry Track: Session 2
Michel Dumontier
Michel Dumontier
Michel
5e77a59ef110b7f85b3e1c2feb28b3d1c26b870b
Combine the Web of Data and the Web of Documents (RDFa and Drupal 7)
Abraham Bernstein
Abraham Bernstein
Abraham
8704ad77580618cb845036d3a15626d30fd828c3
British Columbia Cancer Research Centre
British Columbia Cancer Research Centre
Daniel Hienert
Daniel Hienert
Daniel
9a9855efbd75d3a603f9860618a091b0a1e9a0e6
David Laniado
David Laniado
David
f8f37199f555868cfc18aabb9ffc8c4ceeb7c9d5
In-Use Track/1
Olaf Hartig
Olaf Hartig
Olaf
9c09772d208636b590bf7b41d9d1976b80f6b335
Bart J. Nagel
Bart J. Nagel
Bart
d55d5a32e0356196f45919813edc300ec3622476
Industry Track: Session 2
Universidad de Chile
Universidad de Chile
Web Rules: Fundamentals, Applications, and Standards
Paul Buitelaar
Paul Buitelaar
Paul
1b01a3da0c0ebff7089eb364ef40def825fb3148
Google
Google
Krzysztof Janowicz
Krzysztof Janowicz
Krzysztof
370abc72ba56ab007826f882d58e2211ef573105
University of Aberdeen
University of Aberdeen
Alistair Duke
Alistair Duke
Alistair
08400e14ca3a777de2721425832cba38c43fbe7a
Linked Data for eGovernment
Universität der Bundeswehr München
Universität der Bundeswehr München
JustBench: A Framework for OWL Benchmarking
Duc Thanh Tran
Duc Thanh Tran
Duc Thanh
13a8957f89cffa9ca37a4525e19792bd3ba8ca54
Edward Benson
Edward Benson
Edward
f6788998f0e4b3155a15d37b2a53e0f0924e810f
David C. De Roure
David C. De Roure
David
65c08dd5d0c872ff172293356d88796cb0bfd17b
Yuan Ni
Yuan Ni
Yuan
df44250c64560e6c81b9648543a57997260beae2
Linked Open Services
Universite Paris 7 - Denis Diderot
Universite Paris 7-Denis Diderot
Johnson and Johnson
Johnson and Johnson
In Use Track
Semantic Search Tutorial
Knarig Arabshian
Knarig Arabshian
Knarig
f2876944692de114ff30dff8c01b3255ce65c265
Danh Le-Phuoc
Danh Le-Phuoc
Danh
a8c8eef405e7e48f5bd4b664df9db19048b025eb
Jerome Euzenat
Jerome Euzenat
Jerome
22bc9bfef9e568c1439538b6a03d4cd8becf01f9
Johns Hopkins University
Johns Hopkins University
Using Semantic Web technologies for Clinical Trial Recruitment
Luciano Serafini
Luciano Serafini
Luciano
7fea00a39da1a3986831556109303fc904b9f935
Intelligent Software Components
Intelligent Software Components
Ulrike Sattler
Ulrike Sattler
Ulrike
263ccece2324c257d2b0c10a62c3233893cbae29
Michael Erdmann
Michael Erdmann
Michael
1358c9444dc080d0f388bca815f6f35fd62cd8f2
SILK is an expressive Semantic Web rule language and system equipped with scalable reactive higher-order defaults. We present one of its latest novel features: a graphical user interface (GUI) for knowledge entry, query answering, and justification browsing that supports user specification and understanding of advanced courteous prioritized defeasible reasoning. We illustrate the use of the GUI in an example from college-level biology of modeling and reasoning about hierarchically structured causal processes with interfering multiple causes.
A SILK Graphical UI for Defeasible Reasoning, with a Biology Causal Process Example
A SILK Graphical UI for Defeasible Reasoning, with a Biology Causal Process Example
University of London
University of London
Hideaki Takeda
Hideaki Takeda
Hideaki
b89c2a9de1b2b9c0b16d4d1e0bc33ca371f25e46
Semantic Web Career Mentoring Lunch
Jans Aasman
Jans Aasman
Jans
203216e2412e287bad61ff368f0b51f41cc73311
Thomas Steiner
Thomas Steiner
Thomas
9c5fa2b92131aab99375f3191e4bd68852fcba89
In-Use/5
Nanjing University
Nanjing University
Bernardo Cuenca-Grau
Bernardo Cuenca-Grau
Bernardo
ae98569ea8e2d775ec222700985de5eb630745ff
Semantic MediaWiki in Operation: Experiences with Building a Semantic Portal
semantic web
Wikis allow users to collaboratively create and maintain content. Semantic wikis, which provide the additional means to annotate the content semantically and thereby allow to structure it, experience an enormous increase in popularity, because structured data is more usable and thus more valuable than unstructured data. As an illustration of leveraging the advantages of semantic wikis for semantic portals, we report on the experience with building the AIFB portal based on Semantic MediaWiki. We discuss the design, in particular how free, wiki-style semantic annotations and guided input along a predefined schema can be combined to create a flexible, extensible, and structured knowledge representation. How this structured data evolved over time and its flexibility regarding changes are subsequently discussed and illustrated by statistics based on actual operational data of the portal. Further, the features exploiting the structured data and the benefits they provide are presented. Since all benefits have its costs, we conducted a performance study of the Semantic MediaWiki and compare it to MediaWiki, the non- semantic base platform. Finally we show how existing caching techniques can be applied to increase the performance.
Semantic MediaWiki in Operation: Experiences with Building a Semantic Portal
Measuring the dynamic bi-directional influence between content and social networks
The Social Semantic Web has begun to provide connections between users within social networks and the content they produce across the whole of the Social Web. Thus, the Social Semantic Web provides a basis to analyze both the communication behavior of users together with the content of their communication. However, there is little research combining the tools to study communication behaviour and communication content, namely, social network analysis and content analysis. Furthermore, there is even less work addressing the longitudinal characteristics of such a combination. This paper presents a general framework for measuring the dynamic bi-directional influence between communication content and social networks. We apply this framework in two use-cases: online forum discussions and conference publications. The results provide a new perspective over the dynamics involving both social networks and communication content.
Measuring the dynamic bi-directional influence between content and social networks
semantic web
In-Use/4
BT
BT
When owl:sameAs isn't the Same: An Analysis of Identity in Linked Data
linked data
coreference
semantic web
In Linked Data, the use of owl:sameAs is ubiquitous in interlinking data-sets. There is however, ongoing discussion about its use, and potential misuse, particularly with regards to interactions with inference. In fact, owl:sameAs can be viewed as encoding only one point on a scale of similarity, one that is often too strong for many of its current uses. We describe how referentially opaque contexts that do not allow inference exist, and then outline some varieties of referentially-opaque alternatives to owl:sameAs. Finally, we report on an empirical experiment over randomly selected owl:sameAs statements from the Web of data. This theoretical apparatus and experiment shed light upon how owl:sameAs is being used (and misused) on the Web of data.
When owl:sameAs isn't the Same: An Analysis of Identity in Linked Data
identity
2010 Workshop on Cross-Cultural and Cross-Lingual Aspects of the Semantic Web
EL with Default Attributes and Overriding
In-Use/3
Hugh Glaser
Hugh Glaser
Hugh
623018b35a1850179ed2903e332d96978eeb1d4f
Zhongli Ding
Zhongli Ding
Zhongli
6b9ac726589036e530b5b8c2cdf6a51d36b944bd
Vit Novacek
Vit Novacek
Vit
c91b8f5b6908408264728371f7331249e3857a87
SPARQL Beyond Subgraph Matching
Despoina Trivela
Despoina Trivela
Despoina
Juanzi Li
Juanzi Li
Juanzi
c3a13805c2241db080dc04bc5f49fd61b4a07910
FCT/Universidade Nova de Lisboa
FCT/Universidade Nova de Lisboa
Giorgos Stamou
Giorgos Stamou
Giorgos
ed24f9a731f7d754cfd077da217c483efea94d89
Kejia Wu
Kejia Wu
Kejia
Paola Monachesi
Paola Monachesi
Paola
9a1bab031cfd7c009f197a1dea4dcbffcfb1de93
Making sense of Twitter
semantic web
Making sense of Twitter
Twitter enjoys enormous popularity as a microblogging service largely due to its simplicity. On the downside, there is little organization to the Twitterverse and making sense of the stream of messagespassing through the system has become a significant challenge for everyone involved. As a solution, Twitter users have adopted the convention ofadding a hash at the beginning of a word to turn it into a hashtag. Hashtags have become the means in Twitter to create threads of conversationand to build communities around particular interests.In this paper, we take a first look at whether hashtags behave as strongidentifiers, and thus whether they could serve as identifiers for the Semantic Web. We introduce some metrics that can help identify hashtagsthat show the desirable characteristics of strong identifiers. We look atthe various ways in which hashtags are used, and show through evaluation that our metrics can be applied to detect hashtags that representreal world entities.
Carleton University
Carleton University
University of Edinburgh
University of Edinburgh
What does It Look Like, Really? Imagining how Citizens might Effectively, Usefully and Easily Find, Explore, Query and Re-present Open/Linked Data
Heiner Stuckenschmidt
Heiner Stuckenschmidt
Heiner
f072571d8c8abd21e637a9dec2c5e835165c8ece
Basil Ell
Basil Ell
Basil
46ab0a56c4872867b37c785c208b0eabff3223c8
Shanghai Jiao Tong University
Shanghai Jiao Tong University
Vulcan Inc
Vulcan Inc
Enhancing the Open-Domain Classification of Named Entity using Linked Open Data
William Murray
William Murray
William
16e358b211b956d3e8f05ac9ba90c401aabcf8a4
National Library of Medicine
National Library of Medicine
Yi Dong Shen
Yi Dong Shen
Yi Dong
b175df833d1d907ea84539695097391f421bf28e
Awards and Closing Ceremonies
Compact Representation of Large RDF Data Sets for Publishing and Exchange
Boris Villazon Terrazas
Boris Villazon Terrazas
Boris
6384e9af5019abb399667d5259acec5db611c3d4
Break
Semantic Technology at The New York Times: Lessons Learned and Future Directions
semantic web
An Expressive and Efficient Solution to the Service Selection Problem
An Expressive and Efficient Solution to the Service Selection Problem
Given the large number of Semantic Web Services that can be created from online sources by using existing annotation tools, expressive formalisms and efficient and scalable approaches to solve the service selection problem are required to make these services widely available to the users. In this paper, we propose a framework that is grounded on logic and the Local-As-View approach for representing instances of the service selection problem. In our approach,Web services are semantically described using LAV mappings in terms of generic concepts from an ontology, user requests correspond to conjunctive queries on the generic concepts and, in addition, the user may specify a set of preferences that are used to rank the possible solutions to the given request. The LAV formulation allows us to cast the service selection problem as a query rewriting problem that must consider the relationships among the concepts in the ontology and the ranks induced by the preferences. Then, building on related work, we devise an encoding of the resulting query rewriting problem as a logical theory whose models are in correspondence with the solutions of the user request, and in presence of preferences, whose best models are in correspondence with the best-ranked solutions. Thus, by exploiting known properties of modern SAT solvers, we provide an efficient and scalable solution to the service selection problem. The approach provides the basis to represent a large number of real-world situations and interesting user requests.
Alessandro Adamou
Alessandro Adamou
Alessandro
bd7621ff59162ec62118f24a0a4e4fc2c32115a9
Break
Linked Data Query Processing Strategies
Blai Bonet
Blai Bonet
Blai
5bae4e724817052bfb0e2ce8d41b0a8213ab4148
Ivan Martinez
Ivan Martinez
Ivan
87470b0d4c68033ef691e5330f29cf22ed79c66d
The Linking Open Data cloud contains several music related datasets that hold great potential for enhancing the process of research in the ?eld of Music Information Retrieval (MIR) and which, in turn, can be enriched by MIR results. We demonstrate a system with several related aims: to enable MIR researchers to utilise these datasets through incorporation in their research systems and work?ows; to publish MIR research output on the Semantic Web linked to existing datasets (thereby also increasing the size and applicability of the datasets for use in MIR); and to present MIR research output, with cross-referencing to other linked data sources, for manipulation and evaluation by researchers and re-use within the wider Semantic Web. By way of example we gather and publish RDF describing signal collections derived from the country of an artist. Genre analysis over these collections and integration of collection and result metadata enables us to ask: "how country is my country?".
Semantics for music researchers: How country is my country?
Semantics for music researchers: How country is my country?
University of Oregon
University of Oregon
Patrick Kapahnke
Patrick Kapahnke
Patrick
da93ef6fd37b8baddffda792c3cdb81a6ba31e85
Advanced Evaluation of Web Search - Methodology and Technology
Wolfgang Nejdl
Wolfgang Nejdl
Wolfgang
bbeda2ca7d282ea067085181b864c7e13dc7d544
Jan Dedek
Jan Dedek
Jan
093fcde8131b2f162d3d94b121682168b9c154a6
Using Semantics for Automating the Authentication of Web APIs
IBM Research China
IBM China Research Laboratory
IBM Research China
IBM China Research Laboratory
Siegfried Handschuh
Siegfried Handschuh
Siegfried
583cac1297018405882f186064c6d98cd127af70
Break
The 6th International Workshop on Scalable Semantic Web Knowledge Base Systems
RDOTE - Transforming Relational Databases into Semantic Web Data
RDOTE - Transforming Relational Databases into Semantic Web Data
RDB2RDF
During the last decade, there has been intense research and development in creating methodologies and tools able to map Relational Databases with the Resource Description Framework. Although some systems have gained wider acceptance in the Semantic Web community, they either require users to learn a declarative language for encoding mappings, or have limited expressivity. Thereupon we present RDOTE, a framework for easily transporting data residing in Relational Databases into the Semantic Web. RDOTE is available under GNU/GPL license and provides friendly graphical interfaces, as well as enough expressivity for creating custom RDF dumps.
RDF Dump
Relational Databases to Ontology Transformation
The Open Graph Protocol Design Decisions
Michael Schmidt
Michael Schmidt
Michael
92f314774e71485a0f35688d78278e18ad1b8489
Harry Halpin
Harry Halpin
Harry
7988b1abc80e9c9393c5feca76af35808f8d7a49
Query strategy for sequential ontology debugging
Harith Alani
Harith Alani
Harith
ad0c7d68490b84d6c7f8b0cb8aa1e457559386ef
A Self-Policing Policy Language
RDFMatView: Indexing RDF Data for SPARQL Queries
Enabling Ontology-based Access to Streaming Data Sources
Research Track: Semantic Web Services
Matthias Weidl
Matthias Weidl
Matthias
a3d7450b5cd8da0d4de4087ae3608faf6f88e346
integrity constraint
owl
instance data
This paper presents our work on supporting evaluation of integrity constraint issues in semantic web instance data. We propose an alternative semantics for the ontology language, i.e., OWL, a decision procedure for constraint evaluation by query answering, and an approach of explaining and repairing integrity constraint violations by utilizing the justifications of conjunctive query answers.
evaluation
semantic web
Adding Integrity Constraints to the Semantic Web for Instance Data Evaluation
Adding Integrity Constraints to the Semantic Web for Instance Data Evaluation
entity linking
linked data
T2LD: Interpreting and Representing Tables as Linked Data
human language technology
We describe a framework and prototype system for interpreting tables and extracting entities and relations from them, and producing a linked data representation of the table's contents. This can be used to annotate the table or to add new facts to the linked data collection.
T2LD: Interpreting and Representing Tables as Linked Data
Christer Thorn
Christer Thorn
Christer
d0019542bb3ad8a7ee27c419478ec9c7af30bc10
Yuan Tian
Yuan Tian
Yuan
42fa25cd65e783707332fcbeae74bca804ee305d
Research Track: Linked Data
University of Sheffield
University of Sheffield
Guo-Qiang Zhang
Guo-Qiang Zhang
Guo-Qiang
5a1cd1d6941fd62c3bf2341cdfd541ec6f07e19e
Research Track: Reasoning and Algorithms
Breakfast
Vinhtuan Thai
Vinhtuan Thai
Vinhtuan
67abf94faa44a44ca38d68dec2192740d8bc04da
Michael Gruninger
Michael Gruninger
Michael
b928543fbf9cd011751ece4cec727e27dd651bc1
Extensions of SPARQL towards Heterogeneous Sources and Domain Annotations
Extensions of SPARQL towards Heterogeneous Sources and Domain Annotations
SPARQL is the W3C Recommended query language for RDF. My current work aims at extending SPARQL in two distinct ways: (i) to allow a better integration of RDF and XML; and (ii) to define a query language for RDF extended with domain specific annotations. Transforming data between XML and RDF is a much required, but not so simple, task in the Semantic Web. The aim of (i) is to enable transparent transformations between these two representation formats, relying on a new query language called XSPARQL. On a different aspect, representing and reasoning with meta-information about RDF triples has been addressed by several proposals for representing time, trust and provenance. A common extension of RDF (and RDFS inferencing rules), capable of encompassing all these proposals, with a clearly defined semantics is much desirable. Building on top of Annotated RDF, we present such an extension and an extension of the SPARQL language capable of querying triples with annotations. An open research issue remains the possibility of unifying the two, currently independent, extensions of SPARQL.
semantic web
Yang Yang
Yang Yang
Yang
f41ae0f861dcd2281ab7a7f6c77743cb95a83248
Silver Oliver
Silver Oliver
Silver
cab292c34c96b73ea8545ddd5904085c9857d7c6
Frank van Harmelen
Frank van Harmelen
Frank
44657ea3231f512794e12d76b02ed7fcf93bf4b0
BBC
BBC
Research Track: Representation Extensions
EvoPat - Pattern-Based Evolution and Refactoring of RDF Knowledge Bases
Gui Rong Xue
Gui Rong Xue
Gui Rong
ce2dee14cea7fdef37830f1e2ee3b70fd2694a44
Sebastian Tramp
Sebastian Tramp
Sebastian
4c8faa6d9e54a411f9e20760d6507c8f037ba866
Samur Araujo
Samur Araujo
Samur
5a47a3a05014fbe3c664ed227220e7a74e5f1b8d
Presentation and Discussion on RDF Next Steps
Fabio Ciravegna
Fabio Ciravegna
Fabio
1581bc8c10464ef1f4b317119f5706b1fedaf77f
Dmitry Ryashchentsev
Dmitry Ryashchentsev
Dmitry
Robert H. P. Engels
Robert H. P. Engels
Robert
608c13d67ab3e5fe3be33c7b9f443ffeba4d3883
Enrico Motta
Enrico Motta
Enrico
28a0f82609671f47d811e6bee865afb23abfb8db
Optimising Ontology Classification
Jozef Stefan Institute
Jozef Stefan Institute
Facebook
Facebook
Indiana University
Indiana University
Riichiro Mizoguchi
Riichiro Mizoguchi
Riichiro
36f7c5e541fbc21084f8bc4c85215922ab342097
Jane Hunter
Jane Hunter
Jane
c37d6749670bdf835b98a68ba16cf9dfcaa3b7c5
Ming Zuo
Ming Zuo
Ming
c555802d7a9d1c81dc6d9f5f580476deed51c7fd
Pennsylvania State University
Pennsylvania State University
Ontotext Lab
Ontotext Lab
Applications at the heart of a new Publishing Ecosystem
wikipedia
relation extraction
semantic web
When multiple ontologies are used within one application system, aligning the ontologies is a prerequisite for interoperability and unhampered semantic navigation and search. Various methods have been proposed to compute mappings between elements from different ontologies, the majority of which being based on various kinds of similarity measures. As a major shortcoming of these methods it is difficult to decode the semantics of the results achieved. In addition, in many cases they miss important mappings due to poorly developed ontology structures or dissimilar ontology designs. I propose a complementary approach making massive use of relation extraction techniques applied to broad-coverage text corpora. This approach is able to detect different types of semantic relations, dependent on the extraction techniques used. Furthermore, exploiting external background knowledge, it can detect relations even without clear evidence in the input ontologies themselves.
ontology alignment
Exploiting Relation Extraction for Ontology Alignment
Exploiting Relation Extraction for Ontology Alignment
The eCloudManager Intelligence Edition Semantic Technologies for Enterprise Cloud Management
Enterprise clouds apply the paradigm of cloud computing to enterprise IT infrastructures, with the goal of providing easy, flexible, and scalable access to both computing resources and IT services. Realizing the vision of the fully automated enterprise cloud involves addressing a range of technological challenges. In this demonstration, we show how semantic technologies can help to address the challenges related to intelligent information management in enterprise clouds. In particular, we address the topics of data integration, collaborative documentation and annotation and intelligent information access and analytics and demonstrate solutions that are implemented in the newest addition to our eCloudManager product suite: The Intelligence Edition.
The eCloudManager Intelligence Edition Semantic Technologies for Enterprise Cloud Management
mc schraefel
mc schraefel
mc
7b5fcc32e3d9002c074a521209471a49e26a761b
Linkage of Heterogeneous Knowledge Resources within In-store Dialogue Interaction
Summary Models for Routing Keywords to Linked Data Sources
Leigh Dodds
Leigh Dodds
Leigh
3605b869216404d54ebcf0d2a7e045c39eb3109e
Enhancing the BBC's World Cup coverage with an ontology driven information architecture
Wolfgang Maass
Wolfgang Maass
Wolfgang
6716e5d7cecf77816bffe55ee08b078fe7ac1f82
Nor Azlinayati Abdul Manaf
Nor Azlinayati Abdul Manaf
Nor
6e648f001b0034cc90a93a6c00e04dae3ad0791a
2nd International Workshop on the role of Semantic Web in Provenance Management
Simon Bolivar University
Simon Bolivar University
Sapienza Universita di Roma
Sapienza Universita di Roma
Key Sun Choi
Key Sun Choi
Key Sun
d3a3d0c5e6aa283795c96ddf39fd4002251de1de
Customizing the Composition of Actions, Programs, and Web Services with User Preferences
Customizing the Composition of Actions, Programs, and Web Services with User Preferences
Web service composition (WSC) - loosely, the composition of web-accessible software systems - requires a computer program to automatically select, integrate, and invoke multiple web services in order to achieve a user-defined objective. It is an example of the more general task of composing business processes or component-based software. Our doctoral research endeavours to make fundamental contributions to the knowledge representation and reasoning principles underlying the task of WSC, with a particular focus on the customization of compositions with respect to individual preferences. The setting for our work is the semantic web, where the properties and functioning of services and data are described in a computer-interpretable form. In this setting we conceive of WSC as an Artificial Intelligence planning task. This enables us to bring to bear many of the theoretical and computational advances in reasoning about action and planning to the task of WSC. However, WSC goes far beyond the reaches of classical planning, presenting a number of interesting challenges that are relevant not only to WSC but to a large body of problems related to the composition of actions, programs, business processes, and services. In what follows we identify a set of challenges facing our doctoral research and report on our progress to date in addressing these challenges.
semantic web
semantic web
ORE - A Tool for Repairing and Enriching Knowledge Bases
While the number and size of Semantic Web knowledge bases increases, their maintenance and quality assurance are still difficult. In this article, we present ORE, a tool for repairing and enriching OWL ontologies. State-of-the-art methods in ontology debugging and supervised machine learning form the basis of ORE and are adapted or extended so as to work well in practice. ORE supports the detection of a variety of ontology modelling problems and guides the user through the process of resolving them. Furthermore, the tool allows to extend an ontology through (semi-)automatic supervised learning. A wizard-like process helps the user to resolve potential issues after axioms are added.
ORE - A Tool for Repairing and Enriching Knowledge Bases
Tamar Domany
Tamar Domany
Tamar
759a9795cdceaa84877ac97459fcefe609d30b74
Jesse (Jiaxin) Wang
Jesse (Jiaxin) Wang
Jesse
ca5f12029d15b3d95ac29d459bb19c2cc9148cea
Sean M. Falconer
Sean M. Falconer
Sean
e79d72ca42726c097c1876a721b72ee958e9cdcb
Magdalena Ortiz
Magdalena Ortiz
Magdalena
6780554684df2909110ccf3b8ff2b85c49bc6a3d
Pascal Hitzler
Pascal Hitzler
Pascal
d9d5e01de07e6f9a5e8b66c44c995c5ca8cc3b63
Xiao Zhang
Xiao Zhang
Xiao
Tania Tudorache
Tania Tudorache
Tania
638d023ba44fb531a81881698239ebb410af4790
Christian Meilicke
Christian Meilicke
Christian
aa10dcc1abe225b12ac6c62c75224109957f8837
Pascal Liedtke
Pascal Liedtke
Pascal
75c500a7a30716fe5677b948fdfba00a21520bca
CIS Informatics
CIS Informatics
Paolo Besana
Paolo Besana
Paolo
University of Applied Sciences Northwestern Switzerland (FHNW)
University of Applied Sciences Northwestern Switzerland (FHNW)
Thomas Schneider
Thomas Schneider
Thomas
6542f602930fbc87c5026aec7fa2506652c2b189
Bo Hu
Bo Hu
Bo
b82c0558162bc109e51f60a5986d218dd2c1cdd9
Alexandros Chortaras
Alexandros Chortaras
Alexandros
e53f8d6fe227f865c36d8d6b215c4b013098baa9
Susie Stephens
Susie Stephens
Susie
ac2efbc6ebcf27f67cca5777df1bc8671ccbcd96
Matthias Klusch
Matthias Klusch
Matthias
57876bb570c0df05cb5353220e5b2e1a040c1409
Alun Preece
Alun Preece
Alun
0c30c05401c56610765d2f4ac7ee902f74c47807
University of Maryland
University of Maryland, Baltimore County
University of Maryland
University of Maryland, Baltimore County
middleware
service oriented architecture
Using Multi-Agent Based Middleware to Implement a Distributed Peer-To-Peer Semantic Service Oriented Architecture
Using Multi-Agent Based Middleware to Implement a Distributed Peer-To-Peer Semantic Service Oriented Architecture
semantic web
multi-agent system
In this work we give the outline for a novel approach to semantic web service based applications. This approach centers around the use of so-called intelligent agents as the basis for the middleware layer. We give a broad outline of our prototype architecture and preliminary correctness results.
service composition
semantic web services
Ontological metamodeling has a variety of applications yet only very restricted forms are supported by OWL 2 directly. We propose a novel encoding scheme enabling class-based metamodeling inside the domain ontology with full reasoning support through standard OWL 2 reasoning systems. We demonstrate the usefulness of our method by applying it to the OntoClean methodology. En passant, we address performance problems arising from the inconsistency diagnosis strategy originally proposed for OntoClean by introducing an alternative technique where sources of conflicts are indicated by means of marker predicates.
Integrated Metamodeling and Diagnosis in OWL 2
Integrated Metamodeling and Diagnosis in OWL 2
semantic web
Maxim Lukichev
Maxim Lukichev
Maxim
d22046d5fd0b6484d7cd4766ee05a0a599873058
Sebastian Hellmann
Sebastian Hellmann
Sebastian
3b9b030bfa83b9c747d525b7943829d3abc2813b
1st International Workshop on Semantic Repositories for the Web
Yves Raimond
Yves Raimond
Yves
df94b6469447b53fdf45c80e2cec57dc91eb90ee
Denny Vrandecic
Denny Vrandecic
Denny
724da1947282453da70768fab5ab29e1ba12d88a
Tassos Venetis
Tassos Venetis
Tassos
107749fd36ff1a07272397061c75aa03b7943715
Xin He
Xin He
Xin
8a1a0ebfc124901bc613060054664e85335d1be8
The 5th International Workshop on Ontology Matching
Diego Calvanese
Diego Calvanese
Diego
9f41f6f9767c215c484e883dfa80e694c03aef54
Ivan Herman
Ivan Herman
Ivan
5ac8032d5f6012aa1775ea2f63e1676bafd5e80b
Daniel Blum
Daniel Blum
Daniel
31126ab1f8d77cc6da8a3170d3c6bc8d9018745f
Oracle Nashua
Oracle Nashua
An ontology mapping neural network (OMNN) is proposed in order to learn and infer correspondences among ontologies. It extends the Identical Elements Neural Network (IENN)'s ability to represent and map complex relationships. The learning dynamics of simultaneous (interlaced) training of similar tasks interact at the shared connections of the networks. The output of one network in response to a stimulus to another network can be interpreted as an analogical mapping. In a similar fashion, the networks can be explicitly trained to map specific items in one domain to specific items in another domain. Representation layer helps the network learn relationship mapping with direct training method. OMNN is applied to several OAEI benchmark test cases to test its performance on ontology mapping. Results show that OMNN approach is competitive to the top performing systems that participated in OAEI 2009.
Ontology Mapping Neural Network: An Approach to Learning and Inferring Correspondences among Ontologies
analogy
learning
Ontology Mapping Neural Network: An Approach to Learning and Inferring Correspondences among Ontologies
ontology mapping
neural network
4th International Workshop on Ontology Dynamics
University of Southern California
University of Southern California
Semantic Techniques for Enabling Knowledge Reuse in Conceptual Modelling
Luigi Sauro
Luigi Sauro
Luigi
06861b9f33c0f5830cf759eb382a8b512d94c5f6
Zepheira
Zepheira
Geert-Jan Houben
Geert-Jan Houben
Geert-Jan
9a5f499c604ad2aa0187925949a43598439fcf00
The Open University
The Open University
Aldo
Gangemi
Aldo Gangemi
8d7f004803b48a3b7c5e9f73dc16953069a6632d
Aldo
Aldo Gangemi
Aldo Gangemi
NTT Corporation
NTT Corporation
Oussama Zekri
Oussama Zekri
Oussama
f5313786d375f1cf598cc0d3aa2de8fb89381a87
Roger Castillo
Roger Castillo
Roger
73678b44bd8ea426b542c1f913e4ed1d16dde1de
Semantic Technologies for Enterprise Cloud Management
Semantic Technologies for Enterprise Cloud Management
Enterprise clouds apply the paradigm of cloud computing to enterprise IT infrastructures, with the goal of providing easy, flexible, and scalable access to both computing resources and IT services. Realizing the vision of the fully automated enterprise cloud involves addressing a range of technological challenges. In this paper, we focus on the challenges related to intelligent information management in enterprise clouds and discuss how semantic technologies can help to fulfill them. In particular, we address the topics of data integration, collaborative documentation and annotation and intelligent information access and analytics and present solutions that are implemented in the newest addition to our eCloudManager product suite: The Intelligence Edition.
semantic web
One size does not fit all: Customizing Ontology Alignment Using User Feedback
KiWi - A Platform for building Semantic Social Media Applications
KiWi - A Platform for building Semantic Social Media Applications
The combination of semantic technologies and social software has become more and more popular in the last few years as can be seen by the emergence of Semantic Wikis or the popularity of vocabularies such as FOAF or SIOC. The KiWi project is based upon these principles and offers features required for Social Media applications such as versioning, (semantic) tagging, rich text editing, easy linking, rating and commenting, as well as advanced "smart" services such as recommendation, rule-based reasoning, information extraction, intelligent search and querying, a sophisticated social reputation system, vocabulary management, and rich visualization. KiWi can be used both, as a platform for building custom Semantic Media applications, and as a Semantic Social Index, integrating content and data from a variety of different sources, e.g. Wikis, blogs and content management systems in an enterprise internet. Third-party applications can access the KiWi System using simple-to-use web services. The demo presents the whole functionality of the Open Source development platform KiWi in its final version within one integrated project management scenario. Furthermore it shows different KiWi-based Social Media projects to illustrate its various fields of application.
National and Kapodistrian University of Athens
National and Kapodistrian University of Athens
Enterprise Data Classification using Semantic Web Technologies
Enterprise Data Classification using Semantic Web Technologies
semantic web
modeling
Organizations today collect and store large amounts of data in various formats and locations. However they are sometimes required to locate all instances of a certain type of data. Good data classification allows marking enterprise data in a way that enables quick and efficient retrieval of information when needed. We introduce a generic, automatic classification method that exploits Semantic Web technologies to assist in several phases in the classification process; defining the classification requirements, performing the classification and representing the results. Using Semantic Web technologies enables flexible and extensible configuration, centralized management and uniform results. This approach creates general and maintainable classifications, and enables applying semantic queries, rule languages and inference on the results.
semantic techniques
rdf
classification
semantic web
Deciding Agent Orientation on Ontology Mappings
Deciding Agent Orientation on Ontology Mappings
Effective communication in open environments relies on the ability of agents to reach a mutual understanding of the exchanged message by reconciling the vocabulary (ontology) used. Various approaches have considered how mutually acceptable mappings between corresponding concepts in the agents' own ontologies may be determined dynami- cally through argumentation-based negotiation (such as Meaning-based Argumentation, MbA). In this paper we present a novel approach to the dynamic determination of mutually acceptable mappings, that allows agents to express a private acceptability threshold over the types of mappings they prefer. We empirically compare this approach with the Meaning-based Argumentation and demonstrate that the proposed approach produces larger agreed alignments thus better enabling agent communication. Furthermore, we compare and evaluate the fitness for purpose of the generated alignments, and we empirically demonstrate that the proposed approach has comparable performance to the MbA approach.
Case Western Reserve University
Case Western Reserve University
Kostis Kyzirakos
Kostis Kyzirakos
Kostis
a45138009890ce780bd31806e8888b8a2f26d1af
Bert Bredeweg
Bert Bredeweg
Bert
d9ffecfbbdf2cb760ac5a1754d7eab64c439eddc
Poster Session of ISWC 2010
Linking and Building Ontologies of Linked Data
Theofilos Mailis
Theofilos Mailis
Theofilos
Informatica Trentina, TasLab
Informatica Trentina TasLab
Fourth International Workshop on Service Matchmaking and Resource Retrieval in the Semantic Web
Intelligent Decision Automation on an Event Driven Semantic Platform
Peter F. Patel-Schneider
Peter F. Patel-Schneider
Peter
17a3ba4049603c0e888eca6c03465a42be5197e8
Dataset about iswc2010.
Tue May 03 19:01:34 CEST 2016
The World Wide Web (WWW), as an ubiquitous medium for publication and exchange, already significantly influenced the way how historians work: the availability of public catalogs and bibliographies enable efficient research of relevant content for a certain investigation; the increasing digitization of works from historical archives and libraries, in addition, enables historians to directly access historical sources remotely. The capabilities of the WWW as a medium for collaboration, however, are only starting to be explored. Many historical questions are only answerable by combining information from different sources, from different researchers and organizations. Furthermore, after analyzing original sources, the derived information is often more comprehensive than can be captured by simple keyword indexing. In [3] we report about the application of an adaptive, semantics-based knowledge engineering approach for the development of a prosopographical knowledge base. In this demonstration we will showcase the comprehensive prosopographical knowledge base and its potential for applications. In prosopographical research, historians analyze common characteristics of historical groups by studying statistically relevant quantities of individual biographies. Untraceable periods of biographies can be determined on the basis of such accomplished analyses in combination with statistically examinations as well as patterns of relationships between individuals and their activities. In our case, researchers from the Historical Seminar at the University of Leipzig aimed at creating a prosopographical knowledge base about the life and work of professors in the 600 years history of University of Leipzig ranging from the year 1409 till 2009 - the Catalogus Professorum Lipsiensis (CPL).
The Catalogus Professorum Lipsiensis - Semantics-based Collaboration and Exploration for Historians
The Catalogus Professorum Lipsiensis - Semantics-based Collaboration and Exploration for Historians
Zoi Kaoudi
Zoi Kaoudi
Zoi
c9a5eca0c257e88ec99a109439e5de23c89d81b5
ontology
semantic annotation
Towards Semantic Data Mining
data mining
Incorporating domain knowledge is one of the most challenging problems in data mining. The Semantic Web technologies are promising to offer solutions to formally capture and efficiently use the domain knowledge. We call data mining technologies powered by the Semantic Web, capable of systematically incorporating domain knowledge, the semantic data mining. In this paper, we identify the importance of semantic annotation-a crucial step towards realizing semantic data mining by bringing meaning to data, and propose a learning-based semantic search algorithm for annotating (semi-) structured data.
Towards Semantic Data Mining
semantic web
Peng Wang
Peng Wang
Peng
1989bb06ca02d2db4eed08c82b88b8e4f8412b7d
Wolfgang Müller
Wolfgang Müller
Wolfgang
fb08c0163e77a22c2c59d4d24c1b2f755c38d31f
K-Spend: Semantic Web Technologies for Spend Analysis
Diana Maynard
Diana Maynard
Diana
81fd7be49550aada81d2d6d1932f435047e02bdb
Ian Dickinson
Ian Dickinson
Ian
e77f2081e5ba1288089668be4a6129a268fd96e0
Industry Track: Session 1
Vinny Reynolds
Vinny Reynolds
Vinny
2e5fe5458ea3e457515f91d5f32d5bf3ee27eb0e
Wright State University
Wright State University
Kouji Kozaki
Kouji Kozaki
Kouji
c493b1b07fa4dacfdda46edc55ebae341758972f
IBM Canada
IBM Canada
visualization
optimization
Displaying email-related contextual information using Contextify
productivity
Displaying email-related contextual information using Contextify
email
Contextify is a tool for maximizing user productivity by showing email-related contextual information. The contextual information is determined based on the currently selected email and includes related emails, people, attachments and web links. This content is displayed in a sidebar in Microsoft Outlook and in a special dialog that can display an extended context.
Jiao Tao
Jiao Tao
Jiao
47b232e485805df0e86a6d284279494c7eaa7f1e
Dave Beckett
Dave Beckett
Dave
1825e16ddb13787f88a3ac573857a727d602ffb8
Aleksander Pohl
Aleksander Pohl
Aleksander
f56ac57af169d6f9cffb076592fc5543e7f96114
Aditya Kalyanpur
Aditya Kalyanpur
Aditya
bbf73790640de98e8e30f2f5ed48b491a4ce8a12
Li Xiaoming
Li Xiaoming
Li
2eb94749d87564d02e92775db2e9669cbe36158d
Max Wilson
Max Wilson
Max
a7100c3c04fce383603adf613c699a413c5aa7ff
Lei Zhang
Lei Zhang
Lei
1e653a24ec99b645d3e70b8931d6088089fa6e66
Paul R. Alexander
Paul R. Alexander
Paul
e4532edb374cb842d2bf282fc686bcb43b79833c
Geo Semantics
Reasoning
Geo Semantic Technology is evaluated as the core technology for supporting interoperability of geospatial data and building urban computing environment. We made semantic integrations of LOD's Linked Geo Data and Open Street Map with Korean POI data set, and have researched for developing intelligent road sign management system based on the LarKC platform.
Semantic Web
Toward Seoul Road Sign Management on the LarKC Platform
Toward Seoul Road Sign Management on the LarKC Platform
Isabel Cruz
Isabel Cruz
Isabel
450162ac52a51c1ed888fa843c004bbc77d8e757
Marc Cuggia
Marc Cuggia
Marc
fb0f8867c58d2bd82883e23e73df756b2ef960b5
Mari Carmen Suarez-Figueroa
Mari Carmen Suarez-Figueroa
Mari
Michael Hausenblas
Michael Hausenblas
Michael
327b61f3721afbd39dceadf5e5b4fc2d79d5dcc8
Research Track: Query Optimization
Sergej Sizov
Sergej Sizov
Sergej
9e5d9332ecf20e34d33dd5f378c4111f551068f1
Pericles A. Mitkas
Pericles A. Mitkas
Pericles
45e1dd2713158657ec78e70fea3ccfd3f29f4914
Sheila A. Mcilraith
Sheila A. Mcilraith
Sheila
397914ec03c3768254e52decb94e58b526641864
University of Manchester
University of Manchester
Ian Horrocks
Ian Horrocks
Ian
6513c77252b509e1e5072e1bb5c3cce030567015
Ying Liu
Ying Liu
Ying
cc61ec88824378a4a1e1db5af9ae4d310bc818ec
HITS gGmbH
HITS gGmbH
MediaEvent Services
MediaEvent Services
ISTC-CNR
CNR Institute of Cognitive Sciences and Technology
ISTC-CNR
CNR Institute of Cognitive Sciences and Technology
Ian Oliver
Ian Oliver
Ian
59be8cbbfa99dc2f122871d5fe273a93c4066211
Lily-LOM: An Efficient System for Matching Large Ontologies with Non-Partitioned Method
Lily-LOM: An Efficient System for Matching Large Ontologies with Non-Partitioned Method
Since the high time and space complexity, most existing ontology matching systems are not well scalable to solve the large ontology matching problem. Moreover, the popular divide-and-conquer matching solution faces two disadvantages: First, partitioning ontology is a complicate process; Second, it will lead to loss of semantic information during matching. To avoid these drawbacks, this paper presents an efficient large ontology matching system Lily-LOM, which uses a non-partitioned method. Lily-LOM is based on two kinds of reduction anchors, i.e. positive and negative reduction anchors, to reduce the time complexity problem. Some empirical strategies for reducing the space complexity are also discussed. The experiments show that Lily-LOM is effective.
Rafael Penaloza
Rafael Penaloza
Rafael
1b374d6bfb4ef9ace30a9166758fa5270dfec8bd
Freie Universität Berlin
Freie Universität Berlin
Peking University
Peking University
owl:sameas
SameAs Networks and Beyond: Analyzing Deployment Status and Implications of owl:sameAs in Linked Data
network
linked data
Millions of owl:sameAs statements have been published on the Web of Data. Due to its unique role and heavy usage in Linked Data integration, owl:sameAs has become a topic of increasing interest and debate. This paper provides a quantitative analysis of owl:sameAs deployment status and uses these statistics to focus discussion around its usage in Linked Data.
semantic web
SameAs Networks and Beyond: Analyzing Deployment Status and Implications of owl:sameAs in Linked Data
Christopher G. Chute
Christopher G. Chute
Christopher
ff1faedd72994ff8dfe721dfd34fdfbfaa1f9946
Research Track: Social Semantic Web/2
Thomas Hornung
Thomas Hornung
Thomas
62050cc33fff026673773ce7b2ffc024e202505f
Frederick Maier
Frederick Maier
Frederick
49119d461e9ba5cb861efe341b7e6d08b115df81
Breakfast
Building the Inform Semantic Publishing Ecosystem: from Author to Audience
University of Toronto
University of Toronto
ISReal: An Open Platform for Semantic-Based 3D Simulations in the 3D Internet
semantic web
Signal/Collect: Graph Algorithms for the (Semantic) Web
The Semantic Web graph is growing at an incredible pace, enabling opportunities to discover new knowledge by interlinking and analyzing previously unconnected data sets. This confronts researchers with a conundrum: Whilst the data is available the programming models that facilitate scalability and the infrastructure to run various algorithms on the graph are missing. Some use MapReduce - a good solution for many problems. However, even some simple iterative graph algorithms do not map nicely to that programming model requiring programmers to shoehorn their problem to the MapReduce model. This paper presents the Signal/Collect programming model for synchronous and asynchronous graph algorithms. We demonstrate that this abstraction can capture the essence of many algorithms on graphs in a concise and elegant way by giving Signal/Collect adaptations of various relevant algorithms. Furthermore, we built and evaluated a prototype Signal/Collect framework that executes algorithms in our pro- gramming model. We empirically show that this prototype transpar- ently scales and that guiding computations by scoring as well as asyn- chronicity can greatly improve the convergence of some example algorithms. We released the framework under the Apache License 2.0 (at http://www.ifi.uzh.ch/ddis/research/sc).
Signal/Collect: Graph Algorithms for the (Semantic) Web
Fabian Howahl
Fabian Howahl
Fabian
8660735b0530658459aca6f566ef3d03fc8786eb
Elsevier
Elsevier
Ismael Rivera
Ismael Rivera
Ismael
a35902bd228b6fc6dacea3477f23ed4348e93aa7
Claudio Giuliano
Claudio Giuliano
Claudio
8297985c099262b2c5a2704ca281a2b7359a0d96
Research Track: Scalability
Cosmin Basca
Cosmin Basca
Cosmin
9a979bd476dd73fdce1663743533e0c9958c2357
Centre Eugene Marquis
Centre Eugene Marquis
Stefan Schulte
Stefan Schulte
Stefan
31d1eef88c416f2cc4e92dc5e8f77e731bef7c21
Breakfast
Southeast University
Southeast University
University of St. Gallen
University of St. Gallen
Giorgos Stoilos
Giorgos Stoilos
Giorgos
0fb7bb105da6305d8175302257e74fc41eef2034
Olivier Bodenreider
Olivier Bodenreider
Olivier
bf554f67d7b26477e3bf5bf955d4caacdc54a2d0
Kavitha Srinivas
Kavitha Srinivas
Kavitha
3524dd31de79a544b21dd104327c3c7eb9a9f139
University of Economics
University of Economics
Mark Burstein
Mark Burstein
Mark
b67b92592c9e3ebb1df54da3f4fdca29c52b247a
2nd Workshop on Ontology Patterns
Andreas Eberhart
Andreas Eberhart
Andreas
79f778c047e73839d993fb0da1b4f4428878ce29
University of Amsterdam
University of Amsterdam
Benjamin Zapilko
Benjamin Zapilko
Benjamin
98f2f3e56a680f2e7db881874a45f423c1177133
Krishnamurthy Koduvayur Viswanathan
Krishnamurthy Koduvayur Viswanathan
Krishnamurthy
e30b93137a02f1ca0c28ef33639c372fa1f5b762
Vaibhav Khadilkar
Vaibhav Khadilkar
Vaibhav
34bb4e47ccceb7983ef8af504c9ec21af40a3a33
Songyun Duan
Songyun Duan
Songyun
8417f49addc29158b0d0a9ff4338d29e0053f9c9
Cui Tao
Cui Tao
Cui
067987f78a4d22130513a4745cafdb334f03934f
Natalia Vassilieva
Natalia Vassilieva
Natalia
National University of Ireland, Galway
National University of Ireland, Galway
Maciej Zaremba
Maciej Zaremba
Maciej
f3bc619738a8c1ed64e732828c4bf7c8d1fed12f
Jose Luis Ambite
Jose Luis Ambite
Jose
1e430f2ad8c3dd42da0ac00ed2c6a7c3e6fcaeb5
Wei Hu
Wei Hu
Wei
f7074d05b74deb43ec150671bb9b226578d20f2b
Jie Tang
Jie Tang
Jie
ec291c9048a8db16ba6b5c935be5e23ce59aebdd
We present a scalable, SPARQL-based computational pipeline for testing the lattice-theoretic properties of partial orders represented as RDF triples. The use case for this work is quality assurance in biomedical ontologies, one desirable property of which is conformance to lattice structures. At the core of our pipeline is the algorithm called NuMi, for detecting the Number of Minimal upper bounds of any pair of elements in a given finite partial order. Our technical contribution is the coding of NuMi completely in SPARQL. To show its scalability, we applied NuMi to the entirety of SNOMED CT, the largest clinical ontology (over 300,000 conepts). Our experimental results have been groundbreaking: for the first time, all non-lattice pairs in SNOMED CT have been identified exhaustively from 34 million candidate pairs using over 2.5 billion queries issued to Virtuoso. The percentage of non-lattice pairs ranges from 0 to 1.66 among the 19 SNOMED CT hierarchies. These non-lattice pairs represent target areas for focused curation by domain experts. RDF, SPARQL and related tooling provide an efficient platform for implementing lattice algorithms on large data structures.
Using SPARQL to Test for Lattices: application to quality assurance in biomedical ontologies
semantic web
Using SPARQL to Test for Lattices: application to quality assurance in biomedical ontologies
MIT
MIT
Eleni Tsalapati
Eleni Tsalapati
Eleni
Robert Isele
Robert Isele
Robert
8a2755fb61eba762ec9d06711e0faefd7286ecb9
Representing and Querying Validity Time in RDF and OWL: A Logic-Based Approach
University of Helsinki
University of Helsinki
Nick Gibbins
Nick Gibbins
Nick
28339a9a36ee4e330da9613958efb89e2961c6cb
Will Semantic Web Technologies Work for the Development of ICD-11?
Andreas Harth
Andreas Harth
Andreas
0604d144b935121a11d7495b2751e5d3176fc6fa
Carl Andersen
Carl Andersen
Carl
ae85f4481598ce1384977374c7f0d443a9b67996
Anne Schlicht
Anne Schlicht
Anne
a25ef8ebfa91d30307cf9060ba1c848d2044ac23
Stefan Nesbigall
Stefan Nesbigall
Stefan
b44b8423ee9ec3df51085494593cb6fa35f3331c
University of Bielefeld
University of Bielefeld
Toponym Resolution in Social Media
Jing Mei
Jing Mei
Jing
6f53a3cf9ab1a2eef25e702f8cd6a9d0350d17fa
IBM T.J. Watson Research Center
IBM T.J. Watson Research Center
Mayo Clinic
Mayo Clinic
Brian Davis
Brian Davis
Brian
8c6dfc17028b508310f6c7cde2ba007c545b591f
Aristotle University of Thessaloniki
Aristotle University of Thessaloniki
GESIS - Leibniz Institute for the Social Sciences
GESIS - Leibniz Institute for the Social Sciences
Universidad de Valladolid
Universidad de Valladolid
Mike Dean
Mike Dean
Mike
6006a914f7d645142fadf08d9a4e33aee98416d0
Elena Beisswanger
Elena Beisswanger
Elena
1f7d93280937e25fce22bd0342d20b4ec1913055
Renato Iannella
Renato Iannella
Renato
4c2ce302ad87d09b90791d66df16402323b731e5
University of Trento
University of Trento
Cleveland Clinic Foundation
Cleveland Clinic Foundation
We study the problem of evolution for Knowledge Bases (KBs) expressed in Description Logics (DLs) of the DL-Lite family. DL-Lite is at the basis of OWL 2 QL, one of the tractable fragments of OWL 2, the recently proposed revision of theWeb Ontology Language.We propose some fundamental principles that KB evolution should respect. We review known model and formula-based approaches for evolution of propositional theories. We exhibit limitations of a number of model-based approaches: besides the fact that they are either not expressible in DL-Lite or hard to compute, they intrinsically ignore the structural properties of KBs, which leads to undesired properties of KBs resulting from such an evolution. We also examine proposals on update and revision of DL KBs that adopt the model-based approaches and discuss their drawbacks. We show that known formula-based approaches are also not appropriate for DL-Lite evolution, either due to high complexity of computation, or because the result of such an action of evolution is not expressible in DL-Lite. Building upon the insights gained, we propose two novel formula-based approaches that respect our principles and for which evolution is expressible in DL-Lite. For our approaches we also developed polynomial time algorithms to compute evolution of DL-Lite KBs.
Evolution of DL-Lite Knowledge Bases
Evolution of DL-Lite Knowledge Bases
semantic web
Anna Lisa Gentile
Anna Lisa
Gentile
Utrecht University
Utrecht University
Xuan Li
Xuan Li
Xuan
David Karger
David Karger
David
1192ccf2698e2122ed342719927b0f6e70c46269
Terry R. Payne
Terry R. Payne
Terry
3a6c3f60f5835ddfd1be8c3cebe00e9f5ee565e2
Peter Haase
Peter Haase
Peter
fec12b76b11eceb8dce87a648d055583e575d0c6
Jürgen Umbrich
Jürgen Umbrich
Jürgen
b9514eba2ed2ae41a072765fe3ed3544de10974f
Elena Simperl
Elena Simperl
Elena
09814d21068fb5bacc73c395dfd09780f462748a
Lei Zhang
Lei Zhang
Lei
6a4b666aa1f7adb8fe7d2514f2d58f0417dfb474
Xiaoyong Du
Xiaoyong Du
Xiaoyong
9aa50db05ff479dce860c23ad4aa00c8ec5a7846
Michael Meier
Michael Meier
Michael
6e165d176f38a2be0eba6894ca250e27e8b69af2
Shengping Liu
Shengping Liu
Shengping
0e121ae8674d91b1a7c10dfe7fe8854a819997d2
Elena Botoeva
Elena Botoeva
Elena
449221fc4a6811e154baa5d6b1d2bf4d5223bfe0
Vojtech Svatek
Vojtech Svatek
Vojtech
7b9eaf1b98b973552c075c5f01612546dcebd1d9
Haofen Wang
Haofen Wang
Haofen
0233b9fd11287c2f4beecdd5a3002eb5cae9f080
Michael Benedikt
Michael Benedikt
Michael
772ec79aba4d5552a1493906cf3cb370d313fbad
Marco Rospocher
Marco Rospocher
Marco
Marcelo Cohen
Marcelo Cohen
Marcelo
e99f6a4a1d7326103b785091d1fd05141675b952
Sebastian Speiser
Sebastian Speiser
Sebastian
3cac4f9f0d97fce3ae73a3890d8e50289478f615
Jerome David
Jerome David
Jerome
3a1e43133839315dbf2ad69092ad987d54c2fa5e
Roman Kontchakov
Roman Kontchakov
Roman
88e1d5abbdf7deee26b731eb8773dd472e9a0285
Semantic Identity, Brisbane
Semantic Identity Brisbane
Poznan Supercomputing and Networking Center
Poznan Supercomputing and Networking Center
The amount of data on the Internet is rapidly growing. Formal languages are used to annotate such data in order to make it machine-understandable; i.e., allow machines to reason about it, to check consistency, to answer queries, or to infer new facts. Essential for this are formalisms that allow for tractable and efficient reasoning algorithms. Particular care is demanded in efficiently responding to the trade-off between expressivity and usefulness. The updated Web Ontology Language (OWL 2) provides dialects that are restricted in their semantic expressivity for optimizing the reasoning behavior; e.g., the OWL 2 EL or OWL 2 RL profiles. Such dialects are very important to respond to the aforementioned trade-off. Profiles reflect particular requirements and yield purposeful balance between expressivity and computational complexity. The support for dialects is not only given in OWL 2, but also in the Rule Interchange Format (RIF) standards. RIF specifies formalisms for the knowl- edge exchange between different rule systems. The same applies for the WSML language that provides variants for Description Logics and rule-based reasoning. The goal remains the same, formalisms that are expressive enough to be useful, while exhibiting reasoning characteristics that can scale to the size of the Web. Leveraging this is exactly the objective of the WSML2Reasoner framework. In Section 2 we present WSML2Reasoner and our reasoners IRIS and Ell
WSML2Reasoner - A Comprehensive Reasoning Framework for the Semantic Web
WSML2Reasoner - A Comprehensive Reasoning Framework for the Semantic Web
Anja Jentzsch
Anja Jentzsch
Anja
1469b295d805cdff3a9ad502d9798fbf569bff2c
Linked data from your pocket: The Android RDFContentProvider
Linked data from your pocket: The Android RDFContentProvider
Smartphones are becoming main personal information repositories. Unfortunately this information is stored in independent silos managed by applications. We have seen that already: in the Palm operating system, application "databases" were only accessible when the application schemas were known and worked by opening other application databases. Our goal is to provide support for applications to deliver their data in RDF. This would allow applications to exploit this information in a uniform way without knowing beforehand application schemas. This would also connect this information to the semantic web and the web of data through reference from and to device information. We present a way to do this in a uniform manner within the Android platform. Moreover, we propose to do it along the linked data principles (provide RDF, describe in ontologies, use URIs, link other sources). We first consider how the integration of RDF could be further pushed within the context of the Android platform. We demonstrate its feasibility through a linked data browser that allows for browsing the phone information.
Csongor Nyulas
Csongor Nyulas
Csongor
88bb713ff705a7fe7262fda87b705b31118e76b8
Pavel Shvaiko
Pavel Shvaiko
Pavel
6fc18ceccfe31ac7c9d76fea4e28a96b6fdd804e
semantic web
Completeness Guarantees for Incomplete Reasoners
Completeness Guarantees for Incomplete Reasoners
We extend our recent work on evaluating incomplete reasoners by introducing strict testing bases. We show how they can be used in practice to identify ontologies and queries where applications can exploit highly scalable incomplete query answering systems while enjoying completeness guarantees normally available only when using computationally intensive reasoning systems.
Pontifical Catholic University of Rio de Janeiro
Pontifical Catholic University of Rio de Janeiro
Ying Ding
Ying Ding
Ying
541426905a1eac4ee69a90c7940f90ea8e5a0c64
Geological Survey of Canada
Geological Survey of Canada
Peter T. Wood
Peter T. Wood
Peter
72bad06362a2e3f7f96d246756d4149011aca672
Christian Hachenberg
Christian Hachenberg
Christian
584bbe15c25d8b3cea26f9b78938f1cd5f71c46f
Opening Ceremonies
Optimize First, Buy Later: Analyzing Metrics to Ramp-up Very Large Knowledge Bases
As knowledge bases move into the landscape of larger ontologies and have terabytes of related data, we must work on optimizing the performance of our tools. We are easily tempted to buy bigger machines or to fill rooms with armies of little ones to address the scalability problem. Yet, careful analysis and evaluation of the characteristics of our data-using metrics-often leads to dramatic improvements in performance. Firstly, are current scalable systems scalable enough? We found that for large or deep ontologies (some as large as 500,000 classes) it is hard to say because benchmarks obscure the load-time costs for materialization. Therefore, to expose those costs, we have synthesized a set of more representative ontologies. Secondly, in designing for scalability, how do we manage knowledge over time? By optimizing for data distribution and ontology evolution, we have reduced the population time, including materialization, for the NCBO Resource Index, a knowledge base of 16.4 billion annotations linking 2.4 million terms from 200 ontologies to 3.5 million data elements, from one week to less than one hour for one of the large datasets on the same machine.
Optimize First, Buy Later: Analyzing Metrics to Ramp-up Very Large Knowledge Bases
semantic web
University of Applied Sciences in Darmstadt
University of Applied Sciences in Darmstadt
Lorenz Buhmann
Lorenz Buhmann
Lorenz
0af4c392654c4562a37bce182da079b5ac4ad9e1
Jay Katzen
Jay Katzen
Jay
Boyan Brodaric
Boyan Brodaric
Boyan
9b2eed7e5755484560d76731ee22dd167142cd09
A General Approach to Query the Web of Data
This poster paper presents the design and implementation of an RDFS reasoner based on a backward chaining approach and implemented on a clustered RDF triplestore. The system presented, called 4sr, uses 4store as base infrastructure. In order to achieve a highly scalable system we implemented the reasoning at the lowest level of the quad store, the bind operation. The bind operation in 4sr traverses the quad store indexes matching or expanding the query variables with awareness of the RDFS semantics.
4sr - Scalable Decentralized RDFS Backward Chained Reasoning
4sr - Scalable Decentralized RDFS Backward Chained Reasoning
Andres Garcia-Silva
Andres Garcia-Silva
Andres
e030312ca341a25150376469d014db3135b2c92f
Murat Kantarcioglu
Murat Kantarcioglu
Murat
07f990b71450f88e3f16bccf4372e528b7435739
Olga X. Giraldo
Olga X. Giraldo
Olga
2ee1d0720e3ee754cb89db0990bf844dbf4acc4e
Milan Stankovic
Milan Stankovic
Milan
7f5a673afbdc9349c41c0a9c21a28c6de29d1d59
Amrapali J. Zaveri
Amrapali J. Zaveri
Amrapali
77eda3f1f02b4e3244f0e8027bd5655a9ed1716d
Delia Rusu
Delia Rusu
Delia
4181530957d92d561984536783271cf2683095cb
SPARQL Query Optimization on Top of DHTs
We study the problem of SPARQL query optimization on top of distributed hash tables. Existing works on SPARQL query processing in such environments have never been implemented in a real system, or do not utilize any optimization techniques and thus exhibit poor performance. Our goal in this paper is to propose efficient and scalable algorithms for optimizing SPARQL basic graph pattern queries. We augment a known distributed query processing algorithm with query optimization strategies that improve performance in terms of query response time and bandwidth usage. We implement our techniques in the system Atlas and study their performance experimentally in a local cluster.
semantic web
SPARQL Query Optimization on Top of DHTs
Crawler
Spider
Linked Data tools
LDSpider: An open-source crawling framework for the Web of Linked Data
Linked Data
The Web of Linked Data is growing and currently consists of several hundred interconnected data sources altogether serving over 25 billion RDF triples to the Web. What has hampered the exploitation of this global dataspace up till now is the lack of an open-source Linked Data crawler which can be employed by Linked Data applications to localize (parts of) the dataspace for further processing. With LDSpider, we are closing this gap in the landscape of publicly available Linked Data tools. LDSpider traverses the Web of Linked Data by following RDF links between data items, it supports di?fferent crawling strategies and allows crawled data to be stored either in fi?les or in an RDF store.
LDSpider: An open-source crawling framework for the Web of Linked Data
ESIS Norge AS
ESIS Norge AS
Demo: Enriching Text with RDF/OWL Encoded Senses
Demo: Enriching Text with RDF/OWL Encoded Senses
This demo paper describes an extension of the Enrycher text enhancement system, which annotates words in context, from a text fragment, with RDF/OWL encoded senses from WordNet and OpenCyc. The extension is based on a general purpose disambiguation algorithm which takes advantage of the structure and/or content of knowledge resources, reaching state-of-the-art performance when compared to other knowledge-lean word sense disambiguation algorithms.
RDF/OWL word sense representation
Nicholas Gibbins
Nicholas Gibbins
Nicholas
28339a9a36ee4e330da9613958efb89e2961c6cb
Combining Approximation and Relaxation in SemanticWeb Path Queries
semantic web
Combining Approximation and Relaxation in SemanticWeb Path Queries
We develop query relaxation techniques for regular path queries and combine them with query approximation in order to support flexible querying of RDF data when the user lacks knowledge of its full structure or where the structure is irregular. In such circumstances, it is helpful if the querying system can perform both approximate matching and relaxation of the user's query and can rank the answers according to how closely they match the original query. Our framework incorporates both standard notions of approximation based on edit distance and RDFS-based inference rules. The query language we adopt comprises conjunctions of regular path queries, thus including extensions proposed for SPARQL to allow for querying paths using regular expressions. We provide an incremental query evaluation algorithm which runs in polynomial time and returns answers to the user in ranked order.
Antoine Zimmermann
Antoine Zimmermann
Antoine
c4f80d64f6fda773391618a4866c737b2113eb30
A Case Study of Linked Enterprise Data
FZI Forschungszentrum Informatik
FZI Forschungszentrum Informatik
Hebrew University of Jerusalem
Hebrew University of Jerusalem
Performance is the most critical aspect towards achieving high scalability of Semantic Web reasoning applications, and considerably limits the application areas of them. There is still a deep mismatch between the requirements for reasoning on a Web scale and performance of the existing reasoning engines. The performance limitation can be considerably reduced by utilizing such large-scale e-Infrastructures as LarKC - the Large Knowledge Collider - an experimental platform for massive distributed incomplete reasoning, which offers several innovative approaches removing the scalability barriers, in particularly, by enabling transparent access to HPC systems. Efficient utilization of such resources is facilitated by means of parallelization being the major element for accomplishing performance and scalability of semantic applications. Here we discuss application of some emerging parallelization strategies and show the benefits obtained by using such systems as LarKC.
message-passing
LarKC
Semantic Web Reasoning
multi-threading
Parallelization Techniques for Semantic Web Reasoning Applications
parallelization
Parallelization Techniques for Semantic Web Reasoning Applications
Semantic Need: Guiding Metadata Annotations by Questions People #ask
Alan Rector
Alan Rector
Alan
b4c3594530b2a7d19366535aa05b2298a49b66ea
Towards Technology Structure Mining from Scientific Literature
Mari Wigham
Mari Wigham
Mari
6b2cff4c06a57549bb139976d7e151f08229b74d
Jonkoping University
Jonkoping University
Goldsmiths University of London
Goldsmiths University of London
Knowledge Engineering for Historians on the Example of the Catalogus Professorum Lipsiensis
FORTH-ICS
FORTH-ICS
How to Reuse a Faceted Classification and Put it on the Semantic Web
Clark and Parsia
Clark and Parsia
Julia Hoxha
Julia Hoxha
Julia
ffdedecacd9b801e3e5a99e09e080407d696bc62
Claudio Gutierrez
Claudio Gutierrez
Claudio
f341588c8c974d3b6fa4134e12700da871e8704f
Auto-experimentation of KDD Workflows based on Ontological Planning
Auto-experimentation of KDD Workflows based on Ontological Planning
One of the problems of Knowledge Discovery in Databases (KDD) is the lack of user support for solving KDD problems. Current Data Mining (DM) systems enable the user to manually design workflows but this becomes difficult when there are too many operators to choose from or the workflow's size is too large. Therefore we propose to use auto-experimentation based on ontological planning to provide the users with automatic generated workflows as well as rankings for workflows based on several criteria (execution time, accuracy, etc.). Moreover autoexperimentation will help to validate the generated workflows and to prune and reduce their number. Furthermore we will use mixed-initiative planning to allow the users to set parameters and criteria to limit the planning search space as well as to guide the planner towards better workflows.
semantic web
Aidan Hogan
Aidan Hogan
Aidan
d2163e057507f828085f322cc77dc43b4105a158
biology
RightField: Embedding Ontology Term Selection into Spreadsheets for the Annotation of Biological Data
spreadsheets
RightField: Embedding Ontology Term Selection into Spreadsheets for the Annotation of Biological Data
RightField is an open source application that provides a mechanism for embedding ontology annotation support for Life Science data in Microsoft Excel spreadsheets. Individual cells, columns, or rows can be restricted to particular ranges of allowed classes or instances from chosen ontologies. Informaticians, with experience in ontologies and data annotation prepare RightField-enabled spreadsheets with embedded ontology term selection for use by a wider community of laboratory scientists. The RightField-enabled spreadsheet presents selected ontology terms to the users as a simple drop-down list, enabling scientists to consistently annotate their data without the need to understand the numerous metadata standards and ontologies available to them. The spreadsheets are self-contained and remain "vanilla" Excel so that they can be readily exchanged, processed offline and are usable by regular Excel tooling. The result is semantic annotation by stealth, with an annotation process that is less error-prone, more efficient, and more consistent with community standards. RightField has been developed and deployed for a consortium of some 300 Systems Biologists. RightField is open source under a BSD license and freely available from http://www.sysmo-db.org/RightField.
ontology annotation
metadata standards
Converting and Annotating Quantitative Data Tables
I18n of Semantic Web Applications
Semantic Recognition of Ontology Refactoring
University of Mannheim
University of Mannheim
Enrico Franconi
Enrico Franconi
Enrico
cc31df1716defe7e7094b4e019d2218078072e53
Supporting Natural Language Processing with Background Knowledge: Coreference Resolution Case
Supporting Natural Language Processing with Background Knowledge: Coreference Resolution Case
semantic web
Systems based on statistical and machine learning methods have been shown to be extremely effective and scalable for the analysis of large amount of textual data. However, in the recent years, it becomes evident that one of the most important directions of improvement in natural language processing (NLP) tasks, like word sense disambiguation, coreference resolution, relation extraction, and other tasks related to knowledge extraction, is by exploiting semantics. While in the past, the unavailability of rich and complete semantic descriptions constituted a serious limitation of their applicability, nowadays, the Semantic Web made available a large amount of logically encoded information (e.g. ontologies, RDF(S)-data, linked data, etc.), which constitutes a valuable source of semantics. However, web semantics cannot be easily plugged into machine learning systems. Therefore the objective of this paper is to define a reference methodology for combining semantic information available in the web under the form of logical theories, with statistical methods for NLP. The major problems that we have to solve to implement our methodology concern (i) the selection of the correct and minimal knowledge among the large amount available in the web, (ii) the representation of uncertain knowledge, and (iii) the resolution and the encoding of the rules that combine knowledge retrieved from Semantic Web sources with semantics in the text. In order to evaluate the appropriateness of our approach, we present an application of the methodology to the problem of intra-document coreference resolution, and we show by means of some experiments on the standard dataset, how the injection of knowledge leads to the improvement of this task performance.
Publishing Bibliographic Data on the Semantic Web using BibBase
We present BibBase, a system for publishing and managing bibliographic data available in BibTeX files on the Semantic Web. BibBase uses a powerful yet light-weight approach to transform BibTeX files into rich Linked Data as well as custom HTML and RSS code that can readily be integrated within a user's website. The data can instantly be queried online on the system's SPARQL endpoint. In this demo, we present a brief overview of the features of our system and outline a few challenges in the design and implementation of such a system.
Data Integration
Linked Data
Bibliographic Data Management
Publishing Bibliographic Data on the Semantic Web using BibBase
Semantic Web
OWL-POLAR: Semantic Policies for Agent Reasoning
Jacco van Ossenbruggen
Jacco van Ossenbruggen
Jacco
55937258805a240393727f8e803f0c787135bb91
Assessing Trust in Uncertain Information
Xiaoping Sun
Xiaoping Sun
Xiaoping
Jagiellonian University
Jagiellonian University
Tony Lee
Tony Lee
Tony
7feda9d7ed587af441ac90ae67d2c5b09418dddd
Ming Mao
Ming Mao
Ming
588e1303f4a15a9ae93ccccf636547590b05e210
Peter Z. Yeh
Peter Z. Yeh
Peter
da7dcfc2d58cf93b5d3eb989163dde997c854656
Telefonica Research and Development
Telefonica Research and Development
Optimizing Enterprise-scale OWL 2 RL Reasoning in a Relational Database System
Northwestern Polytechnical University
Northwestern Polytechnical University
David François Huynh
David Huynh
David
df3d94386b2f6046584cf101a4a6e0b49acddff5
Zhe Wang
Zhe Wang
Zhe
998ed728cda197ddfd1f99c78ce8eb4874bc256c
Andrea Nuzzolese
Andrea Nuzzolese
Andrea
87707a356b60f036a079c5268236791fbab9f85e
Carlos Buil Aranda
Carlos Buil Aranda
Carlos
0a3cfc5999d531257e93a631528690ecf6b210e1
semantic web
Social dynamics in conferences: analyses of data from the Live Social Semantics application
Social dynamics in conferences: analyses of data from the Live Social Semantics application
Popularity and spread of online social networking in recent years has given a great momentum to the study of dynamics and patterns of social interactions. However, these studies have often been confined to the online world, neglecting its interdependencies with the offline world. This is mainly due to the lack of real data that spans across this divide. The Live Social Semantics application is a novel platform that dissolves this divide, by collecting and integrating data about people from (a) their online social networks and tagging activities from popular social networking sites, (b) their publications and co-authorship networks from semantic repositories, and (c) their real-world face-to-face contacts with other attendees collected via a network of wearable active sensors. This paper investigates the data collected by this application during its deployment at three major conferences, where it was used by more than 400 people. Our analyses show the robustness of the patterns of contacts at various conferences, and the influence of various personal properties (e.g. seniority, conference attendance) on social networking patterns.
University of Leipzig
University of Leipzig
Dingyi Han
Dingyi Han
Dingyi
6951bd27437812cef2ef9075d813b3d716e015d2
Steve Harris
Steve Harris
Steve
26a374ad4de937252c044f7dd45aa48ecbdb4f16
Anita Burgun
Anita Burgun
Anita
c914ca406fbf5650b598910b0527d01e8479045b
Semantic Media Asset Management: playence Media
Semantic Media Asset Management: playence Media
Norman Heino
Norman Heino
Norman
f573c7cf859e0924ed074c08d0099f9bdd08211b
We explore a diagrammatic logic suitable for specifying ontologies using a case study. Diagrammatic reasoning is used to establish consequences of the ontology.
Semantic Web
Visual Reasoning about Ontologies
Visual Reasoning about Ontologies
Ontology similarity in the alignment space
semantic web
Ontology similarity in the alignment space
Measuring similarity between ontologies can be very useful for different purposes, e.g., finding an ontology to replace another, or finding an ontology in which queries can be translated. Classical measures compute similarities or distances in an ontology space by directly comparing the content of ontologies. We introduce a new family of ontology measures computed in an alignment space: they evaluate the similarity between two ontologies with regard to the available alignments between them.We define two sets of such measures relying on the existence of a path between ontologies or on the ontology entities that are preserved by the alignments. The former accounts for known relations between ontologies, while the latter reflects the possibility to perform actions such as instance import or query translation. All these measures have been implemented in the OntoSim library, that has been used in experiments which showed that entity preserving measures are comparable to the best ontology space measures. Moreover, they showed a robust behaviour with respect to the alteration of the alignment space.
Stanley Park
Stanley Park
Stanley
83e6f88e79706bd48d6c7d2da9ff94c77aede2d4
Justification Oriented Proofs in OWL
Guilin Qi
Guilin Qi
Guilin
499e1bd65978d374216dc5f6cfc91eb5c1731c60
Bo Wang
Bo Wang
Bo
3db473687d5c61b060bf69265410127e214a5cdd
Universite Paris 13
Universite Paris 13
Jun Fang
Jun Fang
Jun
d3974e5f73128e661dff6fb495d1e4f6f0188cd2
Katy Wolstencroft
Katy Wolstencroft
Katy
3dabdf312876f4b139507ce80b36e872e10164ae
MoKi: aWiki-Based Conceptual Modeling Tool
Semantic Web
The success of wikis for collaborative knowledge construction is triggering the development of a number of tools for collaborative conceptual modeling based on them. In this paper we present a completely revised version of MoKi, a tool for modelling ontologies and business process models in an integrated way.
MoKi: aWiki-Based Conceptual Modeling Tool
Jasmin Opitz
Jasmin Opitz
Jasmin
2ccecbf89b352bebe1b97054cff36649939953a3
Fernando Silva Parreiras
Fernando Silva Parreiras
Fernando
ba055431f8e2c6f3bca6ba8ac9ef5474ebfe272c
b875a8731bcdbcb0be19cd9f795ef33a8c6e1b2f
Giuseppe Pirro
Giuseppe Pirro
Giuseppe
ff4586c12bb2886eeaf909f80f66c8545333de91
Time-Oriented Question Answering from Clinical Narratives Using Semantic-Web Techniques
semantic web
The ability to answer temporal-oriented questions based on clinical narratives is essential to clinical research. The temporal dimension in medical data analysis enables clinical researches on many areas, such as, disease progress, individualized treatment, and decision support. The Semantic Web provides a suitable environment to represent the temporal dimension of the clinical data and reason about them. In this paper, we introduce a Semantic-Web based framework, which provides an API for querying temporal information from clinical narratives. The framework is centered by an OWL ontology called CNTRO (Clinical Narrative Temporal Relation Ontology), and contains three major components: time normalizer, SWRL based reasoner, and OWL-DL based reasoner. We also discuss how we adopted these three components in the clinical domain, their limitations, as well as extensions that we found necessary or desirable to archive the purposes of querying time-oriented data from real-world clinical narratives.
Time-Oriented Question Answering from Clinical Narratives Using Semantic-Web Techniques
University of Glasgow
University of Glasgow
Maria Copeland
Maria Copeland
Maria
0486c9705fb7223ae6026b772351e0e6f3dda0f4
William Ferguson
William Ferguson
William
63bf324eb7269ff36d5a8d0eba4b5fed266b5e4e
Günter Ladwig
Günter Ladwig
Günter
df6318355930965c8d8ee343560bbc6aeb993fc2
Manfred Hauswirth
Manfred Hauswirth
Manfred
ddb493a8a7c94cb9fc0c6e8d108ce0f62fee6f06
Esther Lozano
Esther Lozano
Esther
342b3439c2dedc7fed6c48e7fb9e06bc55c5085c
Haishan Liu
Haishan Liu
Haishan
561deb5b705726d2b55a1d171b2d41564aa0154f
Fleur Mougin
Fleur Mougin
Fleur
a6f45a206123924b7934f077a0587e1338a62362
Defense Science and Technology Lab - UK
Defense Science and Technology Lab-UK
David Ben-David
David Ben-David
David
64b6a5d19b81ca9d32a03cf61711d97eb1531d7d
Mapping Master: a Flexible Approach for Mapping Spreadsheets to OWL
semantic web
Mapping Master: a Flexible Approach for Mapping Spreadsheets to OWL
We describe a mapping language for converting data contained in spreadsheets into the Web Ontology Language (OWL). The developed language, called M2, overcomes shortcomings with existing mapping techniques, including their restriction to well-formed spreadsheets reminiscent of a single relational database table and verbose syntax for expressing mapping rules when transforming spreadsheet contents into OWL. The M2 language provides expressive, yet concise mechanisms to create both individual and class axioms when generating OWL ontologies. We additionally present an implementation of the mapping approach, Mapping Master, which is available as a plug-in for the Protege ontology editor.
Self-Service Development of Linked Data Applications with the Information Workbench
Self-Service Development of Linked Data Applications with the Information Workbench
Causal Knowledge Modeling for Traditional Chinese Medicine using OWL 2
Jan Top
Jan Top
Jan
e68a13960220004288c619034764a29973078e75
Lorand Dali
Lorand Dali
Lorand
bd2bd9e9f252091d08ac68677f688edd5f50baff
Rinke Hoekstra
Rinke Hoekstra
Rinke
2d1a0bafa206dda29a24e715d257d8ae5f4f00a6
Break
Lunch
Maria Maleshkova
Maria Maleshkova
Maria
ca3affb919025dc0ff537e91f30d1aad61c53f2b
Xin Liu
Xin Liu
Xin
a33268488ebc271110dbaa91f79af83841746def
Reynold S. Xin
Reynold S. Xin
Reynold
2ddc12e65fa73eb3519824af7bf00649eaad9830
Talis
Talis
Alcatel-Lucent, Bell Labs Belgium
Alcatel-Lucent, Bell Labs Belgium
dbrec - Music Recommendations Using DBpedia
Sebastian Rudolph
Sebastian Rudolph
Sebastian
45bd6eede6b520bed036e4b774baf59a5e33be03
University of Illinois at Chicago
University of Illinois at Chicago
Martin Junghans
Martin Junghans
Martin
18a04fe88ba7fb98a30ea1e709c4fff6bbc1e71b
Lunch
Alexander Garcia Castro
Alexander Garcia Castro
Alexander
442aae33d6728af9d94eb76f5e00f7f2cd0afaae
Joerg Puehrer
Joerg Puehrer
Joerg
22fb78977f259d6342768ada115a3c221c402dba
Axel Polleres
Axel
776866afe69158abddfa6dbf92aaaf2045bd91a4
Axel Polleres
Ansgar Scherp
Ansgar Scherp
Ansgar
f015ae2b5fb0e21e6caa767bf4ca58c5d2f046f3
Giorgos Flouris
Giorgos Flouris
Giorgos
dc808b065733afaf3aa11d334f478b26f7ef527d
Forgetting Fragments from Evolving Ontologies
Oscar Corcho
Oscar Corcho
Oscar
efbd90eca236ae3131e67f30e3abe0a1bceff305
Lyndon Nixon
Lyndon Nixon
Lyndon
9df7283a72695f1db07b8fe71ec7b9ef0d04fc33
Lehigh University
Lehigh University
Lunch
German Research Center for Artificial Intelligence (DFKI)
German Research Center for Artificial Intelligence (DFKI)
Deutsches Forschungszentrum fur Kunstliche Intelligenz (DFKI)
Deutsches Forschungszentrum fur Kunstliche Intelligenz (DFKI)
Mark Baker
Mark Baker
Mark
c578a85f0951489d0eaec0b42e81ec4728857c32
Nikolas Schmitt
Nikolas Schmitt
Nikolas
WebProtege: Supporting the Creation of ICD-11
WebProtege is a highly customizable Web interface for browsing and editing ontologies, which provides support for collaboration. We have created a customized version to support the World Health Organization with the collaborative development of the 11th revision of the International Classification of Diseases (ICD-11). Our demo will present this customized version and focus on how content creation and collaboration is being supported in WebProtege for the development of ICD-11.
WebProtege: Supporting the Creation of ICD-11
Preference-based Web Service Composition: A Middle Ground Between Execution and Search
Yefei Peng
Yefei Peng
Yefei
494902f3e9e7a5e91c8c0927bfa2eaaf548207e5
National Institute of Informatics, Japan
National Institute of Informatics, Japan
SAP Research CEC Belfast
SAP Research CEC Belfast
Feiyu Lin
Feiyu Lin
Feiyu
a08f5a82f34d58d8ae16327c45ef856aeb3dfb12
Adrian Marte
Adrian Marte
Adrian
7ae854a556d73b4957e15b6f13efc08eaa48e3e4
Jörg-Uwe Kietz
Jörg-Uwe Kietz
Jörg-Uwe
6ab51d0aee5042a2f322df76c7fe4a314b0ad645
Fusion - Visually Exploring and Eliciting Relationships in Linked Data
We present RDF On the Go, a full-edged RDF storage and SPARQL query processor for mobile devices. Implemented by adapting the widely used Jena and ARQ Semantic Web Toolkit and query engine, it uses Berkeley DB for storing the RDF data, R-Trees for indexing spatial data indexing and a query processor that supports both standard and spatial queries. By storing and querying RDF data locally at the user's mobile device, RDF On the Go contributes to improving scalability, decreasing transmission costs, and controlling access to user's personal information. It also enables the development of a next generation of mobile applications. RDF On the Go is available for the Android platform and can be downloaded at http://rdfonthego.googlecode.com/.
RDF On the Go: An RDF Storage and Query Processor for Mobile Devices
SPARQL query processor
RDF On the Go: An RDF Storage and Query Processor for Mobile Devices
mobile devices
RDF storage
Israel Institute of Technology
Israel Institute of Technology
Maurizio Lenzerini
Maurizio Lenzerini
Maurizio
c0a685e338e5489db87d8ef8e2594ae39bc15d17
Jochem Liem
Jochem Liem
Jochem
d5a6a23a6dcfe213c646f1f9fc31116c6d84ce5b
Reception
SAP AG UK
SAP AG UK
Deepak K. Sharma
Deepak K. Sharma
Deepak
Philipp Cimiano
Philipp Cimiano
Philipp
27476fa75acdcf53dc58538af98770a3b2bebc70
Towards Semantic Annotation Supported by Dependency Linguistics and ILP
Industry Track
Jorge Perez
Jorge Perez
Jorge
c1a6db51c27b1713615b1c3e6e4409ea7b1b0722
From Knowledge Capture to Semantic Applications: The Evolution of Semantic MediaWiki
From Knowledge Capture to Semantic Applications: The Evolution of Semantic MediaWiki
Experience of Using OWL Ontologies for Automated Inference of Routine Pre-Operative Screening Tests
Nicola Fanizzi
Nicola Fanizzi
Nicola
3c1395bd919491feee209479341d32552e97231c
Philip Stutz
Philip Stutz
Philip
4a882a6281cdbc0fd61cd836e251a6334035d2dc
Claudia Damato
Claudia Damato
Claudia
5bcefa24904ebb8f0666b2b8b03fe3c89dac04f7
Hans Joerg Happel
Hans Joerg Happel
Hans-Joerg
cc20a32692c256e3aa01513d72d6ceaa2c59169c
University of Zurich
University of Zurich
Evgeny Kharlamov
Evgeny Kharlamov
Evgeny
030ccc3c30b2f82da51d5f0122db7492091b5482
Alain Barrat
Alain Barrat
Alain
2b086eef3cdab1c30ea819d0c933f382f2d2be59
Sabine Janzen
Sabine Janzen
Sabine
78d74301771aa69eb36b298f788a827fc4ad9054
Guus Schreiber
Guus Schreiber
Guus
ddaa983ca5d101642d761f81ec885e9c2bd0a093
Technische Universität Darmstadt
Technische Universität Darmstadt
Jeff Heflin
Jeff Heflin
Jeff
1d8b1638f1c01384c2d034bb1853ecbe8952a4aa
Carlos Viegas Damasio
Carlos Viegas Damasio
Carlos
747d1d9898da965f6cb486c91053a0707b78f3c7
Ontology Alignment for Linked Open Data
Tim Crawford
Tim Crawford
Tim
68c47546b14e37dc04df89865abf7a88090648d4
A Graphical Evaluation Tool for Semantic Web Service Matchmaking
Semantic matchmaking, i.e., the task of finding matching (Web) services based on semantic information, has been a prominent field of research lately, and a wide range of supporting tools both for research and practice have been published. However, no suitable solution for the visualization of matchmaking results exists so far. In this paper, we present the Matchmaking Visualizer, an application for the visual representation and analysis of semantic matchmaking results. It allows for the comparing of matchmaking approaches for semantic Web services in a fine-grained manner and thus complements existing evaluation suites that are based on rather coarse-grained information retrieval metrics.
A Graphical Evaluation Tool for Semantic Web Service Matchmaking
Markus Kroetzsch
Markus Kroetzsch
Markus
65da96e3981d75c954a4da7be89834ee059a71f3
Using Reformulation Trees to Optimize Queries over Distributed Heterogeneous Sources
Asuncion Gomez Perez
Asuncion Gomez Perez
Asuncion
f929b4dab306ec656affc5136763b6fe14c2347e
Volker Haarslev
Volker Haarslev
Volker
53b27d8e7306f336e69abe0bd6b87c07b7eacbb2
Clement Jonquet
Clement Jonquet
Clement
b6b6a2c7e586632f2d654f537f6ab32af4d763ee
Semantic Web Technologies for a Smart Energy Grid: Requirements and Challenges
Semantic Web Technologies for a Smart Energy Grid: Requirements and Challenges
The Smart Grid aims at making the current energy grid more efficient and eco-friendly. The Smart Grid features an IT-layer, which allows communication between a multitude of stakeholders and will have to be integrated with other "smart" systems (e.g., smart factories or smart cities) to operate effectively. Thus, many participants will be involved and will exchange large volumes of data, leading to a heterogeneous system with ad-hoc data exchange in which centralised coordination and control will be very difficult to achieve. In this paper, we show parallels between requirements for the (Semantic) Web and the Smart Grid. We argue that the communication architecture for the Smart Grid can be built upon existing (Semantic) Web technologies. We point out differences between the existing Web and the Smart Grid, thereby identifying remaining challenges.
Paul Gearon
Paul Gearon
Paul
b13de2f8061e7c8008496e05aa412ddd49ecf643
Eero Hyvonen
Eero Hyvonen
Eero
4e8958eda85e3976b4930cd198cd9de854e8d0d6
John Domingue
John Domingue
John
ee358e3b2e0d8a6dd78e3b2ae9d56dd03a2c5941
Humboldt-Universität zu Berlin
Humboldt-Universität zu Berlin
Jing He
Jing He
Jing
02fbce17670353b0af9be527a0bfc827961b7482
Tim Finin
Tim Finin
Tim
49953f47b9c33484a753eaf14102af56c0148d37
John Davies
John Davies
John
737d6926354e5956f8a3ce371f71d49da4fbe20d
Matt-Mouley Bouamrane
Matt-Mouley Bouamrane
Matt-Mouley
c62d3624de2159f953c08fde9229740e76f8ea07
Kevin R. Page
Kevin R. Page
Kevin
7c2d2bdc64072a4f01f60f526d5d514197631147
6166d4e1505420e8f59638e62e78b1ebea45fbe8
Huajun Chen
Huajun
Huajun Chen
Benedicto Rodriguez-Castro
Benedicto Rodriguez-Castro
Benedicto
d2467cb4f2205a2f21f96447c3739df259016d21
Ralf Steinmetz
Ralf Steinmetz
Ralf
74c36e55d6a7fc28c4696102d5f4d83f20db9c18
Harvard Medical School
Harvard Medical School
Gennady Legostaev
Gennady Legostaev
Gennady
b511be0f77842837a3c07552482c7b8807568a89
SPARQL Beyond Subgraph Matching
semantic web
We extend the Semantic Web query language SPARQL by defining the semantics of SPARQL queries under the entailment regimes of RDF, RDFS, and OWL. The proposed extensions are part of the SPARQL 1.1 Entailment Regimes working draft which is currently being developed as part of the W3C standardization process of SPARQL 1.1. We review the conditions that SPARQL imposes on such extensions, discuss the practical difficulties of this task, and explicate the design choices underlying our proposals. In addition, we include an overview of current implementations and their underlying techniques.
SPARQL Beyond Subgraph Matching
Paul Munro
Paul Munro
Paul
3700fa8beeb77db0d1e72e543ca03cde10fad73d
Volha Bryl
Volha Bryl
Volha
cf41f8beb0560db1273936d71c7be9154b77520a
semantic web
Using Semantic Web technologies for Clinical Trial Recruitment
Using Semantic Web technologies for Clinical Trial Recruitment
Clinical trials are fundamental for medical science: they provide the evaluation for new treatments and new diagnostic approaches. One of the most difficult parts of clinical trials is the recruitment of patients: many trials fail due to lack of participants. Recruitment is done by matching the eligibility criteria of trials to patient conditions. This is usually done manually, but both the large number of active trials and the lack of time available for matching keep the recruitment ratio low. In this paper we present a method, entirely based on standard semantic web technologies and tool, that allows the automatic recruitment of a patient to the available clinical trials. We use a domain specific ontology to represent data from patients' health records and we use SWRL to verify the eligibility of patients to clinical trials.
Lunch
Martin J. Oconnor
Martin J. Oconnor
Martin
01cc1f060da69d9ad9f15ee53d39c84c1068a775
Michal Trna
Michal Trna
Michal
e1e5abf7e8704b28ff105bcc22400446765699cd
Analysing the performance of OWL reasoners on expressive OWL ontologies is an ongoing challenge. In this paper, we present a new approach to performance analysis based on justifications for entailments of OWL ontologies. Justifications are minimal subsets of an ontology that are sufficient for an entailment to hold, and are commonly used to debug OWL ontologies. In JustBench, justifications form the key unit of test, which means that individual justifications are tested for correctness and reasoner performance instead of entire ontologies or random subsets. Justifications are generally small and relatively easy to analyse, which makes them very suitable for transparent analytic micro-benchmarks. Furthermore, the JustBench approach also allows us to isolate reasoner errors and inconsistent behaviour. We present the results of initial experiments using JustBench with FaCT++, HermiT, and Pellet. Finally, we show how JustBench can be used by reasoner developers and ontology engineers seeking to understand and improve the performance characteristics of reasoners and ontologies.
JustBench: A Framework for OWL Benchmarking
semantic web
JustBench: A Framework for OWL Benchmarking
Cosmin Stroe
Cosmin Stroe
Cosmin
7f8b16739b9aae5cd2e503ed3d6fa7a20c5fc801
Declarative Semantics for the Rule Interchange Format Production Rule Dialect
Griffith University
Griffith University
SAOR: Template Rule Optimisations for Distributed Reasoning over 1 Billion Linked Data Triples
digital libraries
The Living Document Project aims to harness the collective knowledge within communities in digital libraries, making it possible to enhance knowledge discovery and dissemination as well as to facilitate interdisciplinary collaborations amongst readers. Here we present a prototype that allows users to annotate content within digital libraries; the annotation schema is built upon the Annotation Ontology; data is available as RDF, making it possible to publish it as linked data and use SPARQL and SWRL for querying, reasoning, and processing. Our demo illustrates how a social tagging system could be used within the context of digital libraries in life sciences so that users are able to better organize, share, and discover knowledge embedded in research articles. Availability: http://www.biotea.ws/videos/ld_ao/ld_ao.html
Using the Annotation Ontology in Semantic Digital Libraries
Social semantic web
Using the Annotation Ontology in Semantic Digital Libraries
Web 3.0
Bijan Parsia
Bijan Parsia
Bijan
c9ef3edda6fd12cc1e9113217a75e5074e2ee80e
Gerd Groner
Gerd Groner
Gerd
0b39da82cd110b143beb5837931d01f0bdf4c60c
Universidad Politecnica de Madrid
Universidad Politecnica de Madrid
Lunch
Finding the Achilles Heel of the Web of Data: using network analysis for link-recommendation
Open Innovation and Semantic Web: Problem Solver Search on Linked Data
Breakfast
Joerg Unbehauen
Joerg Unbehauen
Jorg
9ac8457696644bdf4403ca8be18d07dfd7867ad8
Gianni Oneill
Gianni Oneill
Gianni
a53b6551b80d6f78b56f5bf7db9a821b91d5e1d9
Eva Blomqvist
Eva Blomqvist
Eva
d3dbbc88c5ffe3b6f27880b45c2db466c29f832d
Invited Talk: Austin Haugen and Evan Sandhaus
Delft University of Technology
Delft University of Technology
Simeon Polfliet
Simeon Polfliet
Simeon
853b7f33d8e8871c4af0a18925224fdc7ff6a994
Invited Talk: Li Xiaoming
Fangkai Yang
Fangkai Yang
Fangkai
6e4d1249c09903f9c1a534b994e11b5feaa035b7
Natasha
Natasha F. Noy
7d8b34490f91ef43b84489a7630394b04a8c2c21
Natalya F. Noy
Natalya
Natasha F. Noy
Natalya F. Noy
semantic web
Using Semantics for Automating the Authentication of Web APIs
Using Semantics for Automating the Authentication of Web APIs
Recent technology developments in the area of services on the Web are marked by the proliferation of Web applications and APIs. The implementation and evolution of applications based on Web APIs is, however, hampered by the lack of automation that can be achieved with current technologies. Research on semantic Web services is there fore trying to adapt the principles and technologies that were devised for traditional Web services, to deal with this new kind of services. In this paper we show that currently more than 80% of the Web APIs require some form of authentication. Therefore authentication plays a major role for Web API invocation and should not be neglected in the context of mashups and composite data applications. We present a thorough anal ysis carried out over a body of publicly available APIs that determines the most commonly used authentication approaches. In the light of these results, we propose an ontology for the semantic annotation of Web API authentication information and demonstrate how it can be used to cre ate semantic Web API descriptions. We evaluate the applicability of our approach by providing a prototypical implementation, which uses au thentication annotations as the basis for automated service invocation.
Centre de Physique Theorique
Centre de Physique Theorique
Peter Mika
Peter Mika
Peter
652187a6d9f902ec9d9dc17c9f1d5191e079879e
Boeing Phantom Works
Boeing Phantom Works
Vladimir Kolovski
Vladimir Kolovski
Vladimir
d52b853e610be57ee26bcbc236642114d7e4b73f
Towards Linked Data Services
Towards Linked Data Services
Large amounts of data reside in sources which are not web- accessible. Wrappers - small software programs that provide uniform access to data - are often used to transform legacy data sources for use on the Semantic Web.Wrappers, as well as links between data from wrapped sources and data that already exists on the Web, are typically created in an ad-hoc fashion. We propose a principled approach to integrating data-providing services with Linked Data. Linked Data Services (LIDS) can be used in various application scenarios to provide uniform access to legacy data and enable automatic interlinkage with existing data sets.
Renaud Delbru
Renaud Delbru
Renaud
247d80518c87c6f8129d5a3ec60a07665eded006
Zhenning Shangguan
Zhenning Shangguan
Zhenning
45eefe0a6646cea4c85fc0c1bddf84e59bb2f95b
Breakfast
Enrico Daga
Enrico Daga
Enrico
da50c1e462618c97bab0b228703c098fa2f61eca
Kostyantyn Shchekotykhin
Kostyantyn Shchekotykhin
Kostyantyn
06ade6b4af6044041fe7d48e28ba162e02913409
Theofanis K Grollios
Theofanis K Grollios
Theofanis
1cfcfc307f0d886d293a3366407910ccaad4fb85
ontology.
To the best of our knowledge, existing Semantic Web (SW) search systems fail to index RDF graph structures as graphs. They either do not index graph structures and retrieve them by run-time formal queries, or index all row triples from the back-end repositories. This increases the overhead of indexing for very large RDF documents. Moreover, the graph explorations from row triples can be complicated when blank nodes, RDF collections and containers are involved. This paper provides a means to index SW data in graph structures, which potentially benefit the graph exploration and ranking in SW querying.
A Graph-based Approach to Indexing Semantic Web Data
A Graph-based Approach to Indexing Semantic Web Data
search
query
resource
RDF
Semantic Web
Jian Chen
Jian Chen
Jian
5a568f9dc0a4fc35ee95432cf1fadffeb4f0c0ac
Osaka University
Osaka University
Fang Du
Fang Du
Fang
Octavian Udrea
Octavian Udrea
Octavian
0bfb06d194068162946a9c37515807e5df740bd6
BBN Technologies
BBN Technologies
Li Ding
Li Ding
Li
a7d0967c21ba8952ab0443bf822750d4c44afe2c
Google Germany GmbH
Google Germany GmbH
Karlsruhe Institute of Technology
Karlsruhe Institute of Technology
Hai Zhuge
Hai Zhuge
Hai
29a3ebb0d7ecebdb904313a53ec019b473ed42e8
City University London
City University London
Semantic Technology at The New York Times: Lessons Learned and Future Directions
Semantic Technology at The New York Times: Lessons Learned and Future Directions
At last year's International Semantic Web Conference, The New York Times Company announced the release of our Linked Open Data Platform available at http://data.nytimes.com. In the subsequent year, we have continued our efforts in this space and learned many valuable lessons. In our remarks, we will review these lessons; demonstrate innovative prototypes built on our linked data; explore the future of RDF and RDFa in the News Industry and announce an exciting new milestone in our Linked Data efforts.
semantic web
Yolanda Gil
Yolanda Gil
Yolanda
271995cf045094b4e575e4c7aaf3ad3006658cac
Town Hall Meeting
Michael Sintek
Michael Sintek
Michael
839411c1c10db49cbaaaaf5548046a3b01da275c
Gianluca Correndo
Gianluca Correndo
Gianluca
7a9a1fd95595d708e6be4d5de3468027593146d2
Anupam Joshi
Anupam Joshi
Anupam
de4984eb69b9610f133321ac8b1fc38de56661e3
Manuel Salvadores
Manuel Salvadores
Manuel
3291e1da0075475e2e13a0e7e018c3480deb1a34
Break
What does It Look Like, Really? Imagining how Citizens might Effectively, Usefully and Easily Find, Explore, Query and Re-present Open/Linked Data
What does It Look Like, Really? Imagining how Citizens might Effectively, Usefully and Easily Find, Explore, Query and Re-present Open/Linked Data
Are we in the semantic web/linked data community effectively attempting to make possible a new literacy - one of data rather than document analysis? By opening up data beyond the now familiar hand crafted Web 2 mash up of data about X plus geography, what are we trying to do, really? Is the goal at least in part to enable net citizens rather than only geeks the ability to pick up, explore, blend, interogate and represent data sources so that we may draw our own statistically informed conclusions about information, and thereby build new knowledge in ways not readily possible before without access to these data seas? If we want citizens rather than just scientists or statisticians or journalists for that matter to be able to pour over data and ask statistically sophisticated questions of comparison and contrast betewen times, places and people, does that mission re-order our research priorities at all? If the goal is to enpower citizens to be able to make use of data, what do we need to make this vision real beyond attending to Tim Berners-Lee's call to "free your data"? The purpose of this talk therefore will be to look at key interaction issues around defining and delivering a useful, usable *data explorotron* for citizens. In particular, we'll consider who is a "citizen user" and what access to and tools for linked data sense making means in this case. From that perspective, we'll consider research issues around discovery, exploration, interrogation and representation of data for not only a single wild data source but especially for multiple wild heterogeneous data sources. I hope this talk may help frame some stepping stones towards useful and usable interaction with linked data, and look forward to input from the community to refine such a new literacy agenda further.
semantic web
Rudi Studer
Rudi Studer
Rudi
160bfa2d86a2453ea7cfb3992312e3af2f21ea6e
Optimising Ontology Classification
Ontology classification - the computation of subsumption hierarchies for classes and properties is one of the most important tasks for OWL reasoners. Based on the algorithm by Shearer and Horrocks [9], we present a new classification procedure that addresses several open issues of the original algorithm, and that uses several novel optimisations in order to achieve superior performance. We also consider the classification of (object and data) properties. We show that algorithms commonly used to implement that task are incomplete even for relatively weak ontology languages. Furthermore, we show how to reduce the property classification problem into a standard (class) classification problem, which allows reasoners to classify properties using our optimised procedure. We have implemented our algorithms in the OWL HermiT reasoner, and we present the results of a performance evaluation.
Optimising Ontology Classification
semantic web
Gunnar Aastrand Grimnes
Gunnar Aastrand Grimnes
Gunnar
64b4bc43d28168930e4adc80cbb71626433418b1
Nicola Henze
Nicola Henze
Nicola
a0baead50d421fb8f80ba8ef961a9bab49080619
Andrey Simanovsky
Andrey Simanovsky
Andrey
44c1ebb181697ab1df5dc4add64eb3f2f25826dd
York Sure
York Sure
York
c013b5c247e106e7092b1fce764502052646e30d
833dd359e65a3b1efb1c4921a8bf6928e53f2085
TopQuadrant
TopQuadrant
Finding the Achilles Heel of the Web of Data: using network analysis for link-recommendation
The Web of Data is increasingly becoming an important infrastructure for such diverse sectors as entertainment, government, e-commerce and science. As a result, the robustness of this Web of Data is now crucial. Prior studies show that the Web of Data is strongly dependent on a small number of central hubs, making it highly vulnerable to single points of failure. In this paper, we present concepts and algorithms to analyse and repair the brittleness of the Web of Data. We apply these on a substantial subset of it, the 2010 Billion Triple Challenge dataset. We first distinguish the physical structure of the Web of Data from its semantic structure. For both of these structures, we then calculate their robustness, taking betweenness centrality as a robustness-measure. To the best of our knowledge, this is the first time that such robustness-indicators have been calculated for the Web of Data. Finally, we determine which links should be added to the Web of Data in order to improve its robustness most effectively. We are able to determine such links by interpreting the question as a very large optimisation problem and deploying an evolutionary algorithm to solve this problem. We believe that with this work, we offer an effective method to analyse and improve the most important structure that the Semantic Web community has constructed to date.
Finding the Achilles Heel of the Web of Data: using network analysis for link-recommendation
semantic web
Heather S. Packer
Heather S. Packer
Heather
a79adb8e19f9eda499329713522e89bed9483a65
Kaoru Hiramatsu
Kaoru Hiramatsu
Kaoru
95a34afb07404a2c2b514f17dcf11cfad186b724
Timothy Redmond
Timothy Redmond
Timothy
a71d427c63ec23fed10ca61bf3657feb79a922f9
Tobias Bürger
Tobias Bürger
Tobias
6eb18431cc823cc518a24b7b724b4cab5f42d6af
Malte Kiesel
Malte Kiesel
Malte
8b616d8c4c0e8c74b1e144f49288c0f9a5461915
Eun Kyung Kim
Eun Kyung Kim
Eun Kyung
semantic web
Several projects have brought rich data semantics to collaborative wikis, but blogging platforms remain primarily limited to text. As blogs comprise a significant portion of the web's content, engagement of the blogging community is crucial to the development of the semantic web. We provide a study of blog content to show a latent need for better data publishing and visualization support in blogging software. We then present DataPress, an extension to the WordPress blogging platform that enables users to publish, share, aggregate, and visualize structured information using the same workflow that they already apply to text-based content. In particular, we aim to preserve those attributes that make blogs such a successful publication medium: one-click access to the information, one-click publishing of it, natural authoring interfaces, and easy copy and paste of information (and visualizations) from other sources. We reflect on how our designs make progress toward these goals with a study of how users who installed DataPress made use of various features.
Talking about Data: Sharing Richly Structured Information through Blogs and Wikis
Talking about Data: Sharing Richly Structured Information through Blogs and Wikis
Recently, processing of queries on linked data has gained attention. We identify and systematically discuss three main strategies: a bottom-up strategy that discovers new sources during query processing by following links between sources, a top-down strategy that relies on complete knowledge about the sources to select and process relevant sources, and a mixed strategy that assumes some incomplete knowledge and discovers new sources at run-time. To exploit knowledge discovered at run-time, we propose an additional step, explicitly scheduled during query processing, called correct source ranking. Additionally, we propose the adoption of stream-based query processing to deal with the unpredictable nature of data access in the distributed Linked Data environment. In experiments, we show that our implementation of the mixed strategy leads to early reporting of results and thus, more responsive query processing, while not requiring complete knowledge.
Linked Data Query Processing Strategies
Linked Data Query Processing Strategies
semantic web
Martin Hurrell
Martin Hurrell
Martin
5632c10082e361115509c2424ed63e37b33b2679
The Open Graph Protocol Design Decisions
The Open Graph Protocol Design Decisions
The Open Graph protocol enables any web page to become a rich object in a social graph. It was created by Facebook but designed to be generally useful to anyone. While many different technologies and schemas exist and could be combined together, there is not a single technology which provides enough information to richly represent any web page within the social graph. The Open Graph protocol builds on these existing technologies and gives developers one thing to implement. Developer simplicity is a key goal of the Open Graph protocol which has informed many of the technical design decisions. This talk will explore the motivation of the Open Graph protocol and the design decisions which went into creating it.
semantic web
Stuart Owen
Stuart Owen
Stuart
1654cd9b3fd361da606d4057500ef3de06c8f48d
Invited Talk: mc schrafel
Benjamin Bach
Benjamin Bach
Benjamin
56b22af04a7951f811bac9ba94fa66d8451786bd
SRI International
SRI International
Glenn Svensson
Glenn Svensson
Glenn
836fd8d4d5a80e6f1caf364abb52d4659dd35b31
Advanced Evaluation of Web Search - Methodology and Technology
Advanced Evaluation of Web Search - Methodology and Technology
semantic web
It is no doubt that search is critical to the web. And I believe it will be of similar importance to the semantic web. Once you are talking about searching from billions of objects, it will be impossible to always give a single right result, no matter how intelligent the search engine is. Instead, a set of possible results will be provided for the user to choose from. Moreover, if we consider the trade-off between the system costs of generating a single right result and a set of possible results, we may choose the latter. This will naturally lead to the question of how to decide on and present the set to the user and how to evaluate the outcome. In this presentation, I will talk about some new results in the methodology and technology developed for evaluation of web search technologies and systems. As we know, the dominant method for evaluating search engines is the Cranfield paradigm, which employs a test collection to qualify the systems' performance. However, the modern search engines are much different than the traditional information retrieval systems when the Cranfield paradigm was proposed: 1. Mostmodernsearchengineshavemuchmorefeatures,suchasquery-dependent document snippets and query suggestions, and the quality of such features can affect the users' effectiveness to find out useful information; 2. The document collections used in search engines are much larger than ever, so the complete test collection that contain all query-document judgments is not available. As response to the above differences and difficulties, the evaluation based on implicit feedback is a promising alternative methodology employed in IR evaluation. With this approach, no extra human effort is required to judge the querydocument relevance. Instead, such judgments information can be automatically predicted from real users' implicit feedback data. There are three key issues in this methodology: 1. How to predict the query-document relevance and other useful features that useful to qualify the search engine performance; 2. If the complete "judgments" are not available, how can we efficiently collect the most critical information that can determine the system performance; 3. Because more than query-document relevance features can affect the performance, how can they integrate to be a good metric to predict the system performance. We will show a set of technologies dealing with these issues.
While semantic web search may present different requirements from web search, evaluation of any search technology will be inevitable. As such, I hope the materials covered in the talk will benefit some of you in semantic web community in the future.
Enhancing the Open-Domain Classification of Named Entity using Linked Open Data
semantic web
named entity
Enhancing the Open-Domain Classification of Named Entity using Linked Open Data
linked open data
Many applications make use of named entity classification. Machine learning is the preferred technique adopted for many named entity classification methods where the choice of features is critical to final performance. Existing approaches explore only the features derived from the characteristic of the named entity itself or its linguistic context. With the development of the SemanticWeb, a large number of data sources are published and connected across the Web as Linked Open Data (LOD). LOD provides rich a priori knowledge about entity type information, knowledge that can be a valuable asset when used in connection with named entity classification. In this paper, we explore the use of LOD to enhance named entity classification. Our method extracts information from LOD and builds a type knowledge base which is used to score a (named entity string, type) pair. This score is then injected as one or more features into the existing classifier in order to improve its performance. We conducted a thorough experimental study and report the results, which confirm the effectiveness of our proposed method.
classification
Dmitry Tsarkov
Dmitry Tsarkov
Dmitry
8ca9de5243d9babda9bdbc832bfabdd8e6aaed36
Rob Young
Rob Young
Rob
262e0c47b873544a009a3df21cbc2e20fdee8ba0
Leyla Jael Garcia Castro
Leyla Jael Garcia Castro
Leyla
e046cc13194b040c3edcae6e07b5e1cc4be9f82c
84106b1483a4ede05faf897f2b143d0c935c14ff
Clados Management LLC
Clados Management LLC
Florian Schmedding
Florian Schmedding
Florian
3a85094513a206afb0518393f42520c7ecc8eb99
Jens Lehmann
Jens Lehmann
Jens
01fee219e665ecea3905f361517b2bd4a344975d
Martin Hepp
Martin Hepp
Martin
49e06491d1c02eead2d362e2300fa56d24ed5213
Yuting Zhao
Yuting Zhao
Yuting
afd5f370c87e171a95ba2ea58f586c17a393e5ae
Stefan Gradmann
Stefan Gradmann
Stefan
76e5c62d1d3cdd7ef08f86fda8b777d907bfa6a9
Enabling Ontology-based Access to Streaming Data Sources
The availability of streaming data sources is progressively increasing thanks to the development of ubiquitous data capturing technologies such as sensor networks. The heterogeneity of these sources introduces the requirement of providing data access in a unified and coherent manner, whilst allowing the user to express their needs at an ontological level. In this paper we describe an ontology-based streaming data access service. Sources link their data content to ontologies through s2o mappings. Users can query the ontology using sparqlStream, an extension of sparql for streaming data. A preliminary implementation of the approach is also presented. With this proposal we expect to set the basis for future efforts in ontology-based streaming data integration.
semantic web
Enabling Ontology-based Access to Streaming Data Sources
Formal policies allow the non-ambiguous definition of situations in which usage of certain entities are allowed, and enable the automatic evaluation whether a situation is compliant. This is useful for example in applications using data provided via standardized interfaces. The low technical barriers of integrating such data sources is in contrast to the manual evaluation of natural language policies as they currently exist. Usage situations can themselves be regulated by policies, which can be restricted by the policy of a used entity. Consider for example the Google Maps API, which requires that applications using the API must be available without a fee, i.e. the application's policy must not require a payment. In this paper we present a policy language that can express such constraints on other policies, i.e. a self-policing policy language. We validate our approach by realizing a use case scenario, using a policy engine developed for our language.
semantic web
A Self-Policing Policy Language
A Self-Policing Policy Language
Talking about Data: Sharing Richly Structured Information through Blogs and Wikis
semantic web
Query strategy for sequential ontology debugging
Debugging is an important prerequisite for the wide-spread application of ontologies, especially in areas that rely upon everyday users to create and maintain knowledge bases, such as the Semantic Web. Most recent approaches use diagnosis methods to identify sources of inconsistency. However, in most debugging cases these methods return many alternative diagnoses, thus placing the burden of fault localization on the user. This paper demonstrates how the target diagnosis can be identified by performing a sequence of observations, that is, by querying an oracle about entailments of the target ontology. We exploit probabilities of typical user errors to formulate information theoretic concepts for query selection. Our evaluation showed that the suggested method reduces the number of required observations compared to myopic strategies.
Query strategy for sequential ontology debugging
rdf
RDFMatView: Indexing RDF Data for SPARQL Queries
semantic web
materialized queries
The Semantic Web is now gaining momentum due to its efforts to create a universal medium for the exchange of semantically tagged data. The representation and querying of semantic data have been made by means of directed labelled graphs using RDF and SPARQL, standards which have been widely accepted by the scientific community. Currently, most implementations of RDF/SPARQL are based on relational database technology. But executing complex queries in these systems usually is rather slow due to the number of joins that need to be performed. In this article, we describe an indexing method using materialized SPARQL queries as indexes on RDF data sets to reduce the query processing time. We provide a formal definition of materialized SPARQL queries, a cost model to evaluate their impact on query performance, a storage scheme for the materialization, and an algorithm to find the optimal set of indexes given a query. We also introduce different approaches to integrate materialized queries into an existing SPARQL query engine.
sparql
RDFMatView: Indexing RDF Data for SPARQL Queries
indexing
Zhipeng Peng
Zhipeng Peng
Zhipeng
dbf66ea98c2604cac156b0b600a1af6acbb99c3c
Georg Lausen
Georg Lausen
Georg
9b94eccc1de49ceee1f8fe147ffa5e994a5080af
Valentina Tamma
Valentina Tamma
Valentina
38fb98af3ddd45545d1a5f452204f4785a90ccba
Raul Palma
Raul Palma
Raul
f1310d3aa1194860e163caecfc32aa2b214e6875
Anees Ul Mehdi
Anees Ul Mehdi
Anees
01a865798eb73ccf4a88c2ae8cbd6b210181bf2c
University of Kassel
University of Kassel
Guergana K. Savova
Guergana K. Savova
Guergana
Peiqin Gu
Peiqin Gu
Peiqin
944cb0daeeb7dd18321e4f1073ccd87a656ca3dd
Chinese Academy of Sciences
Chinese Academy of Sciences
When owl:sameAs isn't the Same: An Analysis of Identity in Linked Data
Alitora Systems
Alitora Systems
Centrum voor Wiskunde en Informatica (CWI)
Centrum voor Wiskunde en Informatica (CWI)
Furtwangen University
Furtwangen University
Break
Dresden University of Technology
Dresden University of Technology
Applications at the heart of a new Publishing Ecosystem
Applications at the heart of a new Publishing Ecosystem
semantic web
Carlos Pedrinaci
Carlos Pedrinaci
Carlos
c64f9841ebaba8d2ea75552be0400ad2b304b5d0
EvoPat - Pattern-Based Evolution and Refactoring of RDF Knowledge Bases
semantic web
Facilitating the seamless evolution of RDF knowledge bases on the Semantic Web presents still a major challenge. In this work we devise EvoPat - a pattern-based approach for the evolution and refactoring of knowledge bases. The approach is based on the definition of basic evolution patterns, which are represented declaratively and can capture simple evolution and refactoring operations on both data and schema levels. For more advanced and domain-specific evolution and refactorings, several simple evolution patterns can be combined into a compound one. We performed a comprehensive survey of possible evolution patterns with a combinatorial analysis of all possible before/after combinations, resulting in an extensive catalog of usable evolution patterns. Our approach was implemented as an extension for the OntoWiki semantic collaboration platform and framework.
EvoPat - Pattern-Based Evolution and Refactoring of RDF Knowledge Bases
Vrije Universiteit Amsterdam
Vrije Universiteit Amsterdam
Daniel Olmedilla
Daniel Olmedilla
Daniel
2391b49baf5b1ea2c0dd616b8b49ac341e1c639c
Jean Paul Calbimonte
Jean Paul Calbimonte
Jean-Paul
b33a4918bf12bc9dd4115ed53ade46736ec3b7db
Piero Bonatti
Piero Bonatti
Piero
69edda4288bb908e54cd1c66a308289292c5ed4c
K-Now
K-Now
Yuzhong Qu
Yuzhong Qu
Yuzhong
57682429d3d2a18d6a9c2c2b0559a2105ca034a1
Semantic Web
Visualizing Populated Ontologies with OntoTrix
Visualizing Populated Ontologies with OntoTrix
Most tools for visualizing Semantic Web data structure the representation according to the concept definitions and interrelations that constitute the ontology's vocabulary. Instances are often treated as somewhat peripheral information, when considered at all. The visualization of instance-level data poses different but significant challenges as instances will often be orders of magnitude more numerous than the concept definitions that give them machine-processable meaning. We present a visualization technique designed to visualize large instance sets and the relations that connect them. This visualization uses both nodelink and adjacency matrix representations of graphs to visualize different parts of the data depending on their semantic and local structural properties, exploiting ontological knowledge to drive the layout of, and navigation in, the visualization.
Pavel Klinov
Pavel Klinov
Pavel
e95c601cbecec70c88b949d3d85b272cef0ee066
Les Carr
Les Carr
Les
5c5061088fc17ea2774188c1001621daf91d3567
Yue Ma
Yue Ma
Yue
69ad4c90d4142546f55fc50585bb64b418633879
In-Use Panel "OWL vs. RIF"
Alexandra Poulovassilis
Alexandra Poulovassilis
Alexandra
b804c68178a28ccde3196f5512affec2d7ded34c
Making sense of Twitter
Benjamin Fields
Benjamin Fields
Benjamin
Ben Fields
Murat Sensoy
Murat Sensoy
Murat
8ad2226099226182818b5117d06022810bfd8900
Tadej Stajner
Tadej Stajner
Tadej
8fd397f598db6e0129ae49ad1b25e99a2313757a
Sean Bechhofer
Sean Bechhofer
Sean
cdc01cde5b33382c60bdc4c0a68ca5c1736ec313
Enhancing the BBC's World Cup coverage with an ontology driven information architecture
Enhancing the BBC's World Cup coverage with an ontology driven information architecture
Oktie Hassanzadeh
Oktie Hassanzadeh
Oktie
6051b86834b107d02b15bd1dd906a544729df7fb
nonmonotonic description logics
EL with Default Attributes and Overriding
defeasible inheritance
EL with Default Attributes and Overriding
semantic web
Biomedical ontologies and semantic web policy languages based on description logics (DLs) provide fresh motivations for extending DLs with nonmonotonic inferences - a topic that has attracted a significant amount of attention along the years. Despite this, nonmonotonic inferences are not yet supported by the existing DL engines. One reason is the high computational complexity of the existing decidable fragments of nonmonotonic DLs. In this paper we identify a fragment of circumscribed $\EL^\bot$ that supports attribute inheritance with specificity-based overriding (much like an object-oriented language), and such that reasoning about default attributes is in P.
Most graph visualisation tools for RDF data are desktop applications focused on loading complete ontologies and metadata from a file and allowing users to filter out information if needed. Recently both scientific and commercial frameworks have started to shift their focus to the web, however they still rely on plugins such as Java and rarely handle larger collections of RDF statements efficiently. In this abstract we present a framework which visualises RDF graphs in a native browser environment, leveraging both the SVG standard and JavaScript technology to provide a responsive user interface. Graphs can be directly expanded, modified and explored. Users select nodes and edges from a central data repository containing millions of statements. The resulting graph can be shared with other users retaining full interactivity for collaborative work or presentation purposes.
BRAMBLE: A Web-based Framework for Interactive RDF-Graph Visualisation
BRAMBLE: A Web-based Framework for Interactive RDF-Graph Visualisation
Semantic Web
Summary Models for Routing Keywords to Linked Data Sources
Summary Models for Routing Keywords to Linked Data Sources
semantic web
The proliferation of linked data on the Web paves the way to a new generation of applications that exploit heterogeneous data from different sources. However, because this Web of data is large and continuously evolving, it is non-trivial to identify the relevant link data sources and to express some given information needs as structured queries against these sources. In this work, we allow users to express needs in terms of simple keywords. Given the keywords, we define the problem of finding the relevant sources as the one of keyword query routing. As a solution, we present a family of summary models, which compactly represents the Web of linked data and allows to quickly find relevant sources. The proposed models capture information at different levels, representing summaries of varying granularity. They represent different trade-offs between effectiveness and efficiency. We provide a theoretical analysis of these trade-offs and also, verify them in experiments carried out in a real-world setting using more than 150 publicly available datasets.
empirical study
dialogue interaction
ontology
semantic web
Linkage of Heterogeneous Knowledge Resources within In-store Dialogue Interaction
Dialogue interaction between customers and products improves presentation of relevant product information in in-store shopping situations. Thus, information needs of customers can be addressed more intuitive. In this article, we describe how access to product information can be improved based on dynamic linkage of heterogeneous knowledge representations. We therefore introduce a conceptual model of dialogue interaction based on multiple knowledge resources for in-store shopping situations and empirically test its utility with end-users.
heterogeneous knowledge resources
Linkage of Heterogeneous Knowledge Resources within In-store Dialogue Interaction
dynamic linkage
Nuno Lopes
Nuno Lopes
Nuno
f55387fb8cb7af2a64a81ddeb4f1e8affb000ed0
Boris Motik
Boris Motik
Boris
d4eccc5f2f9a33129c207211d7af8f298a7f71ee
Daniela Inclezan
Daniela Inclezan
Daniela
57df436158dbb744e1032a22cc9e95fed36b13e5
Mark A. Musen
Mark A. Musen
Mark
60602b405f9d456ffc0e30d22d535100159b7874
Melliyal Annamalai
Melliyal Annamalai
Melliyal
1a405b61cf123960bd25ba5fb5e87ec749926680
Floarea Serban
Floarea Serban
Floarea
c66064fd9d2bf7f10923dc835a379f474d684230
Daniel M Herzig
Daniel M Herzig
Daniel
4ee687e8f9e8576a48ec7625e7ccc414fcd57639
K-Spend: Semantic Web Technologies for Spend Analysis
K-Spend: Semantic Web Technologies for Spend Analysis
Beate Krause
Beate Krause
Beate
5f04ac94a779b39ec430a355cad57d4b949b05f5
Lalana Kagal
Lalana Kagal
Lalana
68047c6f3a10c173746fa3f6fc6f9218d2921d64
Sara Cohen
Sara Cohen
Sara
c8bc9396dbd989c849154593e43b366ebb1b52c2
Ryutaro Ichise
Ryutaro Ichise
Ryutaro
0a09da4b327971fff4a6573caac2b4872cab5cc9
Christoph Riess
Christoph Riess
Christoph
85a2f37de25d596330227101efee6a424b223137
Universite Paris Sud
Universite Paris Sud
Valentina Presutti
Valentina
Presutti
Gong Cheng
Gong Cheng
Gong
c7357de08b9a6e7c459bac9d85de8f2bf66f169f
Jennifer Sleeman
Jennifer Sleeman
Jennifer
42dbed1b893d6a9f90ea1a30781e13459c25d022
Ambient assisted living
Ambient assisted living (AAL) is a new research area focusing on services that support people in their daily life with a particular focus on elderly people. In the AAL domain sensor technologies are used to identify situations that pose a risk to the assisted person (AP) or that indicate the need of proactive assistance. These situations of interest are detected by analyzing sensor data coming from a whole variety of sensors. Considering the need for immediate assistance especially in the case of safety- and health-critical situations, the detection of situations must be achieved in real-time. In this paper we propose to use Complex Event Processing (CEP) based on semantic technologies to detect typical AAL-like situations. In particular, we present how the ETALIS CEP engine can be used to detect situations in real-time and how this can lead to immediate and proper assistance even in critical situations in conjunction with the semantic AAL service platform openAAL.
Semantic-based Complex Event Processing in the AAL Domain
Semantic Web
Complex Event Processing
Semantic Technologies
Context-aware
Semantic-based Complex Event Processing in the AAL Domain
ETALIS
openAAL
Real-time
Yahoo!
Yahoo!
Pontificia Universidad Catolica de Chile
Pontificia Universidad Catolica de Chile
Richard Shapiro
Richard Shapiro
Richard
e7e5fb5a8e15420c899f342bff2cda4feacf0a1a
9th International Semantic Web Conference
Semantic MediaWiki in Operation: Experiences with Building a Semantic Portal
Measuring the dynamic bi-directional influence between content and social networks
Wageningen University and Research Centre
Wageningen University and Research Centre
Dunja Mladenic
Dunja Mladenic
Dunja
98a26dfacc3ce23c7ae695e673e15413b7cb2603
Szabolcs Grunwald
Szabolcs Grunwald
Szabolcs
7e78ef9162031015184c5fd82d974e5ca23ffef6
Andreas Wagner
Andreas Wagner
Andreas
bb64dc3391e5df9e39176b2d65dcdd373ebcfe42
SemWebVid - Making Video a First Class Semantic Web Citizen and a First Class Web Bourgeois
SemWebVid is an online Ajax application that allows for the automatic generation of Resource Description Framework (RDF) video descriptions. These descriptions are based on two pillars: first, on a combination of user-generated metadata such as title, summary, and tags; and second, on closed captions which can be user-generated, or be auto-generated via speech recognition. The plaintext contents of both pillars are being analyzed using multiple Natural Language Processing (NLP) Web services in parallel whose results are then merged and where possible matched back to concepts in the sense of Linking Open Data (LOD). The final result is a deep-linkable RDF description of the video, and a "scroll-along" view of the video as an example of video visualization formats.
RDF
SemWebVid - Making Video a First Class Semantic Web Citizen and a First Class Web Bourgeois
LOD
Linked Data
Semantic Web
Video
NLP
Research Track
Adding Integrity Constraints to the Semantic Web for Instance Data Evaluation
Increasingly huge RDF data sets are being published on theWeb. Currently, they use different syntaxes of RDF, contain high levels of redundancy and have a plain indivisible structure. All this leads to fuzzy publications, inefficient management, complex processing and lack of scalability. This paper presents a novel RDF representation (HDT) which takes advantage of the structural properties of RDF graphs for splitting and representing, efficiently, three components of RDF data: Header, Dictionary and Triples structure. On-demand management operations can be implemented on top of HDT representation. Experiments show that data sets can be compacted in HDT by more than fifteen times the current naive representation, improving parsing and processing while keeping a consistent publication scheme. For exchanging, specific compression techniques over HDT improve current compression solutions.
semantic web
Compact Representation of Large RDF Data Sets for Publishing and Exchange
Compact Representation of Large RDF Data Sets for Publishing and Exchange
Lei Wang
Lei Wang
Lei
65a319bba5bb888a8855a7f5809e82b963e436b9
Peter Wolf
Peter Wolf
Peter
d85bafc7eff9c3b8b4a6774a0034292e2867d3a0
Achim Rettinger
Achim Rettinger
Achim
c8534f2cda2d909bbb64009ae8156d78764438db
HP Labs Palo Alto
HP Labs Palo Alto
Mantas Simkus
Mantas Simkus
Mantas
c455529d4c5c80a4783cdb04935173ec5c265816
Junquan Chen
Junquan Chen
Junquan
01bf9de51b569048352ad5ef73c77a0239959972
Sandro Hawke
Sandro Hawke
Sandro
2c098f780abf7f05166243a541edeb966dfbd596
Semantic Techniques for Enabling Knowledge Reuse in Conceptual Modelling
Conceptual modelling tools allow users to construct formal representations of their conceptualisations. These models are typically developed in isolation, unrelated to other user models, thus losing the opportunity of incorporating knowledge from other existing models or ontologies that might enrich the modelling process. We propose to apply Semantic Web techniques to the context of conceptual modelling (more particularly to the domain of qualitative reasoning), to smoothly interconnect conceptual models created by different users, thus facilitating the global sharing of scientific data contained in such models and creating new learning opportunities for people who start modelling. This paper describes how semantic grounding techniques can be used during the creation of qualitative reasoning models, to bridge the gap between the imprecise user terminology and a well defined external common vocabulary. We also explore the application of ontology matching techniques between models, which can provide valuable feedback during the model construction process.
semantic web
Semantic Techniques for Enabling Knowledge Reuse in Conceptual Modelling
semantic web
One size does not fit all: Customizing Ontology Alignment Using User Feedback
One size does not fit all: Customizing Ontology Alignment Using User Feedback
A key problem in ontology alignment is that different ontological features (e.g., lexical, structural or semantic) vary widely in their importance for different ontology comparisons. In this paper, we present a set of principled techniques that exploit user feedback to customize the alignment process for a given pair of ontologies. Specifically, we propose an iterative supervised-learning approach to (i) determine the weights assigned to each alignment strategy and use these weights to combine them for matching ontology entities; and (ii) determine the degree to which the information from such matches should be propagated to their neighbors along different relationships for collective matching. We demonstrate the utility of these techniques with standard benchmark datasets and large, real-world ontologies, showing improvements in F-scores of up to 70% from the weighting mechanism and up to 40% from collective matching, compared to an unweighted linear combination of matching strategies without information propagation.
Marcelo Arenas
Marcelo Arenas
Marcelo
263fbdd4ad0d4f74a9a210582a03d51d7e04b904
Exploiting Relation Extraction for Ontology Alignment
Zhaoming Qiu
Zhaoming Qiu
Zhaoming
98194b4f109a67479626aa068fc10ac6e32c526c
Andraz Tori
Andraz Tori
Andraz
Doctoral Consortium/1: Mining and Search
Thomas Krennwallner
Thomas Krennwallner
Thomas
4fbf23f97eb1c36561a72379cea71095200fbd60
Martin Szomszor
Martin Szomszor
Martin
453b931a14e486546e833a844c882e903f8c4a36
A Feature and Information Theoretic Framework for Semantic Similarity and Relatedness
Patrick J. Hayes
Patrick J. Hayes
Patrick
bd028ef46e23fa534a994760001db850b46bc5f2
Building the Inform Semantic Publishing Ecosystem: from Author to Audience
Building the Inform Semantic Publishing Ecosystem: from Author to Audience
Matthias Assel
Matthias Assel
Matthias
5f7dc0d016092d32aca9c8ca6b6d7a2658dc5b60
ISReal: An Open Platform for Semantic-Based 3D Simulations in the 3D Internet
ISReal: An Open Platform for Semantic-Based 3D Simulations in the 3D Internet
semantic web
We present the first open and cross-disciplinary 3D Internet research platform, called ISReal, for intelligent 3D simulation of realities. Its core innovation is the comprehensively integrated application of semantic Web technologies, semantic services, intelligent agents, verification and 3D graphics for this purpose. In this paper, we focus on the interplay between its components for semantic XML3D scene query processing and semantic 3D animation service handling, as well as the semantic-based perception and action planning with coupled semantic service composition by agent-controlled avatars in a virtual world. We demonstrate the use of the implemented platform for semantic-based 3D simulations in a small virtual world example with an intelligent user avatar and discuss results of the platform performance evaluation.
Carnegie Mellon University
Carnegie Mellon University
Philipp Mayr
Philipp Mayr
Philipp
480d91426de8e07086fce99dca55039db5f1b3c8
University of Reading
University of Reading
Doctoral Consortium/2; Semantic Web Applications and Services
semantic web
Linking and Building Ontologies of Linked Data
The Web of Linked Data is characterized by linking structured data from different sources using equivalence statements, such as owl:sameAs, as well as other types of linked properties. The ontologies behind these sources, however, remain unlinked. This paper describes an extensional approach to generate alignments between these ontologies. Specifically our algorithm produces equivalence and subsumption relationships between classes from ontologies of different Linked Data sources by exploring the space of hypotheses supported by the existing equivalence statements. We are also able to generate a complementary hierarchy of derived classes within an existing ontology or generate new classes for a second source where the ontology is not as refined as the first. We demonstrate empirically our approach using Linked Data sources from the geospatial, genetics, and zoology domains. Our algorithm discovered about 800 equivalences and 29,000 subset relationships in the alignment of five source pairs from these domains. Thus, we are able to model one Linked Data source in terms of another by aligning their ontologies and understand the semantic relationships between the two sources.
Linking and Building Ontologies of Linked Data
Mark van Assem
Mark van Assem
Mark
8463e951c582e00ec4a0eeac4657da7818aac781
Intelligent Decision Automation on an Event Driven Semantic Platform
Intelligent Decision Automation on an Event Driven Semantic Platform
As more RDF streaming applications are being developed, there is a growing need for an efficient mechanism for storing and performing inference over these streams. In this poster, we present a tool that stores these streams in a unified model by combining memory and disk based mechanisms. We explore various memory management algorithms and disk-persistence strategies to optimize query performance. Our unified model produces an optimized query execution and inference performance for RDF streams that benefit from the advantages of using both, memory and disk.
Semantic Web
Efficient processing of large RDF streams using memory management algorithms
Efficient processing of large RDF streams using memory management algorithms
Evaluation of semantic web technologies at large scale, including ontology matching, is an important topic of semantic web research. This paper presents a web-based evaluation service for automatically executing the evaluation of ontology matching systems. This service is based on the use of a web service interface wrapping the functionality of a matching tool to be evaluated and allows developers to launch evaluations of their tool at any time on their own. Furthermore, the service can be used to visualise and manipulate the evaluation results. The approach allows the execution of the tool on the machine of the tool developer without the need for a runtime environment.
A web-based Evaluation Service for Ontology Matching
Semantic Web
A web-based Evaluation Service for Ontology Matching
Achille Fokoue
Achille Fokoue
Achille
42e105e76a4873077b7c63e06d51946a89f0eafd
An Expressive and Efficient Solution to the Service Selection Problem
Kemafor Anyanwu
Kemafor Anyanwu
Kemafor
fe9a49f5c8a2ea092efaf3f38dbc53f2681bc54f
Doctoral Consoritium/3: Reasoning and Querying
Jinghai Rao
Jinghai Rao
Jinghai
17a468c3d02e7d5d885e4dbf13b0dcefbfa01ad3
Yixin Yan
Yixin Yan
Yixin
Deborah L. Mcguinness
Deborah L. Mcguinness
Deborah
292f7f25a21bd6c41c784397092317016dfc987d
New York Times
New York Times
Xiaoyuan Wang
Xiaoyuan Wang
Xiaoyuan
30f24d017c4d93520aae1100efe63dc64bc8d80f
Customizing the Composition of Actions, Programs, and Web Services with User Preferences
St Petersburg State University
St Petersburg State University
Yahoo! Research - Barcelona
Yahoo! Research-Barcelona
Kamal Kc
Kamal Kc
Kamal
f8039c7c8052dae26c1dc3dcc452df522d9acef4
Nikesh Garera
Nikesh Garera
Nikesh
d14a4f438d48c3bb959e11a64011a8e059f47275
RDF
entity
Semantic Web
resource
xhRank: Ranking Entities on the Semantic Web
ranking
xhRank: Ranking Entities on the Semantic Web
In general, ranking entities (resources) on the Semantic Web (SW) is subject to importance, relevance, and query length. Few existing SW search systems cover all of these aspects. Moreover, many existing efforts simply reuse the technologies from conventional Information Retrieval (IR), which are not designed for SW data. This paper proposes a ranking mechanism, which includes all three categories of rankings and are tailored to SW data.
ontology
Evan Sandhaus
Evan Sandhaus
Evan
b407049ab8ef72cf83e581f9d9457978da6ee41b
First International Workshop on Consuming Linked Data
Anastasios Kementsietsidis
Anastasios Kementsietsidis
Anastasios
e6563946b9127806c6a94706e6181d5ff2eafc7e
Universita degli Studi di Bari
Universita degli Studi di Bari
Albert-Ludwigs-Universität Freiburg
Albert-Ludwigs-Universität Freiburg
Stefan Schlobach
Stefan Schlobach
Stefan
77f7b82eb146c1867ee01643ef2eb740c0dc9cc4
Break
Michael Martin
Michael Martin
Michael
577bfc91a74510adea7fbbb5686629985f5c6864
Christophe Gueret
Christophe Gueret
Christophe
b35d03b79165699b8aee26174245017a2624d29a
Oracle
Oracle
Integrated Metamodeling and Diagnosis in OWL 2
Using Multi-Agent Based Middleware to Implement a Distributed Peer-To-Peer Semantic Service Oriented Architecture
Max Jakob
Max Jakob
Max
5d157b2e375e868d67ff5f38b97666f316d34627
Institute for Human and Machine Cognition
Institute for Human and Machine Cognition
Alcatel-Lucent, Bell Labs
Alcatel-Lucent, Bell Labs
Sen Luo
Sen Luo
Sen
Renmin University of China
Renmin University of China
Daniel Schwabe
Daniel Schwabe
Daniel
64426ee795421651f6fc88bf0fca221c52c4005a
Matthew Horridge
Matthew Horridge
Matthew
29c0127871609390f3d73c72c9418cc2936ac0f8
Universita di Napoli Federico II
Universita di Napoli Federico II
George Eadon
George Eadon
George
459ff91109f62cdd8ab2e1d4c8ed56af83a5cfde
Wamberto W Vasconcelos
Wamberto W Vasconcelos
Wamberto
dc84a059585a01c5587d4b30fec8fc15b16d11b1
Stephanie Stroka
Stephanie Stroka
Stephanie
5c3fd09e4c371dc60a21ab5a60f9281a38266279
Christian Halaschek-Wiener
Christian Halaschek-Wiener
Christian
aa504b98382a66462dd0e360b6ead3a2bb1f0ead
Paul Doran
Paul Doran
Paul
818780caaed049027fd437d093ce830aaff39e2b
University of Bremen
University of Bremen
Extensions of SPARQL towards Heterogeneous Sources and Domain Annotations
Lin Hao Xu
Lin Hao Xu
Lin Hao
ad6d3db9232d496644e098838629b0e4fe3aa3f5
Universität Koblenz-Landau
Universität Koblenz-Landau
University of Koblenz-Landau
University of Koblenz-Landau
Marko Grobelnik
Marko Grobelnik
Marko
b6706a96f87552df0b385ae8120db0633ba76a44
Semantic Technologies for Enterprise Cloud Management
Learning Co-reference Relations for FOAF Instances
machine learning
FOAF is widely used on the Web to describe people, groups and organizations and their properties. Since FOAF does not require unique IDs, it is often unclear when two FOAF instances are co-referent, i.e., denote the same entity in the world. We describe a prototype system that identifies sets of co-referent FOAF instances using logical constraints (e.g., IFPs), strong heuristics (e.g., FOAF agents described in the same file are not co-referent), and a Support Vector Machine (SVM) generated classifier.
Learning Co-reference Relations for FOAF Instances
linked data
FOAF
Qian Zhong
Qian Zhong
Qian
3c2d3a932bdaad9a35d0a6e87bb45d0bb92500f1
Bob DuCharme
Bob DuCharme
Bob
a58014b314fbab59926e013e5314c5e416e39828
Anand Ranganathan
Anand Ranganathan
Anand
7e50528332d15dabf8bb4680abb458b2640cf499
Nokia Research Center, Beijing
Nokia Research Center, Beijing
University of Stuttgart
University of Stuttgart
Jorge Garcia
Jorge Garcia
Jorge
49a8499c1bb33dacd1076662488f85055c22dad2
Deciding Agent Orientation on Ontology Mappings
Bin Xu
Bin Xu
Bin
8224c2dd51ef6bb091d61aea8b1d630fd3cc2cee
Towards Semantic Data Mining
RDF mapping
data management
data interaction
Linked Data
Building Linked Data Applications with Fusion: A Visual Interface for Exploration and Mapping
Building applications over Linked Data often requires a mapping between the application model and the ontology underlying the source dataset in the Linked Data cloud. Explicitly formulating these mappings demands a comprehensive understanding of the underlying schemas (RDF ontologies) of the source and target datasets. This task can be supported by integrating the process of schema exploration into the mapping process and help the application designer with finding the implicit relationships that she wants to map. This demo describes Fusion - a framework for closing the gap between the application model and the underlying ontologies in the Linked Data cloud. Fusion simplifies the definition of mappings by providing a visual user interface that integrates the exploratory process and the mapping process. Its architecture allows the creation of new applications through the extension of existing Linked Data sources with additional data.
semantic web
Building Linked Data Applications with Fusion: A Visual Interface for Exploration and Mapping
University of Pittsburgh
University of Pittsburgh
Doctoral Consortium Track
Universität Innsbruck
Universität Innsbruck
Yong Yu
Yong Yu
Yong
06294b912a074c0679eefbefb3e06bee679eebed
Nokia Research Center Helsinki
Nokia Research Center Helsinki
Institute for Scientific Interchange (ISI) Foundation
Institute for Scientific Interchange (ISI) Foundation
Johanna Volker
Johanna Volker
Johanna
af1de740b3b72f056f403d27ffbb01f1a84c8c8f
Concordia University
Concordia University
Semantic MediaWiki
Data Integration
Extending SMW+ with a Linked Data Integration Framework
Extending SMW+ with a Linked Data Integration Framework
Linked Data
In this paper, we present a project which extends a SMW+ semantic wiki with a Linked Data Integration Framework that performs Web data access, vocabulary mapping, identity resolution, and quality evaluation of Linked Data. As a result, a large collection of neurogenomics-relevant data from the Web can be fiexibly transformed into a uni?ed ontology, allowing uni?ed querying, navigation, and visualization; as well as support for wiki-style collaboration, crowdsourcing, and commentary on chosen data sets.
Ciro Cattuto
Ciro Cattuto
Ciro
505c77ccc22097a2023011fa0a11159b2815f5d4
Knud Moeller
Knud Moeller
Knud
b15d1e7efb11374644555fa9734bf75a553a362c
Toponym Resolution in Social Media
Toponym Resolution in Social Media
social networks
concept disambiguation
information extraction
Increasingly user-generated content is being utilised as a source of information, however each individual piece of content tends to contain low levels of information. In addition, such information tends to be informal and imperfect in nature; containing imprecise, subjective, ambiguous expressions. However the content does not have to be interpreted in isolation as it is linked, either explicitly or implicitly, to a network of interrelated content; it may be grouped or tagged with similar content, comments may be added by other users or it may be related to other content posted at the same time or by the same author or members of the author's social network. This paper generally examines how ambiguous concepts within user-generated content can be assigned a specific/formal meaning by considering the expanding context of the information, i.e. other information contained within directly or indirectly related content, and specifically considers the issue of toponym resolution of locations.
semantic web
Austin Hagen
Austin Hagen
Austin
Ondrej Svab Zamazal
Ondrej Svab Zamazal
Ondrej
fa5753d57260962506098825ba084e18a71f53f6
Eleni Mikroyannidi
Eleni Mikroyannidi
Eleni
c57fe5035bf1cd0ea17227e004786cc43e94cf31
Jos de Bruijn
Jos de Bruijn
Jos
c0bfaa184536231edab9b153115cbbb074cda742
Gem Stapleton
Gem Stapleton
Gem
2ffe006a99d1aca6904cb094c26aa1eab609d12b
University of Hanover
University of Hanover
Werner Nutt
Werner Nutt
Werner
048d577a29b6c35abf950e3201dff43fecec6a27
Shirin Sohrabi
Shirin Sohrabi
Shirin
fa1f8ceaa83076619cf1ba8cd4b859a22607a890
William W. Cohen
William W. Cohen
William
c4a2e67b44dd01c9fefddab1bdc2cd7840e64fda
ORE - A Tool for Repairing and Enriching Knowledge Bases
Will Semantic Web Technologies Work for the Development of ICD-11?
The World Health Organization is beginning to use Semantic Web technologies in the development of the 11th revision of the International Classification of Diseases (ICD-11). Health officials use ICD in all United Nations member countries to compile basic health statistics, to monitor health-related spending, and to inform policy makers. While previous revisions of ICD encoded minimal information about a disease, and were mainly published as books and tabulation lists, the creators of ICD-11 envision that it will become a multi-purpose and coherent classification ready for electronic health records. Most important, they plan to have ICD-11 applied for a much broader variety of uses than previous revisions. The new requirements entail significant changes in the way we represent disease information, as well as in the technologies and processes that we use to acquire the new content. In this paper, we describe the previous processes and technologies used for developing ICD. We then describe the requirements for the new development process and present the Semantic Web technologies that we use for ICD-11. We outline the experiences of the domain experts using the software system that we implemented using Semantic Web technologies. We then discuss the benefits and challenges in following this approach and conclude with lessons learned from this experience.
Will Semantic Web Technologies Work for the Development of ICD-11?
semantic web
David Wood
David Wood
David
bc6493658035ae500863608c739a6d1938a0b690
Andreas Hotho
Andreas Hotho
Andreas
618346f249ba96ff62d1a2765d7badc4282125ad
Alasdair J. G. Gray
Alasdair J. G. Gray
Alasdair
5c6896bc0decadda7b540a70f877a8f4a8fe8d16
Fuming Shih
Fuming Shih
Fuming
f467f5fce6cf0cc7680f4d8ca9f2c13773df8e5a
Neil Ireson
Neil Ireson
Neil
6ddb590576a64376de79ce02136333d9b7f3557d
Maria Esther Vidal
Maria Esther Vidal
Maria
6c9651932804d271e53f279c99d7cd1d1d429c0a
Alexey Cheptsov
Alexey Cheptsov
Alexey
97de650d3eb70520af72be565278582b8a359cc9
CMS
SPARQL Views: A Visual SPARQL Query Builder for Drupal
End-user Programming
User Interfaces
Publishing Linked Data on the Web has become much easier with tools such as Drupal. However, consuming that data and presenting it in a meaningful way is still difficult for both Web developers and for Semantic Web practitioners. We demonstrate a module for Drupal which supports visual query building for SPARQL queries and enables meaningful displays of the query result.
SPARQL Views: A Visual SPARQL Query Builder for Drupal
Minghua Zhao
Minghua Zhao
Minghua
ea3a95361d318407c7e121039945cf1391aa2246
Satya S. Sahoo
Satya S. Sahoo
Satya
56e13ba22002fd621234b41c90cdb05e9aa59b01
6th International Workshop on Uncertainty Reasoning for the Semantic Web
Chintan Patel
Chintan Patel
Chintan
ff36b3f104a0072b22b3350a6cc4dc7672c1a529
Research Track: Query Languages
Björn Forcher
Björn Forcher
Björn
315ed89df0eb492080f2295f19d8529aeb131b2f
Mudhakar Srivatsa
Mudhakar Srivatsa
Mudhakar
4e809123161985358347fbf6de255422ce8af403
Yinglong Ma
Yinglong Ma
Yinglong
76a4365add2c92e3009f9993171ae75dc0fca755
Silk - Generating RDF Links while publishing or consuming Linked Data
Linked Data
Link Discovery
The central idea of the Web of Data is to interlink data items using RDF links. However, in practice most data sources are not sufficiently interlinked with related data sources. The Silk Link Discovery Framework addresses this problem by providing tools to generate links between data items based on user-provided link specifications. It can be used by data publishers to generate links between data sets as well as by Linked Data consumers to augment Web data with additional RDF links. In this poster we present the Silk Link Discovery Framework and report on two usage examples in which we employed Silk to generate links between two data sets about movies as well as to find duplicate persons in a stream of data items that is crawled from the Web.
Identity Resolution
Silk - Generating RDF Links while publishing or consuming Linked Data
University of Queensland
University of Queensland
Ora Lassila
Ora Lassila
Ora
f1f7489808a1c44bbb8626c040a81260dcf55319
Christopher Thomas
Christopher Thomas
Christopher
6c59a49d4aab289ac2668d207719eb8f45458b9e
Josiane Xavier Parreira
Josiane Xavier Parreira
Josiane
a69a534c7a5802053569792e8c769d8981487eb4
Research Track: Access to Other Kinds of Data
Grenoble Institute of Technology (INPG)
Grenoble Institute of Technology (INPG)
Jie Bao
Jie Bao
Jie
c8753e1e5adcf276fb3e9e2c19f399cc71e90337
Research Track: Proofs, Trust, NLP, Rules
Signal/Collect: Graph Algorithms for the (Semantic) Web
Wouter Van den Broeck
Wouter Van den Broeck
Wouter Van den Broeck
Enterprise Data Classification using Semantic Web Technologies
Meghyn Bienvenu
Meghyn Bienvenu
Meghyn
644601774606ef0279069dc6887af4dd38407186
Daniel Bertinshaw
Daniel Bertinshaw
Daniel
d65d4cb79c44a6f92cd31253d73d13e5e6bb732c
Alexander Ulanov
Alexander Ulanov
Alexander
1dc084d57e6a435ee689224be804542e921a0a97
Universite Paris-Sorbonne
Universite Paris-Sorbonne
Tobias Mathass
Tobias Mathass
Tobias
686bbb4538a681ca3bebc40f042d766270db3d3c
Research Track: Ontology Evolution
Break
SameAs Networks and Beyond: Analyzing Deployment Status and Implications of owl:sameAs in Linked Data
University of Texas at Austin
University of Texas at Austin
University of California, Berkeley
University of California Berkeley
Reto Krummenacher
Reto Krummenacher
Reto
227c6f6b1e1b54def057ea2a928f654ab410884d
Miguel A. Martinez Prieto
Miguel A. Martinez Prieto
Miguel
f0a0bfc1aaefeecdf352719820cdd592b0bd7f5f
Sam Chapman
Sam Chapman
Sam
9df9bc74656f0241449ed35d25075dbea9bd68c0
Emanuele Della Valle
Emanuele Della Valle
Emanuele
1ee386235c89959195075bc4944d5c68f8265f96
Thomas Riechert
Thomas Riechert
Thomas
e446d8a664490aee5773192d2b0c594acd86475c
Li Ma
Li Ma
Li
a12dfb43dd03863a25af319ca616c69fbc96e460
Shenghui Wang
Shenghui Wang
Shenghui
b8c200bba0d987191cf168a51e6cabcfe2408851
Research Track: Agents
Poster Session
Break
Ontoprise GmbH
Ontoprise GmbH
Lin Clark
Lin Clark
Lin
579441ea0e0e9f41346d8241f8dd2b81cb2fa5fc
University of Wurzburg
University of Wurzburg
Steffen Staab
Steffen Staab
Steffen
ae8f32f31b69df2872d4c5d2e3bf21cf09cadf90
Chimezie Ogbuji
Chimezie Ogbuji
Chimezie
a95603ffe1c4abd4fa4f386ba94864de28aab269
Chenyan Xiong
Chenyan Xiong
Chenyan
Paul Groth
Paul Groth
Paul
c43fb37c8ccda8a1e80795f35dc402fcdba16c9f
Research Track: Large KBs
3rd International Workshop on Semantic Sensor Networks
Pablo Mendes
Pablo Mendes
Pablo
f897e0cb6fdf0f9dde1ac5629ac17caebd3fd4fb
Tom Heath
Tom Heath
Tom
1dd0dab717be578c153b8ed70bee284845439706
Laura Dragan
Laura Dragan
Laura
81fa8ee7e5e16c892088803d19d24eb9b9720ca7
Andrea Giovanni Nuzzolese
Andrea Giovanni
Nuzzolese
Sudhir Agarwal
Sudhir Agarwal
Sudhir
23e01d9e42f56692d1ff5c7a732cb81ddd33d92d
Research Track: Social Semantic Web/1
Melanie Siebenhaar
Melanie Siebenhaar
Melanie
815c4ab712cfe092600272e708640551e3a38744
Vinay Chaudhri
Vinay Chaudhri
Vinay
eefade46a5eb633d93da1657bef302a67664cb2c
Nigam H. Shah
Nigam H. Shah
Nigam
40f599c3935f0f17928a090c90140795afcac7ec
Gang Wu
Gang Wu
Gang
2c4b910547a729e62a91653675cbfe8b48ede8ed
Tudor Groza
Tudor Groza
Tudor
75691f9b8834cf1e1552893d01c7bc0dca6136ee
HP Labs Russia
HP Labs Russia
Kateryna Tymoshenko
Kateryna Tymoshenko
Kateryna
2325366f5756e32303443f8f06599110a7f396b7
Stefan Decker
Stefan Decker
Stefan
1bc1f862b688a45b7e0c8d4a8467c23177c53fad
Gerhard Friedrich
Gerhard Friedrich
Gerhard
0b3c57a08eacdd39224b5272381cf7dc0af12400
Varish Mulwad
Varish Mulwad
Varish
b9885e735b09d1c4e49215927f8b2dde8bac5a2c
Mariano Rodriguez Muro
Mariano Rodriguez Muro
Mariano
9834233dbc9d00654ac36e085f897a38c1a88df3
Research Track: Ontology Similarity and Debugging
Microsoft
Microsoft
Using SPARQL to Test for Lattices: application to quality assurance in biomedical ontologies
Nokia
Nokia
Katia Sycara
Katia Sycara
Katia
80b0eee12d87ac02b057b13569fcf242afd72c8d
Nenad Stojanovic
Nenad Stojanovic
Nenad
53a4bdea8bebaa7af9c3d002dc19b0fd88c7efdb
Donghyun Choi
Donghyun Choi
Donghyun
03995105ba3fd2132092b364eebcbf5fdf1128bc
Banquet
Yingjie Li
Yingjie Li
Yingjie
fb606291fd6ae57bcf82b02ea2a30cdc6cfbb63d
Timothy J. Norman
Timothy J. Norman
Timothy
b4e043c25c38f93eba0b609b95a8661b3dea2b5b
Marc Hadfield
Marc Hadfield
Marc
73350d9ee09e42d8ddbe71c7398cf667ac65199a
Universite Paul Sabatier
Universite Paul Sabatier
SAP Labs Palo Alto
SAP Labs Palo Alto
Renee J. Miller
Renee J. Miller
Renee
0bde07c873509c8725d66351c0f41a61655f872b
Catherina Burghart
Catherina Burghart
Catherina
4c47b9606c5ae05dc7f39f0411e5d51f246d0f3b
Recognizing that two Semantic Web documents or graphs are similar and characterizing their differences is useful in many tasks, including retrieval, updating, version control and knowledge base editing. We describe several text-based similarity metrics that characterize the relation between Semantic Web graphs and evaluate these metrics for three specific?c cases of similarity: similarity in classes and properties, similarity disregarding differences in base-URIs, and versioning relationship. We apply these techniques for a specific use case: generating a delta between versions of a Semantic Web graph. We have evaluated our system on several tasks using a collection of graphs from the archive of the Swoogle Semantic Web search engine.
Text Based Similarity Metrics and Deltas for Semantic Web Graphs
Semantic Web graphs
Text Based Similarity Metrics and Deltas for Semantic Web Graphs
Semantic Web
delta
similarity metrics
Ontologies are used for sharing information and are often collaboratively developed. They are adapted for different applications and domains resulting in multiple versions of an ontology that are caused by changes and refactorings. Quite often, ontology versions (or parts of them) are syntactical very different but semantically equivalent. While there is existing work on detecting syntactical and structural changes in ontologies, there is still a need in analyzing and recognizing ontology changes and refactorings by a semantically comparison of ontology versions. In our approach, we start with a classification of model refactorings found in software engineering for identifying such refactorings in OWL ontologies using DL reasoning to recognize these refactorings.
semantic web
Semantic Recognition of Ontology Refactoring
Semantic Recognition of Ontology Refactoring
I18n of Semantic Web Applications
I18n of Semantic Web Applications
Recently, the use of semantic technologies has gained quite some traction. With increased use of these technologies, their maturation not only in terms of performance, robustness but also with regard to support of non-latin-based languages and regional differences is of paramount importance. In this paper, we provide a comprehensive review of the current state of the internationalization (I18n) of Semantic Web technologies. Since resource identifiers play a crucial role for the Semantic Web, the internatinalization of resource identifiers is of high importance. It turns out that the prevalent resource identification mechanism on the Semantic Web, i.e. URIs, are not sufficient for an efficient internationalization of knowledge bases. Fortunately, with IRIs a standard for international resource identifiers is available, but its support needs much more penetration and homogenization in various semantic web technology stacks. In addition, we review various RDF serializations with regard to their support for internationalized knowledge bases. The paper also contains an in-depth review of popular semantic web tools and APIs with regard to their support for internationalization.
semantic web
Haixun Wang
Haixun Wang
Haixun
a50441eaf6dbeba382c392bfddb9bb5c539fefdb
Converting and Annotating Quantitative Data Tables
Converting and Annotating Quantitative Data Tables
Companies, governmental agencies and scientists produce a large amount of quantitative (research) data, consisting of measurements ranging from e.g. the surface temperatures of an ocean to the viscosity of a sample of mayonnaise. Such measurements are stored in tables in e.g. spreadsheet files and research reports. To integrate and reuse such data, it is necessary to have a semantic description of the data. However, the notation used is often ambiguous, making automatic interpretation and conversion to rdf or other suitable format difficult. For example, the table header cell ``f (Hz)'' refers to frequency measured in Hertz, but the symbol ``f'' can also refer to the unit farad or the quantities force or luminous flux. Current annotation tools for this task either work on less ambiguous data or perform a more limited task. We introduce new disambiguation strategies based on an ont, which allows to improve performance on ``sloppy'' datasets not yet targeted by existing systems.
data interaction
RDF mapping
Linked Data
data management
semantic web
Lieven Trappeniers
Lieven Trappeniers
Trappeniers
d70dad015303d2b7f5bbcfb19489825402e129f5
Metaweb Technologies
Metaweb Technologies
Franz Inc
Franz Inc
Sebastien Ferre
Sebastien Ferre
Sebastien
3f9b46804a8350ee8e3b098dbe208c3abee8bd71
Craig A. Knoblock
Craig A. Knoblock
Craig
2c2715555efac793759255fe12d117541cf52a37
Representing and Querying Validity Time in RDF and OWL: A Logic-Based Approach
Representing and Querying Validity Time in RDF and OWL: A Logic-Based Approach
RDF(S) and OWL 2 currently support only static ontologies. In practice, however, the truth of statements often changes with time, and Semantic Web applications often need to represent such changes and reason about them. In this paper we present a logic-based approach for representing validity time in RDF and OWL. Unlike the existing proposals, our approach is applicable to entailment relations that are not deterministic, such as the Direct Semantics or the RDF-Based Semantics of OWL 2.We also extend SPARQL to temporal RDF graphs and present a query evaluation algorithm. Finally, we present an optimization of our algorithm that is applicable to entailment relations characterized by a set of deterministic rules, such RDF(S) and OWL 2 RL/RDF entailment.
semantic web
Alexander Deleon
Alexander Deleon
Alexander
2b77f881fe9235d50499b1ef3e652a9ad8ed16c5
Birte Glimm
Birte Glimm
Birte
0f8b8da8c426bea774fa0a555d65524e6b3e0363
A General Approach to Query the Web of Data
A General Approach to Query the Web of Data
With the development of the Semantic Web, an increasing amount of data with semantics has been published on the web according to the Linked Data principles and become ubiquitous. The requirement of utilizing the entire web of data to answer a query has arised since the desire for the application of such ubiquitous semantic data sources. However, limited research work has been made on the query above the web of data and there is not a formal way to describe the query processing procedure. In this paper, we propose a general query processing method on the web of data, which contains three steps: data inference configuration, data discovery, result generation and ranking. Finally, we briefly represent the work already done and the future work.
semantic web
Sebastian Schaffert
Sebastian Schaffert
Sebastian
3270f2c58ed51473817c1426bc28ef1d570700e8
Andreas Filler
Andreas Filler
Andreas
e99aa29d5f27b67683031a2585d20c0fd4e18d6d
Behrang Qasemizadeh
Behrang Qasemizadeh
Behrang
44065852bc61f82696e7e3e1c2ab1547531cb94f
Chen Wang
Chen Wang
Chen
14ae99d16e3f588339fc28970e7b81378439811d
Abigail Tarem
Abigail Tarem
Abigail
5b52695450fc5a57e2a645c96904affa35aac214
Generating RDF for Application Testing
Generating RDF for Application Testing
Application testing is a critical component of application development. Testing of Semantic Web applications requires large RDF datasets, conforming to an expected form or schema, and preferably, to an expected data distribution. Finding such datasets often proves impossible, while generating input datasets is often cumbersome. The GRR (Generating Random RDF) system is a convenient, yet powerful, tool for generating random RDF, based on a SPARQLlike syntax. In this poster and demo, we show how large datasets can be easily generated using intuitive commands.
semantic web
Even though its adoption in the enterprise environment lags behind the public domain, semantic (web) technologies, more recently the linked data initiative, started to penetrate into business domain with more and more people recognising the benefit of such technologies. An evident advantage of leveraging semantic technologies is the integration of distributed data sets that benefit companies with a great return of value. Enterprise data, however, present significantly different characteristics from public data on the Internet. These differences are evident in both technical and managerial perspectives. This paper reports a pilot study, carried out in an international organisation, aiming to provide a collaborative workspace for fast and low-overhead data sharing and integration. We believe that the design considerations, study outcomes, and learnt lessons can help making decisions of whether and how one should adopt semantic technologies in similar contexts.
A Case Study of Linked Enterprise Data
A Case Study of Linked Enterprise Data
Vienna University of Technology
Technische Universität Wien
Vienna University of Technology
Technische Universität Wien
Stephan Grimm
Stephan Grimm
Stephan
ee78f26b432f046eeda1857ce5cb072a72cb1b1d
Christian Bizer
Christian Bizer
Christian
50c02ff93e7d477ace450e3fbddd63d228fb23f3
Swansea University
Swansea University
Completeness Guarantees for Incomplete Reasoners
Finn Bacall
Finn Bacall
Finn
12470e0ed5bec40ea0956a16c8add53241bbb3f3
University of Southampton
University of Southampton
Towards Stable Semantic Ontology Measurement
Towards Stable Semantic Ontology Measurement
Stable semantic ontology measurement is crucial to obtain significant and comparable measurement results. In this paper, we present a summary of the definition of ontology measurement stability and the preprocessing for stable semantic ontology measurement from [5]. Meanwhile, we describe two existing ontology metrics. For each of them, we compare their stability from the perspectives of structural and semantic ontology measurements, respectively. The experiments show that some structural ontology measurements may be unusable in cases when we want to compare the measurements of different models, unless the pre-processing of the models is performed.
Cardiff University
Cardiff University
Nanjing University of Aeronautics and Astronautics
Nanjing University of Aeronautics and Astronautics
Justification Oriented Proofs in OWL
semantic web
Justification Oriented Proofs in OWL
Justifications - that is, minimal entailing subsets of an ontology - are currently the dominant form of explanation provided by ontology engineering environments, especially those focused on the Web Ontology Language (OWL). Despite this, there are naturally occurring justifications that can be very difficult to understand. In essence, justifications are merely the premises of a proof and, as such, do not articulate the (often non-obvious) reasoning which connect those premises with the conclusion. This paper presents justification oriented proofs as a potential solution to this problem.
Bruno Kessler Foundation
Fondazione Bruno Kessler
Bruno Kessler Foundation
Fondazione Bruno Kessler
Microsoft Research Asia
Microsoft Research Asia
Umberto Straccia
Umberto Straccia
Umberto
743c2d225f6d5527e252a24abd0abd15caa79ccf
Brett Benyo
Brett Benyo
Brett
b6be2421ad9f1c87c3de0f26c4cce7d5358cb863
Kendall Clark
Kendall Clark
Kendall
1cde8114566a4ec3c99aeee2aab07bebf5cdc768
Yuan Ren
Yuan Ren
Yuan
062915e0dd115e1a14fc06557952592fd694b8a8
John Howse
John Howse
John
8cfc90848ada598bd7461adac4756850bb7dcfe9
Jan Wielemaker
Jan Wielemaker
Jan
0661cb4b50f0c85e78dd296dd033d1b4cd6074a1
There are ontology domain concepts that can be represented according to multiple alternative classification criteria. Current ontology modeling guidelines do not explicitly consider this aspect in the representation of such concepts. To assist with this issue, we examined a domain-specific simplified model for facet analysis used in Library Science. This model produces a Faceted Classification Scheme (FCS) which accounts for the multiple alternative classification criteria of the domain concept under scrutiny. A comparative analysis between a FCS and the Normalisation Ontology Design Pattern (ODP) indicates the existence of key similarities between the elements in the generic structure of both knowledge representation models. As a result, a mapping is identified that allows to transform a FCS into an OWL DL ontology applying the Normalisation ODP. Our contribution is illustrated with an existing FCS example in the domain of "Dishwashing Detergent" that benefits from the outcome of this study.
How to Reuse a Faceted Classification and Put it on the Semantic Web
How to Reuse a Faceted Classification and Put it on the Semantic Web
semantic web
exploration
RExplorator - supporting reusable explorations of Semantic Web Linked Data
RExplorator - supporting reusable explorations of Semantic Web Linked Data
interface
reuse
Semantic Web
RDF
set-based navigation
exploratory search
ontology
This demo presents RExplorator, an environment which allows nontechnically savvy users, but who understand the problem domain, to explore the data until they understand its structure They employ a combination of search, query and faceted navigation in a direct manipulation, query-byexample style interface. In this process, users can reuse previously found solutions by other users, which may accomplish sub-tasks of the problem at hand. It is also possible to create an end-user friendly interface to allow them to access the information. Once a solution has been found, it can be generalized, and optionally made available for reuse by other users. This enables the establishment of a social network of users that share solutions for problems in particular domains (repositories) of interest.
Knowledge Engineering for Historians on the Example of the Catalogus Professorum Lipsiensis
Knowledge Engineering for Historians on the Example of the Catalogus Professorum Lipsiensis
Although the Internet, as an ubiquitous medium for communication, publication and research, already significantly influenced the way historians work, the capabilities of the Web as a direct medium for collaboration in historic research are not much explored. We report about the application of an adaptive, semantics-based knowledge engineering approach for the development of a prosopographical knowledge base on the Web - the Catalogus Professorum Lipsiensis. In order to enable historians to collect, structure and publish prosopographical knowledge an ontology was developed and knowledge engineering facilities based on the semantic data wiki OntoWiki were implemented. The resulting knowledge base contains information about more than 14.000 entities and is tightly interlinked with the emerging Web of Data. For access and exploration by other historians a number of access interfaces were developed, such as a visual SPARQL query builder, a relationship finder and a Linked Data interface. The approach is transferable to other prosopographical research projects and historical research in general, thus improving the collaboration in historic research communities and facilitating the reusability of historic research results.
semantic web
Yoshinobu Kitamura
Yoshinobu Kitamura
Yoshinobu
Evolution of DL-Lite Knowledge Bases
Charles University
Charles University
University of Auckland
University of Auckland
AnQL: SPARQLing up annotated RDF
Semantic Need: Guiding Metadata Annotations by Questions People #ask
Semantic Need: Guiding Metadata Annotations by Questions People #ask
In its core, the Semantic Web is about the creation, collection and interlinking of metadata on which agents can perform tasks for human users. While many tools and approaches support either the creation or usage of semantic metadata, there is neither a proper notion of metadata need, nor a related theory of guidance which metadata should be created. In this paper, we propose to analyze structured queries to help identifying missing metadata. We conduct a study on Semantic MediaWiki (SMW), one of the most popular Semantic Web applications to date, analyzing structured "ask"-queries in public SMWinstances. Based on that, we describe Semantic Need, an extension for SMW which guides contributors to provide semantic annotations, and summarize feedback from an online survey among 30 experienced SMW users.
semantic web
Towards Technology Structure Mining from Scientific Literature
Towards Technology Structure Mining from Scientific Literature
This paper introduces the task of Technology-Structure Mining to support Management of Technology. We propose a linguistic based approach for identification of Technology Interdependence through extraction of technology concepts and relations between them. In addition, we introduce Technology Structure Graph for the task formalization. While the major challenge in technology structure mining is the lack of a benchmark dataset for evaluation and development purposes, we describes steps that we have taken towards providing such a benchmark. The proposed approach is initially evaluated and applied in the domain of Human Language Technology and primarily results are demonstrated. We further explain plans and research challenges for evaluation of the proposed task.
semantic web