Search Result Clustering via Randomized Partitioning of Query-Induced Subgraphs

Details Search Result Clustering via Randomized Partitioning of Query-Induced Subgraphs Search Result Clustering via Randomized Partitioning of Query-Induced Subgraphs

2008-11-25

arxiv.org/abs/0811.4186v1

Computer Science

Information Retrieval

16th Telecommunications Forum TELFOR 2008

Scientific paper

In this paper, we present an approach to search result clustering, using partitioning of underlying link graph. We define the notion of "query-induced subgraph" and formulate the problem of search result clustering as a problem of efficient partitioning of given subgraph into topic-related clusters. Also, we propose a novel algorithm for approximative partitioning of such graph, which results in cluster quality comparable to the one obtained by deterministic algorithms, while operating in more efficient computation time, suitable for practical implementations. Finally, we present a practical clustering search engine developed as a part of this research and use it to get results about real-world performance of proposed concepts.

Affiliated with

Also associated with

No associations

Rating

Search Result Clustering via Randomized Partitioning of Query-Induced Subgraphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Search Result Clustering via Randomized Partitioning of Query-Induced Subgraphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Search Result Clustering via Randomized Partitioning of Query-Induced Subgraphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-273675