Sciweavers

1599 search results - page 203 / 320
» Theoretical Frameworks for Data Mining
Sort
View
ICALP
2007
Springer
14 years 3 months ago
Linear Problem Kernels for NP-Hard Problems on Planar Graphs
Abstract. We develop a generic framework for deriving linear-size problem kernels for NP-hard problems on planar graphs. We demonstrate the usefulness of our framework in several c...
Jiong Guo, Rolf Niedermeier
KDD
2008
ACM
128views Data Mining» more  KDD 2008»
14 years 9 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»
14 years 9 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
PKDD
2009
Springer
144views Data Mining» more  PKDD 2009»
14 years 3 months ago
Evaluation Measures for Multi-class Subgroup Discovery
Subgroup discovery aims at finding subsets of a population whose class distribution is significantly different from the overall distribution. It has previously predominantly been...
Tarek Abudawood, Peter Flach
PKDD
2009
Springer
138views Data Mining» more  PKDD 2009»
14 years 3 months ago
Margin and Radius Based Multiple Kernel Learning
A serious drawback of kernel methods, and Support Vector Machines (SVM) in particular, is the difficulty in choosing a suitable kernel function for a given dataset. One of the appr...
Huyen Do, Alexandros Kalousis, Adam Woznica, Melan...