Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

17

ECML
1998
Springer

favoriteEmaildiscussreport

111views Machine Learning» more ECML 1998»

First-Order Learning for Web Mining

13 years 8 months ago

First-Order Learning for Web Mining

Download www.kamalnigam.com

We present compelling evidence that the World Wide Web is a domain in which applications can benefit from using first-order learning methods, since the graph structure inherent in hypertext naturally lends itself to a relational representation. We demonstrate strong advantages for two applications

Mark Craven, Seán Slattery, Kamal Nigam

Real-time Traffic

Compelling Evidence | ECML 1998 | First-order Learning Methods | Machine Learning | World Wide Web |

claim paper

Related Content

» Learning FirstOrder Horn Clauses from Web Text

» Learning First Order Logic Rules with a Genetic Algorithm

» Axiomatic FirstOrder Probability

» Beyond blacklists learning to detect malicious web sites from suspicious URLs

» PEBL positive example based learning for Web page classification using SVM

» Discovering data dependencies in Web content mining

» WebSets extracting sets of entities from the web using unsupervised information extraction

» Applying Web Usage Mining Techniques to Discover Potential Browsing Problems of Users

» Using Text Mining and Link Analysis for Software Mining

Post Info
More Details (n/a)

Added	05 Aug 2010
Updated	05 Aug 2010
Type	Conference
Year	1998
Where	ECML
Authors	Mark Craven, Seán Slattery, Kamal Nigam

Comments (0)