Refining web search engine results using incremental clustering
Article first published online: 12 JAN 2004
DOI: 10.1002/int.10161
Copyright © 2004 Wiley Periodicals, Inc.
Issue
1098-111X/asset/cover.gif?v=1&s=7f7c12f2c86265974044b2b3f9936860ffc468a0)
International Journal of Intelligent Systems
Special Issue: Intelligent Technologies
Volume 19, Issue 1-2, pages 191–199, January - February 2004
Additional Information
How to Cite
Zhang, Y.-J. and Liu, Z.-Q. (2004), Refining web search engine results using incremental clustering. Int. J. Intell. Syst., 19: 191–199. doi: 10.1002/int.10161
Publication History
- Issue published online: 12 JAN 2004
- Article first published online: 12 JAN 2004
- Abstract
- References
- Cited By
Abstract
In this article, we present a new solution to improve the Web search performance. Our algorithm is based on a new clustering algorithm that classifies the results of a query from a search engine into subgroups and assigns each group a short series of keywords together with some statistics data. Then, the user may look into the group with the keywords that he/she finds interesting. Compared with the approaches available in the literature, our algorithm does not require the number of groups as the prior knowledge; it starts from a single prototype group and adaptively expands the prototype set based on a self-spawning splitting scheme until all the groups are finally identified. © 2004 Wiley Periodicals, Inc.

1098-111X/asset/INT_left.gif?v=1&s=c0d44ac5ce99265330169e2ac3d22da4ab6b1a5d)
1098-111X/asset/INT_centre.gif?v=1&s=e94826a6788e7bb0695867b68ca2c030d8c7a252)
1098-111X/asset/INT_right.gif?v=1&s=d4616ff123f9b0a0199cc9f89f77f112e4ce3a70)