Sciweavers

1681 search results - page 24 / 337
» Adaptive Clustering of Search Results
Sort
View
JSAC
2007
124views more  JSAC 2007»
13 years 7 months ago
Optimal search performance in unstructured peer-to-peer networks with clustered demands
—This paper derives the optimal search time and the optimal search cost that can be achieved in unstructured peer-topeer networks when the demand pattern exhibits clustering (i.e...
Saurabh Tewari, Leonard Kleinrock
PAKDD
2007
ACM
158views Data Mining» more  PAKDD 2007»
14 years 1 months ago
Density-Sensitive Evolutionary Clustering
In this study, we propose a novel evolutionary algorithm-based clustering method, named density-sensitive evolutionary clustering (DSEC). In DSEC, each individual is a sequence of ...
Maoguo Gong, Licheng Jiao, Ling Wang, Liefeng Bo
LKR
2008
13 years 9 months ago
Identification of MCMC Samples for Clustering
Abstract. For clustering problems, many studies use just MAP assignments to show clustering results instead of using whole samples from a MCMC sampler. This is because it is not st...
Kenichi Kurihara, Tsuyoshi Murata, Taisuke Sato
APWEB
2004
Springer
14 years 1 months ago
User-Oriented Adaptive Web Information Retrieval Based on Implicit Observations
Web search engines help users find useful information on the WWW. However, when the same query is submitted by different users, typical search engines return the same result regar...
Kazunari Sugiyama, Kenji Hatano, Masatoshi Yoshika...
ICDM
2002
IEEE
191views Data Mining» more  ICDM 2002»
14 years 20 days ago
Iterative Clustering of High Dimensional Text Data Augmented by Local Search
The k-means algorithm with cosine similarity, also known as the spherical k-means algorithm, is a popular method for clustering document collections. However, spherical k-means ca...
Inderjit S. Dhillon, Yuqiang Guan, J. Kogan