207 search results - page 29 / 42 » Unsupervised Learning for Graph Matching |
ECML
2006
Springer
13 years 10 months ago
2006
Springer
We propose preprocessing spectral clustering with b-matching to remove spurious edges in the adjacency graph prior to clustering. B-matching is a generalization of traditional maxi...
AUSAI
2008
Springer
13 years 10 months ago
2008
Springer
Abstract. Graph-based representations have been used with considercess in computer vision in the abstraction and recognition of object shape and scene structure. Despite this, the ...
ESANN
2004
13 years 10 months ago
2004
Standard pattern recognition provides effective and noise-tolerant tools for machine learning tasks; however, most approaches only deal with real vectors of a finite and fixed dime...
IJON
2010
13 years 6 months ago
2010
Graph construction plays a key role on learning algorithms based on graph Laplacian. However, the traditional graph construction approaches of -neighborhood and k-nearest-neighbor...
INFOCOM
2010
IEEE
13 years 7 months ago
2010
IEEE
—Delay Tolerant Networks (DTN) are networks of self-organizing wireless nodes, where end-to-end connectivity is intermittent. In these networks, forwarding decisions are generall...