Combining flexible queries and knowledge anchors to facilitate the exploration of knowledge graphs

Semantic web and information extraction technologies are enabling the creation of vast information and knowledge repositories, particularly in the form of knowledge graphs comprising entities and the relationships between them. Users are often unfamiliar with the complex structure and vast content of such graphs. Hence, users need to be assisted by tools that support interactive exploration and flexible querying. In this paper we draw on recent work in flexible querying for graph-structured data and identifying good anchors for knowledge graph exploration in order to demonstrate how users can be supported in incrementally querying, exploring and learning from large complex knowledge graphs. We demonstrate our techniques through a case study in the domain of lifelong learning and career guidance

Combining Flexible Queries and Knowledge Anchors to facilitate the exploration of Knowledge Graphs

Semantic web and information extraction technologies are enabling the creation of vast information and knowledge repositories, particularly in the form of knowledge graphs comprising entities and the relationships between them. Users are often unfamiliar with the complex structure and vast content of such graphs. Hence, users need to be assisted by tools that support interactive exploration and flexible querying. In this paper we draw on recent work in flexible querying for graph-structured data and identifying good anchors for knowledge graph exploration in order to demonstrate how users can be supported in incrementally querying, exploring and learning from large complex knowledge graphs. We demonstrate our techniques through a case study in the domain of lifelong learning and career guidance

Evaluating Knowledge Anchors in Data Graphs against Basic Level Objects

The growing number of available data graphs in the form of RDF Linked Da-ta enables the development of semantic exploration applications in many domains. Often, the users are not domain experts and are therefore unaware of the complex knowledge structures represented in the data graphs they in-teract with. This hinders users’ experience and effectiveness. Our research concerns intelligent support to facilitate the exploration of data graphs by us-ers who are not domain experts. We propose a new navigation support ap-proach underpinned by the subsumption theory of meaningful learning, which postulates that new concepts are grasped by starting from familiar concepts which serve as knowledge anchors from where links to new knowledge are made. Our earlier work has developed several metrics and the corresponding algorithms for identifying knowledge anchors in data graphs. In this paper, we assess the performance of these algorithms by considering the user perspective and application context. The paper address the challenge of aligning basic level objects that represent familiar concepts in human cog-nitive structures with automatically derived knowledge anchors in data graphs. We present a systematic approach that adapts experimental methods from Cognitive Science to derive basic level objects underpinned by a data graph. This is used to evaluate knowledge anchors in data graphs in two ap-plication domains - semantic browsing (Music) and semantic search (Ca-reers). The evaluation validates the algorithms, which enables their adoption over different domains and application contexts

Flexible learning systems : an insight into personalised learning systems

Web services are defined as accessible software programs ex- posed through an Internet interface description which enhances client to server requests and are not only easily invoked and consumed but they provide interoperability for applications through Service-Oriented Architectures. The Semantic Web, Web services and Web technologies, have so far been mostly utilised in business models and processes throughout industry. This research paper proposes to show how these emergent technologies are also being exploited for E-learning environments. Such a service applies in fact not only to businesses and the work-place but also to academic settings. The ability to make a provision for flexible, personalised and adaptable services is heavily dependent on Web technologies which need to be moulded into rich, dynamic and active environments based on individual user needs and requirements. The paper aims to highlight ongoing projects in this area offering a brief description of their findings and achievements as well as identify future trends in the areas of flexible learning systems.peer-reviewe

A portal of educational resources: providing evidence for matching pedagogy with technology

The TPACK (Technology, Pedagogy and Content Knowledge) model presents the three types of knowledge that are necessary to implement a successful technology-based educational activity. It highlights how the intersections between TPK (Technological Pedagogical Knowledge), PCK (Pedagogical Content Knowledge) and TCK (Technological Content Knowledge) are not a sheer sum up of their components but new types of knowledge. This paper focuses on TPK, the intersection between technology knowledge and pedagogy knowledge – a crucial field of investigation. Actually, technology in education is not just an add-on but is literally reshaping teaching/learning paradigms. Technology modifies pedagogy and pedagogy dictates requirements to technology. In order to pursue this research, an empirical approach was taken, building a repository (back-end) and a portal (front-end) of about 300 real-life educational experiences run at school. Educational portals are not new, but they generally emphasise content. Instead, in our portal, technology and pedagogy take centre stage. Experiences are classified according to more than 30 categories (‘facets’) and more than 200 facet values, all revolving around the pedagogical implementation and the technology used. The portal (an innovative piece of technology) supports sophisticated ‘exploratory’ sessions of use, targeted at researchers (investigating the TPK intersection), teachers (looking for inspiration in their daily jobs) and decision makers (making decisions about the introduction of technology into schools)

Intelligent Support for Exploration of Data Graphs

This research investigates how to support a user’s exploration through data graphs generated from semantic databases in a way leading to expanding the user’s domain knowledge. To be effective, approaches to facilitate exploration of data graphs should take into account the utility from a user’s point of view. Our work focuses on knowledge utility – how useful exploration paths through a data graph are for expanding the user’s knowledge. The main goal of this research is to design an intelligent support mechanism to direct the user to ‘good’ exploration paths through big data graphs for knowledge expansion. We propose a new exploration support mechanism underpinned by the subsumption theory for meaningful learning, which postulates that new knowledge is grasped by starting from familiar concepts in the graph which serve as knowledge anchors from where links to new knowledge are made. A core algorithmic component for adapting the subsumption theory for generating exploration paths is the automatic identification of Knowledge Anchors in a Data Graph (KADG). Several metrics for identifying KADG and the corresponding algorithms for implementation have been developed and evaluated against human cognitive structures. A subsumption algorithm which utilises KADG for generating exploration paths for knowledge expansion is presented and evaluated in the context of a semantic data browser in a musical instrument domain. The resultant exploration paths are evaluated in a controlled user study to examine whether they increase the users’ knowledge as compared to free exploration. The findings show that exploration paths using knowledge anchors and subsumption lead to significantly higher increase in the users’ conceptual knowledge. The approach can be adopted in applications providing data graph exploration to facilitate learning and sensemaking of layman users who are not fully familiar with the domain presented in the data graph

Ubiquitous learning architecture to enable learning path design across the cumulative learning continuum

The past twelve years have seen ubiquitous learning (u-learning) emerging as a new learning paradigm based on ubiquitous technology. By integrating a high level of mobility into the learning environment, u-learning enables learning not only through formal but also through informal and social learning modalities. This makes it suitable for lifelong learners that want to explore, identify and seize such learning opportunities, and to fully build upon these experiences. This paper presents a theoretical framework for designing personalized learning paths for lifelong learners, which supports contemporary pedagogical approaches that can promote the idea of a cumulative learning continuum from pedagogy through andragogy to heutagogy where lifelong learners progress in maturity and autonomy. The framework design builds on existing conceptual and process models for pedagogy-driven design of learning ecosystems. Based on this framework, we propose a system architecture that aims to provide personalized learning pathways using selected pedagogical strategies, and to integrate formal, informal and social training offerings using two well-known learning and development reference models; the 70:20:10 framework and the 3–33 model

Integrating and querying linked datasets through ontological rules

The Web of Linked Open Data has developed from a few datasets in 2007 into a large data space containing billions of RDF triples published and stored in hundreds of independent datasets, so as to form the so called Linked Open Data Cloud. This information cloud, ranging over a wide set of data domains, poses a challenge when it comes to reconciling heterogeneous schemas or vocabularies adopted by data publishers. Motivated by this challenge, in this thesis was address the problem of integrating and querying multiple heterogeneous Linked Data sets through ontological rules. Firstly, we propose a formalisation of the notion of a peer-to-peer Linked Data integration system, where the mappings between peers comprise schema-level mappings and equality constraints between different IRIs; we call this formalism an RDF Peer System(RPS). We show that the semantics of the mappings preserve tractability of answering Basic Graph Pattern (BGP) SPARQL queries against the data stored in the RDF sources and the set of constraints given by the RPS mappings. Then, we address the problem of SPARQL query rewriting under RPSs and we show that it is not possible to rewrite an input BGP SPARQL query into a SPARQL 1.0 query under general RPSs, as the RPS peer mappings are not first-order-rewritable rules; this is a major drawback of general RPSs since data materialisation is required to exploit their full semantics. With the adoption of the more recent standard SPARQL 1.1 and its property paths we are able to extend the expressivity of the target language beyond first-order by including regular expressions in the body of the target SPARQL queries, that is, by expressing conjunctive two-way regular path queries (C2RPQs). Following this idea, in the second part of the thesis we step away from the language of RPSs to conduct a study on C2RPQ-rewritability under a broader ontology language. We define [ELHI`inh] (harmless linear ELHI), an ontology language that generalises both the DL-Lite[R] and linear ELH description logics. We prove the rewritability of instance queries (queries with a single atom in their body) under [ELHI`inh] knowledge bases with C2RPQs as the target language, presenting a query rewriting algorithm that makes use of non-deterministic finite-state automata. Following from that, we propose a query rewriting algorithm for answering conjunctive queries under [ELHI`inh] knowledge bases, with C2RPQs as the target language. Since C2RPQs can be straightforwardly expressed in SPARQL 1.1 by means of property paths, we believe that our approach is directly applicable to real-world querying settings. Lastly, we undertake a complexity analysis for query answering under [ELHI`inh]. We analyse the computational cost of query answering in terms of both data complexity (where the ontology and the query are fixed and the data alone is a variable input)and combined complexity (where query, ontology and data all constitute the variable input). We show that answering instance queries under [ELHI`inh] is NLogSpace-complete for data complexity and in PTime for combined complexity; we also show that answering CQs under [ELHI`inh] is NLogSpace-complete for data complexity and NP-complete for combined complexity

Applications of flexible querying to graph data

Graph data models provide flexibility and extensibility that makes them well-suited to modelling data that may be irregular, complex, and evolving in structure and content. However, a consequence of this is that users may not be familiar with the full structure of the data, which itself may be changing over time, making it hard for users to formulate queries that precisely match the data graph and meet their information seeking requirements. There is a need therefore for flexible querying systems over graph data that can automatically make changes to the user's query so as to find additional or different answers, and so help the user to retrieve information of relevance to them. This chapter describes recent work in this area, looking at a variety of graph query languages, applications, flexible querying techniques and implementations