Sciweavers

220 search results - page 1 / 44
» A Method of Web Search Result Clustering Based on Rough Sets
Sort
View
WEBI
2005
Springer
13 years 10 months ago
A Method of Web Search Result Clustering Based on Rough Sets
Due to the enormous size of the web and low precision of user queries, finding the right information from the web can be difficult if not impossible. One approach that tries to ...
Chi Lang Ngo, Hung Son Nguyen
PKDD
2004
Springer
166views Data Mining» more  PKDD 2004»
13 years 10 months ago
A Tolerance Rough Set Approach to Clustering Web Search Results
Chi Lang Ngo, Hung Son Nguyen
ECIR
2006
Springer
13 years 6 months ago
Improving Quality of Search Results Clustering with Approximate Matrix Factorisations
Abstract. In this paper we show how approximate matrix factorisations can be used to organise document summaries returned by a search engine into meaningful thematic categories. We...
Stanislaw Osinski
FSKD
2007
Springer
158views Fuzzy Logic» more  FSKD 2007»
13 years 10 months ago
LET: Towards More Precise Clustering of Search Results
Web users are always distracted by a large number of results returned from search engines. Clustering can efficiently facilitate users’ browsing pages of certain topic. However...
Yi Zhang, Lidong Bing, Yexin Wang, Yan Zhang
WISE
2009
Springer
13 years 11 months ago
STC+ and NM-STC: Two Novel Online Results Clustering Methods for Web Searching
Results clustering in Web Searching is useful for providing users with overviews of the results and thus allowing them to restrict their focus to the desired parts. However, the ta...
Stella Kopidaki, Panagiotis Papadakos, Yannis Tzit...