5046 search results - page 338 / 1010 » Non-redundant data clustering |
203
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...
178
click to vote
MICCAI
2004
Springer
16 years 7 months ago
2004
Springer
In this paper we present a framework for unsupervised segmentation of white matter fiber traces obtained from diffusion weighted MRI data. Fiber traces are compared pairwise to cre...
126
click to vote
DEXA
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. K-anonymisation is an approach to protecting private information contained within a dataset. Many k-anonymisation methods have been proposed recently and one class of suc...
179
click to vote
KDD
1999
ACM
15 years 11 months ago
1999
ACM
Most time series comparison algorithms attempt to discover what the members of a set of time series have in common. We investigate a di erent problem, determining what distinguish...
181
click to vote
FGR
2004
IEEE
15 years 10 months ago
2004
IEEE
We present a new unsupervised learning technique for the discovery of temporal clusters in large data sets. Our method performs hierarchical decomposition of the data to find stru...