請用此 Handle URI 來引用此文件:
http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/28750
完整後設資料紀錄
DC 欄位 | 值 | 語言 |
---|---|---|
dc.contributor.advisor | 莊裕澤(Yuh-Jzer Joung) | |
dc.contributor.author | Chin-Che Lin | en |
dc.contributor.author | 林晉徹 | zh_TW |
dc.date.accessioned | 2021-06-13T00:20:47Z | - |
dc.date.available | 2007-07-30 | |
dc.date.copyright | 2007-07-30 | |
dc.date.issued | 2007 | |
dc.date.submitted | 2007-07-27 | |
dc.identifier.citation | [1] FOAF. http://www.foaf-project.org/.
[2] FOAF vocabulary specification. http://xmlns.com/foaf/0.1. [3] Tribe.net. http://www.tribe.net. [4] Lada A. Adamic and Eytan Adar. How to search a social network. Social Networks,27(3):187-203, July 2005. [5] Lada A. Adamic, Rajan M. Lukose, Amit R. Puniyani, and Bernardo A. Huberman. Search in power-law networks. Physical review E, 64(4):046135-046143, September 2001. [6] Peter S. Dodds, Roby Muhamad, and Duncan J. Watts. An Experimental Study of Search in Global Social Networks. Science, 301(5634):827-829, 2003. [7] Gyorgy Frivolt and Maria Bielikov'a. Growing world wide social network by bridging social portals using FOAF. In Proceedings of the fifteenth International Conference on Knowledge Engineering and Knowledge Management Managing Knowledge in a World of Networks (EKAW 2006), 2006. submitted to EKAW 2006. [8] Mark S. Granovetter. The strength of weak ties. The American Journal of Sociology, 78(6):1360-1380, 1973. [9] Caroline Haythornthwaite. Social network analysis: An approach and technique for the study of information exchange. Library and Information Science Research, 18(4):323-342, 1996. [10] David Liben-Nowell, Jasmine Novak, Ravi Kumar, Prabhakar Raghavan, and Andrew Tomkins. Geographic routing in social networks. Proceedings of the National Academy of Sciences of the United States of America, 102(33):11623-11628, August 2005. [11] Filippo Menczer. Growing and navigating the small world web by local content. Proceedings of the National Academy of Sciences of the United States of America, 99(22):14014-14019, 2002. [12] Josep M. Pujol, Ramon Sanguesa, and Jordi Delgado. Extracting reputation in multi agent systems by means of social network topology. In Proceedings of the first international joint conference on Autonomous agents and multiagent systems (AAMAS 2002), pages 467-474, 2002. [13] Oskar Sandberg. Searching a Small World. PhD thesis, Chalmers University, Goteborg, Sweden, 2005. [14] Oskar Sandberg. Distributed Routing in Small-World Networks. In Proceedings of The Eighth Workshop on Algorithm Engineering and Experiments (ALENEX 2006), 2006. [15] John Scott. Social Network Analysis: A Handbook. SAGE Publications, ‾rst edition, 1991. [16] Yi Tang and Liankuan Zhang. INFO: An improving strategy for searching the small world networks. In The IEEE / WIC / ACM International Conference on Web Intellience (WI 2005), pages 54-57. IEEE Computer Society, 2005. [17] Jeffrey Travers and Stanley Milgram. An Experimental Study of the Small World Problem. Sociometry, 32(4):425-443, 1969. [18] Douglas R. White and Michael Houseman. The navigability of strong ties: small worlds, tie strength, and network topology. Complexity, 8(1):72-81, 2002. [19] Bin Yu and Munindar P. Singh. Searching social networks. In Proceedings of the second international joint conference on Autonomous agents and multiagent systems (AAMAS 2003), pages 65-72, New York, NY, USA, 2003. ACM Press. [20] Bin Yu, Mahadevan Venkatraman, and Munindar P. Singh. An adaptive social network for information access: Theoretical and experimental results. Applied Artificial Intelligence. [21] Jun Zhang and Mark S. Ackerman. Searching for expertise in social networks: a simulation of potential strategies. In Proceedings of the international ACM SIGGROUP conference on Supporting group work (SIGGROUP 2005), pages 71-80, New York, NY, USA, 2005. ACM Press. | |
dc.identifier.uri | http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/28750 | - |
dc.description.abstract | 人脈網絡具有可搜尋的特性。藉由其他節點的幫助,我們通常可以只透過鄰近節點的資訊與互動來達成搜尋目的,搜尋過程通常為詢問鄰居一步步找尋答案可能的所在方向。在這樣的模式下,如何挑選合適的下一個傳送節點,成為我們想要探討的議題。此外,人脈網絡富涵人的資料,透過節點之間的互動,這些資料將可以被交換與分析,進而產生更有價值的資訊,考量這些資訊通常將有助於
提升搜尋的成效。 在本論文中,我們想要運用人身上所帶的資訊來幫助搜尋。藉由考量多維度資料的方式,我們可以在不同維度中挑選取出合適的候選人,之後再從這些候選人之中,進一步篩選出我們想要傳送的對象。透過這樣多層篩選的方式,我們最後的選擇傳送對象將可以結合有不同衡量方法的優點,進而提升搜尋成效。而因為節點可以依據他所擁有的資訊來選擇下一個傳送節點,也讓節點多了自主性與彈性。 | zh_TW |
dc.description.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. | en |
dc.description.provenance | Made available in DSpace on 2021-06-13T00:20:47Z (GMT). No. of bitstreams: 1 ntu-96-R94725019-1.pdf: 609739 bytes, checksum: d2370fc7a566cb70aaaa24fa8c22e89d (MD5) Previous issue date: 2007 | en |
dc.description.tableofcontents | Contents
1 Introduction . . . . . . . . . . 1 1.1 Problem Statement . . . . . . . . . . . . . . . . . . .3 1.2 Motivation . . . . . . . . . . . . . . . . . . . . . . 5 1.3 Goal . . . . . . . . . . . . . . . . . . . . . . . . . 6 1.4 Organization of thesis . . . . . . . . . . . . . . . . 6 2 Related Work . . . . . . . . . . 7 2.1 Property of Social Network . . . . . . . . . . . . . . 7 2.2 Searching Strategy . . . . . . . . . . . . . . . . . . 7 2.3 Brief Summary . . . . . . . . . . . . . . . . . . . . .9 3 Simulation Design . . . . . . . .10 3.1 Overview . . . . . . . . . . . . . . . . . . . . . . . 10 3.2 Idea . . . . . . . . . . . . . . . . . . . . . 11 3.3 Data Source . . . . . . . . . . . . . . . . . . . . . .12 3.4 Assumption . . . . . . . . . . . . . . . . . . . . . . 13 3.5 Model . . . . . . . . . . . . . . . . . . . . . . . . .14 3.6 Equation of Similarity . . . . . . . . . . . . . . . . 15 3.7 FOAF . . . . . . . . . . . . . . . . . . . . . . . . . 16 3.8 Data Collection . . . . . . . . . . . . . . . . . . . .18 3.9 Data Preparation . . . . . . . . . . . . . . . . . . . 19 3.10 Need for Information . . . . . . . . . . . . . . . . . 20 3.11 Query Set . . . . . . . . . . . . . . . . . . . . . . 20 3.12 Answer Set . . . . . . . . . . . . . . . . . . . . . .21 3.13 Design of simulation . . . . . . . . . . . . . . . . .22 3.14 Evaluation of Simulation . . . . . . . . . . . . . . .27 3.15 Node Behavior . . . . . . . . . . . . . . . . . . . . 28 4 Experimental Result . . . . . . .29 4.1 Simulation 1 - Score of similarity . . . . . . . . . . 29 4.2 Simulation 2 - Number of dimensional data . . . . . . .32 4.3 Simulation 3 - Limitation of steps . . . . . . . . . . 35 4.4 Simulation 4 - Limitation of message number . . . . . .36 4.5 Simulation 5 - In°uence of location information . . . .37 4.6 Simulation 6 - In°uence of relations between people . .38 5 Conclusion and Future Work . . . 39 5.1 Conclusion . . . . . . . . . . . . . . . . . . . . . . 39 5.2 Future Work . . . . . . . . . . . . . . . . . . . . . .39 Bibliography . . . . . . . . . . . 40 | |
dc.language.iso | en | |
dc.title | 人脈網絡的多重搜尋策略研究 | zh_TW |
dc.title | Multi-Strategy Searching in Social Network | en |
dc.type | Thesis | |
dc.date.schoolyear | 95-2 | |
dc.description.degree | 碩士 | |
dc.contributor.oralexamcommittee | 蔡益坤(Yih-Kuen Tsay),陳炳宇(Bing-Yu Chen),李瑞庭(J.T. Lee) | |
dc.subject.keyword | 人脈網絡,搜尋,搜尋策略,多維度,資料,關鍵字搜尋, | zh_TW |
dc.subject.keyword | Social Network,Search,Searching Strategy,Multi-Dimensional Data,Keyword Search, | en |
dc.relation.page | 41 | |
dc.rights.note | 有償授權 | |
dc.date.accepted | 2007-07-27 | |
dc.contributor.author-college | 管理學院 | zh_TW |
dc.contributor.author-dept | 資訊管理學研究所 | zh_TW |
顯示於系所單位: | 資訊管理學系 |
文件中的檔案:
檔案 | 大小 | 格式 | |
---|---|---|---|
ntu-96-1.pdf 目前未授權公開取用 | 595.45 kB | Adobe PDF |
系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。