中大學術數位典藏-NCU Institutional Repository-提供博碩士論文、考古題、期刊論文、研究計畫等下載:Item 987654321/106309
English  |  正體中文  |  简体中文  |  Items with full text/Total items : 94201/94201 (100%)
Visitors : 81574851      Online Users : 3274
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version


    Please use this identifier to cite or link to this item: https://ir.lib.ncu.edu.tw/handle/987654321/106309


    Title: Applying hebbian theory to enhance search performance in unstructured social-like peer-to-peer networks
    Authors: 楊鎮華;Huang, Chester S.J.;Yang, Stephen J.H.;Su, Addison Y.S.
    Contributors: 資訊電機學院資訊工程學系
    Keywords: P2P query routing;semantic search;social networks;전자/정보통신공학
    Date: 2012-08-01
    Issue Date: 2026-04-23 13:17:18 (UTC+8)
    Publisher: John Wiley & Sons Inc.;한국전자통신연구원
    Abstract: 摘要: Unstructured peer‐to‐peer (p2p) networks usually employ flooding search algorithms to locate resources. However, these algorithms often require a large storage overhead or generate massive network traffic. To address this issue, previous researchers explored the possibility of building efficient p2p networks by clustering peers into communities based on their social relationships, creating social‐like p2p networks. This study proposes a social relationship p2p network that uses a measure based on Hebbian theory to create a social relation weight. The contribution of the study is twofold. First, using the social relation weight, the query peer stores and searches for the appropriate response peers in social‐like p2p networks. Second, this study designs a novel knowledge index mechanism that dynamically adapts social relationship p2p networks. The results show that the proposed social relationship p2p network improves search performance significantly, compared with existing approaches.
    出版者: 한국전자통신연구원
    出版日期: 2012-08
    出處: ETRI Journal, 2012, 34(4), , pp.591-601
    版權: 2012 ETRI
    識別號: ISSN: 1225-6463
    識別號: ISSN: 2233-7326
    識別號: EISSN: 2233-7326
    識別號: DOI: 10.4218/etrij.12.0111.0588
    Appears in Collections:[Department of Computer Science and information Engineering] journal & Dissertation

    Files in This Item:

    File Description SizeFormat
    index.html0KbHTML8View/Open


    All items in NCUIR are protected by copyright, with all rights reserved.

    社群 sharing

    ::: Copyright National Central University. | 國立中央大學圖書館版權所有 | 收藏本站 | 設為首頁 | 最佳瀏覽畫面: 1024*768 | 建站日期:8-24-2009 :::
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - 隱私權政策聲明