利用集合差异度实现基于内容聚类的P2P搜索模型

Content-based clustered P2P search model depending on set distance

基于内容的非结构化P2P搜索系统中直接影响查询效果和搜索成本的两个主要问题是,高维语义空间所引起的文本相似度计算复杂以及广播算法带来的大量冗余消息.本文提出利用集合差异度实现基于内容聚类的P2P搜索模型提高查询效率和减少冗余消息.该模型利用集合差异度定义文本相似度,将文本相似性的计算复杂度控制在线性时间内而有效地减少了查询时间;利用节点之间的集合差异度实现基于内容的聚类,既降低了查询时间,又减少了冗余消息.模拟实验表明,利用集合差异度构建的基于内容的搜索模型不仅具有较高的召回率,而且将搜索成本和查询时间分别降低到了Gnutella系统的40%和30%左右.

In a content-based unstructured P2P search system, the main issues that affect the query efficiency and searching cost are the complexity of computing document similarities brought by high dimensions and the great deal of redundant messages. The content-based cluster P2P search model depending on a set distance is proposed in this paper to reduce the query time and redundant messages. This model defines document similarities by a set distance to restrain the complexity of computing the document similarities in linear time. Also, clustering peers based on the content depending on a set distance reduces the query time and decreases the redundant messages. Simulations show that this model not only has higher recall, but also reduces the search cost and query time to the rate of 40 % and 30% of Gnutella.