240 search results - page 26 / 48 » Laplacian Spectrum Learning |
ICML
2005
IEEE
14 years 9 months ago
2005
IEEE
In genomic sequence analysis tasks like splice site recognition or promoter identification, large amounts of training sequences are available, and indeed needed to achieve suffici...
ICML
2002
IEEE
14 years 9 months ago
2002
IEEE
In a multi-view problem, the features of the domain can be partitioned into disjoint subsets (views) that are sufficient to learn the target concept. Semi-supervised, multi-view a...
COLT
2003
Springer
14 years 2 months ago
2003
Springer
A general class of no-regret learning algorithms, called no-Φ-regret learning algorithms, is defined which spans the spectrum from no-external-regret learning to no-internal-reg...
ICML
2007
IEEE
14 years 9 months ago
2007
IEEE
Maximum margin clustering (MMC) is a recent large margin unsupervised learning approach that has often outperformed conventional clustering methods. Computationally, it involves n...
ICML
2005
IEEE
14 years 9 months ago
2005
IEEE
Recently, several manifold learning algorithms have been proposed, such as ISOMAP (Tenenbaum et al., 2000), Locally Linear Embedding (Roweis & Saul, 2000), Laplacian Eigenmap ...