Multi-Strategy Searching in Social Network
Date Issued
2007
Date
2007
Author(s)
Lin, Chin-Che
DOI
en-US
Abstract
Social network has the property that it is searchable. With the help from other nodes, we can search for some resource successfully only by utilizing neighbor's information and interaction between people. The process of searching is often achieved by asking neighbor step by step. Based on this approach, how to choose a appropriate next forwarding target becomes the topic we want to study. Besides, there are rich data about people in social network. By interaction of people, these data can be exchanged and analyzed to extract more information. Considering more people's characteristic or interaction data often can improve the performance of searching.
In this thesis, we want to utilize the information on people when designing searching strategy. By considering multi-dimensional data, we can get some candidates after evaluating neighbors in different dimensional data. Then we can filter these candidates further. By this way, the filtering mechanism let us combine advantages of different evaluation process and then improve the performance of searching. This design also give the node some flexibility because node can decide the next forwarding target based on the information it has.
Subjects
人脈網絡
搜尋
搜尋策略
多維度
資料
關鍵字搜尋
Social Network
Search
Searching Strategy
Multi-Dimensional Data
Keyword Search
Type
other
File(s)![Thumbnail Image]()
Loading...
Name
ntu-96-R94725019-1.pdf
Size
23.31 KB
Format
Adobe PDF
Checksum
(MD5):41f5724a628337fc5370365a492cdb4a