Sciweavers

1045 search results - page 180 / 209
» Data mining for discrimination discovery
Sort
View
DMKD
1997
ACM
198views Data Mining» more  DMKD 1997»
13 years 11 months ago
Clustering Based On Association Rule Hypergraphs
Clustering in data mining is a discovery process that groups a set of data such that the intracluster similarity is maximized and the intercluster similarity is minimized. These d...
Eui-Hong Han, George Karypis, Vipin Kumar, Bamshad...
KDD
1998
ACM
120views Data Mining» more  KDD 1998»
13 years 11 months ago
Ranking - Methods for Flexible Evaluation and Efficient Comparison of Classification Performance
We present the notion of Ranking for evaluation of two-class classifiers. Ranking is based on using the ordering information contained in the output of a scoring model, rather tha...
Saharon Rosset
KDD
2008
ACM
132views Data Mining» more  KDD 2008»
14 years 8 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
160views Data Mining» more  KDD 2002»
14 years 8 months ago
Scaling multi-class support vector machines using inter-class confusion
Support vector machines (SVMs) excel at two-class discriminative learning problems. They often outperform generative classifiers, especially those that use inaccurate generative m...
Shantanu Godbole, Sunita Sarawagi, Soumen Chakraba...
KDD
2007
ACM
138views Data Mining» more  KDD 2007»
14 years 1 months ago
High-quantile modeling for customer wallet estimation and other applications
In this paper we discuss the important practical problem of customer wallet estimation, i.e., estimation of potential spending by customers (rather than their expected spending). ...
Claudia Perlich, Saharon Rosset, Richard D. Lawren...