A graph-based big data optimization approach using hidden Markov model and constraint satisfaction problem

Volume: 8, Issue: 1
Published: Jun 29, 2021
Abstract
To address the challenges of big data analytics, several works have focused on big data optimization using metaheuristics. The constraint satisfaction problem (CSP) is a fundamental concept of metaheuristics that has shown great efficiency in several fields. Hidden Markov models (HMMs) are powerful machine learning algorithms that are applied especially frequently in time series analysis. However, one issue in forecasting time series using HMMs...
Paper Details
Title
A graph-based big data optimization approach using hidden Markov model and constraint satisfaction problem
Published Date
Jun 29, 2021
Volume
8
Issue
1
Citation AnalysisPro
  • Scinapse’s Top 10 Citation Journals & Affiliations graph reveals the quality and authenticity of citations received by a paper.
  • Discover whether citations have been inflated due to self-citations, or if citations include institutional bias.