EUVIMEDEUVIMED entdecken
Crossref

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

Muhammad Azka

SPECTA Journal of Technology · 2019

DOI: 10.35718/specta.v1i2.75 ↗

Kurz gefasst

Fachartikel in der Zeitschrift SPECTA Journal of Technology, 2019. Verfasst von Muhammad Azka.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

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.

Zitieren

APA

Azka, M. (2019). Frekuensi Hari Hujan Menurut Bulan di Kota Balikpapan dengan Rantai Markov Waktu Diskrit. SPECTA Journal of Technology. https://doi.org/10.35718/specta.v1i2.75

Vancouver

Azka M. Frekuensi Hari Hujan Menurut Bulan di Kota Balikpapan dengan Rantai Markov Waktu Diskrit. SPECTA Journal of Technology. 2019. doi:10.35718/specta.v1i2.75

BibTeX
@article{Azka2019,
  author = {Azka, Muhammad},
  title = {Frekuensi Hari Hujan Menurut Bulan di Kota Balikpapan dengan Rantai Markov Waktu Diskrit},
  journal = {SPECTA Journal of Technology},
  year = {2019},
  doi = {10.35718/specta.v1i2.75}
}
Kostenlos starten →