Search Result Clustering via Randomized Partitioning of Query-Induced Subgraphs
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 a given subgraph into topic-relat...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Telecommunications Society, Academic Mind
2009-06-01
|
| Series: | Telfor Journal |
| Subjects: | |
| Online Access: | http://journal.telfor.rs/Published/Vol1No1/Vol1No1_A7.pdf |