Sciweavers

181 search results - page 27 / 37
» Graph Embedding: A General Framework for Dimensionality Redu...
Sort
View
ICML
2007
IEEE
15 years 10 months ago
Spectral feature selection for supervised and unsupervised learning
Feature selection aims to reduce dimensionality for building comprehensible learning models with good generalization performance. Feature selection algorithms are largely studied ...
Zheng Zhao, Huan Liu
FSTTCS
2001
Springer
15 years 2 months ago
On Clustering Using Random Walks
Abstract. We propose a novel approach to clustering, based on deterministic analysis of random walks on the weighted graph associated with the clustering problem. The method is cen...
David Harel, Yehuda Koren
IPPS
2000
IEEE
15 years 2 months ago
Connectivity Models for Optoelectronic Computing Systems
Abstract. Rent's rule and related concepts of connectivity such as dimensionality, line-length distributions, and separators have found great use in fundamental studies of di ...
Haldun M. Özaktas
JMLR
2012
13 years 4 days ago
Metric and Kernel Learning Using a Linear Transformation
Metric and kernel learning arise in several machine learning applications. However, most existing metric learning algorithms are limited to learning metrics over low-dimensional d...
Prateek Jain, Brian Kulis, Jason V. Davis, Inderji...
MM
2010
ACM
238views Multimedia» more  MM 2010»
14 years 10 months ago
Supervised manifold learning for image and video classification
This paper presents a supervised manifold learning model for dimensionality reduction in image and video classification tasks. Unlike most manifold learning models that emphasize ...
Yang Liu, Yan Liu, Keith C. C. Chan