Ruben Verborgh’s data

Matches in Ruben’s data for { ?s ?p ?o }

• 978-3-030-81242-3_15 label "A Rewarding Framework for Crowdsourcing to Increase Privacy Awareness".
• 978-3-030-81242-3_15 name "A Rewarding Framework for Crowdsourcing to Increase Privacy Awareness".
• 978-3-030-81242-3_15 authorList b0_b1969.
• 978-3-030-81242-3_15 abstract "Digital applications typically describe their privacy policy in lengthy and vague documents (called PrPs), but these are rarely read by users, who remain unaware of privacy risks associated with the use of these digital applications. Thus, users need to become more aware of digital applications’ policies and, thus, more content about their choices. To raise privacy awareness, we implemented the CAP-A portal, a crowdsourcing platform which aggregates knowledge as extracted from PrP documents and motivates users in performing privacy-related tasks. The Rewarding Framework is one of the most critical components of the platform. It enhances user motivation and engagement by combining features from existing successful rewarding theories. In this work, we describe this Rewarding Framework, and show how it supports users to increase their privacy knowledge level by engaging them to perform privacy-related tasks, such as annotating PrP documents in a crowdsourcing environment. The proposed Rewarding Framework was validated by pilots ran in the frame of the European project CAP-A and by a user evaluation focused on its impact in terms of engagement and raising privacy awareness. The results show that the Rewarding Framework improves engagement and motivation, and increases users’ privacy awareness.".
• 978-3-030-81242-3_15 datePublished "2021".
• 978-3-030-81242-3_15 mainEntityOfPage chrysakis_dbsec_2021.
• 978-3-030-81242-3_15 sameAs 978-3-030-81242-3_15.
• 978-3-030-81242-3_15 isPrimaryTopicOf chrysakis_dbsec_2021.
• 978-3-030-81242-3_15 page chrysakis_dbsec_2021.
• 978-3-030-81242-3_15 number "259".
• 978-3-030-81242-3_15 number "277".
• 978-3-030-81242-3_15 number "12840".
• 978-3-030-81242-3_15 volume "12840".
• 978-3-030-81242-3_15 locator "259".
• 978-3-030-81242-3_15 locator "277".
• 978-3-030-81242-3_15 locator "12840".
• 978-3-030-81242-3_15 volume "12840".
• 978-3-030-81242-3_15 position "12840".
• 978-3-030-81242-3_15 volumeNumber "12840".
• 978-3-030-81242-3_15 endingPage "277".
• 978-3-030-81242-3_15 startingPage "259".
• 978-3-030-81242-3_15 pageEnd "277".
• 978-3-030-81242-3_15 pageStart "259".
• 978-3-030-81242-3_15 pageEnd "277".
• 978-3-030-81242-3_15 pageStart "259".
• 978-3-030-91167-6_5 author me.
• 978-3-030-91167-6_5 author younes_zeboudj.
• 978-3-030-91167-6_5 author heba_aamer.
• 978-3-030-91167-6_5 author bas_ketsman.
• 978-3-030-91167-6_5 author bart_bogaerts.
• 978-3-030-91167-6_5 author me.
• 978-3-030-91167-6_5 creator me.
• 978-3-030-91167-6_5 creator younes_zeboudj.
• 978-3-030-91167-6_5 creator heba_aamer.
• 978-3-030-91167-6_5 creator bas_ketsman.
• 978-3-030-91167-6_5 creator bart_bogaerts.
• 978-3-030-91167-6_5 creator me.
• 978-3-030-91167-6_5 about trust.
• 978-3-030-91167-6_5 about SPARQL.
• 978-3-030-91167-6_5 about World_Wide_Web.
• 978-3-030-91167-6_5 author me.
• 978-3-030-91167-6_5 author younes_zeboudj.
• 978-3-030-91167-6_5 author heba_aamer.
• 978-3-030-91167-6_5 author bas_ketsman.
• 978-3-030-91167-6_5 author bart_bogaerts.
• 978-3-030-91167-6_5 author me.
• 978-3-030-91167-6_5 coparticipatesWith me.
• 978-3-030-91167-6_5 coparticipatesWith younes_zeboudj.
• 978-3-030-91167-6_5 coparticipatesWith heba_aamer.
• 978-3-030-91167-6_5 coparticipatesWith bas_ketsman.
• 978-3-030-91167-6_5 coparticipatesWith bart_bogaerts.
• 978-3-030-91167-6_5 coparticipatesWith me.
• 978-3-030-91167-6_5 type PublicationVolume.
• 978-3-030-91167-6_5 type ScholarlyArticle.
• 978-3-030-91167-6_5 type Article.
• 978-3-030-91167-6_5 type Document.
• 978-3-030-91167-6_5 type Q386724.
• 978-3-030-91167-6_5 type CreativeWork.
• 978-3-030-91167-6_5 type Document.
• 978-3-030-91167-6_5 type Work.
• 978-3-030-91167-6_5 type Document.
• 978-3-030-91167-6_5 P50 me.
• 978-3-030-91167-6_5 P50 younes_zeboudj.
• 978-3-030-91167-6_5 P50 heba_aamer.
• 978-3-030-91167-6_5 P50 bas_ketsman.
• 978-3-030-91167-6_5 P50 bart_bogaerts.
• 978-3-030-91167-6_5 P50 me.
• 978-3-030-91167-6_5 maker me.
• 978-3-030-91167-6_5 maker younes_zeboudj.
• 978-3-030-91167-6_5 maker heba_aamer.
• 978-3-030-91167-6_5 maker bas_ketsman.
• 978-3-030-91167-6_5 maker bart_bogaerts.
• 978-3-030-91167-6_5 maker me.
• 978-3-030-91167-6_5 title "Link Traversal with Distributed Subweb Specifications".
• 978-3-030-91167-6_5 isPartOf proceedings_of_the_5th_international_joint_conference_on_rules_and_reasoning.
• 978-3-030-91167-6_5 name "Link Traversal with Distributed Subweb Specifications".
• 978-3-030-91167-6_5 label "Link Traversal with Distributed Subweb Specifications".
• 978-3-030-91167-6_5 name "Link Traversal with Distributed Subweb Specifications".
• 978-3-030-91167-6_5 topic trust.
• 978-3-030-91167-6_5 topic SPARQL.
• 978-3-030-91167-6_5 topic World_Wide_Web.
• 978-3-030-91167-6_5 subject trust.
• 978-3-030-91167-6_5 subject SPARQL.
• 978-3-030-91167-6_5 subject World_Wide_Web.
• 978-3-030-91167-6_5 authorList b0_b1917.
• 978-3-030-91167-6_5 topic trust.
• 978-3-030-91167-6_5 topic SPARQL.
• 978-3-030-91167-6_5 topic World_Wide_Web.
• 978-3-030-91167-6_5 abstract "Link Traversal–based Query Processing (LTQP), in which a SPARQL query is evaluated over a web of documents rather than a single dataset, is often seen as a theoretically interesting yet impractical technique. However, in a time where the hypercentralization of data has increasingly come under scrutiny, a decentralized Web of Data with a simple document-based interface is appealing, as it enables data publishers to control their data and access rights. While LTQP allows evaluating complex queries over such webs, it suffers from performance issues (due to the high number of documents containing data) as well as information quality concerns (due to the many sources providing such documents). In existing LTQP approaches, the burden of finding sources to query is entirely in the hands of the data consumer. In this paper, we argue that to solve these issues, data publishers should also be able to suggest sources of interest and guide the data consumer towards relevant and trustworthy data. We introduce a theoretical framework that enables such guided link traversal and study its properties. We illustrate with a theoretic example that this can improve query results and reduce the number of network requests.".
• 978-3-030-91167-6_5 datePublished "2021".
• 978-3-030-91167-6_5 mainEntityOfPage bogaerts_rulemlrr_2021.
• 978-3-030-91167-6_5 sameAs 978-3-030-91167-6_5.
• 978-3-030-91167-6_5 isPrimaryTopicOf bogaerts_rulemlrr_2021.
• 978-3-030-91167-6_5 page bogaerts_rulemlrr_2021.
• 978-3-030-91167-6_5 number "62".
• 978-3-030-91167-6_5 number "12851".
• 978-3-030-91167-6_5 number "79".
• 978-3-030-91167-6_5 volume "12851".
• 978-3-030-91167-6_5 locator "62".
• 978-3-030-91167-6_5 locator "12851".

• first
• previous
• next