東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Decentralized Information Search.

Swaminathan, Neelakantan.

FindBook

Google Book

Amazon

博客來

Decentralized Information Search.

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Decentralized Information Search./
作者:	Swaminathan, Neelakantan.
面頁冊數:	82 p.
附註:	Source: Masters Abstracts International, Volume: 52-02.
Contained By:	Masters Abstracts International52-02(E).
標題:	Computer Science. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=1543683
ISBN:	9781303311772

Decentralized Information Search.
Swaminathan, Neelakantan.

Decentralized Information Search. - 82 p.

Source: Masters Abstracts International, Volume: 52-02.

Thesis (M.S.)--Arizona State University, 2013.

Our research focuses on finding answers through decentralized search, for complex, imprecise queries (such as "Which is the best hair salon nearby?") in situations where there is a spatiotemporal constraint (say answer needs to be found within 15 minutes) associated with the query. In general, human networks are good in answering imprecise queries. We try to use the social network of a person to answer his query. Our research aims at designing a framework that exploits the user's social network in order to maximize the answers for a given query. Exploiting an user's social network has several challenges. The major challenge is that the user's immediate social circle may not possess the answer for the given query, and hence the framework designed needs to carry out the query diffusion process across the network. The next challenge involves in finding the right set of seeds to pass the query to in the user's social circle. One other challenge is to incentivize people in the social network to respond to the query and thereby maximize the quality and quantity of replies. Our proposed framework is a mobile application where an individual can either respond to the query or forward it to his friends.

ISBN: 9781303311772Subjects--Topical Terms:

626642
Computer Science.

Decentralized Information Search.
LDR:03176nam a2200301 4500 001 1959622
005 20140520124448.5
008 150210s2013 ||||||||||||||||| ||eng d
020 $a 9781303311772
035 $a (MiAaPQ)AAI1543683
035 $a AAI1543683
040 $a MiAaPQ $c MiAaPQ
100 1 $a Swaminathan, Neelakantan. $3 2095094
245 1 0 $a Decentralized Information Search.
300 $a 82 p.
500 $a Source: Masters Abstracts International, Volume: 52-02.
500 $a Advisers: Hari Sundaram; Hasan Davulcu.
502 $a Thesis (M.S.)--Arizona State University, 2013.
520 $a Our research focuses on finding answers through decentralized search, for complex, imprecise queries (such as "Which is the best hair salon nearby?") in situations where there is a spatiotemporal constraint (say answer needs to be found within 15 minutes) associated with the query. In general, human networks are good in answering imprecise queries. We try to use the social network of a person to answer his query. Our research aims at designing a framework that exploits the user's social network in order to maximize the answers for a given query. Exploiting an user's social network has several challenges. The major challenge is that the user's immediate social circle may not possess the answer for the given query, and hence the framework designed needs to carry out the query diffusion process across the network. The next challenge involves in finding the right set of seeds to pass the query to in the user's social circle. One other challenge is to incentivize people in the social network to respond to the query and thereby maximize the quality and quantity of replies. Our proposed framework is a mobile application where an individual can either respond to the query or forward it to his friends.
520 $a We simulated the query diffusion process in three types of graphs: Small World, Random and Preferential Attachment. Given a type of network and a particular query, we carried out the query diffusion by selecting seeds based on attributes of the seed. The main attributes are Topic relevance, Replying or Forwarding probability and Time to Respond. We found that there is a considerable increase in the number of replies attained, even without saturating the user's network, if we adopt an optimal seed selection process. We found the output of the optimal algorithm to be satisfactory as the number of replies received at the interrogator's end was close to three times the number of neighbors an interrogator has. We addressed the challenge of incentivizing people to respond by associating a particular amount of points for each query asked, and awarding the same to people involved in answering the query. Thus, we aim to design a mobile application based on our proposed framework so that it helps in maximizing the replies for the interrogator's query by diffusing the query across his/her social network.
590 $a School code: 0010.
650 4 $a Computer Science. $3 626642
650 4 $a Information Science. $3 1017528
650 4 $a Information Technology. $3 1030799
690 $a 0984
690 $a 0723
690 $a 0489
710 2 $a Arizona State University. $b Computer Science. $3 1676136
773 0 $t Masters Abstracts International $g 52-02(E).
790 $a 0010
791 $a M.S.
792 $a 2013
793 $a English
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=1543683