Kanishka Ghosh Dastidar

Kanishka Ghosh Dastidar

Auto-generated profile, based on publicly available information

Kanishka Ghosh Dastidar

University of Passau, Passau, Germany

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
28 October 2024 in IEEE Access
Verified
Journal Article
Open access
KDKanishka Ghosh Dastidar
Kanishka Ghosh Dastidar
OCOlivier Caelen
Olivier Caelen
MGMichael Granitzer
Michael Granitzer
As a consequence of the ubiquity of online payments, there has been an accompanying surge in fraudulent activity in recent times, leading to billions of dollars of financial losses. As payment providers aim to tackle this with various preventive mechanisms, fraudsters also continuously evolve their methods to remain indistinguishable from genuine actors. This necessitates sophisticated fraud detection tools to supplement these security mechanisms. As the volume of transactions taking place per day is in the millions, relying solely on human investigation is expensive and ultimately unfeasible, leading to an emergence of research into data driven or machine learning methods for fraud detection. Over the last decade, this research has evolved into tackling the various particularities of the domain. These include the skewed nature of the data, the evolving user and fraud behaviour and towards learning representations of the context in which a transaction takes place. This work aims to provide the community an in-depth overview of these different directions in which recent research works on online fraud detection has focused on. We develop a taxonomy of the domain based on these directions and organize our analysis according to them. For each area we focus on significant methodological advancements and highlight limitations or gaps in the current state-of-the-art solutions. Through our analysis, it emerges that one of the the primary limiting factors that many researchers face is the lack availability of high-quality credit card data. Therefore, we provide a first step in addressing this in the form of a data generation framework using generative adversarial networks (GANs). We hope that this survey serves as a foundation for researchers who want to address the multi-faceted problem of credit card fraud detection.

6 February 2022 in Knowledge and Information Systems
Verified
Journal Article
Open access
PDF file
KDKanishka Ghosh Dastidar
Kanishka Ghosh Dastidar
JJJohannes Jurgovsky
Johannes Jurgovsky
WSWissam Siblini
Wissam Siblini
MGMichael GRanitzer
Michael GRanitzer
The state-of-the-art feature-engineering method for fraud classification of electronic payments uses manually engineered feature aggregates, i.e., descriptive statistics of the transaction history. However, this approach has limitations, primarily that of being dependent on expensive human expert knowledge. There have been attempts to replace manual aggregation through automatic feature extraction approaches. They, however, do not consider the specific structure of the manual aggregates. In this paper, we define the novel Neural Aggregate Generator (NAG), a neural network-based feature extraction module that learns feature aggregates end-to-end on the fraud classification task. In contrast to other automatic feature extraction approaches, the network architecture of the NAG closely mimics the structure of feature aggregates. Furthermore, the NAG extends learnable aggregates over traditional ones through soft feature value matching and relative weighting of the importance of different feature constraints. We provide a proof to show the modeling capabilities of the NAG. We compare the performance of the NAG to the state-of-the-art approaches on a real-world dataset with millions of transactions. More precisely, we show that features generated with the NAG lead to improved results over manual aggregates for fraud classification, thus demonstrating its viability to replace them. Moreover, we compare the NAG to other end-to-end approaches such as the LSTM or a generic CNN. Here we also observe improved results. We perform a robust evaluation of the NAG through a parameter budget study, an analysis of the impact of different sequence lengths and also the predictions across days. Unlike the LSTM or the CNN, our approach also provides further interpretability through the inspection of its parameters.

13 July 2025
Verified
Conference Paper
Open access
MDMichael Dinzinger
Michael Dinzinger
LCLaura Caspari
Laura Caspari
KDKanishka Ghosh Dastidar
Kanishka Ghosh Dastidar
JMJelena Mitrović
Jelena Mitrović
MGMichael GRanitzer
Michael GRanitzer

24 March 2026
Verified
Book Chapter
Closed access
PDF file
LCLaura Caspari
Laura Caspari
MDMichael Dinzinger
Michael Dinzinger
KDKanishka Ghosh Dastidar
Kanishka Ghosh Dastidar
CFChristofer Fellicious
Christofer Fellicious
JMJelena Mitrović
Jelena Mitrović
MGMichael GRanitzer
Michael GRanitzer

19 July 2026
Verified
Conference Paper
Open access
KDKanishka Ghosh Dastidar
Kanishka Ghosh Dastidar
MDMichael Dinzinger
Michael Dinzinger
LCLaura Caspari
Laura Caspari
JMJelena Mitrović
Jelena Mitrović
MGMichael GRanitzer
Michael GRanitzer
LLM-based chatbots are increasingly augmented with retrieval mechanisms operating over web-scale corpora. Evaluating the effectiveness of these retrieval components is challenging, as explicit relevance judgments are often unavailable. Query performance prediction (QPP) addresses this limitation by providing unsupervised estimates of retrieval effectiveness. However, existing QPP methods assume a static corpus and do not account for the impact of corpus growth on query performance. In this work, we extend the QPP paradigm by studying query performance degradation under corpus inflation in dense retrieval systems. Using tiered corpora with fixed relevance judgments, we analyze how query effectiveness evolves as the corpus (index) size increases and evaluate the ability of established score-based and embedding-based post-retrieval QPP methods to predict such degradation. Our findings show that the reliability of these predictors is dependent on the dataset. We propose simple adaptations to established QPP measures, most notably a top-k vs background Wasserstein distance measure, which yield more consistent associations with degradation and outperform their original counterparts. These findings highlight limitations of several QPP approaches in large-scale, continuously expanding retrieval environments and motivate the development of corpus-growth-aware QPP measures.

6 November 2026
Verified
Conference Paper
Open access
LCLaura Caspari
Laura Caspari
KDKanishka Ghosh Dastidar
Kanishka Ghosh Dastidar
MDMichael Dinzinger
Michael Dinzinger
JMJelena Mitrović
Jelena Mitrović
MGMichael GRanitzer
Michael GRanitzer
Dense retrieval is commonly evaluated on benchmarks that represent each document with a single embedding, even though real-world retrieval systems often index long documents that require chunking. In these settings, the chosen chunking method not only affects retrieval quality, but also indexing throughput, query latency, and memory usage. Prior comparisons of chunking strategies have mainly focused on retrieval performance, leaving operational trade-offs underexplored. To address these issues, we evaluate eight representative chunking strategies across two scalable corpora, three embedding models, and multiple corpus sizes, measuring both retrieval effectiveness and system-level costs. Our results show that computationally expensive methods rarely provide consistent gains over simpler chunking. Instead, the best performing strategy depends on the embedding model, dataset, corpus size, and target retrieval metric. Methods with similar performance can also differ substantially in operational cost, showing that chunking should be seen as a multi-objective design decision. Our code and datasets are available on GitHub. https://github.com/casparil/chunking-eval and Hugging Face. https://huggingface.co/datasets/PaDaS-Lab/kilt-nq. https://huggingface.co/datasets/PaDaS-Lab/CoRE.