126 search results - page 6 / 26 » A dependence maximization view of clustering |
ICCV
2003
IEEE
14 years 9 months ago
2003
IEEE
The objective of active recognition is to iteratively collect the next "best" measurements (e.g., camera angles or viewpoints), to maximally reduce ambiguities in recogn...
DATE
2008
IEEE
14 years 2 months ago
2008
IEEE
Keeping diagnostic resolution as high as possible while maximizing the compaction ratio is subject to research since the advent of embedded test. In this paper, we present a novel...
IJCM
2007
13 years 7 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...
TNN
2010
13 years 2 months ago
2010
Clustering using the Hilbert Schmidt independence criterion (CLUHSIC) is a recent clustering algorithm that maximizes the dependence between cluster labels and data observations ac...
KDD
2003
ACM
14 years 8 months ago
2003
ACM
Two-dimensional contingency or co-occurrence tables arise frequently in important applications such as text, web-log and market-basket data analysis. A basic problem in contingenc...