Sciweavers

7150 search results - page 1070 / 1430
» Graph-Based Data Mining
Sort
View
115
Voted
KDD
2008
ACM
128views Data Mining» more  KDD 2008»
16 years 3 months ago
Bypass rates: reducing query abandonment using negative inferences
We introduce a new approach to analyzing click logs by examining both the documents that are clicked and those that are bypassed--documents returned higher in the ordering of the ...
Atish Das Sarma, Sreenivas Gollapudi, Samuel Ieong
KDD
2008
ACM
132views Data Mining» more  KDD 2008»
16 years 3 months ago
Partitioned logistic regression for spam filtering
Naive Bayes and logistic regression perform well in different regimes. While the former is a very simple generative model which is efficient to train and performs well empirically...
Ming-wei Chang, Wen-tau Yih, Christopher Meek
KDD
2008
ACM
120views Data Mining» more  KDD 2008»
16 years 3 months ago
Multi-class cost-sensitive boosting with p-norm loss functions
We propose a family of novel cost-sensitive boosting methods for multi-class classification by applying the theory of gradient boosting to p-norm based cost functionals. We establ...
Aurelie C. Lozano, Naoki Abe
KDD
2008
ACM
142views Data Mining» more  KDD 2008»
16 years 3 months ago
Weighted graphs and disconnected components: patterns and a generator
The vast majority of earlier work has focused on graphs which are both connected (typically by ignoring all but the giant connected component), and unweighted. Here we study numer...
Mary McGlohon, Leman Akoglu, Christos Faloutsos
117
Voted
KDD
2008
ACM
166views Data Mining» more  KDD 2008»
16 years 3 months ago
Generating succinct titles for web URLs
How can a search engine automatically provide the best and most appropriate title for a result URL (link-title) so that users will be persuaded to click on the URL? We consider th...
Deepayan Chakrabarti, Ravi Kumar, Kunal Punera
« Prev « First page 1070 / 1430 Last » Next »