Sciweavers

576 search results - page 60 / 116
» Structured metric learning for high dimensional problems
Sort
View
AAAI
2000
13 years 9 months ago
Localizing Search in Reinforcement Learning
Reinforcement learning (RL) can be impractical for many high dimensional problems because of the computational cost of doing stochastic search in large state spaces. We propose a ...
Gregory Z. Grudic, Lyle H. Ungar
ACCV
2010
Springer
13 years 2 months ago
Affordance Mining: Forming Perception through Action
This work employs data mining algorithms to discover visual entities that are strongly associated to autonomously discovered modes of action, in an embodied agent. Mappings are lea...
Liam Ellis, Michael Felsberg, Richard Bowden
JCIT
2010
190views more  JCIT 2010»
13 years 2 months ago
Application of Feature Extraction Method in Customer Churn Prediction Based on Random Forest and Transduction
With the development of telecom business, customer churn prediction becomes more and more important. An outstanding issue in customer churn prediction is high dimensional problem....
Yihui Qiu, Hong Li
CVIU
2011
12 years 11 months ago
Graph attribute embedding via Riemannian submersion learning
In this paper, we tackle the problem of embedding a set of relational structures into a metric space for purposes of matching and categorisation. To this end, we view the problem ...
Haifeng Zhao, Antonio Robles-Kelly, Jun Zhou, Jian...
ICCV
2005
IEEE
14 years 9 months ago
Neighborhood Preserving Embedding
Recently there has been a lot of interest in geometrically motivated approaches to data analysis in high dimensional spaces. We consider the case where data is drawn from sampling...
Xiaofei He, Deng Cai, Shuicheng Yan, HongJiang Zha...