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
- Abhishek Pandey, V Ramesh, Puneet Mittal, Suruthi, Muniyandy Elangovan, G.Deepa, Exploring advancements in deep learning for natural language processing tasks , The Scientific Temper: Vol. 14 No. 04 (2023): The Scientific Temper
- Ravi Kumar P, C. Gowri Shankar, Optimizing power converters for enhanced electric vehicle propulsion: A novel research methodology , The Scientific Temper: Vol. 15 No. 04 (2024): The Scientific Temper
- Yanbo Wang, Yonghong Zhu, Jingjing Liu, Research on the current situation and influencing factors of college students learning engagement in a blended teaching environment , The Scientific Temper: Vol. 14 No. 03 (2023): The Scientific Temper
- Neeraj ., Anita Singhrova, Quantum Key Distribution-based Techniques in IoT , The Scientific Temper: Vol. 14 No. 03 (2023): The Scientific Temper
- G GAYATHRI DEVI, Dr R Radha, Dark web exploitation of women and children: Understanding the phenomenon and combating its impact , The Scientific Temper: Vol. 15 No. 03 (2024): The Scientific Temper
- Hardik N Talsania, Kirit Modi, Interpretable Cardiovascular Diagnosis using Multi-dimensional Feature Fusion and Deep Learning , The Scientific Temper: Vol. 17 No. 02 (2026): The Scientific Temper
- Suresh L. Chitragar, Occupational Structure of Population in the Malaprabha River Basin, Karnataka State, India; A Geographical Approach , The Scientific Temper: Vol. 15 No. 01 (2024): The Scientific Temper
- Krishna P. Kalyanathaya, Krishna Prasad K, A novel method for developing explainable machine learning framework using feature neutralization technique , The Scientific Temper: Vol. 15 No. 02 (2024): The Scientific Temper
- Amudavalli L, K. Muthuramalingam, Integrated energy-efficient routing and secure data management for location-aware wireless sensor networks with PFO leveraged improved fuzzy unequal clustering algorithm (IFUC) , The Scientific Temper: Vol. 15 No. 04 (2024): The Scientific Temper
- Saba Naaz, K.B. Shiva Kumar, Integrated deep learning classification of Mudras of Bharatanatyam: A case of hand gesture recognition , The Scientific Temper: Vol. 14 No. 04 (2023): The Scientific Temper
<< < 8 9 10 11 12 13 14 15 16 17 > >>
You may also start an advanced similarity search for this article.

