Sciweavers

886 search results - page 70 / 178
» Learning Distance Functions using Equivalence Relations
Sort
View
JAIR
2010
131views more  JAIR 2010»
14 years 8 months ago
Automatic Induction of Bellman-Error Features for Probabilistic Planning
Domain-specific features are important in representing problem structure throughout machine learning and decision-theoretic planning. In planning, once state features are provide...
Jia-Hong Wu, Robert Givan
IADIS
2004
14 years 11 months ago
Problem-Based Learning Method Simulation by PBL Virtual Environment
Problem Based Learning (PBL) is a new teaching-learning method originated from the changes that have occurred in the world economical basis and in the information and communicatio...
Hernane Borges de Barros Pereira, Gabriela Ribeiro...
KDD
2004
ACM
132views Data Mining» more  KDD 2004»
15 years 10 months ago
A probabilistic framework for semi-supervised clustering
Unsupervised clustering can be significantly improved using supervision in the form of pairwise constraints, i.e., pairs of instances labeled as belonging to same or different clu...
Sugato Basu, Mikhail Bilenko, Raymond J. Mooney
ICPR
2006
IEEE
15 years 11 months ago
A Convolution Edit Kernel for Error-tolerant Graph Matching
General graph matching methods often suffer from the lack of mathematical structure in the space of graphs. Using kernel functions to evaluate structural graph similarity allows u...
Horst Bunke, Michel Neuhaus
CSDA
2007
131views more  CSDA 2007»
14 years 9 months ago
Bivariate density estimation using BV regularisation
In this paper we study the problem of bivariate density estimation. The aim is to find a density function with the smallest number of local extreme values which is adequate with ...
Andreas Obereder, Otmar Scherzer, Arne Kovac