Sciweavers

1339 search results - page 138 / 268
» Robust learning from bites for data mining
Sort
View
PAKDD
2004
ACM
131views Data Mining» more  PAKDD 2004»
14 years 2 months ago
A Tree-Based Approach to the Discovery of Diagnostic Biomarkers for Ovarian Cancer
Computational diagnosis of cancer is a classification problem, and it has two special requirements on a learning algorithm: perfect accuracy and small number of features used in t...
Jinyan Li, Kotagiri Ramamohanarao
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
KDD
2002
ACM
110views Data Mining» more  KDD 2002»
14 years 9 months ago
A model for discovering customer value for E-content
There exists a huge demand for multimedia goods and services in the Internet. Currently available bandwidth speeds can support sale of downloadable content like CDs, e-books, etc....
Srinivasan Jagannathan, Jayanth Nayak, Kevin C. Al...
SDM
2008
SIAM
138views Data Mining» more  SDM 2008»
13 years 10 months ago
Learning Markov Network Structure using Few Independence Tests
In this paper we present the Dynamic Grow-Shrink Inference-based Markov network learning algorithm (abbreviated DGSIMN), which improves on GSIMN, the state-ofthe-art algorithm for...
Parichey Gandhi, Facundo Bromberg, Dimitris Margar...
KDD
2008
ACM
176views Data Mining» more  KDD 2008»
14 years 9 months ago
Febrl -: an open source data cleaning, deduplication and record linkage system with a graphical user interface
Matching records that refer to the same entity across databases is becoming an increasingly important part of many data mining projects, as often data from multiple sources needs ...
Peter Christen