Claim Missing Document
Check
Articles

ANALISISTINGKATKEPUASANKONSUMEN PADA RESTORAN CEPATSAJI MENGGUNAKAN FUZZY MAMDANI Eko Wijaya; Desi Arisandi; Tri Sutrisno
Jurnal Ilmu Komputer dan Sistem Informasi Vol 9, No 1 (2021): JURNAL ILMU KOMPUTER DAN SISTEM INFORMASI
Publisher : Fakultas Teknologi Informasi Universitas Tarumanagara

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (368.853 KB) | DOI: 10.24912/jiksi.v9i1.12666

Abstract

The development of technology is the root of the civilization of society in carrying out their daily activities. In its application, technology can make it easy to access information that helps people to find out certain information, one of which is the level of consumer satisfaction with fast food restaurants.Fast food restaurants have become an important factor in people's daily activities. To fulfill its role in people's lives, fast food restaurants serve food and services for their consumers. Fast food restaurants with decent service, as well as good food prices and quality will certainly result in a high level of satisfaction from consumers with these fast food restaurants.The Fuzzy Mamdani method is one part of the Fuzzy Inference System which is useful for drawing conclusions or the best decisions in uncertain problems. In its application, the criteria for fast food restaurants become variables to determine the level of consumer satisfaction with these fast food restaurants. The Fuzzy Mamdani method forms a fuzzy set of input variables, then implements the implication function, then composes the rules, then defuzzy to get the level of consumer satisfaction with fast food restaurants. In determining the level of customer satisfaction, Fuzzy Mamdani obtained an accuracy rate of 100%.
SISTEM REKOMENDASI PAKET MINUMAN BERDASARKAN PESANAN PELANGGAN DENGAN METODE FREQUENT PATTERN GROWTH Steven Steven; Viny Christanti Mawardi; Tri Sutrisno
Jurnal Ilmu Komputer dan Sistem Informasi Vol 8, No 1 (2020): Jurnal Ilmu Komputer dan Sistem Informasi
Publisher : Fakultas Teknologi Informasi Universitas Tarumanagara

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (375.38 KB) | DOI: 10.24912/jiksi.v8i1.11490

Abstract

It is proposed that a beverage package is determined based on customer orders by looking for different frequent itemset patterns in the transaction data that has occurred. These data can be analyzed to be more useful. The method used is the association method. With the predicted beverage package the company can increase sales. With so many transaction data stored, the difficulty in managing data requires a method called the association method. Frequent Pattern Growth Algorithm is an alternative algorithm that is quite effective for finding the set of data that most often appears (frequent itemset) in a large data set. The test results from the Frequent Pattern Growth method can determine a number of packages that meet the minimum value of support and confidence with a combination of two itemset
ANALISIS REKOMENDASI PEMINATAN MENGGUNAKAN METODE DECISION TREE DENGAN ALGORITMA C4.5 Stefanny Claudia; Tri Sutrisno
Jurnal Ilmu Komputer dan Sistem Informasi Vol 6, No 2 (2018): JURNAL ILMU KOMPUTER DAN SISTEM INFORMASI
Publisher : Fakultas Teknologi Informasi Universitas Tarumanagara

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (239.165 KB) | DOI: 10.24912/jiksi.v6i2.2655

Abstract

The application created are used to analyze which thesis preference subject suits students academic performance based on their academic grades. The application also provide online academic consultations features which students can use for their academic consultations. To find their thesis preference, the application use decision tree method with C4.5 algorithm. Testing prediction system using students data from 2012 to 2015 who have found their thesis preference. The value data used is 32 mandatory courses in the Faculty of Information Technology before thesis preference. The application can run , use and perform well in accordance with the design made. Testing is to compare the accuracy of the selected tree model build from training data and the thesis preference students have selected. The average accuracy percentage of this a 72,6227%.
REKOMENDASI CALON KARYAWAN TETAP DI PERUSAHAAN J&T EXPRESS DENGAN METODE SIMPLE ADDTIVE WEIGHTING Prabu Alif Anggadiputra; Viny Christanti Mawardi; Tri Sutrisno
Jurnal Ilmu Komputer dan Sistem Informasi Vol 10, No 1 (2022): JURNAL ILMU KOMPUTER DAN SISTEM INFORMASI
Publisher : Fakultas Teknologi Informasi Universitas Tarumanagara

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.24912/jiksi.v10i1.17794

Abstract

The definition of an expedition is the delivery of goods or a company that transports goods. Expeditions for shipping goods are now often found in Indonesia because of the large number of people who make transactions via online. There is a J&T Express expedition service which is one of the shipping services that is able to serve deliveries within cities, between cities and between provinces. J&T Express has problems in determining permanent warehouse employees. The determination of warehouse employees for permanent employees at J&T Express is still done individually by the Supervisor of each J&T Express branch. The Simple Additive Weighting method is one method to make it easier for Supervisors to choose permanent warehouse employees with rankings. The way it works is that the user selects the 7 criteria provided, namely performance, attendance, manners, appearance, ability, knowledge, and responsibility.
PERANCANGAN SISTEM REKOMENDASI PENJURUSAN PADA SEKOLAH MENENGAH KEJURUAN SANTO PAULUS MENGGUNAKAN METODE K-MEANS CLUSTERING Isaias F.X.F.A. Felnditi; Desi Arisandi; Tri Sutrisno
Jurnal Ilmu Komputer dan Sistem Informasi Vol 8, No 1 (2020): Jurnal Ilmu Komputer dan Sistem Informasi
Publisher : Fakultas Teknologi Informasi Universitas Tarumanagara

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (404.708 KB) | DOI: 10.24912/jiksi.v8i1.11472

Abstract

Santo Paulus Vocational School in Jakarta, is one of the Private Schools in Central Jakarta which holds majors for grade X (ten) students who will continue their studies to grade XI (eleven). The obstacle that is often found in the majors in SMK Santo Paulus Jakarta is the difficulty in determining which students meet the criteria to occupy certain majors. This is because the majors process is still done manually, so it requires quite a long time and is considered inappropriate. This study, purpose to the K-Means Clustering algorithm for the decision support system of student majors at SMK Santo Paulus Jakarta. K-Means Clustering algorithm can group data that has attributes and has a large amount of data, so that it can be utilized in the determination of student majors in accordance with students' academic abilities.Based on the results of the implementation of the K-Means Clustering algorithm for the majors decision support system, the conclusion that can be drawn is the K-Means-Clustering algorithm can be applied in the student majors decision support system.
APLIKASI PERINGKASAN DOKUMEN MENGGUNAKAN METODE MAXIMUM MARGINAL RELEVANCE (MMR) Delvin Delvin; Desi Arisandi; Tri Sutrisno
Jurnal Ilmu Komputer dan Sistem Informasi Vol 10, No 1 (2022): JURNAL ILMU KOMPUTER DAN SISTEM INFORMASI
Publisher : Fakultas Teknologi Informasi Universitas Tarumanagara

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.24912/jiksi.v10i1.17820

Abstract

making a summary application to help readers who do not like to read long and thick news articles which take a relatively long time and can cause readers to be lazy to read the news articles. This summary application is used to summarize news articles, in making the application using ASP.Net. In this summary, the Maximum Marginal Relevance (MMR) method is used. In this study, you can use articles on the website, and do it. Articles are processed in the form of a file (single document) with a txt extension. The summary process goes through the preprocessing stage, which consists of sentence segmentation, case folding, tokenizing, filtering, stemming.
ALGORITMA GENETIKA DENGAN ROULETTE WHEEL SELECTION DAN ARITHMETIC CROSSOVER UNTUK PENGELOMPOKAN Jessen Yaputra Setiawan; Dyah Erny Herwindiati; Tri Sutrisno
Jurnal Ilmu Komputer dan Sistem Informasi Vol 7, No 1 (2019): JURNAL ILMU KOMPUTER DAN SISTEM INFORMASI
Publisher : Fakultas Teknologi Informasi Universitas Tarumanagara

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (343.991 KB) | DOI: 10.24912/jiksi.v7i1.5882

Abstract

Genetic algorithms are techniques that can be used to clustering data that has global search characters. This application is made using roulette wheel selection techniques and arithmetic crossover techniques. The purpose of this research is to implement a genetic algorithm that produces good results in clustering image data. The result is clustering flower images with different colors has good results, while clustering flower images with similar colors do not have good results. Several experiments were carried out on each scenario to determine the effect of the parameters used on the fitness value obtained, the result was a clustering with parameter color characteristics, the parameter with the largest fitness value are the number of population = 100, iterations = 200, and mutations = 0.02. while clustering with color plus texture characteristic, the parameter with the largest fitness value are the number population=200, iterations=300, and mutations=0.02.
PERANCANGAN SISTEM PENUNJANG KEPUTUSAN PENCARIAN JARAK TERPENDEK MENUJU RUMAH SAKIT DAN PUSKESMAS DENGAN METODE DIJKSTRA Stefan Senabudy; Desi Arisandi; Tri Sutrisno
Jurnal Ilmu Komputer dan Sistem Informasi Vol 10, No 1 (2022): JURNAL ILMU KOMPUTER DAN SISTEM INFORMASI
Publisher : Fakultas Teknologi Informasi Universitas Tarumanagara

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.24912/jiksi.v10i1.17858

Abstract

Advances in technology and information offer various conveniences and alternatives in every activity and community activity. There are various types of activities and community activities that do not escape the role of technology and information. Of course, this makes it easier for the community to make decisions in every activity and activity. In fact, in determining the fastest route, people are faced with a choice of available routes and are required to make the right decision regarding the alternative shortest route. One of them is in determining the route/path to hospitals and health centers. To take the shortest route/path, you can use public transportation, such as buses, which are often the people's choice compared to other modes of transportation. The existence of hospitals and health centers is very important because they can help treat people who are sick and provide 24-hour Emergency Unit (ER) services. In particular, immigrants who still don't know where the hospitals and health centers are and have to take which route is closer to where they are. Dijkstra's method is very effectively used to map alternative paths, if the main route experiences obstacles. In addition, it can be used to solve the problem of the shortest route/path and maximum flow, the elements (weights) of the route are the distance traveled and the cost. Dijkstra's method does not solve the problem of negative lines and only looks for the minimum value from one node to another that is related to each other. In its implementation, the Dijkstra method can use dynamic or changing data.
PEMILIHAN CROSSOVER PADA ALGORITMA GENETIKA UNTUK PROGRAM APLIKASI PENGENALAN KARAKTER TULISAN TANGAN Judah Suryaputra; Chairisni Lubis; Tri Sutrisno
Jurnal Ilmu Komputer dan Sistem Informasi Vol 6, No 1 (2018): JURNAL ILMU KOMPUTER DAN SISTEM INFORMASI
Publisher : Fakultas Teknologi Informasi Universitas Tarumanagara

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (229.037 KB) | DOI: 10.24912/jiksi.v6i1.2600

Abstract

Handwriting recognition system using genetic algorithm is an Optical Character Recognition system which receives input in the form of handwritten image in scanned box and produces output in the form of characters from the handwriting. Writing can be uppercase, lowercase, or numbers. The designed system consists of five main processes: preprocessing the input image, vertical and horizontal line segmentation, line segmentation and character with automatic cropping, resizing template, and character recognition using genetic algorithm. Preprocessing of input image consists of grayscale process, and thresholding. Genetic algorithm is used to find characters from the character image obtained by comparing the image with the chromosome of the train data. To use the genetic algorithm method, given the process of resizing the template first so that the image size of the characters with the same template. This system has a success rate of character segmentation of 100% and success rate on character recognition with genetic algorithm of 89,027% with one point crossover, 90,43% with two point crossover, 90,72% with uniform crossover.
APLIKASI PENGUKUR KELAYAKAN TEMPAT TINGGAL MENGGUNAKAN METODE NAIVE BAYES Ivan Andrew Yoshua; Jeanny Pragantha; Tri Sutrisno
Jurnal Ilmu Komputer dan Sistem Informasi Vol 8, No 1 (2020): Jurnal Ilmu Komputer dan Sistem Informasi
Publisher : Fakultas Teknologi Informasi Universitas Tarumanagara

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (430.39 KB) | DOI: 10.24912/jiksi.v8i1.11473

Abstract

Application for measuring the feasibility of residence by using the Naive Bayes method is a method for measuring the feasibilty of a house. This method was created for PT. Ady Karya Raya Nusantara employees to replace the PT Ady Karya Raya method which still uses manual method. There are 2 programming languages used to make this application, namely PHP and Python. PHP for the user interface and python for the calculation. Testing was done by User Acceptence Testing (UAT) and count testing. UAT testing to check buttons and features and count testing to check whether the results of the manual method are the same as the Naive Bayes method. From the two tests conducted it can be seen that the Naive Bayes method can be applied to replace the manual method and also all buttons and features in the application function properly.
Co-Authors AA Sudharmawan, AA Adinda Putri Aji Widya Putra Aminuyati Anak Agung Gede Sugianthara Andre Blenski Angga Aji Prasetyo Angga Saputra Anjas Asmara Subekti Ari Setiawan Susanto bagus Mulyawan Bambang Sutikno Baqiatush Shalihat Benny Wijaya Brian Kurniawan Widianto Bryan Daniel Pinenda Pasaribu Calvin Catur Putri Khairun Nisa Chairisni Lubis Dadang Purnama Daniel Daniel Dedi Trisnawarman Deistata Majiore Delvin Delvin Desi Arisandi Desy Arisandi Deza Farras Tsany Diaz Ridzky Anandianto Diri Anindyah Qonita Dwi Putri Diri Anindyah Qonitah Dwi Putri Dyah Erny Herwindiati Edwin Leonardo Eko Prasodjo Eko Wijaya Eni Erwantiningsih Eny Rochaida Ery Dewayani Farhan Abad Fika Alfiani Filbert Gabriel Carvenita Triasis George Timotius Harefa Gerry Geraldicky Gilbert Sanko Sunarko Glenvin Kiamidi Gusti Noorlitaria Achmad Hizkia Aristyo Christianto Hugeng I Dewa Ketut Satria Wahyu Perdana Indra Suyoto Kurniawan Irvan Lewenusa Isaias F.X.F.A. Felnditi Ivan Andrew Yoshua Januar Mansur Jeanny Pragantha Jeffrey Alexander Jessen Yaputra Setiawan Johan Tjung Jolie Felicia Jonathan Adelwin Jonathan Adrian Wibowo Joshua Saputra Joya Nur Rustiyana Judah Suryaputra Julio Yan Augusto Kelvin Kelvin Kelvin Khaleed Alhamzi Koko Prasetyo Kristopher Halim Lely Hiryanto Leonardo Josua Louis Fernando Winata M. Yoga Agustiranda Malahayati Malahayati Marsia Marsia Muhammad Farras Oktavia Nila Permata Para Mitta Purbosari Prabu Alif Anggadiputra Rabiatul Adawiyah Rayvaldi Harvian Renaldy Cahya Reyhan Rezqi Malia Rezza Adiluhung Prasetya Ricky Hansen Kurnia Rifki Ananta Pratama Ronald Lie Safrika Safrika Salma Auliannisa Seflahir Dinata Stefan Senabudy Stefanny Claudia Stella Ester Rantung Stevan Stevan Steven Steven Sumana, Axcel Lorensius Sumartono Sumartono Taria Adila Taysa Natalia Tony Tony Viny Christanti M Wasino Widi Santoso Willy Willy Witdiawati Woro Agus Nurtiyanto Yohanes Leonardus Dwi Pradipta Yonico Ariando Pratama Yosua Pandapotan Sianipar