Frekuensi Hari Hujan Menurut Bulan di Kota Balikpapan dengan Rantai Markov Waktu Diskrit

The problem proposed in this research is about the amount rainy day per a month at Balikpapan city and discretetime markov chain. The purpose is finding the  probability of rainy day with the frequency rate of rainy at the next month if given the frequency rate of rainy at the prior month. The appli...

Full description

Bibliographic Details
Main Author: Muhammad Azka
Format: Article
Language:English
Published: Institut Teknologi Kalimantan 2019-11-01
Series:Specta
Online Access:https://journal.itk.ac.id/index.php/sjt/article/view/75
id doaj-abf2b6034a324fd7abb16f8c69657bdd
record_format Article
spelling doaj-abf2b6034a324fd7abb16f8c69657bdd2021-03-26T01:58:21ZengInstitut Teknologi KalimantanSpecta2549-27132622-90992019-11-011251010.35718/specta.v1i2.7575Frekuensi Hari Hujan Menurut Bulan di Kota Balikpapan dengan Rantai Markov Waktu DiskritMuhammad Azka0Institut Teknologi KalimantanThe problem proposed in this research is about the amount rainy day per a month at Balikpapan city and discretetime markov chain. The purpose is finding the  probability of rainy day with the frequency rate of rainy at the next month if given the frequency rate of rainy at the prior month. The applied method in this research is classifying the amount of rainy day be three frequency levels, those are, high, medium, and low. If a month, the amount of rainy day is less than 11 then the frequency rate for the month is classified low, if a month, the amount of rainy day between 10 and 20, then it is classified medium and if it is more than 20, then it is classified high. The result is discrete-time markov chain represented with the transition probability matrix, and the transition diagram.https://journal.itk.ac.id/index.php/sjt/article/view/75
collection DOAJ
language English
format Article
sources DOAJ
author Muhammad Azka
spellingShingle Muhammad Azka
Frekuensi Hari Hujan Menurut Bulan di Kota Balikpapan dengan Rantai Markov Waktu Diskrit
Specta
author_facet Muhammad Azka
author_sort Muhammad Azka
title Frekuensi Hari Hujan Menurut Bulan di Kota Balikpapan dengan Rantai Markov Waktu Diskrit
title_short Frekuensi Hari Hujan Menurut Bulan di Kota Balikpapan dengan Rantai Markov Waktu Diskrit
title_full Frekuensi Hari Hujan Menurut Bulan di Kota Balikpapan dengan Rantai Markov Waktu Diskrit
title_fullStr Frekuensi Hari Hujan Menurut Bulan di Kota Balikpapan dengan Rantai Markov Waktu Diskrit
title_full_unstemmed Frekuensi Hari Hujan Menurut Bulan di Kota Balikpapan dengan Rantai Markov Waktu Diskrit
title_sort frekuensi hari hujan menurut bulan di kota balikpapan dengan rantai markov waktu diskrit
publisher Institut Teknologi Kalimantan
series Specta
issn 2549-2713
2622-9099
publishDate 2019-11-01
description The problem proposed in this research is about the amount rainy day per a month at Balikpapan city and discretetime markov chain. The purpose is finding the  probability of rainy day with the frequency rate of rainy at the next month if given the frequency rate of rainy at the prior month. The applied method in this research is classifying the amount of rainy day be three frequency levels, those are, high, medium, and low. If a month, the amount of rainy day is less than 11 then the frequency rate for the month is classified low, if a month, the amount of rainy day between 10 and 20, then it is classified medium and if it is more than 20, then it is classified high. The result is discrete-time markov chain represented with the transition probability matrix, and the transition diagram.
url https://journal.itk.ac.id/index.php/sjt/article/view/75
work_keys_str_mv AT muhammadazka frekuensiharihujanmenurutbulandikotabalikpapandenganrantaimarkovwaktudiskrit
_version_ 1724202801069817856