280 search results - page 18 / 56 » A Semi-Supervised Document Clustering Algorithm Based on EM |
130
click to vote
MLDM
2005
Springer
15 years 9 months ago
2005
Springer
Subspace clustering is an extension of traditional clustering that seeks to find clusters in different subspaces within a dataset. This is a particularly important challenge with...
116
click to vote
CIARP
2004
Springer
15 years 9 months ago
2004
Springer
In this paper we present a new parallel clustering algorithm based on the extended star clustering method. This algorithm can be used for example to cluster massive data sets of do...
116
click to vote
IIS
2004
15 years 5 months ago
2004
Search results clustering problem is defined as an automatic, on-line grouping of similar documents in a search results list returned from a search engine. In this paper we present...
132
click to vote
ISICA
2007
Springer
15 years 10 months ago
2007
Springer
The latent class model or multivariate multinomial mixture is a powerful model for clustering discrete data. This model is expected to be useful to represent non-homogeneous popula...
148
click to vote
WAW
2009
Springer
15 years 10 months ago
2009
Springer
We study personalized web ranking algorithms based on the existence of document clusterings. Motivated by the topic sensitive page ranking of Haveliwala [19], we develop and imple...