Sciweavers

2100 search results - page 235 / 420
» Learning to rank on graphs
Sort
View
NAACL
2001
15 years 8 months ago
SPoT: A Trainable Sentence Planner
Sentence planning is a set of inter-related but distinct tasks, one of which is sentence scoping, i.e. the choice of syntactic structure for elementary speech acts and the decisio...
Marilyn A. Walker, Owen Rambow, Monica Rogati
SIGMOD
2010
ACM
224views Database» more  SIGMOD 2010»
15 years 6 months ago
GDR: a system for guided data repair
Improving data quality is a time-consuming, labor-intensive and often domain specific operation. Existing data repair approaches are either fully automated or not efficient in int...
Mohamed Yakout, Ahmed K. Elmagarmid, Jennifer Nevi...
GG
2008
Springer
15 years 7 months ago
Transformation-Based Operationalization of Graph Languages
Graph Languages1 emerged during the seventies from the necessity to process data structures with complex interrelations. Nowadays, various variants of these languages can be found...
Erhard Weinell
COLT
2007
Springer
16 years 24 days ago
Property Testing: A Learning Theory Perspective
Property testing deals with tasks where the goal is to distinguish between the case that an object (e.g., function or graph) has a prespecified property (e.g., the function is li...
Dana Ron
ICML
2007
IEEE
16 years 7 months ago
Learning to combine distances for complex representations
The k-Nearest Neighbors algorithm can be easily adapted to classify complex objects (e.g. sets, graphs) as long as a proper dissimilarity function is given over an input space. Bo...
Adam Woznica, Alexandros Kalousis, Melanie Hilario