Anurag Dutta

Dr. Anurag Dutta

orcid

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
Verified
Journal Article
Open access
PDF file
Anurag DuttaAnurag Dutta
Anurag Dutta
LVLiton Chandra Voumik
Liton Chandra Voumik
Ramamoorthy ARamamoorthy A
Ramamoorthy A
Samrat RaySamrat Ray
Samrat Ray
Asif RaihanAsif Raihan
Asif Raihan
Cryptocurrencies are in high demand now due to their volatile and untraceable nature. Bitcoin, Ethereum, and Dogecoin are just a few examples. This research seeks to identify deception and probable fraud in Ethereum transactional processes. We have developed this capability via ChaosNet, an Artificial Neural Network constructed using Generalized Luröth Series maps. Chaos has been objectively discovered in the brain at many spatiotemporal scales. Several synthetic neuronal simulations, including the Hindmarsh–Rose model, possess chaos, and individual brain neurons are known to display chaotic bursting phenomena. Although chaos is included in several Artificial Neural Networks (ANNs), for instance, in Recursively Generating Neural Networks, no ANNs exist for classical tasks entirely made up of chaoticity. ChaosNet uses the chaotic GLS neurons’ property of topological transitivity to perform classification problems on pools of data with cutting-edge performance, lowering the necessary training sample count. This synthetic neural network can perform categorization tasks by gathering a definite amount of training data. ChaosNet utilizes some of the best traits of networks composed of biological neurons, which derive from the strong chaotic activity of individual neurons, to solve complex classification tasks on par with or better than standard Artificial Neural Networks. It has been shown to require much fewer training samples. This ability of ChaosNet has been well exploited for the objective of our research. Further, in this article, ChaosNet has been integrated with several well-known ML algorithms to cater to the purposes of this study. The results obtained are better than the generic results.

3 July 2023 in Risks
Verified
Journal Article
Open access
PDF file
Anurag DuttaAnurag Dutta
Anurag Dutta
LVLiton Chandra Voumik
Liton Chandra Voumik
LKLakshmanan Kumarasankaralingam
Lakshmanan Kumarasankaralingam
Abidur RahamanAbidur Rahaman
Abidur Rahaman
GZGrzegorz Zimon
Grzegorz Zimon
Data are produced every single instant in the modern era of technological breakthroughs we live in today and is correctly termed as the lifeblood of today’s world; whether it is Google or Meta, everyone depends on data to survive. But, with the immense surge in technological boom comes several backlashes that tend to pull it down; one similar instance is the data morphing or modification of the data unethically. In many jurisdictions, the phenomenon of data morphing is considered a severe offense, subject to lifelong imprisonment. There are several cases where data are altered to encrypt reliable details. Recently, in March 2023, Silicon Valley Bank collapsed following unrest prompted by increasing rates. Silicon Valley Bank ran out of money as entrepreneurial investors pulled investments to maintain their businesses afloat in a frigid backdrop for IPOs and individual financing. The bank’s collapse was the biggest since the financial meltdown of 2008 and the second-largest commercial catastrophe in American history. By confirming the “Silicon Valley Bank” stock price data, we will delve further into the actual condition of whether there has been any data morphing in the data put forward by the Silicon Valley Bank. To accomplish the very same, we applied a very well-known statistical paradigm, Benford’s Law and have cross-validated the results using comparable statistics, like Zipf’s Law, to corroborate the findings. Benford’s Law has several temporal proximities, known as conformal ranges, which provide a closer examination of the extent of data morphing that has occurred in the data presented by the various organizations. In this research for validating the stock price data, we have considered the opening, closing, and highest prices of stocks for a time frame of 36 years, between 1987 and 2023. Though it is worth mentioning that the data used for this research are coarse-grained, still since the validation is subjected to a larger time horizon of 36 years; Benford’s Law and the similar statistics used in this article can point out any irregularities, which can result in some insight into the situation and into whether there has been any data morphing in the Stock Price data presented by SVB or not. This research has clearly shown that the stock price variations of the SVB diverge much from the permissible ranges, which can give a conclusive direction on further investigations in this issue by the responsible authorities. In addition, readers of this article must note that the conclusion formed about the topic discussed in this article is objective and entirely based on statistical analysis and factual figures presented by the Silicon Valley Bank Group.

27 May 2022
Verified
Conference Paper
Closed access
Anurag DuttaAnurag Dutta
Anurag Dutta
MCManan Roy Choudhury
Manan Roy Choudhury
KKKrishan Kundu
Krishan Kundu
We have a lot of sorting algorithms in practice in this modern informatica world. Most of them are operating in quadratic time, some have managed to get them down to logarithmic time combined with linear, but there is no sorting algorithm that is efficient enough to sort data in linear time alone. In this paper, we will try to devise some mathematical support to the failure of minimalizing the sorting algorithms in linear time by comparing three well-known approximations of ! with detailed mathematical proofs associated with it. Further, this paper deals with detailed mathematical analysis to support the fact the minimum time complexity that can be attained by a sorting algorithm is of order O( ) without taking into account any extrapolated system advancement or computer architecture modification. There are various sorting algorithms like Merge sort, Heap sort, Interpolation sort, etc. which attains this minimum possible time complexity (worst case). But if we consider some biased cases then better time complexity can be obtained. If the elements of the array are in arithmetic progression, then interpolation search takes lesser time and there are many such biased cases where a particular algorithm gives better output but this paper deals with the general case i.e., no conditions are imposed on the elements of the array.

30 March 2022 in International Journal of Computer Science and Mobile Computing
Verified
Journal Article
Closed access
Anurag DuttaAnurag Dutta
Anurag Dutta
VCVeenu Chhabra
Veenu Chhabra
PKPijush Kanti Kumar
Pijush Kanti Kumar
Data is the new fuel. With the expansion of the global technology, the in-creasing standards of living and with modernization, data values have caught a great height. Now a days, nearly all top MNCs feed on data. Now, to store all this data is a prime concern for all of them, which is relieved by the Data Structures, the systematic way of storing data. Now, once these data are stored and charged in secure vaults, it’s time to utilize them in the most efficient way. Now, there are a lot of operations that needs to be performed on these massive chunks of data, like searching, sorting, inserting, deleting, merging and so more. In this paper, we would be comparing all the major sorting algorithms that have prevailed till date. Further, work have been done and an inequality in dimension of time between the four Sorting algorithms, Bubble, Selection, Insertion, Merge, that have been discussed in the paper have been proposed.

15 November 2023 in Human-Centric Intelligent Systems
Verified
Journal Article
Open access
PDF file
Anurag DuttaAnurag Dutta
Anurag Dutta
JHJohn Harshith
John Harshith
ARA. Ramamoorthy
A. Ramamoorthy
KLK. Lakshmanan
K. Lakshmanan
Predicting and understanding the behavior of dynamic systems have driven advancements in various approaches, including physics-based models and data-driven techniques like deep neural networks. Chaotic systems, with their stochastic nature and unpredictable behavior, pose challenges for accurate modeling and forecasting, especially during extreme events. In this paper, we propose a novel deep learning framework called Attractor-Inspired Deep Learning (AiDL), which seamlessly integrates actual statistics and mathematical models of system kinetics. AiDL combines the strengths of physics-informed machine learning and data-driven methods, offering a promising solution for modeling nonlinear systems. By leveraging the intricate dynamics of attractors, AiDL bridges the gap between physics-based models and deep neural networks. We demonstrate the effectiveness of AiDL using real-world data from various domains, including catastrophic weather mechanics, El Niño cycles, and disease transmission. Our empirical results showcase AiDL’s ability to substantially enhance the modeling of extreme events. The proposed AiDL paradigm holds promise for advancing research in Time Series Prediction of Extreme Events and has applications in real-world chaotic system transformations.

13 September 2025 in Archives of Computational Methods in Engineering
Verified
Journal Article
Open access
PDF file
Anurag DuttaAnurag Dutta
Anurag Dutta
BMB. Maheswari
B. Maheswari
NPN. Punitha
N. Punitha
ARA. Stephan Antony Raj
A. Stephan Antony Raj
SBS. Sharmila Banu
S. Sharmila Banu
MBMr. M Balamurugan
Mr. M Balamurugan
Neural Networks have shown terrific results in working out several tasks accurately. Be it speech recognition, computer vision, natural language processing, or even generative intelligence, Artificial Neural Networks are ubiquitous. These clusters of neurons with intermittent connectivity are also referred to as Multilayered Perceptron (MLP). Since its inception in 1958, MLPs have served a lot to the neural networking world. It consists of a cluster of neurons assorted at different levels in the form of layers that are connected using non-linear fixed activation functions. These neurons mimic the learning capabilities of the human brain, as it learns the weights and biases annotated with the respective neurons by the process of Backpropagation. Recently in March 2024, inspired by the Kolmogorov-Arnold representation theorem, Liu et al. proposed the Kolmogorov-Arnold Networks (KANs), which grew out of an effort to have learnable, activation functions in place of the weights of an MLP. KANs possess no linear weight vectors, rather it replaces the entire weights as evident in the MLPs with univariate activation function (here., Spline). In the introductory dissemination of KANs, the authors showed better accuracy attained by the KANs over MLPs for a wide range of tasks. Following the introductory article, several advancements have been contributed in the same direction like TKAN, Wav-KAN, DeepOKAN, etc. This review aims to study these recent developments and their respective prospects. Each of these improvisations will be thoroughly examined based on their target domain and scopes of further improvisations.