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

Debanjan Datta

dblp:158/4376 · DBLP profile ↗
← Back
4ranked-venue papers
3as first author
2since 2021 · last 2023
0000-0001-5997-5142ORCID · corroborated

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

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

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
4 papers
Trustworthy machine learning · 48% Efficient and distributed learning · 25% Time series and sequential data · 22%
Databases, data mining, and information retrieval
1 paper
Data mining · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Performance modeling and evaluation · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Efficient and distributed learning
automated machine learning
0.712023
Efficient Multimedia Computing: Unleashing the Power of AutoML · ACM Multimedia 2023
Machine learning › Trustworthy machine learning › interpretability › counterfactual explanation
algorithmic recourse
0.612022
Framing Algorithmic Recourse for Anomaly Detection · KDD 2022
Machine learning › Time series and sequential data
anomaly detection
0.612022
Framing Algorithmic Recourse for Anomaly Detection · KDD 2022
Machine learning › Trustworthy machine learning
interpretability
0.612022
Framing Algorithmic Recourse for Anomaly Detection · KDD 2022
Data mining
anomaly detection
0.412020
Detecting Suspicious Timber Trades · AAAI 2020
Data mining › anomaly detection › outlier detection
categorical data outlier detection
0.412020
Detecting Suspicious Timber Trades · AAAI 2020
Performance modeling and evaluation
benchmarking
0.412020
A Geometric Approach to Predicting Bounds of Downstream Model Performance · KDD 2020
Knowledge, reasoning and agents › Knowledge representation and reasoning › knowledge engineering › knowledge integration
domain knowledge integration
0.112020
Detecting Suspicious Timber Trades · AAAI 2020
Machine learning › Trustworthy machine learning
uncertainty estimation
0.112020
A Geometric Approach to Predicting Bounds of Downstream Model Performance · KDD 2020

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

negative sampling · 0.9machine learning · 0.9embedding-based anomaly detection · 0.9AutoML · 0.7transformer encoder-decoder · 0.6counterfactual generation · 0.6
YearPublicationVenuePosition
2023 Efficient Multimedia Computing: Unleashing the Power of AutoML
abstract
As the field of multimedia computing has grown rapidly, so has the need for larger datasets[5] and increased modeling capacity. Navigating this complex landscape often necessitates the use of sophisticated tools and cloud architectures, which all need to be addressed before the actual research commences. Recently, AutoML, an innovation previously exclusive to tabular data, has expanded to encompass multimedia data. This development has the potential to greatly streamline the research process, allowing researchers to shift their focus from model construction to the core content of their problems. In doing so, AutoML not only optimizes resource utilization but also boosts the reproducibility of results. The aim of this tutorial is to acquaint the multimedia community with AutoML technologies, underscoring their advantages and their practical applications in the field.
Debanjan Datta, Gerald Friedland
ACM Multimedia1
2022 Framing Algorithmic Recourse for Anomaly Detection
abstract
The problem of algorithmic recourse has been explored for supervised machine learning models, to provide more interpretable, transparent and robust outcomes from decision support systems. An unexplored area is that of algorithmic recourse for anomaly detection, specifically for tabular data with only discrete feature values. Here the problem is to present a set of counterfactuals that are deemed normal by the underlying anomaly detection model so that applications can utilize this information for explanation purposes or to recommend countermeasures. We present an approach-Context preserving Algorithmic Recourse for Anomalies in Tabular data(CARAT), that is effective, scalable, and agnostic to the underlying anomaly detection model. CARAT uses a transformer based encoder-decoder model to explain an anomaly by finding features with low likelihood. Subsequently semantically coherent counterfactuals are generated by modifying the highlighted features, using the overall context of features in the anomalous instance(s). Extensive experiments help demonstrate the efficacy of CARAT.
Debanjan Datta, Feng Chen 0001, Naren Ramakrishnan
KDD1
2020 Detecting Suspicious Timber Trades
abstract
Developing algorithms that identify potentially illegal trade shipments is a non-trivial task, exacerbated by the size of shipment data as well as the unavailability of positive training data. In collaboration with conservation organizations, we develop a framework that incorporates machine learning and domain knowledge to tackle this challenge. Modeling the task as anomaly detection, we propose a simple and effective embedding-based anomaly detection approach for categorical data that provides better performance and scalability than the current state-of-art, along with a negative sampling approach that can efficiently train the proposed model. Additionally, we show how our model aids the interpretability of results which is crucial for the task. Domain knowledge, though sparse and scattered across multiple open data sources, is ingested with input of domain experts to create rules that highlight actionable results. The application framework demonstrates the applicability of our proposed approach on real world trade data. An interface combined with the framework presents a complete system that can ingest, detect and aid in the analysis of suspicious timber trades.
Debanjan Datta, Mohammad Raihanul Islam, Nathan Self, Amelia Meadows, John Simeone, Willow Outhwaite, Chen Hin Keong, Amy Smith, Linda Walker, Naren Ramakrishnan
AAAI1
2020 A Geometric Approach to Predicting Bounds of Downstream Model Performance
abstract
This paper presents the motivation and methodology for including model application criteria into baseline analysis. We will focus on detailing the interplay between the common measures of mean square error (MSE) and accuracy as it relates to perceived model performance. MSE is a common aggregate measure for the performance of predictive regression models. The advantages are numerous. MSE is agnostic to the choice of model given that the set of possible outcome values are defined on the appropriate metric space. In practice, decisions on how to subsequently use a trained model are based on predictive performance, relative to a baseline where input features are not used - colloquially a "random model". However, the relative performance gains of a model in terms of MSE to the baseline does not guarantee commensurate gains when deployed in downstream applications, systems, or processes. This paper demonstrates one derivation of a distribution to qualify MSE performance for multi-class decision making systems desiring a certain level of accuracy. The model error is qualified through comparison to relevant baselines tied to the application suited to evaluating individual outcome performance criteria.
Brian J. Goode, Debanjan Datta
KDD2