Sciweavers

2100 search results - page 385 / 420
» Learning to rank on graphs
Sort
View
KDD
2009
ACM
191views Data Mining» more  KDD 2009»
16 years 2 months ago
Scalable pseudo-likelihood estimation in hybrid random fields
Learning probabilistic graphical models from high-dimensional datasets is a computationally challenging task. In many interesting applications, the domain dimensionality is such a...
Antonino Freno, Edmondo Trentin, Marco Gori
151
Voted
CVPR
2007
IEEE
16 years 3 months ago
Automatic Face Recognition from Skeletal Remains
The ability to determine the identity of a skull found at a crime scene is of critical importance to the law enforcement community. Traditional clay-based methods attempt to recon...
Carl Adrian, Nils Krahnstoever, Peter H. Tu, Phil ...
119
Voted
WWW
2006
ACM
16 years 2 months ago
Interactive wrapper generation with minimal user effort
While much of the data on the web is unstructured in nature, there is also a significant amount of embedded structured data, such as product information on e-commerce sites or sto...
Utku Irmak, Torsten Suel
WWW
2004
ACM
16 years 2 months ago
Web-scale information extraction in knowitall: (preliminary results)
Manually querying search engines in order to accumulate a large body of factual information is a tedious, error-prone process of piecemeal search. Search engines retrieve and rank...
Oren Etzioni, Michael J. Cafarella, Doug Downey, S...
KDD
2007
ACM
177views Data Mining» more  KDD 2007»
16 years 2 months ago
Mining optimal decision trees from itemset lattices
We present DL8, an exact algorithm for finding a decision tree that optimizes a ranking function under size, depth, accuracy and leaf constraints. Because the discovery of optimal...
Élisa Fromont, Siegfried Nijssen