1301 search results - page 67 / 261 » Default Clustering from Sparse Data Sets |
ICCV
2009
IEEE
15 years 2 months ago
2009
IEEE
Object detection in cluttered, natural scenes has a high
complexity since many local observations compete for object
hypotheses. Voting methods provide an efficient solution
to ...
SDM
2007
SIAM
13 years 10 months ago
2007
SIAM
We introduce a new approach for Clustering and Aggregating Relational Data (CARD). We assume that data is available in a relational form, where we only have information about the ...
KDD
2004
ACM
14 years 9 months ago
2004
ACM
Unsupervised clustering can be significantly improved using supervision in the form of pairwise constraints, i.e., pairs of instances labeled as belonging to same or different clu...
FSKD
2005
Springer
14 years 2 months ago
2005
Springer
Although many systems exist for automatic classification of faces according to their emotional expression, these systems do not explicitly estimate the strength of given expression...
CINQ
2004
Springer
14 years 2 months ago
2004
Springer
Abstract. Data mining algorithms such as the Apriori method for finding frequent sets in sparse binary data can be used for efficient computation of a large number of summaries fr...