A general stochastic model to handle deduplication challenges using hidden Markov model in big data analytics
Downloads
Published
DOI:
https://doi.org/10.58414/SCIENTIFICTEMPER.2023.14.4.50Keywords:
Hidden markov model, Markov chain transition, Likelihood estimation, Poisson distribution.Dimensions Badge
Issue
Section
License
Copyright (c) 2023 The Scientific Temper

This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
Background: Since increased interest of consumers, cloud computing is needed to store and access the information about their data in their convenient way. In recent days, cloud computing offers many services stipulated by the internet. Data duplication is one of the main challenges in big data analytics that leads to increased data storage and processing time. Therefore, there is a need to develop a data deduplication process. It eliminates excessive copies of data as well as decreases the storage space. In order to preserve the accurate data information without any duplication, joint probability distribution computes the likelihood of two events occurring together at the same time and thus it leads to removing the redundant data before data is sent to the cloud server.Abstract
Methods: this paper presents a GSM algorithm that uses hidden markov model, likelihood estimation, markov chain transition, and poisson distribution model.
Findings: Joint probability distribution computes the likelihood of two events occurring together at the same time and thus it leads to removing the redundant data before data is sent to the cloud server.
Novelty and applications: This paper proposes the general stochastic model (GSM) to handle redundant data by a multi-level process using hidden markov model (HMM), likelihood estimation, transition probability and poisson distribution model (PDM).
How to Cite
Downloads
Similar Articles
- Shaik Khaleel Ahamed, Neerav Nishant, Ayyakkannu Selvaraj, Nisarg Gandhewar, Srithar A, K.K.Baseer, Investigating privacy-preserving machine learning for healthcare data sharing through federated learning , The Scientific Temper: Vol. 14 No. 04 (2023): The Scientific Temper
- Jadhav Girish Vasantrao, Chirag Patel, AT&C and non-technical loss reduction in smart grid using smart metering with AI techniques , The Scientific Temper: Vol. 16 No. 08 (2025): The Scientific Temper
- Shiny Bridgette I, Rexlin Jeyakumari S, An optimal fuzzy inventory model for rice farming using lagrangean method , The Scientific Temper: Vol. 15 No. 03 (2024): The Scientific Temper
- Anurag Tripathi, Distribution pattern of acetylcholinesterase in the Diencephalic nuclei of Hemidactylus flaviviridis , The Scientific Temper: Vol. 16 No. 11 (2025): The Scientific Temper
- S V Arulvani, Dr. C. Jayanthi, Logistic Elitist Liquid Neural Network For Student Dropout Prediction , The Scientific Temper: Vol. 17 No. 02 (2026): The Scientific Temper
- Panda Aditi Ambarish, Kaushik Trivedi, Immersive learning: A virtual reality teaching model for enhancing english speaking skills , The Scientific Temper: Vol. 15 No. spl-2 (2024): The Scientific Temper
- Vinodini R, Ritha W, The economic order quantity model for sustainable green inventory considers deterioration impact on the real-time replacement and various reorder points with imperfect quality items , The Scientific Temper: Vol. 16 No. 04 (2025): The Scientific Temper
- S. Ranganathan, V. Umadevi, FDBSCAN-MBKSched: A Hybrid Edge-Cloud Clustering and Energy-Aware Federated Learning Framework with Adaptive Update Scheduling for Healthcare IoT , The Scientific Temper: Vol. 16 No. 12 (2025): The Scientific Temper
- Shivali Kundan, Neha Verma, Zahid Nabi, Dinesh Kumar, Satellite radiance assimilation using the 3D-var technique for the heavy rainfall over the Indian region , The Scientific Temper: Vol. 13 No. 02 (2022): The Scientific Temper
- G. Vijayalakshmi, M. V. Srinath, Student’s Academic Performance Improvement Using Adaptive Ensemble Learning Method , The Scientific Temper: Vol. 16 No. 11 (2025): The Scientific Temper
<< < 3 4 5 6 7 8 9 10 11 12 > >>
You may also start an advanced similarity search for this article.

