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
- Sabana Backer, Prasanth A.P, The influence of attitude on green-cosmetics purchase intention (pi) in central Kerala , The Scientific Temper: Vol. 15 No. 04 (2024): The Scientific Temper
- A. Sandanasamy, P. Joseph Charles, Distributed SDN control for IoT networks: A federated meta reinforcement learning solution for load balancing , The Scientific Temper: Vol. 16 No. 06 (2025): The Scientific Temper
- Prince Grover, Dr. Bhaskar Kanaiyalal Pandya, The Integration of Grammar and Discourse in Academic Writing , The Scientific Temper: Vol. 17 No. 02 (2026): The Scientific Temper
- S. Sathiyavathi, V. Mathivannan, Selvi. Sabhanayakam, Cd4+ CELL COUNTS IN THE PATIENTS OF HIV INFECTED IN SALEM , The Scientific Temper: Vol. 1 No. 01 (2010): The Scientific Temper
- Sangeeta ., Jitander S. Sikka, Meenal Malik, Static deformation of a two-phase medium consisting of a rigid boundary elastic layer and an isotropic elastic half-space induced by a very long tensile fault , The Scientific Temper: Vol. 15 No. 02 (2024): The Scientific Temper
- M. Jayakandan, A. Chandrabose, An ensemble-based approach for sentiment analysis of covid-19 Twitter data using machine learning and deep learning techniques , The Scientific Temper: Vol. 15 No. spl-1 (2024): The Scientific Temper
- Modenisha U, W. Ritha, Sasitharan Nagapan, Analysing the cost structure of construction sectors considering carbon emission factors , The Scientific Temper: Vol. 16 No. 08 (2025): The Scientific Temper
- Josephine Theresa S, Graph Neural Network Ensemble with Particle Swarm Optimization for Privacy-Preserving Thermal Comfort Prediction , The Scientific Temper: Vol. 16 No. 12 (2025): The Scientific Temper
- Dharmendra Singh, Surabhi Singh, Identification of Microsatellite DNA for Population Genetic Analysis in Tor tor , The Scientific Temper: Vol. 11 No. 1&2 (2020): The Scientific Temper
- Vatsal Parashar, Dimple Raina, Shweta Sahni, Molecular profiling and prevalence of hepatitis B virus (HBV) in clinical isolates and its importance , The Scientific Temper: Vol. 14 No. 02 (2023): The Scientific Temper
<< < 21 22 23 24 25 26 27 28 29 30 > >>
You may also start an advanced similarity search for this article.

