Sciweavers

576 search results - page 53 / 116
» Structured metric learning for high dimensional problems
Sort
View
IJCNN
2007
IEEE
14 years 2 months ago
A Wrapper for Projection Pursuit Learning
– Constructive algorithms are effective methods for designing Artificial Neural Networks (ANN) with good accuracy and generalization capability, yet with parsimonious network str...
Leonardo M. Holschuh, Clodoaldo Ap. M. Lima, Ferna...
CIKM
2010
Springer
13 years 5 months ago
Regularization and feature selection for networked features
In the standard formalization of supervised learning problems, a datum is represented as a vector of features without prior knowledge about relationships among features. However, ...
Hongliang Fei, Brian Quanz, Jun Huan
PKDD
2000
Springer
100views Data Mining» more  PKDD 2000»
13 years 11 months ago
Learning Right Sized Belief Networks by Means of a Hybrid Methodology
Previous algoritms for the construction of belief networks structures from data are mainly based either on independence criteria or on scoring metrics. The aim of this paper is to ...
Silvia Acid, Luis M. de Campos
IROS
2006
IEEE
159views Robotics» more  IROS 2006»
14 years 1 months ago
Multi-Level Surface Maps for Outdoor Terrain Mapping and Loop Closing
— To operate outdoors or on non-flat surfaces, mobile robots need appropriate data structures that provide a compact representation of the environment and at the same time suppo...
Rudolph Triebel, Patrick Pfaff, Wolfram Burgard
MM
2005
ACM
122views Multimedia» more  MM 2005»
14 years 1 months ago
Image clustering with tensor representation
We consider the problem of image representation and clustering. Traditionally, an n1 × n2 image is represented by a vector in the Euclidean space Rn1×n2 . Some learning algorith...
Xiaofei He, Deng Cai, Haifeng Liu, Jiawei Han