Sciweavers

277 search results - page 37 / 56
» Using minimum description length for process mining
Sort
View
JMLR
2002
106views more  JMLR 2002»
14 years 9 months ago
Some Greedy Learning Algorithms for Sparse Regression and Classification with Mercer Kernels
We present some greedy learning algorithms for building sparse nonlinear regression and classification models from observational data using Mercer kernels. Our objective is to dev...
Prasanth B. Nair, Arindam Choudhury 0002, Andy J. ...
CIKM
2004
Springer
15 years 3 months ago
Optimizing web search using web click-through data
The performance of web search engines may often deteriorate due to the diversity and noisy information contained within web pages. User click-through data can be used to introduce...
Gui-Rong Xue, Hua-Jun Zeng, Zheng Chen, Yong Yu, W...
NLDB
2007
Springer
15 years 4 months ago
Large-Scale Knowledge Acquisition from Botanical Texts
Free text botanical descriptions contained in printed floras can provide a wealth of valuable scientific information. In spite of this richness, these texts have seldom been anal...
François Role, Milagros Fernandez Gavilanes...
ISI
2007
Springer
15 years 4 months ago
Organizing Hot-Spot Police Patrol Routes
—We address the problem of planning patrol routes to maximize coverage of important locations (hot spots) at minimum cost (length of patrol route). We model a road network using ...
Sudarshan S. Chawathe
COLING
2002
14 years 10 months ago
Effective Structural Inference for Large XML Documents
This paper investigates methods to automatically infer structural information from large XML documents. Using XML as a reference format, we approach the schema generation problem ...
Jason Sankey, Raymond K. Wong