220 search results - page 17 / 44 » A Method of Web Search Result Clustering Based on Rough Sets |
TKDE
2011
13 years 2 months ago
2011
—We consider approaches for similarity search in correlated, high-dimensional data-sets, which are derived within a clustering framework. We note that indexing by “vector appro...
ICWS
2008
IEEE
13 years 9 months ago
2008
IEEE
In this paper, we have studied a common Web service composition problem, the syntactic matching problem, where the output parameters of a Web service can be used as the input para...
PODS
2005
ACM
14 years 7 months ago
2005
ACM
We present a divide-and-merge methodology for clustering a set of objects that combines a top-down "divide" phase with a bottom-up "merge" phase. In contrast, ...
AH
2008
Springer
14 years 1 months ago
2008
Springer
In order to navigate huge document collections efficiently, tagged hierarchical structures can be used. For users, it is important to correctly interpret tag combinations. In this ...
SIGMOD
2008
ACM
14 years 7 months ago
2008
ACM
How can we efficiently find a clustering, i.e. a concise description of the cluster structure, of a given data set which contains an unknown number of clusters of different shape ...