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

Piew Datta

dblp:05/3071 · DBLP profile ↗
← Back
7ranked-venue papers
5as first author
0since 2021 · last 2001
—ORCID · none

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

Artificial intelligence and machine learning · 6 · 5 first-authorDatabases, data management, data science and information retrieval · 4 · 2 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
3 papers
Trustworthy machine learning · 60% Representation and self-supervised learning · 30% Learning paradigms · 10%
Databases, data mining, and information retrieval
2 papers
Data mining · 100%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Computational finance and economics · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Trustworthy machine learning › interpretability
concept-based explanation
0.021997
Learning Symbolic Prototypes · ICML 1997
Learning Prototypical Concept Descriptions · ICML 1995
Machine learning › Trustworthy machine learning
interpretability
0.021997
Learning Symbolic Prototypes · ICML 1997
Learning Prototypical Concept Descriptions · ICML 1995
Machine learning › Representation and self-supervised learning
prototype learning
0.021997
Learning Symbolic Prototypes · ICML 1997
Learning Prototypical Concept Descriptions · ICML 1995
Data mining
clustering
0.011999
Statistics and Data Mining Techniques for Lifetime Value Modeling · KDD 1999
Data mining › clustering › user clustering
customer segmentation
0.011999
Statistics and Data Mining Techniques for Lifetime Value Modeling · KDD 1999
Data mining › statistical analysis
survival analysis
0.011999
Statistics and Data Mining Techniques for Lifetime Value Modeling · KDD 1999
Machine learning › Learning paradigms
multi-task learning
0.011993
Concept Sharing: A Means to Improve Multi-Concept Learning · ICML 1993
Data mining › predictive modeling › classification › instance-based learning
nearest neighbor methods
0.012001
Estimating business targets · KDD 2001

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

nearest neighbor · 0.1econometric frontier analysis · 0.1proportional hazards regression · 0.0neural network · 0.0clustering · 0.0
YearPublicationVenuePosition
2001 Estimating business targets
abstract
Determining and setting maximal revenue expectations or other business performance targets---whether it is for regional company divisions or individual customers---can have profound financial implications. Operational techniques are changed, staffing levels are altered and management attention is re-focused---all in the name of expectations. In practice these expectations are often derived in an ad hoc manner. To address this unsupervised task, we combine nearest neighbor methods and classical statistical methods and derive a new solution to the classical econometric task of frontier analysis. We apply our methodology to two real world business problems in Verizon, a major telecommunications provider in the United States, more specifically in the print yellow page division Verizon Information Services: (1) identifying under marketed customers for targeted upselling campaigns and focused sales attention, and (2) benchmarking regional directory divisions to incent performance improvements. Our analysis uncovers some commercially useful aspects of these domains and by conservative estimates can increase revenue by several million dollars in each domain.
Piew Datta, James Drew, Andrew Betz, D. R. Mani, Jeffery Howard
KDD1
1999 Statistics and Data Mining Techniques for Lifetime Value Modeling
abstract
Customer lifetime value (LTV)-which is a measure of the profit generating potential, or value, of a customer-is increasingly being considered a touchstone for customer relationship management.The central challenge in predicting LTV is the production of estimated customer tenures with a given service supplier, based on information contained in company databases.Classical survival analysis techniques like proportional hazards regression focus on covariate effects frequently presumed to be linear, and examination of age-wise effects can be difficult.Further, segments of customers, whose lifetimes and covariate effects can vary widely, are not necessarily easy to detect.A new neural network model for hazard prediction is used to free proportional hazards-like models from their linearity and proportionality constraints, and clustering tools are applied to identify segments of customer hazard patterns.Using the proportional hazards and neural network models in tandem, we demonstrate how data mining tools can be apt complements of the classical statistical models, and show that their combined usage overcomes many of the shortcomings of each separate tool setresulting in a LTV tenure prediction model that is both accurate and understandable.
D. R. Mani, James Drew, Andrew Betz, Piew Datta
KDD4
1999 Bisiness Focused Evaluation Methods: A Case Study
Piew Datta
PKDD1
1999 CHAMP: A Prototype for Automated Cellular Churn Prediction
Brij M. Masand, Piew Datta, Deepak R. Mani
Data Min. Knowl. Discov.2
1997 Learning Symbolic Prototypes
Piew Datta, Dennis F. Kibler
ICML1
1995 Learning Prototypical Concept Descriptions
Piew Datta, Dennis F. Kibler
ICML1
1993 Concept Sharing: A Means to Improve Multi-Concept Learning
Piew Datta, Dennis F. Kibler
ICML1