#### Filter Results:

#### Publication Year

1998

2016

#### Co-author

#### Key Phrase

#### Publication Venue

#### Data Set Used

Learn More

A novel semi-supervised learning approach is proposed based on a linear neighborhood model, which assumes that each data point can be linearly reconstructed from its neighborhood. Our algorithm, named <i>Linear Neighborhood Propagation (LNP)</i>, can propagate the labels from the labeled points to the whole dataset using these linear neighborhoods with… (More)

In this paper, we propose a novel transductive learning framework named manifold-ranking based image retrieval (MRBIR). Given a query image, MRBIR first makes use of a manifold ranking algorithm to explore the relationship among all the data points in the feature space, and then measures relevance between the query and all the images in the database… (More)

Non-convex sparsity-inducing penalties have recently received considerable attentions in sparse learning. Recent theoretical investigations have demonstrated their superiority over the convex counterparts in several sparse learning settings. However, solving the non-convex optimization problems associated with non-convex penalties remains a big challenge. A… (More)

A novel algorithm called Average Neighborhood Margin Maximization (ANMM) is proposed for supervised linear feature extraction. For each data point, ANMM aims at pulling the neighboring points with the same class label towards it as near as possible, while simultaneously pushing the neighboring points with different labels away from it as far as possible. We… (More)

Canonical correlation analysis (CCA) is applied to analyze the frequency components of steady-state visual evoked potentials (SSVEP) in electroencephalogram (EEG). The essence of this method is to extract a narrowband frequency component of SSVEP in EEG. A recognition approach is proposed based on the extracted frequency features for an SSVEP-based brain… (More)

This paper presents a <i>cutting plane</i> algorithm for multiclass <i>maximum margin clustering (MMC)</i>. The proposed algorithm constructs a nested sequence of successively tighter relaxations of the original <i>MMC</i> problem, and each optimization problem in this sequence could be efficiently solved using the <i>constrained concave-convex… (More)

Distance metric is a key issue in many machine learning algorithms. This paper considers a general problem of learning from pairwise constraints in the form of must-links and cannot-links. As one kind of side information, a must-link indicates the pair of the two data points must be in a same class, while a cannot-link indicates that the two data points… (More)

Multi-label learning refers to the problems where an instance can be assigned to more than one category. In this paper, we present a novel Semi-supervised algorithm for Multi-label learning by solving a Sylvester Equation (SMSE). Two graphs are first constructed on instance level and category level respectively. For instance level, a graph is defined based… (More)

We consider the general problem of learning from both labeled and unlabeled data. Given a set of data points, only a few of them are labeled, and the remaining points are un-labeled. Our goal is to predict the labels of both the un-labeled and new out-of-sample data points. Based on the assumption that the labels of each data can be linearly reconstructed… (More)