Sciweavers

336 search results - page 30 / 68
» Learning with Equivalence Constraints and the Relation to Mu...
Sort
View
IJCAI
1997
13 years 9 months ago
Learning Topological Maps with Weak Local Odometric Information
cal maps provide a useful abstraction for robotic navigation and planning. Although stochastic mapscan theoreticallybe learned using the Baum-Welch algorithm,without strong prior ...
Hagit Shatkay, Leslie Pack Kaelbling
ICML
2004
IEEE
14 years 8 months ago
K-means clustering via principal component analysis
Principal component analysis (PCA) is a widely used statistical technique for unsupervised dimension reduction. K-means clustering is a commonly used data clustering for unsupervi...
Chris H. Q. Ding, Xiaofeng He
AAAI
2007
13 years 10 months ago
Knowledge-Driven Learning and Discovery
The goal of our current research is machine learning with the help and guidance of a knowledge base (KB). Rather than learning numerical models, our approach generates explicit sy...
Benjamin Lambert, Scott E. Fahlman
INTERACT
2003
13 years 9 months ago
Interaction as Enquiry - Learning with Layered Dynamic Media
: The interactivity afforded to the learner by the computer based media is often fairly restricted. This may be by design choice but is often brought about by resource constraints....
Peter Whalley
SDM
2004
SIAM
225views Data Mining» more  SDM 2004»
13 years 9 months ago
Active Semi-Supervision for Pairwise Constrained Clustering
Semi-supervised clustering uses a small amount of supervised data to aid unsupervised learning. One typical approach specifies a limited number of must-link and cannotlink constra...
Sugato Basu, Arindam Banerjee, Raymond J. Mooney