关键词: P2P, 语义检索, 层次兴趣树, 查询路由, 语义相似性

Abstract: An effective semantic search approach based on hierarchical interest tree ( HIT) is proposed in unstructured P2P systems. Documents owned by a peer are classifiedinto categories to build a HIT, which is sent to a super peer. Meanwhile, the inverted document index (IDI) of top n ter ms for each category is also sent to a super peer according to their Chi-square (χ²) statistic values. When a regular peer sends a query and gives a category semantic similarity threshold Simth, query messages are forwarded via an effective query routing algorithm and the results are returned by searching HIT. It is flexible for each peer since it can set the Simth, which can provide a better personal service. The experiments showthat HIT-based semantic search approach is more accurate and efficient than previous methods.

Key words: P2P, semantic search, hierarchical interest tree, query routing, semantic similarity