Sciweavers

1224 search results - page 50 / 245
» On the Optimality of the Dimensionality Reduction Method
Sort
View
IJCNN
2000
IEEE
15 years 10 months ago
Incremental Active Learning with Bias Reduction
The problem of designing input signals for optimal generalization in supervised learning is called active learning. In many active learning methods devised so far, the bias of the...
Masashi Sugiyama, Hidemitsu Ogawa
JMLR
2010
119views more  JMLR 2010»
15 years 28 days ago
Hubs in Space: Popular Nearest Neighbors in High-Dimensional Data
Different aspects of the curse of dimensionality are known to present serious challenges to various machine-learning methods and tasks. This paper explores a new aspect of the dim...
Milos Radovanovic, Alexandros Nanopoulos, Mirjana ...
IV
2007
IEEE
160views Visualization» more  IV 2007»
16 years 12 days ago
Targeted Projection Pursuit for Interactive Exploration of High- Dimensional Data Sets
High-dimensional data is, by its nature, difficult to visualise. Many current techniques involve reducing the dimensionality of the data, which results in a loss of information. ...
Joe Faith
ICPR
2008
IEEE
16 years 17 days ago
Clustering-based locally linear embedding
The locally linear embedding (LLE) algorithm is considered as a powerful method for the problem of nonlinear dimensionality reduction. In this paper, first, a new method called cl...
Kanghua Hui, Chunheng Wang
AMC
2011
14 years 9 months ago
Large correlation analysis
:In this paper, a novel supervised dimensionality reduction method is developed based on both the correlation analysis and the idea of large margin learning. The method aims to m...
Xiaohong Chen, Songcan Chen, Hui Xue