484 search results - page 15 / 97 » Measuring the Quality of Approximated Clusterings |
158
click to vote
VLDB
2007
ACM
16 years 2 months ago
2007
ACM
We propose a technique for measuring the structural similarity of semistructured documents based on entropy. After extracting the structural information from two documents we use ...
133
Voted
JCSS
2002
15 years 1 months ago
2002
We present the first constant-factor approximation algorithm for the metric k-median problem. The k-median problem is one of the most well-studied clustering problems, i.e., those...
120
Voted
ICDM
2005
IEEE
15 years 7 months ago
2005
IEEE
In this paper, we propose a semi-supervised framework for learning a weighted Euclidean subspace, where the best clustering can be achieved. Our approach capitalizes on user-const...
99
Voted
ICDM
2003
IEEE
15 years 7 months ago
2003
IEEE
We explore in this paper the efficient clustering of item data. Different from those of the traditional data, the features of item data are known to be of high dimensionality and...
123
click to vote
SIGIR
2008
ACM
15 years 1 months ago
2008
ACM
Searching for people on the Web is one of the most common query types to the web search engines today. However, when a person name is queried, the returned webpages often contain ...