cover
Article Per Year (5 Year)
All
Home Page
OAI Link
Editorial Team
Contact
Reviewer
Google Scholar
Contact Name
-
Contact Email
-
Phone
-
Journal Mail Official
-
Editorial Address
-
Location
Kab. jember,
Jawa timur
INDONESIA
INFORMAL: Informatics Journal
Published by Universitas Jember
ISSN : 2503250X     EISSN : -     DOI : -
Core Subject : Science,
Computer Science & IT
Arjuna Subject : -
Articles 8 Documents
 1 
Search results for , issue "Vol 3 No 1 (2018): INFORMAL - Informatics Journal" : 8 Documents clear
Strategi Menemukan Jalan Keluar Labirin dengan Waktu Tercepat Menggunakan Metode DFS Mustika Rahmasuci; Husnul Hotimatus s; Maulia Azizah; Putri Wulandari; Diah Adistia A; Saiful Bukhori
INFORMAL: Informatics Journal Vol 3 No 1 (2018): INFORMAL - Informatics Journal
Publisher : Faculty of Computer Science, University of Jember

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.19184/isj.v3i1.9852

Abstract

Depth-first search algorithm are blind search process and deepen search follow a single track until found goal. Maze is complicated network way and tortuous, also have many deadlock. Maze often become a challenge in a game like puzzle, which one there’s an object in start position have find way out on specify position. in this journal we’ll discuss about utilization DFS on maze and fastest time to find way out.
Analisis Perbandingan Fitur Search Engine Saiful i Bukhor
INFORMAL: Informatics Journal Vol 3 No 1 (2018): INFORMAL - Informatics Journal
Publisher : Faculty of Computer Science, University of Jember

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.19184/isj.v3i1.9850

Abstract

Search engines are used in the web as a tool for information retrieval. Web Server is a large warehouse of heterogeneous and unstructured data so that to filter out relevant information from people, a search engine is needed. Search engines usually consist of page repositories, indexing modules, query modules and ranking modules. Search engines do not work alone, besides that there is a web browser that supports the work of this search engine to be more optimal. A browser is software that is run on a user's computer (user) that displays web documents or information taken from a web server [1]. A browser is the type of intermediary the user uses most often. This paper aims to analyze three search engines namely Google, Yahoo, and Bing based on existing features. These features include web search, image search, video search, news search, route search, book search, change search settings, display number of views, shopping, language translator. Google stands as the best search engine among all search engines, which works using the Page Rank algorithm. Page Rank is a numerical value that determines the importance of a web page by calculating the number of backlinks.
Sistem Pendukung Keputusan Seleksi Beasiswa Situbondo Unggul Menggunakan Metode Simple Additive Weighting dan Profile Matching Moh Febri Nurul Qorik; Slamin Slamin; Priza Pandunata
INFORMAL: Informatics Journal Vol 3 No 1 (2018): INFORMAL - Informatics Journal
Publisher : Faculty of Computer Science, University of Jember

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.19184/isj.v3i1.9853

Abstract

This study is about the use of simple additive weighting (SAW) and profile matching methods for the construction of information systems supporting the decision selection of scholarships. The case study of this research is the selection of superior situbondo scholarships in the Education Office of Situbondo Regency. The purpose of this study was to apply the profile matching method and SAW in resolving the problem of selecting the Situbondo Superior Scholarship recipients who had 2 aspects of assessment, namely aspects of poverty and academics which made it difficult to select scholarships, this difficulty is caused by the value of the aspect of poverty must be the smaller the difference in the value of students with the value of the scholarship it will be better while the academic value must go far beyond the minimum value, the better. The profile matching method is used to calculate the value of the aspect of poverty and SAW is used to calculate the value of the academic aspects. To determine the final results of this study using the criteria for decision-making scale determined by the District Education Office of Situbondo, one of the final methods of the method is less than 30 worth not funded, one of the final method values less than 60 is considered to be funded. The development of information systems supporting superior decision making for the Situbondo scholarship using the profile matching and simple additive weighting methods using a website-based system with system design using the SDLC waterfall model, implementation of the system using the laravel framework and program code using the hypertext pre-processor programming language (PHP ), while for managing the database using MySQL DBMS and system testing using black box and white box ( testing unit). The results of this research method of profile matching and simple additive weighting can be applied properly in a superior situbondo scholarship decision support system.
REAR COVER Saiful Bukhori
INFORMAL: Informatics Journal Vol 3 No 1 (2018): INFORMAL - Informatics Journal
Publisher : Faculty of Computer Science, University of Jember

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

FrontCover Saiful Bukhori
INFORMAL: Informatics Journal Vol 3 No 1 (2018): INFORMAL - Informatics Journal
Publisher : Faculty of Computer Science, University of Jember

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

Pencarian Pola Asosiasi Keluhan Pasien Menggunakan Teknik Association Rule Mining Ulya Anisatur Rosyidah; Hardian Oktavianto
INFORMAL: Informatics Journal Vol 3 No 1 (2018): INFORMAL - Informatics Journal
Publisher : Faculty of Computer Science, University of Jember

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.19184/isj.v3i1.5541

Abstract

Perkembangan dan pertumbuhan data di bidang kesehatan semakin meningkat dan bertambah, baik dari kualitas maupun kuantitas, dilihat dari sisi kualitas, perkembangan data ini mengalami perubahan dari bentuk dokumen tulis menjadi dokumen digital atau yang biasanya kita sebut dengan file. Isu yang muncul adalah apakah informasi yang bisa diambil atau didapatkan dari sekian banyak data medis yang tersedia hanya berupa informasi – informasi pada umumnya, sedangkan dari suatu basis data yang tersedia seringkali memuat beberapa variabel sekaligus, bahkan apabila diteliti lebih jauh lagi, basis data yang berbeda bisa jadi memuat beberapa variabel yang sama, dari isu tersebut maka diperlukan suatu metode untuk bisa menggali lebih dalam informasi – informasi yang belum diketahui. Berkaitan dengan data medis serta data mining, maka penelitian kali ini akan membahas tentang implementasi atau kegunaan dari data mining pada data kunjungan pasien dengan cara menerapkan association rule mining untuk mendapatkan pola – pola asosiasi dari basis data kunjungan pasien yang tersedia menggunakan algoritma apriori dan algoritma FP-Growth. Baik algoritma apriori dan algoritma FP-Growth menghasilkan output yang sama. Perbedaan hasil uji coba terletak pada jumlah rule asosiasi yang ditemukan, dengan menggunakan algoritma apriori ditemukan 3 buah rule asosiasi, sedangkan ketika digunakan algoritma FP-Growth ditemukan 2 buah rule asosiasi, hal ini terjadi pada saat uji coba yang dilakukan menggunakan confidence sebesar 80%.
Perbandingan Algoritma Genetika dengan Algoritma Greedy Untuk Pencarian Rute Terpendek Rizky Berlia Oktaviandi; M. Sadid Tafsirul Hadi; Alanfansyah Ghozy Santoso; Nova El Maidah
INFORMAL: Informatics Journal Vol 3 No 1 (2018): INFORMAL - Informatics Journal
Publisher : Faculty of Computer Science, University of Jember

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.19184/isj.v3i1.9847

Abstract

In everyday life we ​​often travel from place to place. So that we need to consider the time and cost efficient. Therefore, accuracy is needed to determine the shortest path as a consideration in decision to show the path to be taken. The results obtained also require speed and accuracy with the help of a computer. Using or functioning a computer there must be a distributed program in it. The programs contained in the computer vary widely and each program must use an algorithm. Algorithm is a collection of commands to solve a problem gradually from start to finish. There are various algorithms that can be used to find the shortest route such as Breadth First Search algorithm, Depth First Search, A *, Hill Climbing and others. For that required comparison algorithm which is able to find the shortest route accurately and efficiently. In this journal, the algorithm to be compared is the genetic algorithm and greedy algorithm to find the shortest route on a map. Some aspects to be compared are aspects of the accuracy, speed, and complexity of genetic algorithms and greedy algorithms for the shortest route search.
Preliminary
INFORMAL: Informatics Journal Vol 3 No 1 (2018): INFORMAL - Informatics Journal
Publisher : Faculty of Computer Science, University of Jember

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

Page 1 of 1 | Total Record : 8

 1 

Filter by Year

2018 2018


Reset
Filter By Issues
All Issue Vol 9 No 3 (2024): Informatics Journal (INFORMAL) Vol 9 No 2 (2024): Informatics Journal (INFORMAL) Vol 9 No 1 (2024): INFORMATICS JOURNAL (INFORMAL) Vol 8 No 3 (2023): Informatics Journal (INFORMAL) Vol 8 No 2 (2023): Informatics Journal (INFORMAL) Vol 8 No 1 (2023): Informatics Journal (INFORMAL) Vol 7 No 3 (2022): Informatics Journal (INFORMAL) Vol 7 No 2 (2022): Informatics Journal (INFORMAL) Vol 7 No 1 (2022): Informatics Journal (INFORMAL) Vol 6 No 3 (2021): Informatics Journal (INFORMAL) Vol 6 No 2 (2021): Informatics Journal (INFORMAL) Vol 6 No 1 (2021): Informatics Journal (INFORMAL) Vol 5 No 3 (2020): Informatics Journal (INFORMAL) Vol 5 No 2 (2020): INFORMAL - Informatics Journal Vol 5 No 1 (2020): INFORMAL - Informatics Journal Vol 4 No 3 (2019): INFORMAL - Informatics Journal Vol 4 No 2 (2019): INFORMAL - Informatics Journal Vol 4 No 1 (2019): INFORMAL - Informatics Journal Vol 3 No 3 (2018): INFORMAL - Informatics Journal Vol 3 No 2 (2018): INFORMAL - Informatics Journal Vol 3 No 1 (2018): INFORMAL - Informatics Journal Vol 2 No 3 (2017): INFORMAL - Informatics Journal Vol 2 No 2 (2017): INFORMAL - Informatics Journal Vol 2 No 1 (2017): INFORMAL: INFORMATICS JOURNAL Vol 1 No 3 (2016): INFORMAL: INFORMATICS JOURNAL Vol 1 No 2 (2016): INFORMAL : Informatics Journal Vol 1, No 1 (2016): INFORMAL: Informatics Journal Vol 1 No 1 (2016): INFORMAL: Informatics Journal More Issue