跳到主要內容

臺灣博碩士論文加值系統

(18.205.192.201) 您好!臺灣時間:2021/08/06 04:17
字體大小: 字級放大   字級縮小   預設字形  
回查詢結果 :::

詳目顯示

我願授權國圖
: 
twitterline
研究生:巫志彰
研究生(外文):Chih-Chang Wu
論文名稱:社會網路中網路結構與使用者維度之搜尋策略
論文名稱(外文):Structural and Dimensional Search in Social Networks
指導教授:莊裕澤莊裕澤引用關係
指導教授(外文):Yuh-Jzer Joung
學位類別:碩士
校院名稱:國立臺灣大學
系所名稱:資訊管理學研究所
學門:電算機學門
學類:電算機一般學類
論文種類:學術論文
論文出版年:2008
畢業學年度:97
語文別:中文
論文頁數:77
中文關鍵詞:社會網路搜尋相似度網路結構人脈維度
外文關鍵詞:Social NetworkSearchSearch StrategySimilarityNetwork StructureSociabilityDimension
相關次數:
  • 被引用被引用:0
  • 點閱點閱:206
  • 評分評分:
  • 下載下載:0
  • 收藏至我的研究室書目清單書目收藏:0
社會網路是一個透過人與人關係所產生的網路型態,相較於我們所熟悉的網際網路或是電信網路,皆具有許多不同的特徵。在眾多獨特的性質當中,又以小世界現象最受人注目,因為它證明了社會網路存在著短路徑,亦即即使網路中存在著數以萬計的節點,兩節點之間依然可以在少數幾次傳遞後接觸到彼此。這個發現為各類網路研究提供了一個新的思維並使我們不得不回頭檢視現存的網路中是否同樣具有相似的現象以求找出其成因來提高現有網路的運作效率以及容錯能力。
社會網路搜尋透過社會網路中的關係來尋找各種不同的資訊,常見的專家系統就是一種類似的搜尋方法。然而,以往大部分的研究僅透過網路結構或使用者維度資訊之一來進行搜尋,因此,我們認為透過結合兩種不同觀點所產生的搜尋方法尚未受到完整驗證。本論文將網路結構特性以及使用者維度資訊透過不同的方式進行組合搭配,並在真實的社會網路中進行模擬實驗以研究兩種觀點在搜尋過程中是否能夠相輔相成、提高效率兼且降低成本。此外,我們也針對答案組特性與搜尋效能之間的關聯進行分析,期望找尋出不易發現但卻可能有助於提高搜尋效能的性質。
第一章 緒論 1
第一節 研究背景 1
第二節 研究動機 3
第三節 研究目標 4
第二章 相關文獻 7
第一節 社會網路簡介 7
2.1.1 小世界現象 7
2.1.2 社會網路特性 9
第二節 社會網路搜尋 13
2.2.1 維度式搜尋策略 13
2.2.2 結構式搜尋策略 15
2.2.3 混合式搜尋策略 17
第三節 總結 19
第三章 系統設計 21
第一節 資料來源 21
第二節 資料萃取 28
3.2.1 使用者維度定義 28
3.2.2 查詢定義 29
3.2.2.1 查詢來源 30
3.2.2.2 查詢分配 33
3.2.2.3 查詢目標 35
第三節 相似度模型 36
第四節 社會網路搜尋模擬 38
3.4.1模擬假設 38
3.4.2 搜尋策略 39
3.4.3 模擬流程 47
第五節 衡量標準 50
第四章 實驗結果 55
第一節 使用者維度搜尋策略實驗結果 55
第二節 網路結構搜尋策略實驗結果 58
第三節 混和型搜尋策略實驗結果 60
第四節 整體衡量 62
第五節 答案組分析 64
4.5.1 維度策略答案組分析 64
4.5.2 結構策略答案組分析 67
4.5.3 混和型策略答案組分析 68
第五章 結論與建議 71
第一節 結論 71
第二節 未來研究方向與建議 71
參考文獻 73
[1]Stefan Bornholdt and Heinz Georg Schuster (2003). Handbook of Graphs and Networks: From the Genome to the Internet. WILEY-VCH GmbH & Co. KGaA, Weinheim.
[2]Watts, D. J., P. S. Dodds, et al. (2002). "Identity and Search in Social Networks." Science 296(5571): 1302.
[3]Travers, J. and S. Milgram (1967). The small world problem. Psychology Today l(May):61-67.
[4]Travers, J. and S. Milgram (1969). "An Experimental Study of the Small World Problem." Sociometry 32(4): 425-443.
[5]Newman, M. E. J. and J. Park (2003). "Why social networks are different from other types of networks." Physical Review E 68(3): 036122.
[6]Granovetter, M. S. (1973). "The Strength of Weak Ties." The American Journal of Sociology 78(6): 1360-1380.
[7]Adamic, L. and E. Adar (2005). "How to search a social network." Social Networks 27(3): 187-203.
[8]Dodds, P. S., R. Muhamad, et al. (2003). "An Experimental Study of Search in Global Social Networks." Science 301(5634): 827-829.
[9]Jun, Z. and S. A. Mark (2005). Searching for expertise in social networks: a simulation of potential strategies. Proceedings of the 2005 international ACM SIGGROUP conference on Supporting group work. Sanibel Island, Florida, USA, ACM.
[10]Chin-Che Lin (2007). Multi-Strategy Searching in Social Network.
[11]Liben-Nowell, D., J. Novak, et al. (2005). "From the Cover: Geographic routing in social networks." Proceedings of the National Academy of Sciences 102(33): 11623-11628.
[12]Kleinberg, J. M. (2000). "Navigation in a small world." Nature 406(6798): 845-845.
[13]Jon, K. (2000). The small-world phenomenon: an algorithm perspective. Proceedings of the thirty-second annual ACM symposium on Theory of computing. Portland, Oregon, United States, ACM.
[14]Bin, Y. and P. S. Munindar (2003). Searching social networks. Proceedings of the second international joint conference on Autonomous agents and multiagent systems. Melbourne, Australia, ACM.
[15]Bernard, H. R., P. D. Killworth, et al. (1982). "Index: An Informant-Defined Experiment in Social Structure." Social Forces 61(1): 99-133.
[16]Friedkin, N. E. (1983). "Horizons of Observability and Limits of Informal Control in Organizations." Social Forces 62(1): 54-77.
[17]Yi, T. and Z. Liankuan (2005). INFO: an improving strategy for searching the small world networks. Web Intelligence, 2005. Proceedings. The 2005 IEEE/WIC/ACM International Conference on.
[18]Hamming, R.W. Error-detecting and error-correcting codes, Bell System Technical Journal, 29(2), 1950, 147-160.
[19]Wasserman, S., Faust, K., Iacobucci, D, and Granovetter, M. Social Network Analysis: Methods and Applications, Cambridge University, 1994, 130--142.
[20]Douglas R. White, M. H. (2002). "The navigability of strong ties: Small worlds, tie strength, and network topology." Complexity 8(1): 72-81.
[21]Tribe.net, http://www.tribe.net/
[22]FOAF Project, http://www.foaf-project.org/
[23]FOAF Vocabulary Specification 0.91, http://xmlns.com/foaf/spec/
[24]Strogatz, S. H. (2001). "Exploring complex networks." Nature 410(6825): 268-276.
[25]Albert, R., H. Jeong, et al. (1999). "Internet: Diameter of the World-Wide Web." Nature 401(6749): 130-131.
[26]Lada, A. A. (1999). The Small World Web. Proceedings of the Third European Conference on Research and Advanced Technology for Digital Libraries, Springer-Verlag.
[27]Ebel, H., L.-I. Mielsch, et al. (2002). "Scale-free topology of e-mail networks." Physical Review E 66(3): 035103.
[28]Watts, D. J. and S. H. Strogatz (1998). "Collective dynamics of ‘small-world‘ networks." Nature 393(6684): 440-442.
[29]Newman, M. E. J. (2001). "Scientific collaboration networks. I. Network construction and fundamental results." Physical Review E 64(1): 016131.
[30]Newman, M. E. J. (2001). "Scientific collaboration networks. II. Shortest paths, weighted networks, and centrality." Physical Review E 64(1): 016132.
[31]Jeong, H., B. Tombor, et al. (2000). "The large-scale organization of metabolic networks." Nature 407(6804): 651.
[32]Andreas Wagner, D. A. F. (2001). "The small world inside large metabolic networks." Proceedings of the Royal Society B: Biological Sciences 268(1478): 1803-1810.
[33]Kogut, B. and G. Walker (2001). "The Small World of Germany and the Durability of National Networks." American Sociological Review 66(3): 317-335.
[34]Chip, M. and N. Van (2004). Analyzing Kleinberg''s (and other) small-world Models. Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing. St. John''s, Newfoundland, Canada, ACM.
[35]Barab, aacute, et al. (1999). "Emergence of Scaling in Random Networks." Science 286(5439): 509-512.
[36]Kochen, M. (ed.) The Small World (Ablex, Norwood, NJ, 1989).
[37]Collins, J. J. and C. C. Chow (1998). "It''s a small world." Nature 393(6684): 409-410.
[38]Adam, P. (2006). Making sense of social networks. CHI ''06 extended abstracts on Human factors in computing systems. Montréal, Québec, Canada, ACM.
[39]Haythornthwaite, C. (1996). "Social network analysis: An approach and technique for the study of information exchange." Library & Information Science Research 18(4): 323-342.
[40]Salton, G., A. Wong, et al. (1975). "A vector space model for automatic indexing." Commun. ACM 18(11): 613-620.
[41]Newman, M. E. J. (2002). "Assortative Mixing in Networks." Physical Review Letters 89(20): 208701.
[42]Adamic, L. A., R. M. Lukose, et al. (2001). "Search in power-law networks." Physical Review E 64(4): 046135.
[43]Wellman, B., J. Salaff, et al. (1996). "COMPUTER NETWORKS AS SOCIAL NETWORKS: Collaborative Work, Telework, and Virtual Community." Annual Review of Sociology 22(1): 213-238.
[44]Wellman, B. (2001). "Computer Networks As Social Networks." Science 293(5537): 2031-2034.
[45]Alan, M., M. Massimiliano, et al. (2007). Measurement and analysis of online social networks. Proceedings of the 7th ACM SIGCOMM conference on Internet measurement. San Diego, California, USA, ACM.
[46]O. Simsek and D. Jensen. Decentralized search in networks using homophily and degree disparity. Proc. 19th International Joint Conference on Artificial Intelligence, 2005.
[47]Gerald Salton and Michael McGill. An Introduction to Modern Information Retrieval. McGraw-Hill, New York, 1983.
[48]Kogut, B. and G. Walker (2001). "The Small World of Germany and the Durability of National Networks." American Sociological Review 66(3): 317-335.
[49]Fernando Vega-Redondo (2007). “Complex Social Networks.” Cambridge University Press.
[50]Zhang, J., J. Tang, et al. (2007). Expert Finding in a Social Network. Advances in Databases: Concepts, Systems and Applications: 1066-1069.
[51]Fu, Y., R. Xiang, et al. (2007). Finding Experts Using Social Network Analysis. Web Intelligence, IEEE/WIC/ACM International Conference on.
[52]Sandberg, O. (2006). "Distributed Routing in Small-World Networks." Proceedings of The Eighth Workshop on Algorithm Engineering and Experiments.
[53]Shi, X., L. A. Adamic, et al. (2007). "Networks of strong ties." Physica A: Statistical Mechanics and its Applications 378(1): 33-47.
[54]Sandberg, O. (2006). "Distributed Routing in Small-World Networks." Proceedings of The Eighth Workshop on Algorithm Engineering and Experiments.
[55]TechCrunch (2008), "Facebook No Longer The Second Largest Social Network.", http://www.techcrunch.com/2008/06/12/facebook-no-longer-the-second-largest-social-network/
[56]Sabidussi, G. (1966). "The centrality index of a graph." Psychometrika 31(4): 581-603.
[57]Linton, C. F. (1977). "A Set of Measures of Centrality Based on Betweenness." Sociometry 40(1): 35-41.
QRCODE
 
 
 
 
 
                                                                                                                                                                                                                                                                                                                                                                                                               
第一頁 上一頁 下一頁 最後一頁 top
無相關期刊