Sciweavers

257 search results - page 33 / 52
» Learning Unions of Tree Patterns Using Queries
Sort
View
SIGIR
2009
ACM
15 years 4 months ago
Extracting structured information from user queries with semi-supervised conditional random fields
When search is against structured documents, it is beneficial to extract information from user queries in a format that is consistent with the backend data structure. As one step...
Xiao Li, Ye-Yi Wang, Alex Acero
FOCS
2009
IEEE
14 years 7 months ago
Learning and Smoothed Analysis
We give a new model of learning motivated by smoothed analysis (Spielman and Teng, 2001). In this model, we analyze two new algorithms, for PAC-learning DNFs and agnostically learn...
Adam Tauman Kalai, Alex Samorodnitsky, Shang-Hua T...
PKDD
2009
Springer
135views Data Mining» more  PKDD 2009»
15 years 4 months ago
Syntactic Structural Kernels for Natural Language Interfaces to Databases
A core problem in data mining is to retrieve data in a easy and human friendly way. Automatically translating natural language questions into SQL queries would allow for the design...
Alessandra Giordani, Alessandro Moschitti
EDBT
2012
ACM
257views Database» more  EDBT 2012»
13 years 3 days ago
Indexing and mining topological patterns for drug discovery
Increased availability of large repositories of chemical compounds has created new challenges and opportunities for the application of data-mining and indexing techniques to probl...
Sayan Ranu, Ambuj K. Singh
COLT
1992
Springer
15 years 1 months ago
Learning Switching Concepts
We consider learning in situations where the function used to classify examples may switch back and forth between a small number of different concepts during the course of learnin...
Avrim Blum, Prasad Chalasani