東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Building trustworthy recommender sys...

Dartmouth College., Computer Science.

FindBook

Google Book

Amazon

博客來

Building trustworthy recommender systems.

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Building trustworthy recommender systems./
作者:	Zhang, Sheng.
面頁冊數:	170 p.
附註:	Adviser: Fillia S. Makedon.
Contained By:	Dissertation Abstracts International69-10B.
標題:	Computer Science. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3334053
ISBN:	9780549857945

Building trustworthy recommender systems.
Zhang, Sheng.

Building trustworthy recommender systems. - 170 p.

Adviser: Fillia S. Makedon.

Thesis (Ph.D.)--Dartmouth College, 2007.

Efficiency refers to the computational cost of CF algorithms. We propose two efficient algorithms that are able to learn low-dimensional linear models (either unconstrained or non-negativity constrained) from a very large number of ratings.

ISBN: 9780549857945Subjects--Topical Terms:

626642
Computer Science.

Building trustworthy recommender systems.
LDR:02669nam 2200313 a 45 001 853028
005 20100701
008 100701s2007 ||||||||||||||||| ||eng d
020 $a 9780549857945
035 $a (UMI)AAI3334053
035 $a AAI3334053
040 $a UMI $c UMI
100 1 $a Zhang, Sheng. $3 1019185
245 1 0 $a Building trustworthy recommender systems.
300 $a 170 p.
500 $a Adviser: Fillia S. Makedon.
500 $a Source: Dissertation Abstracts International, Volume: 69-10, Section: B, page: 6241.
502 $a Thesis (Ph.D.)--Dartmouth College, 2007.
520 $a Efficiency refers to the computational cost of CF algorithms. We propose two efficient algorithms that are able to learn low-dimensional linear models (either unconstrained or non-negativity constrained) from a very large number of ratings.
520 $a For many users of information systems, "information overload" has become a problem: the amount of information they must sift through has reached the point where it is overwhelming. Collaborative Filtering (CF) techniques, which attempt to predict what information will meet a user's needs based on data coming from similar users, are becoming increasingly popular as ways to combat this information overload. While accuracy has been a major focus of CF, in practice, efficiency, privacy, and reliability are also important issues in CF in order to enhance the performance, security, and robustness of CF systems.
520 $a Privacy-preserving CF provides protection against divulgence of personal information. Ratings (and even their existence) can reveal information about individuals' personal preferences. We introduce two data reconstruction methods to reveal limitations in existing privacy-preserving schemes and propose a new two-way communication scheme to help users preserve more privacy.
520 $a Reliability is the ability to detect and prevent malicious attacks that might make specific items appear more or less popular than they truly are. We describe a series of approaches to detect a diverse and general set of recommendation attacks and demonstrate their effectiveness with data.
520 $a The research work introduced in this thesis will benefit both users and implementers of information access systems. Research results will have significant implications for a variety of adaptive information systems that rely on users' input for learning purposes.
590 $a School code: 0059.
650 4 $a Computer Science. $3 626642
690 $a 0984
710 2 $a Dartmouth College. $b Computer Science. $3 1019183
773 0 $t Dissertation Abstracts International $g 69-10B.
790 $a 0059
790 1 0 $a Makedon, Fillia S., $e advisor
791 $a Ph.D.
792 $a 2007
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3334053