Sciweavers

881 search results - page 3 / 177
» Spectral Algorithms for Supervised Learning
Sort
View
SDM
2007
SIAM
137views Data Mining» more  SDM 2007»
13 years 7 months ago
Semi-supervised Feature Selection via Spectral Analysis
Feature selection is an important task in effective data mining. A new challenge to feature selection is the so-called “small labeled-sample problem” in which labeled data is...
Zheng Zhao, Huan Liu
KDD
2008
ACM
161views Data Mining» more  KDD 2008»
14 years 6 months ago
Spectral domain-transfer learning
Traditional spectral classification has been proved to be effective in dealing with both labeled and unlabeled data when these data are from the same domain. In many real world ap...
Xiao Ling, Wenyuan Dai, Gui-Rong Xue, Qiang Yang, ...
TIT
2008
224views more  TIT 2008»
13 years 5 months ago
Graph-Based Semi-Supervised Learning and Spectral Kernel Design
We consider a framework for semi-supervised learning using spectral decomposition-based unsupervised kernel design. We relate this approach to previously proposed semi-supervised l...
Rie Johnson, Tong Zhang
DAGM
2004
Springer
13 years 11 months ago
Learning from Labeled and Unlabeled Data Using Random Walks
We consider the general problem of learning from labeled and unlabeled data. Given a set of points, some of them are labeled, and the remaining points are unlabeled. The goal is to...
Dengyong Zhou, Bernhard Schölkopf
AAAI
2010
13 years 7 months ago
Efficient Spectral Feature Selection with Minimum Redundancy
Spectral feature selection identifies relevant features by measuring their capability of preserving sample similarity. It provides a powerful framework for both supervised and uns...
Zheng Zhao, Lei Wang, Huan Liu