Sciweavers

2922 search results - page 486 / 585
» Scalable Algorithms for Distribution Search
Sort
View
SIGIR
2004
ACM
14 years 2 months ago
GaP: a factor model for discrete data
We present a probabilistic model for a document corpus that combines many of the desirable features of previous models. The model is called “GaP” for Gamma-Poisson, the distri...
John F. Canny
KCAP
2011
ACM
12 years 12 months ago
LinkedDataLens: linked data as a network of networks
With billions of assertions and counting, the Web of Data represents the largest multi-contributor interlinked knowledge base that ever existed. We present a novel framework for a...
Yolanda Gil, Paul T. Groth
KDD
2009
ACM
178views Data Mining» more  KDD 2009»
14 years 9 months ago
Catching the drift: learning broad matches from clickthrough data
Identifying similar keywords, known as broad matches, is an important task in online advertising that has become a standard feature on all major keyword advertising platforms. Eff...
Sonal Gupta, Mikhail Bilenko, Matthew Richardson
KDD
2006
ACM
120views Data Mining» more  KDD 2006»
14 years 9 months ago
Hierarchical topic segmentation of websites
In this paper, we consider the problem of identifying and segmenting topically cohesive regions in the URL tree of a large website. Each page of the website is assumed to have a t...
Ravi Kumar, Kunal Punera, Andrew Tomkins
KDD
2003
ACM
150views Data Mining» more  KDD 2003»
14 years 9 months ago
Learning relational probability trees
Classification trees are widely used in the machine learning and data mining communities for modeling propositional data. Recent work has extended this basic paradigm to probabili...
Jennifer Neville, David Jensen, Lisa Friedland, Mi...