5659 search results - page 47 / 1132 » Comparing Clusterings in Space |
118
click to vote
VISSYM
2004
15 years 3 months ago
2004
In volume visualization, users typically specify transfer functions to classify the data and assign visual attributes to each material class. Higher-dimensional classification mak...
135
click to vote
STACS
2007
Springer
15 years 8 months ago
2007
Springer
The min-sum k-clustering problem is to partition a metric space (P, d) into k clusters C1, . . . , Ck ⊆ P such that k i=1 p,q∈Ci d(p, q) is minimized. We show the first effi...
141
Voted
ICPR
2000
IEEE
16 years 3 months ago
2000
IEEE
Texture feature extraction operators, which comprise linear filtering, eventually followed by post-processing, are considered. The filters used are Laws' masks, filters deriv...
100
click to vote
FOCS
1999
IEEE
15 years 6 months ago
1999
IEEE
The metric 2-clustering problem is de ned as follows: given a metric (X;d), partition X into two sets S1 and S2 in order to minimize the value of X i X fu;vg Si d(u;v) In this pap...
146
click to vote
KDD
2004
ACM
16 years 2 months ago
2004
ACM
In this paper, we define and study a novel text mining problem, which we refer to as Comparative Text Mining (CTM). Given a set of comparable text collections, the task of compara...