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

Markus Ettl

dblp:02/1590 · DBLP profile ↗
← Back
5ranked-venue papers
0as first author
2since 2021 · last 2022
—ORCID · none

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

Artificial intelligence and machine learning · 5 · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 3 · 1 since 2021Databases, data management, data science and information retrieval · 1

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.

Theoretical computer science
1 paper
Mathematical optimization · 100%
Interdisciplinary, comprehensive, and emerging computing
2 papers
Computational finance and economics · 100%
Databases, data mining, and information retrieval
3 papers
Data mining · 84% Information retrieval · 11% Data integration and cleaning · 5%
Artificial intelligence
2 papers
Trustworthy machine learning · 54% Reinforcement learning · 46%

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

TopicWeightPapersLastEvidence papers
Data mining › business intelligence
prescriptive analytics
0.612022
Constrained Prescriptive Trees via Column Generation · AAAI 2022
Mathematical optimization › large-scale optimization › decomposition methods
column generation
0.612022
Constrained Prescriptive Trees via Column Generation · AAAI 2022
Mathematical optimization
discrete optimization
0.612022
Constrained Prescriptive Trees via Column Generation · AAAI 2022
Mathematical optimization › discrete optimization
mixed integer linear programming
0.612022
Constrained Prescriptive Trees via Column Generation · AAAI 2022
Machine learning › Trustworthy machine learning
interpretability
0.512021
Model Distillation for Revenue Optimization: Interpretable Personalized Pricing · ICML 2021
Computational finance and economics
pricing
0.512021
Model Distillation for Revenue Optimization: Interpretable Personalized Pricing · ICML 2021
Computational finance and economics › mechanism design
revenue maximization
0.512021
Model Distillation for Revenue Optimization: Interpretable Personalized Pricing · ICML 2021
Machine learning › Reinforcement learning
bandit
0.412020
Fatigue-Aware Bandits for Dependent Click Models · AAAI 2020
Computational finance and economics
fraud detection
0.212015
Robust System for Identifying Procurement Fraud · AAAI 2015
Data mining
anomaly detection
0.212015
Big Data System for Analyzing Risky Procurement Entities · KDD 2015
Data mining › anomaly detection
fraud detection
0.212015
Big Data System for Analyzing Risky Procurement Entities · KDD 2015
Information retrieval › user behavior › search behavior
click model
0.112020
Fatigue-Aware Bandits for Dependent Click Models · AAAI 2020
Data integration and cleaning
multi-source data integration
0.112015
Big Data System for Analyzing Risky Procurement Entities · KDD 2015

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

column generation · 1.1prescriptive tree · 1.0model distillation · 1.0decision tree · 1.0bandit algorithms · 0.9mixed-integer programming · 0.6mixed integer programming · 0.6transactional data analysis · 0.2public data source integration · 0.2learning with investigation feedback · 0.2formal guarantees · 0.2
YearPublicationVenuePosition
2022 Constrained Prescriptive Trees via Column Generation
abstract
With the abundance of available data, many enterprises seek to implement data-driven prescriptive analytics to help them make informed decisions. These prescriptive policies need to satisfy operational constraints, and proactively eliminate rule conflicts, both of which are ubiquitous in practice. It is also desirable for them to be simple and interpretable, so they can be easily verified and implemented. Existing approaches from the literature center around constructing variants of prescriptive decision trees to generate interpretable policies. However, none of the existing methods is able to handle constraints. In this paper, we propose a scalable method that solves the constrained prescriptive policy generation problem. We introduce a novel path-based mixed-integer program (MIP) formulation which identifies a (near) optimal policy efficiently via column generation. The policy generated can be represented as a multiway-split tree which is more interpretable and informative than binary-split trees due to its shorter rules. We demonstrate the efficacy of our method with extensive computational experiments on both synthetic and real datasets.
Shivaram Subramanian, Wei Sun 0031, Youssef Drissi, Markus Ettl
AAAI4
2021 Model Distillation for Revenue Optimization: Interpretable Personalized Pricing
abstract
Data-driven pricing strategies are becoming increasingly common, where customers are offered a personalized price based on features that are predictive of their valuation of a product. It is desirable for this pricing policy to be simple and interpretable, so it can be verified, checked for fairness, and easily implemented. However, efforts to incorporate machine learning into a pricing framework often lead to complex pricing policies that are not interpretable, resulting in slow adoption in practice. We present a novel, customized, prescriptive tree-based algorithm that distills knowledge from a complex black-box machine learning algorithm, segments customers with similar valuations and prescribes prices in such a way that maximizes revenue while maintaining interpretability. We quantify the regret of a resulting policy and demonstrate its efficacy in applications with both synthetic and real-world datasets.
Max Biggs, Wei Sun 0031, Markus Ettl
ICML3
2020 Fatigue-Aware Bandits for Dependent Click Models
Junyu Cao, Wei Sun 0031, Zuo-Jun Max Shen, Markus Ettl
AAAI4
2015 Robust System for Identifying Procurement Fraud
abstract
An accredited biennial 2012 study by the Association of Certified Fraud Examiners claims that on average 5% of a company’s revenue is lost because of unchecked fraud every year. The reason for such heavy losses are that it takes around 18 months for a fraud to be caught and audits catch only 3% of the actual fraud. This begs the need for better tools and processes to be able to quickly and cheaply identify potential malefactors. In this paper, we describe a robust tool to identify procurement related fraud/risk, though the general design and the analytical components could be adapted to detecting fraud in other domains. Besides analyzing standard transactional data, our solution analyzes multiple public and private data sources leading to wider coverage of fraud types than what generally exists in the marketplace. Moreover, our approach is more principled in the sense that the learning component, which is based on investigation feedback has formal guarantees. Though such a tool is ever evolving, an initial deployment of this tool over the past 6 months has found many interesting cases from compliance risk and fraud point of view, increasing the number of true positives found by over 80% compared with other state-of-the-art tools that the domain experts were previously using.
Amit Dhurandhar, Rajesh Kumar Ravi, Bruce Graves, Gopikrishnan Maniachari, Markus Ettl
AAAI5
2015 Big Data System for Analyzing Risky Procurement Entities
abstract
An accredited biennial 2014 study by the Association of Certified Fraud Examiners claims that on average 5% of a company's revenue is lost because of unchecked fraud every year. The reason for such heavy losses are that it takes around 18 months for a fraud to be caught and audits catch only 3% of the actual fraud. This begs the need for better tools and processes to be able to quickly and cheaply identify potential malefactors. In this paper, we describe a robust tool to identify procurement related fraud/risk, though the general design and the analytical components could be adapted to detecting fraud in other domains. Besides analyzing standard transactional data, our solution analyzes multiple public and private data sources leading to wider coverage of fraud types than what generally exists in the marketplace. Moreover, our approach is more principled in the sense that the learning component, which is based on investigation feedback has formal guarantees. Though such a tool is ever evolving, a deployment of this tool over the past 12 months has found many interesting cases from compliance risk and fraud point of view across more than 150 countries and 65000+ vendors, increasing the number of true positives found by over 80\% compared with other state-of-the-art tools that the domain experts were previously using.
Amit Dhurandhar, Bruce Graves, Rajesh Kumar Ravi, Gopikrishnan Maniachari, Markus Ettl
KDD5