237 search results - page 10 / 48 » Finding Metric Structure in Information Theoretic Clustering |
157
click to vote
EH
2004
IEEE
15 years 10 months ago
2004
IEEE
In this paper we focus on the problem of making a model of the sensory apparatus from raw uninterpreted sensory data as defined by Pierce and Kuipers (Artificial Intelligence 92:1...
217
click to vote
KDD
2007
ACM
16 years 7 months ago
2007
ACM
Existing data-stream clustering algorithms such as CluStream are based on k-means. These clustering algorithms are incompetent to find clusters of arbitrary shapes and cannot hand...
196
click to vote
DAWAK
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. Individual privacy will be at risk if a published data set is not properly de-identified. k-anonymity is a major technique to de-identify a data set. A more general view ...
171
click to vote
PKDD
1999
Springer
15 years 11 months ago
1999
Springer
: For many KDD applications finding the outliers, i.e. the rare events, is more interesting and useful than finding the common cases, e.g. detecting criminal activities in E-commer...
177
click to vote
BMVC
2010
15 years 4 months ago
2010
The standard approach to multi-modal registration is to apply sophisticated similarity metrics such as mutual information. The disadvantage of these measures, in contrast to simpl...