Discovering Meaningful Connections between Resources in the Web of Data

•

6 likes•2,158 views

Slides of LDOW2013 presentation, May 14th, Rio De Janeiro, Brazil We will show that semantically annotated paths lead to discovering meaningful, non-trivial relations and connections between multiple resources in large online datasets such as the Web of Data. Graph algorithms have always been key in pathfinding applications (e.g., navigation systems). They make optimal use of available computation resources to find paths in structured data. Applying these algorithms to Linked Data can facilitate the resolving of complex queries that involve the semantics of the relations between resources. In this paper, we introduce a new approach for finding paths in Linked Data that takes into account the meaning of the connections and also deals with scalability. An efficient technique combining pre-processing and indexing of datasets is used for finding paths between two resources in largedatasets within a couple of seconds. To demonstrate our approach, we have implemented a testcase using the DBpedia dataset.

Technology Business

ELIS – Multimedia Lab
Discovering Meaningful Connections between
Resources in the Web of Data
Everything is connected: behind the scenes
Laurens De Vocht
Sam Coppens, Miel Van der Sande, Ruben Verborgh, Erik Mannens, Rik Van de Walle

ELIS – Multimedia Lab
Barack Obama
?
Paris Barack ObamaBertrand
Delanoë
Catholic
Church
Joe Biden
mayor religion religion of vicepresident of
Query
Result
Paris
Everything is Connected

ELIS – Multimedia Lab
Reource
Description
Resource
Lookup
Pathfinding
Resource
Description
Everything is Connected

ELIS – Multimedia Lab
1. Pathfinding
2. Optimizations
3. Performance Evaluation
4. Future Work & Discussion
Overview

ELIS – Multimedia Lab
Pathfinding
Use of A* Algorithm
Requires:
Adjacency Matrix
Weighted links
Heuristic

ELIS – Multimedia Lab
Pre-processing
RDF Linked Data (NQ)
<http://dbpedia.org/resource/Aristotle>
<http://xmlns.com/foaf/0.1/name>
"Aristotle"@en
<http://en.wikipedia.org/wiki/Aristotle?oldid=494
147695#absolute-line=10> .
…
INCOMING TRIPLES
...
(Triples pointing to subject)
METADATA
http://dbpedia.org/resource/A
ristotle
(subject)
http://en.wikipedia.org/wiki/Ar
istotle?oldid=494147695#ab
solute-line=10
(context)
OUTGOING TRIPLES
<http://dbpedia.org/resource/Aristotle>
<http://xmlns.com/foaf/0.1/name>
"Aristotle"@en
...
(Triples subjects points to)

ELIS – Multimedia Lab
Pre-processing
SIREn
Indexing

ELIS – Multimedia Lab
Adjacency Matrix Initialisation
Paris Barack Obama
Betrand Delanoë
France
...
Joe Biden
...
United States
global set of all
resources increases
every iteration

ELIS – Multimedia Lab
Adjacency Matrix Initialisation
List indices correspond with row/column numbers in adjacency matrix
Generation of list of all resources

ELIS – Multimedia Lab
Weighted Links
Weight encourage rare nodes in paths (Moore et al.)

ELIS – Multimedia Lab
Heuristic
Heuristic: Jaccard distance
measures dissimilarity between sample sets
FranceParis
:monument
:mayor
:language :capital

ELIS – Multimedia Lab
Node centrality based rank reduction
Blacklisting irrelevant links
Optimizations

ELIS – Multimedia Lab
HITRATE
COMPLEXITY
EXECUTION TIME
Performance Evaluation

ELIS – Multimedia Lab
Hitrate above 90%
Testset of 10 000 paths
among 200 popular cities, artists and countries
in DBPedia (10M entities)

ELIS – Multimedia Lab
Exponential space complexity

ELIS – Multimedia Lab
Linear time complexity

ELIS – Multimedia Lab
Over 60% of paths found in less than 2000ms

ELIS – Multimedia Lab
Synchronisation
Index <> Source Repositories/Endpoints
Performance
Further improve iterative reduction
(selection of potentially relevant entities)
Personalization
Adapt blacklist, heuristic and link weights to user preference and context
Future Work & Discussion

ELIS – Multimedia Lab
Optimized pathfinding for
linked data to obtain
meaningful results.
Results within a tolerable time
for users.
Conclusions
http://pathfinding.restdesc.org
http://www.everythingisconnected.be
@laurens_d_v #mmlab
laurens.devocht@ugent.be
http://slideshare.net/laurensdv
http://semweb.mmlab.be/
Contact

"On chemical structures, substances, nanomaterials and measurements" Nina Jeliazkova, Ideaconsult This talk attempts to highlight how I came to recognize the fundamental role of measurements, coming from the realm of data modelling and data analysis. Besides retaining the data provenance it provides insights how do we go beyond chemical structures and address the challenges of representing the identity of chemical substances and nanomaterials (with examples from the latest developments of AMBIT web services and OpenTox API). Finally, supporting the vision of distributed, open, web-like approach towards recording subtle experimental details is essential, not only for the chemists and biologists in the labs, but for all of us using, modelling, storing and querying the data. Presented July 14,2014 in Cambridge , UK Defining the Future for Open Notebook Science – A Memorial Symposium Celebrating the Work of Jean-Claude Bradley http://inmemoriamjcb.wikispaces.com/Jean-Claude+Bradley+Memorial+Symposium

towards interoperable archives: the Universal Preprint Service initiativeHerbert Van de Sompel

The aDORe Federation ArchitectureHerbert Van de Sompel

The OAI ORE Project

Eduserv Foundation

Ariadne: Report on Thesauri and Taxonomies

ariadnenetwork

Web Data Management in the RDF Age

M. Tamer Özsu

Devry proj 586 week 1 quiz new

uopassignment

Using Triple Pattern Fragments To Enable Streaming of Top-k Shortest Paths vi...

Laurens De Vocht

Searching for relationships between Linked Data resources is typically interpreted as a pathfinding problem: looking for chains of intermediary nodes (hops) forming the connection or bridge between these resources in a single dataset or across multiple datasets. In many cases centralizing all needed linked data in a certain (specialized) repository or index to be able to run the algorithm is not possible or at least not desired. To address this, we propose an approach to top-k shortest pathfinding, which optimally translates a pathfinding query into se- quences of triple pattern fragment requests. Triple Pattern Fragments were recently introduced as a solution to address the availability of data on theWeb and the scalability of linked data client applications, preventing data processing bottlenecks on the server. The results are streamed to the client, thus allowing clients to do asynchronous processing of the top-k shortest paths. We explain how this approach behaves using a training dataset, a subset of DBpedia with 10 million triples, and show the trade-offs to a SPARQL approach where all the data is gathered in a single triple store on a single machine. Furthermore we investigate the scalability when increasing the size of the subset up to 110 million triples. Software Package (NodeJS): npmjs.com/package/everything_is_connected_engine

Based upon findings and results from our recent research we propose a generic framework concept for researcher profiling with appliance to the areas of ”Science 2.0” and ”Research 2.0”. Intensive growth of users in social networks, such as Twitter generated a vast amount of information. It has been shown in many previous works that social networks users produce valuable content for profiling and recommendations. Our research focuses on identifying and locating experts for specific research area or topic. In our approach we apply semantic technologies like (RDF, SPARQL), common vocabularies (SIOC , FOAF, MOAT, Tag Ontology) and Linked Data (GeoNames , COLINDA).

Aligning Web Collaboration Tools with Research Data for Scholars

Laurens De Vocht

Resources for research are not always easy to explore, and rarely come with strong support for identifying, linking and selecting those that can be of interest to scholars. In this work we introduce a model that uses state-of-the-art semantic technologies to interlink structured research data and data from Web collaboration tools, social media and Linked Open Data. We use this model to build a platform that connects scholars, using their proles as a starting point to explore novel and relevant content for their research. Scholars can easily adapt to evolving trends by synchronizing new social media accounts or collaboration tools and integrate then with new datasets. We evaluate our approach by a scenario of personalized exploration of research repositories where we analyze real world scholar profiles and compare them to a reference profile.

Providing Interchangeable Open Data to Accelerate Development of Sustainable ...

Laurens De Vocht

Travelers expect access to tourism information at anytime, anywhere, with any media. Mobile tourism guides, accessible via the Web, provide an omnipresent approach to this. Thereby it is expensive and not trivial to (re)model, translate and transform data over and over. This inhibits many players, including governments, in developing such applications. We report on our experience in running a project on mobile tourism in Flanders, Belgium where we develop a methodology and reusable formalization for the data disclosure. We apply open data standards to achieve a reusable and interoperable datahub for mobile tourism. We organized working groups resulting in a re-usable formal specification and serialization of the domain model that is immediately usable for building mobile tourism applications. This increased the awareness and lead to semantic convergence which is forming a regional foundation to develop sustainable mobile guides for tourism.

Researcher Profiling based on Semantic Analysis in Social Networks

Laurens De Vocht

We propose a framework to address an important challenge in the context of the ongoing adoption of the “Web 2.0” in science and research, often referred to as “Research 2.0”. Microblogging is one of the trends with increasing leverage. The challenge in this thesis is to connect users of microblogging services such as Twitter based on specific common entities that are representative and truly matter to them. We investigated the possibilities of using social data for locating an expert who shares a very specific research topic. To enrich and verify this social data we link such content to existing open data provided by the online community. We are using semantic technologies (RDF ,SPARQL), common ontologies (SIOC, FOAF, DublinCore, SWRC) and Linked Data (DBpedia, GeoNames, CoLinDa) to extract and mine the data about scientific conferences out of context of microblogs. We are identifying users related to each other based on entities such as topics (tags), events, time, locations and persons (mentions). As a proof-of-concept we explain, implement and evaluate such a researcher profiling use case. It involves the development of a framework that focuses on the proposition of researches based on topics and conferences they have in common. This framework provides an API that allows quick access to the analyzed information. A demonstration application: “Researcher Affinity Browser” shows how the API supports developers to build rich internet applications for Research 2.0. This application also intro- duces the concept “affinity” that exposes the implicit proximity between entities and users based on the content users produced. The usability of a demonstration application and the usefulness of the framework itself are investigated with an explicit evaluation question- naire. This user feedback lead to important conclusions about successful achievements and opportunities to further improve this effort.

A Visual Exploration Workflow as Enabler for the Exploitation of Linked Open ...

Laurens De Vocht

Semantically annotating and interlinking Open Data results in Linked Open Data which concisely and unambiguously describes a knowledge domain.However, the uptake of the Linked Data depends on its usefulness to non-Semantic Web experts. Failing to support data consumers understanding the added-value of Linked Data and possible exploitation opportunities could inhibit its diffusion. In this paper, we propose an interactive visual workflow for discovering and exploring Linked Open Data. We implemented the workflow considering academic library metadata and carried out a qualitative evaluation. We assessed the workflow’s potential impact on data consumers which bridges the offer as published Linked Open Data, and the demand as requests for: (i) higher quality data; and (ii) more applications that re-use data. More than 70% of the 34 test users agreed that the workflow fulfills its goal: it facilitates non-Semantic Web experts to understand the potential of Linked Open Data

Big Linked Data ETL Benchmark on Cloud Commodity Hardware

Laurens De Vocht

Linked Data storage solutions often optimize for low latency querying and quick responsiveness. Meanwhile, in the back-end, offline ETL processes take care of integrating and preparing the data. In this paper we explain a workflow and the results of a benchmark that examines which Linked Data storage solution and setup should be chosen for different dataset sizes to optimize the cost-effectiveness of the entire ETL process. The benchmark executes diversified stress tests on the storage solutions. The results include an in-depth analysis of four mature Linked Data solutions with commercial support and full SPARQL 1.1 compliance. Whereas traditional benchmarks studies generally deploy the triple stores on premises using high-end hardware, this benchmark uses publicly available cloud machine images for reproducibility and runs on commodity hardware. All stores are tested using their default configuration. In this setting Virtuoso shows the best performance in general. The other tree stores show competitive results and have disjunct areas of excellence. Finally, it is shown that each store’s performance heavily depends on the structural properties of the queries, giving an indication of where vendors can focus their optimization efforts.

Benchmarking the Effectiveness of Associating Chains of Links for Exploratory...

Laurens De Vocht

Linked Data offers an entity-based infrastructure to resolve indirect relations between resources, expressed as chains of links. If we could benchmark how effective retrieving chains of links from these sources is, we can motivate why they are a reliable addition for exploratory search interfaces. A vast number of applications could reap the benefits from encouraging insights in this field. Especially all kinds of knowledge discovery tasks related for instance to ad-hoc decision support and digital assistance systems. In this paper, we explain a benchmark model for evaluating the effectiveness of associating chains of links with keyword-based queries. We illustrate the benchmark model with an example case using academic library and conference metadata where we measured precision involving targeted expert users and directed it towards search effectiveness. This kind of typical semantic search engine evaluation focusing on information retrieval metrics such as precision is typically biased towards the final result only. However, in an exploratory search scenario, the dynamics of the intermediary links that could lead to potentially relevant discoveries are not to be neglected.

Effect of Heuristics on Serendipity in Path-Based Storytelling with Linked Data

Laurens De Vocht

Path-based storytelling with Linked Data on the Web provides users the ability to discover concepts in an entertaining and educational way. Given a query context, many state-of-the-art pathfinding approaches aim at telling a story that coincides with the user’s expectations by investigating paths over Linked Data on the Web. By taking into account serendipity in storytelling, we aim at improving and tailoring existing approaches towards better fitting user expectations so that users are able to discover interesting knowledge without feeling unsure or even lost in the story facts. To this end, we propose to optimize the link estimation between - and the selection of facts in a story by increasing the consistency and relevancy of links between facts through additional domain delineation and refinement steps. In order to address multiple aspects of serendipity, we propose and investigate combinations of weights and heuristics in paths forming the essential building blocks for each story. Our experimental findings with stories based on DBpedia indicate the improvements when applying the optimized algorithm.

OSLO: Open Standards for Linked Organizations

Laurens De Vocht

Each government level uses its own different information system. At the same time citizens expect that these governmental levels adopt a user-centric approach and provide instant access to their data or to open government data. Therefore the applications at various government levels need to be interoperable in support of the ‘once only-principle’: data is inputted and registered only once and then reused. Given government budget constraints and the cost and complexity of (re)modeling, translating and transforming data over and over, public administrations need to reduce interoperability costs. This is achieved by semantically aligning information between the different information systems of each government level. Semantical interoperable systems facilitate citizen-centered e-government services. This paper illustrates how the Open Standards for Linked Organizations program (OSLO) paved the way bottom-up from a broad basis of stakeholders towards a government-endorsed strategy. OSLO applied a generic process and methodology and provided practical insights on how to overcome the encountered hurdles: political support and adoption; reaching semantic agreement. The lessons learned in the region of Flanders (Belgium) can speed-up the process in other countries that face the complexity of integrating information intensive processes between different applications, administrations and government levels.

Linked Open Data Visualization

Laura Po

ISSA: Generic Pipeline, Knowledge Model and Visualization tools to Help Scien...

Franck Michel

Mapping the European(a) metadata landscape

Sally Chambers

ALIAOnline Practical Linked (Open) Data for Libraries, Archives & MuseumsJon Voss

semantic and social (intra)webs

Fabien Gandon

Opening up MOOCs for OER management on the Web of linked data

Gilbert Paquette

Semantic Web in Action

Sebastian Ryszard Kruk

Current metadata landscape in the library world Getaneh Alemu

Getaneh Alemu

This workshop was presented at MTSR-2017 (Nov. 27, 2017) in Tallinn, Estonia http://www.mtsr-conf.org/index.php/programme The workshop aims to bring the current metadata landscape in libraries in context, with particular emphasis on emerging theory/principles and best practices covering: • The theory of enriching and filtering • Metadata enriching through RDA (Hands on - The RDA Toolkit and implementation of RDA at Southampton Solent University) • Metadata filtering through FRBR (practical issues that cataloguers face in FRBRising their catalogue) • Metadata management (metadata quality, authority control and subject headings) • Metadata systems, tools and applications (practical issues of e-books and database cataloguing)

I Linked Open Data nei Beni Culturali, alcuni progetti e casi di studio

CulturaItalia

Stream Reasoning - where we got so far 2011.1.18 Oxford Key NoteEmanuele Della Valle

Harmony project - JISC Synthesis meeting 2001

Dan Brickley

Linked Open Data for Cultural Heritage

Noreen Whysel

This paper surveys the landscape of linked open data projects in cultural heritage, exam- ining the work of groups from around the world. Traditionally, linked open data has been ranked using the five star method proposed by Tim Berners-Lee. We found this ranking to be lacking when evaluating how cultural heritage groups not merely develop linked open datasets, but find ways to used linked data to augment user experience. Building on the five-star method, we developed a six-stage life cycle describing both dataset development and dataset usage. We use this framework to describe and evaluate fifteen linked open data projects in the realm of cultural heritage.

Viewers also liked

The DataTank, RML and Domain Modelling

Laurens De Vocht

A Framework Concept for Profiling Researchers on Twitter using the Web of Data

Laurens De Vocht

Aligning Web Collaboration Tools with Research Data for Scholars

Laurens De Vocht

Providing Interchangeable Open Data to Accelerate Development of Sustainable ...

Laurens De Vocht

Researcher Profiling based on Semantic Analysis in Social Networks

Laurens De Vocht

A Visual Exploration Workflow as Enabler for the Exploitation of Linked Open ...

Laurens De Vocht

Big Linked Data ETL Benchmark on Cloud Commodity Hardware

Laurens De Vocht

Benchmarking the Effectiveness of Associating Chains of Links for Exploratory...

Laurens De Vocht

Effect of Heuristics on Serendipity in Path-Based Storytelling with Linked Data

Laurens De Vocht

OSLO: Open Standards for Linked Organizations

Laurens De Vocht

Viewers also liked (10)

The DataTank, RML and Domain Modelling

A Framework Concept for Profiling Researchers on Twitter using the Web of Data

Aligning Web Collaboration Tools with Research Data for Scholars

Providing Interchangeable Open Data to Accelerate Development of Sustainable ...

Researcher Profiling based on Semantic Analysis in Social Networks

A Visual Exploration Workflow as Enabler for the Exploitation of Linked Open ...

Big Linked Data ETL Benchmark on Cloud Commodity Hardware

Benchmarking the Effectiveness of Associating Chains of Links for Exploratory...

Effect of Heuristics on Serendipity in Path-Based Storytelling with Linked Data

OSLO: Open Standards for Linked Organizations

Similar to Discovering Meaningful Connections between Resources in the Web of Data

Linked Open Data Visualization

Laura Po

ISSA: Generic Pipeline, Knowledge Model and Visualization tools to Help Scien...

Franck Michel

Mapping the European(a) metadata landscape

Sally Chambers

ALIAOnline Practical Linked (Open) Data for Libraries, Archives & MuseumsJon Voss

semantic and social (intra)webs

Fabien Gandon

Opening up MOOCs for OER management on the Web of linked data

Gilbert Paquette

Semantic Web in Action

Sebastian Ryszard Kruk

Current metadata landscape in the library world Getaneh Alemu

Getaneh Alemu

I Linked Open Data nei Beni Culturali, alcuni progetti e casi di studio

CulturaItalia

Stream Reasoning - where we got so far 2011.1.18 Oxford Key NoteEmanuele Della Valle

Harmony project - JISC Synthesis meeting 2001

Dan Brickley

Linked Open Data for Cultural Heritage

Noreen Whysel

Linked Data at the Open University: From Technical Challenges to Organization...

Mathieu d'Aquin

2015.05.19 tom de nies - tin can2prov exposing interoperable provenance of ...

tdenies

Europeana and open data

RobinaClayphan

Using EPUB 3 and the Open Web Platform for Enhanced Presentation and Machine-...

Pieter Heyvaert

Open Data Masterclass - Europeana and LOD

Antoine Isaac

Library discovery: past, present and some futures

lisld

IIIF for CNI Spring 2014 Membership Meeting

Tom-Cramer

On the many graphs of the Web and the interest of adding their missing links.

Fabien Gandon

Similar to Discovering Meaningful Connections between Resources in the Web of Data (20)

Linked Open Data Visualization

ISSA: Generic Pipeline, Knowledge Model and Visualization tools to Help Scien...

Mapping the European(a) metadata landscape

ALIAOnline Practical Linked (Open) Data for Libraries, Archives & Museums

semantic and social (intra)webs

Opening up MOOCs for OER management on the Web of linked data

Semantic Web in Action

Current metadata landscape in the library world Getaneh Alemu

I Linked Open Data nei Beni Culturali, alcuni progetti e casi di studio

Stream Reasoning - where we got so far 2011.1.18 Oxford Key Note

Harmony project - JISC Synthesis meeting 2001

Linked Open Data for Cultural Heritage

Linked Data at the Open University: From Technical Challenges to Organization...

2015.05.19 tom de nies - tin can2prov exposing interoperable provenance of ...

Europeana and open data

Using EPUB 3 and the Open Web Platform for Enhanced Presentation and Machine-...

Open Data Masterclass - Europeana and LOD

Library discovery: past, present and some futures

IIIF for CNI Spring 2014 Membership Meeting

On the many graphs of the Web and the interest of adding their missing links.

Recently uploaded

GraphRAG is All You need? LLM & Knowledge Graph

Guy Korland

Guy Korland, CEO and Co-founder of FalkorDB, will review two articles on the integration of language models with knowledge graphs. 1. Unifying Large Language Models and Knowledge Graphs: A Roadmap. https://arxiv.org/abs/2306.08302 2. Microsoft Research's GraphRAG paper and a review paper on various uses of knowledge graphs: https://www.microsoft.com/en-us/research/blog/graphrag-unlocking-llm-discovery-on-narrative-private-data/

Quantum Computing: Current Landscape and the Future Role of APIs

Vlad Stirbu

DevOps and Testing slides at DASA Connect

Kari Kakkonen

Dev Dives: Train smarter, not harder – active learning and UiPath LLMs for do...

UiPathCommunity

💥 Speed, accuracy, and scaling – discover the superpowers of GenAI in action with UiPath Document Understanding and Communications Mining™: See how to accelerate model training and optimize model performance with active learning Learn about the latest enhancements to out-of-the-box document processing – with little to no training required Get an exclusive demo of the new family of UiPath LLMs – GenAI models specialized for processing different types of documents and messages This is a hands-on session specifically designed for automation developers and AI enthusiasts seeking to enhance their knowledge in leveraging the latest intelligent document processing capabilities offered by UiPath. Speakers: 👨‍🏫 Andras Palfi, Senior Product Manager, UiPath 👩‍🏫 Lenka Dulovicova, Product Program Manager, UiPath

By Design, not by Accident - Agile Venture Bolzano 2024

Pierluigi Pugliese

Welocme to ViralQR, your best QR code generator.

ViralQR

Welcome to ViralQR, your best QR code generator available on the market! At ViralQR, we design static and dynamic QR codes. Our mission is to make business operations easier and customer engagement more powerful through the use of QR technology. Be it a small-scale business or a huge enterprise, our easy-to-use platform provides multiple choices that can be tailored according to your company's branding and marketing strategies. Our Vision We are here to make the process of creating QR codes easy and smooth, thus enhancing customer interaction and making business more fluid. We very strongly believe in the ability of QR codes to change the world for businesses in their interaction with customers and are set on making that technology accessible and usable far and wide. Our Achievements Ever since its inception, we have successfully served many clients by offering QR codes in their marketing, service delivery, and collection of feedback across various industries. Our platform has been recognized for its ease of use and amazing features, which helped a business to make QR codes. Our Services At ViralQR, here is a comprehensive suite of services that caters to your very needs: Static QR Codes: Create free static QR codes. These QR codes are able to store significant information such as URLs, vCards, plain text, emails and SMS, Wi-Fi credentials, and Bitcoin addresses. Dynamic QR codes: These also have all the advanced features but are subscription-based. They can directly link to PDF files, images, micro-landing pages, social accounts, review forms, business pages, and applications. In addition, they can be branded with CTAs, frames, patterns, colors, and logos to enhance your branding. Pricing and Packages Additionally, there is a 14-day free offer to ViralQR, which is an exceptional opportunity for new users to take a feel of this platform. One can easily subscribe from there and experience the full dynamic of using QR codes. The subscription plans are not only meant for business; they are priced very flexibly so that literally every business could afford to benefit from our service. Why choose us? ViralQR will provide services for marketing, advertising, catering, retail, and the like. The QR codes can be posted on fliers, packaging, merchandise, and banners, as well as to substitute for cash and cards in a restaurant or coffee shop. With QR codes integrated into your business, improve customer engagement and streamline operations. Comprehensive Analytics Subscribers of ViralQR receive detailed analytics and tracking tools in light of having a view of the core values of QR code performance. Our analytics dashboard shows aggregate views and unique views, as well as detailed information about each impression, including time, device, browser, and estimated location by city and country. So, thank you for choosing ViralQR; we have an offer of nothing but the best in terms of QR code services to meet business diversity!

Assuring Contact Center Experiences for Your Customers With ThousandEyes

ThousandEyes

UiPath Test Automation using UiPath Test Suite series, part 3

DianaGray10

FIDO Alliance Osaka Seminar: The WebAuthn API and Discoverable Credentials.pdf

FIDO Alliance

Free Complete Python - A step towards Data Science

RinaMondal9

Leading Change strategies and insights for effective change management pdf 1.pdf

OnBoard

PHP Frameworks: I want to break free (IPC Berlin 2024)

Ralf Eggert

In this presentation, we examine the challenges and limitations of relying too heavily on PHP frameworks in web development. We discuss the history of PHP and its frameworks to understand how this dependence has evolved. The focus will be on providing concrete tips and strategies to reduce reliance on these frameworks, based on real-world examples and practical considerations. The goal is to equip developers with the skills and knowledge to create more flexible and future-proof web applications. We'll explore the importance of maintaining autonomy in a rapidly changing tech landscape and how to make informed decisions in PHP development. This talk is aimed at encouraging a more independent approach to using PHP frameworks, moving towards a more flexible and future-proof approach to PHP development.

Le nuove frontiere dell'AI nell'RPA con UiPath Autopilot™

UiPathCommunity

In questo evento online gratuito, organizzato dalla Community Italiana di UiPath, potrai esplorare le nuove funzionalità di Autopilot, il tool che integra l'Intelligenza Artificiale nei processi di sviluppo e utilizzo delle Automazioni. 📕 Vedremo insieme alcuni esempi dell'utilizzo di Autopilot in diversi tool della Suite UiPath: Autopilot per Studio Web Autopilot per Studio Autopilot per Apps Clipboard AI GenAI applicata alla Document Understanding 👨‍🏫👨‍💻 Speakers: Stefano Negro, UiPath MVPx3, RPA Tech Lead @ BSP Consultant Flavio Martinelli, UiPath MVP 2023, Technical Account Manager @UiPath Andrei Tasca, RPA Solutions Team Lead @NTT Data

GenAISummit 2024 May 28 Sri Ambati Keynote: AGI Belongs to The Community in O...

Sri Ambati

Key Trends Shaping the Future of Infrastructure.pdf

Cheryl Hung

PCI PIN Basics Webinar from the Controlcase Team

ControlCase

Encryption in Microsoft 365 - ExpertsLive Netherlands 2024

Albert Hoitingh

Elevating Tactical DDD Patterns Through Object Calisthenics

Dorra BARTAGUIZ

After immersing yourself in the blue book and its red counterpart, attending DDD-focused conferences, and applying tactical patterns, you're left with a crucial question: How do I ensure my design is effective? Tactical patterns within Domain-Driven Design (DDD) serve as guiding principles for creating clear and manageable domain models. However, achieving success with these patterns requires additional guidance. Interestingly, we've observed that a set of constraints initially designed for training purposes remarkably aligns with effective pattern implementation, offering a more ‘mechanical’ approach. Let's explore together how Object Calisthenics can elevate the design of your tactical DDD patterns, offering concrete help for those venturing into DDD for the first time!

FIDO Alliance Osaka Seminar: Passkeys and the Road Ahead.pdf

FIDO Alliance

Elizabeth Buie - Older adults: Are we really designing for our future selves?

Nexer Digital

Recently uploaded (20)

GraphRAG is All You need? LLM & Knowledge Graph

Quantum Computing: Current Landscape and the Future Role of APIs

DevOps and Testing slides at DASA Connect

Dev Dives: Train smarter, not harder – active learning and UiPath LLMs for do...

By Design, not by Accident - Agile Venture Bolzano 2024

Welocme to ViralQR, your best QR code generator.

Assuring Contact Center Experiences for Your Customers With ThousandEyes

UiPath Test Automation using UiPath Test Suite series, part 3

FIDO Alliance Osaka Seminar: The WebAuthn API and Discoverable Credentials.pdf

Free Complete Python - A step towards Data Science

Leading Change strategies and insights for effective change management pdf 1.pdf

PHP Frameworks: I want to break free (IPC Berlin 2024)

Le nuove frontiere dell'AI nell'RPA con UiPath Autopilot™

GenAISummit 2024 May 28 Sri Ambati Keynote: AGI Belongs to The Community in O...

Key Trends Shaping the Future of Infrastructure.pdf

PCI PIN Basics Webinar from the Controlcase Team

Encryption in Microsoft 365 - ExpertsLive Netherlands 2024

Elevating Tactical DDD Patterns Through Object Calisthenics

FIDO Alliance Osaka Seminar: Passkeys and the Road Ahead.pdf

Elizabeth Buie - Older adults: Are we really designing for our future selves?

Discovering Meaningful Connections between Resources in the Web of Data

1. ELIS – Multimedia Lab Discovering Meaningful Connections between Resources in the Web of Data Everything is connected: behind the scenes Laurens De Vocht Sam Coppens, Miel Van der Sande, Ruben Verborgh, Erik Mannens, Rik Van de Walle

2. ELIS – Multimedia Lab Barack Obama ? Paris Barack ObamaBertrand Delanoë Catholic Church Joe Biden mayor religion religion of vicepresident of Query Result Paris Everything is Connected

3. ELIS – Multimedia Lab Reource Description Resource Lookup Pathfinding Resource Description Everything is Connected

4. ELIS – Multimedia Lab 1. Pathfinding 2. Optimizations 3. Performance Evaluation 4. Future Work & Discussion Overview

5. ELIS – Multimedia Lab 1. Pathfinding 2. Optimizations 3. Performance Evaluation 4. Future Work & Discussion Overview

6. ELIS – Multimedia Lab Pathfinding Use of A* Algorithm Requires: Adjacency Matrix Weighted links Heuristic

7. ELIS – Multimedia Lab Pre-processing RDF Linked Data (NQ) <http://dbpedia.org/resource/Aristotle> <http://xmlns.com/foaf/0.1/name> "Aristotle"@en <http://en.wikipedia.org/wiki/Aristotle?oldid=494 147695#absolute-line=10> . … INCOMING TRIPLES ... (Triples pointing to subject) METADATA http://dbpedia.org/resource/A ristotle (subject) http://en.wikipedia.org/wiki/Ar istotle?oldid=494147695#ab solute-line=10 (context) OUTGOING TRIPLES <http://dbpedia.org/resource/Aristotle> <http://xmlns.com/foaf/0.1/name> "Aristotle"@en ... (Triples subjects points to)

8. ELIS – Multimedia Lab Pre-processing SIREn Indexing

9. ELIS – Multimedia Lab Pathfinding Use of A* Algorithm Requires:  Adjacency Matrix Weighted links Heuristic

10. ELIS – Multimedia Lab Adjacency Matrix Initialisation Paris Barack Obama Betrand Delanoë France ... Joe Biden ... United States global set of all resources increases every iteration

11. ELIS – Multimedia Lab Adjacency Matrix Initialisation List indices correspond with row/column numbers in adjacency matrix Generation of list of all resources

12. ELIS – Multimedia Lab Pathfinding Use of A* Algorithm Requires:  Adjacency Matrix  Weighted links Heuristic

13. ELIS – Multimedia Lab Weighted Links Weight encourage rare nodes in paths (Moore et al.)

14. ELIS – Multimedia Lab Pathfinding Use of A* Algorithm Requires:  Adjacency Matrix  Weighted links  Heuristic

15. ELIS – Multimedia Lab Heuristic Heuristic: Jaccard distance measures dissimilarity between sample sets FranceParis :monument :mayor :language :capital

16. ELIS – Multimedia Lab 1. Pathfinding 2. Optimizations 3. Performance Evaluation 4. Future Work & Discussion Overview

17. ELIS – Multimedia Lab Node centrality based rank reduction Blacklisting irrelevant links Optimizations

18. ELIS – Multimedia Lab 1. Pathfinding 2. Optimizations 3. Performance Evaluation 4. Future Work & Discussion Overview

19. ELIS – Multimedia Lab HITRATE COMPLEXITY EXECUTION TIME Performance Evaluation

20. ELIS – Multimedia Lab Hitrate above 90% Testset of 10 000 paths among 200 popular cities, artists and countries in DBPedia (10M entities)

21. ELIS – Multimedia Lab Exponential space complexity

22. ELIS – Multimedia Lab Linear time complexity

23. ELIS – Multimedia Lab Over 60% of paths found in less than 2000ms

24. ELIS – Multimedia Lab 1. Pathfinding 2. Optimizations 3. Performance Evaluation 4. Future Work & Discussion Overview

25. ELIS – Multimedia Lab Synchronisation Index <> Source Repositories/Endpoints Performance Further improve iterative reduction (selection of potentially relevant entities) Personalization Adapt blacklist, heuristic and link weights to user preference and context Future Work & Discussion

26. ELIS – Multimedia Lab Optimized pathfinding for linked data to obtain meaningful results. Results within a tolerable time for users. Conclusions http://pathfinding.restdesc.org http://www.everythingisconnected.be @laurens_d_v #mmlab laurens.devocht@ugent.be http://slideshare.net/laurensdv http://semweb.mmlab.be/ Contact

Discovering Meaningful Connections between Resources in the Web of Data

Recommended

Recommended

More Related Content

Viewers also liked

Viewers also liked (10)

Similar to Discovering Meaningful Connections between Resources in the Web of Data

Similar to Discovering Meaningful Connections between Resources in the Web of Data (20)

Recently uploaded

Recently uploaded (20)

Discovering Meaningful Connections between Resources in the Web of Data