[PDF][PDF] Multiple kernel learning algorithms
In recent years, several methods have been proposed to combine multiple kernels instead of
using a single one. These different kernels may correspond to using different notions of …
using a single one. These different kernels may correspond to using different notions of …
Multi-view clustering and feature learning via structured sparsity
Combining information from various data sources has become an important research topic
in machine learning with many scientific applications. Most previous studies employ kernels …
in machine learning with many scientific applications. Most previous studies employ kernels …
Optimized data fusion for kernel k-means clustering
This paper presents a novel optimized kernel k-means algorithm (OKKC) to combine
multiple data sources for clustering analysis. The algorithm uses an alternating minimization …
multiple data sources for clustering analysis. The algorithm uses an alternating minimization …
Feature selection and kernel learning for local learning-based clustering
The performance of the most clustering algorithms highly relies on the representation of data
in the input space or the Hilbert space of kernel methods. This paper is to obtain an …
in the input space or the Hilbert space of kernel methods. This paper is to obtain an …
Data fusion by matrix factorization
For most problems in science and engineering we can obtain data sets that describe the
observed system from various perspectives and record the behavior of its individual …
observed system from various perspectives and record the behavior of its individual …
Approximation accuracy, gradient methods, and error bound for structured convex optimization
P Tseng - Mathematical Programming, 2010 - Springer
Convex optimization problems arising in applications, possibly as approximations of
intractable problems, are often structured and large scale. When the data are noisy, it is of …
intractable problems, are often structured and large scale. When the data are noisy, it is of …
Multiple kernel extreme learning machine
Extreme learning machine (ELM) has been an important research topic over the last decade
due to its high efficiency, easy-implementation, unification of classification and regression …
due to its high efficiency, easy-implementation, unification of classification and regression …
[PDF][PDF] The MediaMill TRECVID 2006 semantic video search engine
In this paper we describe our TRECVID 2005 experiments. The UvA-MediaMill team
participated in four tasks. For the detection of camera work (runid: A CAM) we investigate the …
participated in four tasks. For the detection of camera work (runid: A CAM) we investigate the …
Linearized alternating direction method with parallel splitting and adaptive penalty for separable convex programs in machine learning
Many problems in statistics and machine learning (eg, probabilistic graphical model, feature
extraction, clustering and classification, etc) can be (re) formulated as linearly constrained …
extraction, clustering and classification, etc) can be (re) formulated as linearly constrained …
[PDF][PDF] Model selection: beyond the bayesian/frequentist divide.
The principle of parsimony also known as “Ockham's razor” has inspired many theories of
model selection. Yet such theories, all making arguments in favor of parsimony, are based …
model selection. Yet such theories, all making arguments in favor of parsimony, are based …