cover
Article Per Year (5 Year)
All
Home Page
OAI Link
Editorial Team
Contact
Reviewer
Google Scholar
Contact Name
Mesran
Contact Email
mesran.skom.mkom@gmail.com
Phone
+6282365336853
Journal Mail Official
jurnal.bulletinds@gmail.com
Editorial Address
Jalan sisingamangaraja No 338 Medan, Indonesia
Location
Kota medan,
Sumatera utara
INDONESIA
Bulletin of Data Science
Published by Forum Kerjasama Pendidikan TInggi
ISSN : -     EISSN : 28079493     DOI : -
Core Subject : Science, Engineering,
Computer Science & IT Control & Systems Engineering Decision Sciences, Operations Research & Management Electrical & Electronics Engineering
Bulletin of Data Science journal publishes manuscripts within the fields of: 1. Soft Computing, 2. Experts System, 3. Decision Support System, 4. Cryptography, 5. Big Data, 6. Data Mining, 7. Artificial Inteligence, and etc
Arjuna Subject : Ilmu Komputer (semua kategori) - Ilmu Komputer (Lain-Lain)
Articles 5 Documents
 1 
Search results for , issue "Vol 3 No 1 (2023): October 2023" : 5 Documents clear
Perancangan Game Stack Jump Rabbit Dengan Menerapkan Algoritma Greedy Berbasis Android Irwan, Irwan
Bulletin of Data Science Vol 3 No 1 (2023): October 2023
Publisher : Forum Kerjasama Pendidikan Tinggi (FKPT)

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.47065/bulletinds.v3i1.5041

Abstract

Games, more commonly known as 'permainan' in Indonesian, are systems with specific rules where players engage in a challenge to produce measurable outcomes, either winning or losing, thus enticing individuals to participate as a form of entertainment. Stack Jump Rabbit game is an arcade platform game utilizing characters to challenge players to jump and land on blocks coming from both sides (right - left) to stack them up, earning points for successful jumps, avoiding block collisions, and building the tallest tower. Greedy Algorithm is one of the most popular methods for solving optimization problems. Stack Jump Rabbit game incorporates the function to find solutions by implementing the greedy algorithm, triggered when jumping within the application. With this greedy algorithm, blocks move until they reach a perfect stacking point, and the function of these blocks is repeatedly called each time a character lands on them.
Jaringan Syaraf Tiruan Pengaruh Konsumsi Durian Pada Ibu Hamil Dengan Menggunakan Metode Backpropagation Simatupang, Erpina
Bulletin of Data Science Vol 3 No 1 (2023): October 2023
Publisher : Forum Kerjasama Pendidikan Tinggi (FKPT)

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.47065/bulletinds.v3i1.5636

Abstract

A pregnant woman is a woman who is carrying a foetus, which is the gateway to the creation of a reliable next generation. In other words, pregnant women are figures who will one day give birth to the next generation who have the skills and ability to make changes for the better. Pregnant women are also a gift for the progress of the nation because from pregnant women are born prospective successors who will lead a generation in the future. Artificial neural network, or JST for short, has the ability to learn and generate rules or operations from several examples or inputs that are entered and make predictions about possible outputs that will appear or store the characteristics of the input stored to it. Backpropagation is one method that is often used in solving complex problems because networks with this method are trained using a guided learning method. The network is given a pair of patterns consisting of the input pattern and the desired pattern. When a pattern is given to the network, the weights are changed to minimise the difference between the output pattern and the desired pattern. This training is done repeatedly so that all patterns issued by the network can fulfil the desired pattern.
Kompresi File Video Menggunakan Algoritma Yamamoto’s Recursive Code Butar-Butar, Ronaldo P.
Bulletin of Data Science Vol 3 No 1 (2023): October 2023
Publisher : Forum Kerjasama Pendidikan Tinggi (FKPT)

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.47065/bulletinds.v3i1.5693

Abstract

At this time it is very common to use it in all aspects, from advertising, films, even learning during the COVID-19 pandemic using video media as a learning medium. Large video file sizes can reduce free space on storage media such as hard drives, flash drives and so on. The more videos that are stored, the less free space is left, or even no free space is left on the storage media. This will not cause a problem if the storage media used has a large capacity, but not everyone has a large storage media. One way to overcome this problem is to use compression techniques. Data compression is a process of converting a set of data into a form of code to save the need for data storage. On this basis, the application of Yamamoto's Recursive Code Algorithm in Compressing Video Files is made in order to help users compress video files that are initially large into their smallest size. Video compression is the opposite of digital video data compression. Compression is the conversion of data to a smaller format, usually done so that data can be stored or transmitted more efficiently. The process of recovering data that has been reduced is called decompression.
Analisa Sentimen Terhadap Transisi Dari Work From Home ke Work From Office Menggunakan Metode Text Mining Dan TF-IDF Ragil, Muhammad
Bulletin of Data Science Vol 3 No 1 (2023): October 2023
Publisher : Forum Kerjasama Pendidikan Tinggi (FKPT)

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.47065/bulletinds.v3i1.5694

Abstract

The implementation of the WFH(Work From Home) and WFO(Work From Office) work schemes has problems related to the adjustment of the work system by workers. Every company or industrial world always prioritizes the value of productivity in any circumstances to prevent a significant decrease in profits. In this sentiment analysis, the researcher uses the Text Mining and TF-IDF methods based on data collected from the Orange DataMining Twitter application by entering the Twitter Key Secret Token API to retrieve the data from the Twitter social networking platform. And continued with the Text Mining process which is used to select the data that has been taken through the Orange application so that it becomes text that is regularly in accordance with the Transformation, Tokenization, Stemming and Stopword stages, it will continue to the tf-idf or weighting process where the sentence weights are in accordance with the criteria certain, if it is necessary to use a descriptive method to percentage the positive and negative values that evaluate negatively to the transition in the WFH to WFO transition period by 76.05%.
Implementasi Spline Interpolating Untuk Resampling Citra USG Nasution, Rizky Saptiansyah
Bulletin of Data Science Vol 3 No 1 (2023): October 2023
Publisher : Forum Kerjasama Pendidikan Tinggi (FKPT)

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.47065/bulletinds.v3i1.5702

Abstract

Spline interpolation is a form of interpolation in which the interpolation is a special type of spline polynomial. It's like attaching a single degree polynomial to all values ​​at once, then fitting a low degree polynomial to a small subset of values, for example fitting 9 cubic polynomials between each pair of ten points like a single ten degree polynomial for all of them. Comparisons were made in terms of gala and computational time. The process of calculating the error resulting from the absolute value of the value minus the approximation in the actual part multiplied by one hundred percent. The length of time indicated by the amount of data sought in the calculation process. After the resampling process on the image pixels is complete, the Red, Green and Blue images are re-united to get the RGB USG image back, the image will change in size, due to the addition of new pixels. If the initial image is 128x128, the new image will be 255x255.

Page 1 of 1 | Total Record : 5

 1 

Filter by Year

2023 2023


Reset
Filter By Issues
All Issue Vol 4 No 2 (2025): February 2025 Vol 4 No 1 (2024): October 2024 Vol 3 No 3 (2024): June 2024 Vol 3 No 2 (2024): February 2024 Vol 3 No 1 (2023): October 2023 Vol 2 No 3 (2023): Juni 2023 Vol 2 No 2 (2023): February 2023 Vol 2 No 1 (2022): October 2022 Vol 1 No 3 (2022): June 2022 Vol 1 No 2 (2022): February 2022 Vol 1 No 1 (2021): October 2021 More Issue