一种P2P系统节点聚类及信息检索算法  

A node clustering and information retrieval algorithm on P2P system

作　　者：李章华[1] 刘高嵩[1] 刘柯萍[1] 

机构地区：[1]中南大学信息科学与工程学院,湖南长沙410075

出　　处：《计算机应用》2007年第4期821-824,共4页journal of Computer Applications

基　　金：湖南省自然科学基金资助项目(03JJY3111)

摘　　要：提出了一种节点聚类及信息检索算法——NCSearch。NCSearch利用Hilbert曲线的局部性特征保持能力,将有相似内容的节点聚类,形成若干个簇。搜索算法能快速定位到与查询最相关的簇,然后在簇内洪泛查找,返回的结果按相关度排序。模拟测试表明,NCSearch稳定高效,相比传统算法在搜索效率方面有明显提高。An efficient node clustering and information retrieval algorithm named NCSearch was introduced. By using the Hilbert curve＇s good locality characteristic of preserving ability, NCSeareh dustered the nodes that have similar content and form some clusters. The search algorithm can fast locate the duster which is most relevant to query and then flood within the duster, and aLl returned results were sorted by relevant degree. Simulation results show that, compared to the GnuteUa algorithm, NCSearch improves search efficiency.

关 键 词：P2P 局部性 聚类 Hilbert空间填充曲线 向量空间模型 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]