Melola Discovery

← Melola Discovery

Jurnal SINTA 2

Pengembangan Auto-AI Model Generatif Analisis Kompleksitas Waktu Algoritma Untuk Data Multi-Sensor IoT Pada Node-RED Menggunakan Extreme Learning Machine

Jurnal Teknologi Informasi dan Ilmu Komputer (JTIIK) · Vol. 9 No. 7 (2022) · pp. 1349–1356

DOI
10.25126/jtiik.2022976738
ISSN
2528-6579, 2355-7699
Published
2022-12-29
Publisher
Fakultas Ilmu Komputer, Universitas Brawijaya
Language
id

Abstract

Awal mulanya, algoritma hanya dipakai untuk solusi penyelesaian persamaan matematika sederhana, seperti aljabar, aritmatika, probabilitas, dan lainnya yang lebih banyak dikerjakan secara manual dan membutuhkan waktu dan upaya yang cukup tinggi seperti pada kasus penghitungan nilai kompleksitas waktu algoritma dengan model rumus T(n), baik untuk algoritma non-rekursif maupun rekursif. Namun dengan perkembangan teknologi komputer untuk AI, Machine Learning maupun Deep Learning, algoritma dengan basis AI tersebut, dalam penelitian ini dikembangkan untuk menemukan solusi general persamaan model T(n) secara otomatis dari desain algoritma sederhana atau kompleks. Langkah dalam penelitian digunakan pembuatan model generatif berbasis algoritma Extreme Learning Machine (ELM) berdasarkan pencatatan nilai waktu komputasi pada beberapa kali pengujian untuk mengotomasi penentuan model persamaan kompleksitas waktu algoritma secara general baik untuk pencarian best case, worst case maupun average case untuk non-rekursif, dan base case dan recurrent case untuk rekursif, maupun keduanya. Hasil komparasi nilai T(n) dari ELM, yang tercepat atau terkecil waktu komputasinya digunakan sebagai rekomendasi algoritma untuk pengolahan data multi-sensor pada Internet of Things (IoT) simulator maupun non-simulator menggunakan Node-RED dengan tambahan platform yaitu flespi dan Heroku, sebagai solusi general untuk semua jenis kasus dan analisis algoritmanya. Berdasarkan pengujian didapatkan selisih nilai antara data aktual dengan hasil prediksi dalam ukuran nilai rata-rata MAPE sebesar 11,90%, yang menunjukkan nilai kesalahan yang cukup kecil. AbstractInitially, algorithms were only used for solving simple mathematical equations such as algebra, arithmetic, probability, and others that were mostly carried out manually and required quite a lot of time and effort as in the case of calculating the value of the time complexity of the algorithm with the formula model of T(n), both for non-recursive and recursive algorithms. However, with the development of computer technology for AI, both Machine Learning and Deep Learning, the AI-based algorithms in this study were developed to identify general solutions to the T(n) model equation automatically from simple or complex algorithm designs. The steps in the study are utilized to create a generative model based on the Extreme Learning Machine (ELM) algorithm according to the recording of computational time values on several tests to automate the determination of time complexity equation model of the algorithm in general including the search of best cases, worst cases, and average cases for non-recursive, and base cases and recurrent cases for recursive, as well as algorithms that contain both. The results of the comparison of T(n) values from ELM revealed that the fastest or smallest computational time is used as the algorithm recommendations for multi-sensor data processing in the Internet of Things (IoT) simulators and non-simulators by utilizing Node-RED with additional platforms i.e., flespi and Heroku, as a general solution for the entire types of cases and analysis of their algorithms. Based on the tests that have been carried out, the difference in value between the actual data and the prediction results in the size of the MAPE average value of 11.90%, which shows a fairly small error value.

Collaboration network of the authors

40 authors · 119 co-authorship links · 3 across different organisations · showing the 40 most connected

Hover or tap a name to highlight its co-authors. Double-click to open the author's page.

  • University of Brawijaya
  • Universitas Amikom Purwokerto
  • Affiliation unknown
  • Different organisations
  • Same organisation
  • Affiliation unknown
  • Thicker line = more joint articles · bigger circle = more articles
Show as table
Co-authorOrganisationJoint articles
Barlian Henryranu PrasetioUniversity of Brawijaya4
Arief Andy SoebrotoUniversity of Brawijaya3
Daneswara JauhariUniversity of Brawijaya3
Dhimas Anjar PrabowoUniversity of Brawijaya3
Hurriyatul FitriyahUniversity of Brawijaya3
Randy Cahya WihandikaUniversity of Brawijaya3
Sutrisno .Affiliation unknown2
Nurul HidayatUniversity of Brawijaya2
Canny Amerilyse CaesarUniversity of Brawijaya2
Latifah HanumUniversity of Brawijaya2
Muhammad FhadliUniversity of Brawijaya2
Anang HanafiUniversity of Brawijaya2
Listiya SurtiningsihUniversity of Brawijaya2
Fitra Abdurrachman BachtiarUniversity of Brawijaya2
Fitri UtaminingrumUniversity of Brawijaya2
Rizal MaulanaUniversity of Brawijaya2
Muhammad Ali FauziUniversity of Brawijaya2
Ahmad Afif SupiantoUniversity of Brawijaya1
Maria Tenika FrestantiyaUniversity of Brawijaya1
Ziya El AriefUniversity of Brawijaya1
Candra DewiUniversity of Brawijaya1
Rina ChristantiUniversity of Brawijaya1
Budi Darma SetiawanUniversity of Brawijaya1
Rekyan Regasari Mardi PutriUniversity of Brawijaya1
Lailil MuflikhahUniversity of Brawijaya1
Muhammad SyafiqUniversity of Brawijaya1
Achmad Jafar Al KadafiUniversity of Brawijaya1
Rizka Husnun ZakiyyahUniversity of Brawijaya1
Wanda Athira LuqyanaUniversity of Brawijaya1
Uswatun HasanahUniversitas Amikom Purwokerto1
Lintang Resita MayangsariUniversity of Brawijaya1
Andhica PratamaUniversity of Brawijaya1
Mochammad Ainun NajibUniversity of Brawijaya1

Affiliations come from OpenAlex; journal OAI-PMH metadata carries none. Authors without an OpenAlex ID are matched by name, which can merge or split people.

Metadata source: OAI-PMH (metadata jurnal) https://jtiik.ub.ac.id/index.php/jtiik/en/oai, first harvested 27 Okt 2026, last seen 27 Okt 2026.
Original metadata (oai_dc)
<oai_dc:dc xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/  http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="id">Pengembangan Auto-AI Model Generatif Analisis Kompleksitas Waktu Algoritma Untuk Data Multi-Sensor IoT Pada Node-RED Menggunakan Extreme Learning Machine</dc:title>
	<dc:creator xml:lang="id">Cholissodin, Imam</dc:creator>
	<dc:creator xml:lang="id">Syauqy, Dahnial</dc:creator>
	<dc:creator xml:lang="id">Firmanda, Dwi Ady</dc:creator>
	<dc:creator xml:lang="id">Aji, Ibrahim</dc:creator>
	<dc:creator xml:lang="id">Rahman, Edy</dc:creator>
	<dc:creator xml:lang="id">Harahap, Syazwandy</dc:creator>
	<dc:creator xml:lang="id">Septino, Fernando</dc:creator>
	<dc:description xml:lang="id">Awal mulanya, algoritma hanya dipakai untuk solusi penyelesaian persamaan matematika sederhana, seperti aljabar, aritmatika, probabilitas, dan lainnya yang lebih banyak dikerjakan secara manual dan membutuhkan waktu dan upaya yang cukup tinggi seperti pada kasus penghitungan nilai kompleksitas waktu algoritma dengan model rumus T(n), baik untuk algoritma non-rekursif maupun rekursif. Namun dengan perkembangan teknologi komputer untuk AI, Machine Learning maupun Deep Learning, algoritma dengan basis AI tersebut, dalam penelitian ini dikembangkan untuk menemukan solusi general persamaan model T(n) secara otomatis dari desain algoritma sederhana atau kompleks. Langkah dalam penelitian digunakan pembuatan model generatif berbasis algoritma Extreme Learning Machine (ELM) berdasarkan pencatatan nilai waktu komputasi pada beberapa kali pengujian untuk mengotomasi penentuan model persamaan kompleksitas waktu algoritma secara general baik untuk pencarian best case, worst case maupun average case untuk non-rekursif, dan base case dan recurrent case untuk rekursif, maupun keduanya. Hasil komparasi nilai T(n) dari ELM, yang tercepat atau terkecil waktu komputasinya digunakan sebagai rekomendasi algoritma untuk pengolahan data multi-sensor pada Internet of Things (IoT) simulator maupun non-simulator menggunakan Node-RED dengan tambahan platform yaitu flespi dan Heroku, sebagai solusi general untuk semua jenis kasus dan analisis algoritmanya. Berdasarkan pengujian didapatkan selisih nilai antara data aktual dengan hasil prediksi dalam ukuran nilai rata-rata MAPE sebesar 11,90%, yang menunjukkan nilai kesalahan yang cukup kecil. AbstractInitially, algorithms were only used for solving simple mathematical equations such as algebra, arithmetic, probability, and others that were mostly carried out manually and required quite a lot of time and effort as in the case of calculating the value of the time complexity of the algorithm with the formula model of T(n), both for non-recursive and recursive algorithms. However, with the development of computer technology for AI, both Machine Learning and Deep Learning, the AI-based algorithms in this study were developed to identify general solutions to the T(n) model equation automatically from simple or complex algorithm designs. The steps in the study are utilized to create a generative model based on the Extreme Learning Machine (ELM) algorithm according to the recording of computational time values on several tests to automate the determination of time complexity equation model of the algorithm in general including the search of best cases, worst cases, and average cases for non-recursive, and base cases and recurrent cases for recursive, as well as algorithms that contain both. The results of the comparison of T(n) values from ELM revealed that the fastest or smallest computational time is used as the algorithm recommendations for multi-sensor data processing in the Internet of Things (IoT) simulators and non-simulators by utilizing Node-RED with additional platforms i.e., flespi and Heroku, as a general solution for the entire types of cases and analysis of their algorithms. Based on the tests that have been carried out, the difference in value between the actual data and the prediction results in the size of the MAPE average value of 11.90%, which shows a fairly small error value.</dc:description>
	<dc:publisher xml:lang="en">Fakultas Ilmu Komputer, Universitas Brawijaya</dc:publisher>
	<dc:date>2022-12-29</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://jtiik.ub.ac.id/index.php/jtiik/article/view/6738</dc:identifier>
	<dc:identifier>10.25126/jtiik.2022976738</dc:identifier>
	<dc:source xml:lang="id">Jurnal Teknologi Informasi dan Ilmu Komputer; Vol 9 No 7: Spesial Issue Seminar Nasional Teknologi dan Rekayasa Informasi (SENTRIN) 2022; 1349-1356</dc:source>
	<dc:source xml:lang="en">Jurnal Teknologi Informasi dan Ilmu Komputer; Vol. 9 No. 7: Spesial Issue Seminar Nasional Teknologi dan Rekayasa Informasi (SENTRIN) 2022; 1349-1356</dc:source>
	<dc:source>2528-6579</dc:source>
	<dc:source>2355-7699</dc:source>
	<dc:source>10.25126/jtiik.202297</dc:source>
	<dc:language>id</dc:language>
	<dc:relation>https://jtiik.ub.ac.id/index.php/jtiik/article/view/6738/pdf</dc:relation>
	<dc:rights xml:lang="en">Copyright (c) 2022 Jurnal Teknologi Informasi dan Ilmu Komputer</dc:rights>
</oai_dc:dc>