5659 search results - page 295 / 1132 » Comparing Clusterings in Space |
194
click to vote
ECCV
2008
Springer
16 years 8 months ago
2008
Springer
We show that the complexity of the recently introduced medoid-shift algorithm in clustering N points is O(N2 ), with a small constant, if the underlying distance is Euclidean. This...
159
click to vote
KDD
2004
ACM
16 years 6 months ago
2004
ACM
We use clustering to derive new relations which augment database schema used in automatic generation of predictive features in statistical relational learning. Clustering improves...
160
click to vote
ICDM
2002
IEEE
15 years 11 months ago
2002
IEEE
Document clustering techniques mostly rely on single term analysis of the document data set, such as the Vector Space Model. To better capture the structure of documents, the unde...
189
Voted
KAIS
2006
15 years 6 months ago
2006
Frequent itemset mining was initially proposed and has been studied extensively in the context of association rule mining. In recent years, several studies have also extended its a...
172
click to vote
IJCM
2007
15 years 6 months ago
2007
The highest fidelity representations of realistic real-world materials currently used comprise Bidirectional Texture Functions (BTF). The BTF is a six dimensional function dependi...