應用海伯理論來改善非結構式社群同儕網路之搜尋效能

以作者查詢圖書館館藏

、以作者查詢臺灣博碩士

、以作者查詢全國書目

、勘誤回報

、線上人數：19

、訪客IP：3.149.24.145

姓名

林建均(Lin Jianjun) 查詢紙本館藏

畢業系所

資訊工程學系

論文名稱

應用海伯理論來改善非結構式社群同儕網路之搜尋效能
(Applying Hebbian theory to improve searching performance in unstructured social-like P2P Networks)

相關論文

★ 應用智慧分類法提升文章發佈效率於一企業之知識分享平台	★ 家庭智能管控之研究與實作
★ 開放式監控影像管理系統之搜尋機制設計及驗證	★ 資料探勘應用於呆滯料預警機制之建立
★ 探討問題解決模式下的學習行為分析	★ 資訊系統與電子簽核流程之總管理資訊系統
★ 製造執行系統應用於半導體機台停機通知分析處理	★ Apple Pay支付於iOS平台上之研究與實作
★ 應用集群分析探究學習模式對學習成效之影響	★ 應用序列探勘分析影片瀏覽模式對學習成效的影響
★ 一個以服務品質為基礎的網際服務選擇最佳化方法	★ 維基百科知識推薦系統對於使用e-Portfolio的學習者滿意度調查
★ 學生的學習動機、網路自我效能與系統滿意度之探討-以e-Portfolio為例	★ 藉由在第二人生內使用自動對話代理人來改善英文學習成效
★ 合作式資訊搜尋對於學生個人網路搜尋能力與策略之影響	★ 數位註記對學習者在線上學習環境中反思等級之影響

檔案

[Endnote RIS 格式]

[Bibtex 格式]

[相關文章]

[文章引用]

[完整記錄]

[館藏目錄]

[檢視]

[下載]

本電子論文使用權限為同意立即開放。
已達開放權限電子全文僅授權使用者為學術研究之目的，進行個人非營利性質之檢索、閱讀、列印。
請遵守中華民國著作權法之相關規定，切勿任意重製、散佈、改作、轉貼、播送，以免觸法。

摘要(中)

為了在同儕網路中要達成搜尋有效性及準確性，因此發展了社群式同儕網路這類新興的技術。從目前相關的社群式同儕網路研究中，本研究發現這些社群式同儕網路的確改善非結構式同儕網路搜尋效率低落的問題。然而，從過去研究者提升非結構式同儕網路搜尋效率的角度來觀察社群式同儕網路，本研究發現有3點因素是影響社群式同儕網路的搜尋效率。1.記錄正確回應節點問題，2.支援語意搜尋問題，3. 維護節點列表問題。因此，本研究發展出一種「社群關聯式同儕網路」，它是利用海伯法(Hebbian Rule)來設計社群式關聯程度機制，這個社群式關聯程度機制就是讓節點與節點之間所形成的人際互動都有權重值。它的重要特色除了達到讓正確回應問題的節點能夠獲得與詢問節點較高的權重值外，還增加了機器學習的能力，讓每一個節點可以在搜尋過後會調整其權重值以增進搜尋效率。

摘要(英)

In order to improve search performance and accuracy, social-like P2P Networks are developed in last years. Our research discover that these methods in social-like P2P Networks can improve search performance in unstructured P2P Networks. However, We find there are three factors that can influence search performance in social-like P2P Networks. First, how to record the peers which have positive response. Second, how to calculate semantic similarity for searching. And third, how to maintain the peer profile. We use Hebbian rule to design the mechanism for calculate the associated weights of peers when they have social interactions, called ‘Associated social-like P2P Networks’. The distinguishing features for improving search performance are the peers with correct responses have higher weights, and adjust the weights by the ability of learning after searching.

關鍵字(中)

★ 語意相似度
★ 社群式同儕網路
★ 同儕網路

關鍵字(英)

★ P2P Network
★ social-like P2P Network
★ semantic similarity

論文目次

摘要 i
ABSTRACT ii
目錄 iii
圖目錄 iv
表目錄 v
1. Introduction 1
2. Related Work 3
2.1 Peer-to-Peer Networks 3
2.1.1 Gnutella 3
2.1.2 Comparisons 3
2.2 Social-Like Peer-to-Peer Networks 4
2.2.1 NeuroGrid Peer-to-Peer Networks 4
2.2.2 Semantic Social Overlay Networks 4
2.2.3 Efficient Social-Like Peer-to-Peer Networks 5
2.2.4 Comparisons 5
3. 社群關聯式同儕網路 7
3.1 Semantic Similarity Rule 7
3.3 Recommend Relation Rule 10
3.4 Degradation Rule 11
3.5 New Peer Rule 12
3.6 Dynamic Expansion Rule 13
4. Experiment 15
4.1 實驗環境設置 15
4.2 實驗結果 16
5. Conclusion 22
6. References 23

參考文獻

[1] A. Rowstron and P. Druschel, "Pastry: Scalable, Distributed Object Location and Routing for Large-scale Peer-to-Peer Systems," in Proc. of IFIP/ACM International Conference on Distributed Systems Platforms, Heidelberg, Germany, November 2001.
[2] ACM. "ACM Computing Classification System," 1998; Available from: http://www.acm.org/class/1998/.
[3] Alexander L¨oser, Steffen Staab, and Christoph Tempich, “Semantic Social Overlay Networks, IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 25, NO. 1, JANUARY 2007
[4] Antonopoulos N, Salter J (2004) Efficient resource discovery in grids and P2P networks. J Internet Res 14:339–346
[5] B. Yang and H. Garcia-Molina. "Improving Search in Peer-to-Peer Networks," in Proceedings of the 22nd IEEE International Conference on Distributed computing Systems (ICDCS), 2002. Vienna, Austria, Jul. 2-5, pp. 5-14.
[6] C. Gkantsidis, M. Mihail, and A. Saberi. "Random Walks in Peer-to-Peer Networks," in Proceedings of 23th AnnualJoint Conference of the IEEE Computer and Communications Societies (Infocom), 2004. Hongkong, China, Mar. 7-11, pp. 120-130.
[7] Christoph Tempich, Steffen Staab, and Adrian Wranik, 2004, REMINDIN’: Semantic Query Routing in Peer-to-Peer Networks based on Social Metaphors, Institute AIFB, University of Karlsruhe D-76128 Karlsruhe, Germany.
[8] Christoph Tempich, Alexander Löser, Jörg Heizmann: Community Based Ranking in Peer-to-Peer Networks. OTM Conferences (2) 2005: 1261-1278
[9] D. Hebb, “The Organization of Behavior, ”New York: Wiley, 1949
[10] D. Tsoumakos and N. Roussopoulos, “A Comparison of Peer-to-Peer Search Methods,” International Workshop on the Web and Databases(WebDB) June 12-13, 2003.
[11] D. Tsoumakos and N. Roussopoulos, "Adaptive Probabilistic Search for Peer-to-Peer Networks," in Proc. of Third International Conference on Peer-to-Peer Computing, Linkoping, Sweden, September 2003.
[12] D. Tsoumakos and N. Roussopoulos. "Analysis and Comparison of P2P Search Methods," in Proceedings of the 1st ACM International Conference on Scalable Information Systems (INFOSCALE), 2006. Hongkong, China, May 30-Jun.
[13] Dejan S. Milojicic, Vana Kalogeraki, Rajan Lukose, Kiran Nagaraja1, Jim Pruyne, Bruno Richard, Sami Rollins, Zhichen Xu, “Peer-to-Peer Computing,” HPL-2002-57 (R.1) July 3rd , 2003
[14] E. Cohen, A. Fiat, and H. Kaplan, "Associative Search in Peer to Peer Networks: Harnessing Latent Semantics," The International Journal of Computer and Telecommunications Networking, 2003, 51(8): pp. 1861-1881.
[15] G. Beydoun, R. Kultchitsky, G. Manasseh, “Evolving semantic web with social navigation,” Expert Systems with Applications, 32(2), February 2007: 265-276
[16] Harry Chiou, Addison Su, Stephen Yang, “Interest-based Peer Selection in P2P Network”, IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing, 2008
[17] I. Stoica, R. Morris, D. Karger, M. F. Kaashoek, and H. Balakrishnan, "Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications," in Proc. of ACM SIGCOMM, San Diego, CA, August 2001.
[18] J.C. Wang, C.C. Chiu, “Recommending trusted online auction sellers using social network analysis,” Expert Systems with Applications, 34(3), April 2008: 1666-1679.
[19] J.K. Kim, H.K. Kim, Y.H. Cho, “A user-oriented contents recommendation system in peer-to-peer architecture,” Expert Systems with Applications, 34(1), January 2008: 300-312.
[20] J. Kleinberg, “Navigation in a small world,” Nature, no. 406, p. 845, 2000.
[21] J. Li and S. Vuong. "An Efficient Clustered Architecture for P2P Networks," in Proceedings of the 18th IEEE International Conference on Advanced Information Networking and Applications (AINA), 2004. Fukuoka, Japan, Mar. 29-31, pp. 278-283.
[22] Lu Liu, Nick Antonopoulos, Jie Xu, Duncan Russell, “Investigation of Research towards Efficient Social Peer-to-Peer Networks”, IEEE Computing in the Global Information Technology, 2008
[23] L. Liu, Antonopoulos N, Mackin S "Social peer-to-peer for resource discovery". In: 15th Euromicro international conference on parallel, distributed and network-based processing, Naples, Italy, February 2007. IEEE Computer Society Press, pp 459–466, 2007
[24] L. Liu, N. Antonopoulos, S. Mackin, J. Xu, and D. Russell, "Efficient Resource Discovery in Self-organized Unstructured Peer-to-Peer Networks," Concurrency and Computation: Practice and Experience, in press, 2008.
[25] M.J. Tsai, Y.K. Hung, “Distributed computing power service coordination based on peer-to-peer grids architecture,” Expert Systems with Applications, In Press, available online 13 February 2008.
[26] M. Ripeanu, A. Iamnitchi, and I. Foster, "Mapping the Gnutella Network," IEEE Internet Computing, Jan./Feb., 2002, 6(1): pp. 50-57.
[27] Ozgur D. Sahin, Fatih Emekçi, Divyakant Agrawal, Amr El Abbadi: Content-Based Similarity Search over Peer-to-Peer Systems. DBISP2P 2004: 61-78
[28] N. Griffiths, “Enhancing peer-to-peer collaboration using trust,” Expert Systems with Applications, 31(4), November 2006: 849-858.
[29] N.T. Borch. "Improving Semantic Routing Efficiency," in Proceedings of the 2nd IEEE International Workshop on Hot Topics in Peer-to-Peer Systems (HOT-P2P), 2005. San Diego, CA, USA, Jul. 21, pp. 80-86.
[30] Peter Haase, Ronny Siebes, and Frank van Harmelen, 2005, Expertise-based peer selection in Peer-to-Peer networks, Institute AIFB, University of Karlsruhe, 76128 Karlsruhe, Germany, Department of Computer Science, Vrije Universiteit Amsterdam, De Boelelaan 1081, 1081HV, The Netherlands
[31] Pleng Chirawatkul, Gerhard Weikum, Sebastian Michel Matthias Bender, “Structured Peer-to-Peer Search to build a Bibliogaphic Paper Recommendation System”, degree of Master of Science October,2006
[32] Q. Lv, P. Cao, E. Cohen, K. Li, and S. Shenker. "Search and Replication in Unstructured Peer-to-Peer Networks," in Proceedings of the ACM International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS), 2002. Marina Del Rey, CA, USA, 258-259, pp. Jun. 15-19.
[33] Rhea S, Gells D, Roscoe T, Kubiatowicz J (2004) Handling churn in a DHT. In: The USENIX annual technical conference, Boston, MA, June 2004
[34] Robert A. Ghanea-Hercock, Fang Wang, and Yaoru Sun, “Self-Organizing and Adaptive Peer-to-Peer Network,” IEEE Transactions on Systems, Man, and Cybernetics – part B: Cybernetics, Vol. 36, No. 6, December 2006.
[35] S. Joseph, "NeuroGrid: Semantically Routing Queries in Peer-to-Peer Networks," in Proc. of International Workshop on Peer-to-Peer Computing, Pisa, Italy, May 2002.
[36] S. Milgram, “The small world problem,” Psychology Today, vol. 67, no. 1, 1967.
[37] S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker, "A Scalable Content-Addressable Network," in Proc. of ACM SIGCOMM, San Diego, CA, August 2001.
[38] W.S. Yang, J.B. Dia, “Discovering cohesive subgroups from social networks for targeted advertising,” Expert Systems with Applications, 34(3), April 2008: 2029-2038.
[39] X. Tong, D. Zhang, and Z. Yang. "Efficient Content Location Based on Interest-Cluster in Peer-to-Peer System," in Proceedings of IEEE International Conference on e-Business Engineering (ICEBE), 2005. Beijing, China, Oct. 18-20, pp. 324-331.
[40] Y. Li, Z. Bandar, and D. McLean, “An approach for measuring semantic similarity between words using multiple information sources.” IEEE Trans. Knowledge Data Eng., vol. 15, no. 4, 2003
[41] Y.M. Li, C.P. Kao, "TREPPS: A Trust-based Recommender System for Peer Production Services,” Expert Systems with Applications, In Press, available online 21 February 2008.
[42] Yang B, Garcia-Molina H (2004) Efficient search in peer-to-peer networks. In: International conference on distributed computing systems, Vienna, Austria, July 2002

指導教授

楊鎮華(Stephen Yang)

審核日期

2009-7-28

推文