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

Patrick Baldasare

dblp:19/269 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
0since 2021 · last 2006
—ORCID · none

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

Artificial intelligence and machine learning · 3Databases, data management, data science and information retrieval · 2

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.

Databases, data mining, and information retrieval
2 papers
Data mining · 74% Query processing and optimization · 26%
Interdisciplinary, comprehensive, and emerging computing
2 papers
Computational finance and economics · 59% Computational social science and digital humanities · 41%

Topics — the 5 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Data mining › predictive modeling › classification
cost-sensitive learning
0.122006
Beyond classification and ranking: constrained optimization of the ROI · KDD 2006
Enhancing the lift under budget constraints: an application in the mutual fund industry · KDD 2005
Computational social science and digital humanities › marketing
customer relationship management
0.112005
Enhancing the lift under budget constraints: an application in the mutual fund industry · KDD 2005
Query processing and optimization
constrained optimization
0.112005
Enhancing the lift under budget constraints: an application in the mutual fund industry · KDD 2005
Data mining › predictive modeling › classification › pattern classification
binary classification
0.012006
Beyond classification and ranking: constrained optimization of the ROI · KDD 2006
Data mining › predictive modeling
classification
0.012006
Beyond classification and ranking: constrained optimization of the ROI · KDD 2006

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

constrained optimization · 0.2ranking · 0.1gradient descent · 0.1gradient-based training · 0.1
YearPublicationVenuePosition
2006 Beyond classification and ranking: constrained optimization of the ROI
abstract
Classification has been commonly used in many data mining projects in the financial service industry. For instance, to predict collectability of accounts receivable, a binary class label is created based on whether a payment is received within a certain period. However, optimization of the classifier does not necessarily lead to maximization of return on investment (ROI), since maximization of the true positive rate is often different from maximization of the collectable amount which determines the ROI under a fixed budget constraint. The typical cost sensitive learning does not solve this problem either since it involves an unknown opportunity cost due to the budget constraint. Learning the ranks of collectable amount would ultimately solve the problem, but it tries to tackle an unnecessarily difficult problem and often results in poorer results for our specific target. We propose a new algorithm that uses gradient descent to directly optimize the related monetary measure under the budget constraint and thus maximizes the ROI. By comparison with several classification, regression, and ranking algorithms, we demonstrate the new algorithm's substantial improvement of the financial impact on our clients in the financial service industry.
Lian Yan, Patrick Baldasare
KDD2
2005 Predicting customer behavior via calling links
abstract
Machine learning techniques have been used to predict customer behavior in telecommunications industry. Typically, several data sources, including historical usage, billing, payment, network, customer service, and demographic data, can be used in a predictive model. However, in some cases, e.g., in the prepaid customer segment, there is often little data available except for the call detail record (CDR) data. In this paper, we tackle this challenging problem, using significantly delayed CDR data as the primary data source to predict customer behavior. We extract calling links, i.e., who called whom, from the CDR data, and propose several distance measures based on calling links. We demonstrate that, by using information derived from the calling links alone as inputs to a neural network model, an acceptable accuracy for predicting churn (customer switching from one service provider to another) can be achieved. Calling links can also be used to identify calling communities, which may be used for targeted marketing campaigns and help predict acceptance of marketing offers.
Lian Yan, Michael Fassino, Patrick Baldasare
IJCNN3
2005 Enhancing the lift under budget constraints: an application in the mutual fund industry
abstract
A lift curve, with the true positive rate on the y-axis and the customer pull (or contact) rate on the x-axis, is often used to depict the model performance in many data mining applications, especially in the area of customer relationship management (CRM). Typically, these applications concern only the model accuracy at a relatively small pull or contact/intervention rate of the whole customer base, which is predetermined by a budget constraint for the project, e.g., how many customers can be contacted every month. In this paper, we address the important problem of enhancing the lift (true positive rate) at a specified pull rate. We propose two distinct algorithms, which are applicable to different scenarios. In particular, when the binary class label of the training set is extracted from a continuous variable, we can optimize a training objective which takes into account the specified pull rate rather than the class prior, based on the often ignored continuous variable. In those cases where only the binary class label is available during training, we propose a constrained optimization algorithm to maximize the true positive rate related to a specific decision threshold at which the specified pull rate is achieved. We applied both algorithms to our projects of predicting defection (decline in account value) of mutual fund accounts for two major U.S. mutual fund companies and achieved substantial enhancement of the lift at the specified pull rate.
Lian Yan, Michael Fassino, Patrick Baldasare
KDD3