Sciweavers

5092 search results - page 742 / 1019
» Clustering the Feature Space
Sort
View
NAACL
2007
15 years 8 months ago
Data-Driven Graph Construction for Semi-Supervised Graph-Based Learning in NLP
Graph-based semi-supervised learning has recently emerged as a promising approach to data-sparse learning problems in natural language processing. All graph-based algorithms rely ...
Andrei Alexandrescu, Katrin Kirchhoff
SDM
2007
SIAM
167views Data Mining» more  SDM 2007»
15 years 8 months ago
Bandits for Taxonomies: A Model-based Approach
We consider a novel problem of learning an optimal matching, in an online fashion, between two feature spaces that are organized as taxonomies. We formulate this as a multi-armed ...
Sandeep Pandey, Deepak Agarwal, Deepayan Chakrabar...
173
Voted
AAAI
2004
15 years 8 months ago
Branching and Pruning: An Optimal Temporal POCL Planner Based on Constraint Programming
A key feature of modern optimal planners such as Graphplan and Blackbox is their ability to prune large parts of the search space. Previous Partial Order Causal Link (POCL) planne...
Vincent Vidal, Hector Geffner
AAAI
2006
15 years 8 months ago
kFOIL: Learning Simple Relational Kernels
A novel and simple combination of inductive logic programming with kernel methods is presented. The kFOIL algorithm integrates the well-known inductive logic programming system FO...
Niels Landwehr, Andrea Passerini, Luc De Raedt, Pa...
DAGSTUHL
2006
15 years 8 months ago
Similarity in Programs
Abstract. An overview of the concept of program similarity is presented. It divides similarity into two types--syntactic and semantic-and provides a review of eight categories of m...
Andrew Walenstein, Mohammad El-Ramly, James R. Cor...