Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Richard H. Wolniewicz

dblp:06/2951 · DBLP profile ↗
← Back
5ranked-venue papers
1as first author
0since 2021 · last 2003
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 4Databases, data management, data science and information retrieval · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
2 papers
Learning theory · 40% Trustworthy machine learning · 30% Probabilistic and Bayesian machine learning · 30%
Theoretical computer science
1 paper
Mathematical optimization · 100%
Interdisciplinary, comprehensive, and emerging computing
3 papers
Computational social science and digital humanities · 66% Computational finance and economics · 26% Computational science and engineering · 9%
Databases, data mining, and information retrieval
1 paper
Query processing and optimization · 50% Database system architecture and tuning · 50%
Computer networks
1 paper
Cellular and mobile networks · 100%

Topics — the 4 heaviest of 10, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Learning theory › classification
binary classification
0.012003
Optimizing Classifier Performance via an Approximation to the Wilcoxon-Mann-Whitney Statistic · ICML 2003
Query processing and optimization › query optimization
algebraic query optimization
0.011993
Algebraic Optimization of Computations over Scientific Databases · VLDB 1993
Database system architecture and tuning
scientific data management
0.011993
Algebraic Optimization of Computations over Scientific Databases · VLDB 1993
Computational science and engineering
scientific data management
0.011993
Algebraic Optimization of Computations over Scientific Databases · VLDB 1993

Methods — techniques the papers use, named apart from their topics

approximation to AUC · 0.1constrained optimization · 0.1ROC analysis · 0.1
YearPublicationVenuePosition
2003 Optimizing Classifier Performance via an Approximation to the Wilcoxon-Mann-Whitney Statistic
Lian Yan, Robert H. Dodier, Michael C. Mozer, Richard H. Wolniewicz
ICML4
2001 Prodding the ROC Curve: Constrained Optimization of Classifier Performance
abstract
When designing a two-alternative classifier, one ordinarily aims to maximize the classifier’s ability to discriminate between members of the two classes. We describe a situation in a real-world business application of machine-learning prediction in which an additional constraint is placed on the nature of the solu- tion: that the classifier achieve a specified correct acceptance or correct rejection rate (i.e., that it achieve a fixed accuracy on members of one class or the other). Our domain is predicting churn in the telecommunications industry. Churn refers to customers who switch from one service provider to another. We pro- pose four algorithms for training a classifier subject to this domain constraint, and present results showing that each algorithm yields a reliable improvement in performance. Although the improvement is modest in magnitude, it is nonethe- less impressive given the difficulty of the problem and the financial return that it achieves to the service provider. When designing a classifier, one must specify an objective measure by which the classi- fier’s performance is to be evaluated. One simple objective measure is to minimize the number of misclassifications. If the cost of a classification error depends on the target and/ or response class, one might utilize a risk-minimization framework to reduce the expected loss. A more general approach is to maximize the classifier’s ability to discriminate one class from another class (e.g., Chang & Lippmann, 1994). An ROC curve (Green & Swets, 1966) can be used to visualize the discriminative performance of a two-alternative classifier that outputs class posteriors. To explain the ROC curve, a classifier can be thought of as making a positive/negative judgement as to whether an input is a member of some class. Two different accuracy measures can be obtained from the classifier: the accuracy of correctly identifying an input as a member of the class (a correct acceptance or CA), and the accuracy of correctly identifying an input as a nonmember of the class (a correct rejection or CR). To evaluate the CA and CR rates, it is necessary to pick a threshold above which the classifier’s probability estimate is inter- preted as an “accept,” and below which is interpreted as a “reject”—call this the criterion. The ROC curve plots CA against CR rates for various criteria (Figure 1a). Note that as the threshold is lowered, the CA rate increases and the CR rate decreases. For a criterion of 1, the CA rate approaches 0 and the CR rate 1; for a criterion of 0, the CA rate approaches 1
Michael C. Mozer, Robert H. Dodier, Michael D. Colagrosso, Cesar Guerra-Salcedo, Richard H. Wolniewicz
NIPS5
2000 Predicting subscriber dissatisfaction and improving retention in the wireless telecommunications industry
abstract
Competition in the wireless telecommunications industry is fierce. To maintain profitability, wireless carriers must control churn, which is the loss of subscribers who switch from one carrier to another.We explore techniques from statistical machine learning to predict churn and, based on these predictions, to determine what incentives should be offered to subscribers to improve retention and maximize profitability to the carrier. The techniques include logit regression, decision trees, neural networks, and boosting. Our experiments are based on a database of nearly 47,000 U.S. domestic subscribers and includes information about their usage, billing, credit, application, and complaint history. Our experiments show that under a wide variety of assumptions concerning the cost of intervention and the retention rate resulting from intervention, using predictive techniques to identify potential churners and offering incentives can yield significant savings to a carrier. We also show the importance of a data representation crafted by domain experts. Finally, we report on a real-world test of the techniques that validate our simulation experiments.
Michael C. Mozer, Richard H. Wolniewicz, David B. Grimes, Howard Kaushansky
IEEE Trans. Neural Networks Learn. Syst.2
1999 Churn Reduction in the Wireless Industry
Michael C. Mozer, Richard H. Wolniewicz, David B. Grimes, Howard Kaushansky
NIPS2
1993 Algebraic Optimization of Computations over Scientific Databases
Richard H. Wolniewicz, Goetz Graefe
VLDB1