331 search results - page 28 / 67 » Possibilistic Clustering in Feature Space |
MCS
2007
Springer
14 years 1 months ago
2007
Springer
The strength of classifier combination lies either in a suitable averaging over multiple experts/sources or in a beneficial integration of complementary approaches. In this paper...
SPIRE
2005
Springer
14 years 1 months ago
2005
Springer
Proximity searching consists in retrieving from a database, objects that are close to a query. For this type of searching problem, the most general model is the metric space, where...
TVCG
2008
13 years 7 months ago
2008
Several previous systems allow users to interactively explore a large input graph through cuts of a superimposed hierarchy. This hierarchy is often created using clustering algorit...
SLSFS
2005
Springer
14 years 1 months ago
2005
Springer
We propose the use of latent space models applied to local invariant features for object classification. We investigate whether using latent space models enables to learn patterns...
ICML
1994
IEEE
13 years 11 months ago
1994
IEEE
With the goal of reducing computational costs without sacrificing accuracy, we describe two algorithms to find sets of prototypes for nearest neighbor classification. Here, the te...