Sciweavers

69 search results - page 3 / 14
» Unsupervised Feature Selection in High Dimensional Spaces an...
Sort
View
NIPS
2008
13 years 7 months ago
Exploring Large Feature Spaces with Hierarchical Multiple Kernel Learning
For supervised and unsupervised learning, positive definite kernels allow to use large and potentially infinite dimensional feature spaces with a computational cost that only depe...
Francis Bach
ECAI
2010
Springer
13 years 2 months ago
Feature Selection by Approximating the Markov Blanket in a Kernel-Induced Space
The proposed feature selection method aims to find a minimum subset of the most informative variables for classification/regression by efficiently approximating the Markov Blanket ...
Qiang Lou, Zoran Obradovic
SDM
2009
SIAM
205views Data Mining» more  SDM 2009»
14 years 2 months ago
Identifying Information-Rich Subspace Trends in High-Dimensional Data.
Identifying information-rich subsets in high-dimensional spaces and representing them as order revealing patterns (or trends) is an important and challenging research problem in m...
Chandan K. Reddy, Snehal Pokharkar
DEXAW
2007
IEEE
157views Database» more  DEXAW 2007»
13 years 9 months ago
Dimensionality Reduction in a P2P System
Peers and data objects in the Hybrid Overlay Network (HON) are organized in a ndimensional feature space. As the dimensionality increases, peers and data objects become sparse and ...
Mouna Kacimi, Kokou Yétongnon
ACL
2006
13 years 7 months ago
Unsupervised Relation Disambiguation Using Spectral Clustering
This paper presents an unsupervised learning approach to disambiguate various relations between name entities by use of various lexical and syntactic features from the contexts. I...
Jinxiu Chen, Dong-Hong Ji, Chew Lim Tan, Zheng-Yu ...