東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Recommender Systems and Information ...

Ulloa, Daniel Alejandro Garcia.

FindBook

Google Book

Amazon

博客來

Recommender Systems and Information Fusion in Spatial Crowdsourcing.

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Recommender Systems and Information Fusion in Spatial Crowdsourcing./
作者:	Ulloa, Daniel Alejandro Garcia.
出版者:	Ann Arbor : ProQuest Dissertations & Theses, : 2018,
面頁冊數:	129 p.
附註:	Source: Dissertations Abstracts International, Volume: 79-11, Section: B.
Contained By:	Dissertations Abstracts International79-11B.
標題:	Information Technology. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=10805132
ISBN:	9780355817935

Recommender Systems and Information Fusion in Spatial Crowdsourcing.
Ulloa, Daniel Alejandro Garcia.

Recommender Systems and Information Fusion in Spatial Crowdsourcing. - Ann Arbor : ProQuest Dissertations & Theses, 2018 - 129 p.

Source: Dissertations Abstracts International, Volume: 79-11, Section: B.

Thesis (Ph.D.)--Emory University, 2018.

This item must not be sold to any third party vendors.

Spatial Crowdsourcing (SC) refers to a series of data collection mechanisms where a set of users with a sensing or computing device are asked to perform a set of tasks at different locations and times. In this work, we explore some of the challenges that arise with SC and propose some solutions. These challenges concern a proper recommendation of tasks to users in such a way that they maximize their expected utility while at the same time maximizing the probability that all the tasks are performed. The utility for the users can be based on the tasks the expected reward they are planning to obtain, and the distance to the assignments. These aspects can be predicted through tensor-factorization techniques. A high-paying assignment might be far from a user, while a low paying assignment is nearby. Depending on the users' preference, we seek to recommend a set of tasks that maximize the user's utility. On the other hand, we also want to maximize the sum of probabilities that the tasks are performed, considering the interdependencies between users. We define the system utility as a convex linear combination of the user and the task utility and suggest approximation methods to recommend the tasks that yield the highest system utility. We also deal with the problem of truth inference, which focuses on integrating the responses from a mobile crowdsourcing scenario and determining the true value. Many times, the answers from a mobile crowdsourcing scenario are noisy, contradicting, or have missing values. We developed a recursive Bayesian system that updates the reputation model of the users, the probability that the users were in the correct time and location, and the probability that the events are true. We further enhanced this algorithm using a Kalman filter that predicts the true state of the event at each time-stamp using a hidden event model and which is updated with the reports from the users. Our method was compared against the naive majority voting method as well as other state-of-the-art truth inference algorithms and our method shows a considerable improvement.

ISBN: 9780355817935Subjects--Topical Terms:

1030799
Information Technology.

Recommender Systems and Information Fusion in Spatial Crowdsourcing.
LDR:03197nmm a2200325 4500 001 2205550
005 20190828120313.5
008 201008s2018 ||||||||||||||||| ||eng d
020 $a 9780355817935
035 $a (MiAaPQ)AAI10805132
035 $a (MiAaPQ)q524jn78d
035 $a AAI10805132
040 $a MiAaPQ $c MiAaPQ
100 1 $a Ulloa, Daniel Alejandro Garcia. $3 3432412
245 1 0 $a Recommender Systems and Information Fusion in Spatial Crowdsourcing.
260 1 $a Ann Arbor : $b ProQuest Dissertations & Theses, $c 2018
300 $a 129 p.
500 $a Source: Dissertations Abstracts International, Volume: 79-11, Section: B.
500 $a Publisher info.: Dissertation/Thesis.
500 $a Xiong, Li.
502 $a Thesis (Ph.D.)--Emory University, 2018.
506 $a This item must not be sold to any third party vendors.
506 $a This item must not be added to any third party search indexes.
520 $a Spatial Crowdsourcing (SC) refers to a series of data collection mechanisms where a set of users with a sensing or computing device are asked to perform a set of tasks at different locations and times. In this work, we explore some of the challenges that arise with SC and propose some solutions. These challenges concern a proper recommendation of tasks to users in such a way that they maximize their expected utility while at the same time maximizing the probability that all the tasks are performed. The utility for the users can be based on the tasks the expected reward they are planning to obtain, and the distance to the assignments. These aspects can be predicted through tensor-factorization techniques. A high-paying assignment might be far from a user, while a low paying assignment is nearby. Depending on the users' preference, we seek to recommend a set of tasks that maximize the user's utility. On the other hand, we also want to maximize the sum of probabilities that the tasks are performed, considering the interdependencies between users. We define the system utility as a convex linear combination of the user and the task utility and suggest approximation methods to recommend the tasks that yield the highest system utility. We also deal with the problem of truth inference, which focuses on integrating the responses from a mobile crowdsourcing scenario and determining the true value. Many times, the answers from a mobile crowdsourcing scenario are noisy, contradicting, or have missing values. We developed a recursive Bayesian system that updates the reputation model of the users, the probability that the users were in the correct time and location, and the probability that the events are true. We further enhanced this algorithm using a Kalman filter that predicts the true state of the event at each time-stamp using a hidden event model and which is updated with the reports from the users. Our method was compared against the naive majority voting method as well as other state-of-the-art truth inference algorithms and our method shows a considerable improvement.
590 $a School code: 0665.
650 4 $a Information Technology. $3 1030799
690 $a 0489
710 2 $a Emory University. $b Computer Science and Informatics. $3 3288066
773 0 $t Dissertations Abstracts International $g 79-11B.
790 $a 0665
791 $a Ph.D.
792 $a 2018
793 $a English
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=10805132