611 search results - page 35 / 123 » The Cardinality Matrix Constraint |
ICDM
2010
IEEE
14 years 7 months ago
2010
IEEE
An idealized clustering algorithm seeks to learn a cluster-adjacency matrix such that, if two data points belong to the same cluster, the corresponding entry would be 1; otherwise ...
124
click to vote
ICASSP
2008
IEEE
15 years 4 months ago
2008
IEEE
Non-negative matrix factorisation (NMF) is an unsupervised learning technique that decomposes a non-negative data matrix into a product of two lower rank non-negative matrices. Th...
ICML
2004
IEEE
15 years 3 months ago
2004
IEEE
We investigate how to learn a kernel matrix for high dimensional data that lies on or near a low dimensional manifold. Noting that the kernel matrix implicitly maps the data into ...
BIOADIT
2004
Springer
15 years 1 months ago
2004
Springer
We present a detailed account of the processing that occurs within a biologically-inspired model for visual homing. The Corner Gradient Snapshot Model (CGSM) initially presented in...
CIVR
2008
Springer
14 years 11 months ago
2008
Springer
In information retrieval, sub-space techniques are usually used to reveal the latent semantic structure of a data-set by projecting it to a low dimensional space. Non-negative mat...