cover
Article Per Year (5 Year)
All
Home Page
OAI Link
Editorial Team
Contact
Reviewer
Google Scholar
Contact Name
Agus Harjoko
Contact Email
ijccs.mipa@ugm.ac.id
Phone
+62274 555133
Journal Mail Official
ijccs.mipa@ugm.ac.id
Editorial Address
Gedung S1 Ruang 416 FMIPA UGM, Sekip Utara, Yogyakarta 55281
Location
Kab. sleman,
Daerah istimewa yogyakarta
INDONESIA
IJCCS (Indonesian Journal of Computing and Cybernetics Systems)
Published by Universitas Gadjah Mada
ISSN : 19781520     EISSN : 24607258     DOI : https://doi.org/10.22146/ijccs
Core Subject : Science, Engineering,
Computer Science & IT Control & Systems Engineering
Indonesian Journal of Computing and Cybernetics Systems (IJCCS), a two times annually provides a forum for the full range of scholarly study . IJCCS focuses on advanced computational intelligence, including the synergetic integration of neural networks, fuzzy logic and eveolutionary computation, so that more intelligent system can be built to industrial applications. The topics include but not limited to : fuzzy logic, neural network, genetic algorithm and evolutionary computation, hybrid systems, adaptation and learning systems, distributed intelligence systems, network systems, human interface, biologically inspired evolutionary system, artificial life and industrial applications. The paper published in this journal implies that the work described has not been, and will not be published elsewhere, except in abstract, as part of a lecture, review or academic thesis.
Arjuna Subject : Ilmu Komputer (semua kategori) - Ilmu Komputer (Lain-Lain)
Articles 466 Documents
 8   9   10   11   12 
Penentuan Klas Sidik Jari Berdasarkan Arah Kemiringan Ridge Sri Suwarno; Agus Harjoko
IJCCS (Indonesian Journal of Computing and Cybernetics Systems) Vol 5, No 3 (2011): November
Publisher : IndoCEISS in colaboration with Universitas Gadjah Mada, Indonesia.

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.22146/ijccs.5208

Abstract

Researches on  fingerprint  classification are generally based on its features such as core and delta. Extraction of these features are generally preceded by a variety of preprocessing. In this study the classification is done directly on the fingerprint image without preprocessing. Feature used as the basis for classification is the direction of the ridge. The direction of the ridge  is determined by the slope of the blocks that are exist on every ridge. Fingerprint image is divided into blocks of size 3x3 pixels and the direction of each block is determined. Direction of the slope of the block are grouped into 8, these are  north, north-east, east, south-east, south, south-west, west and north-west. The number of blocks in each direction form the basis of classification using Learning Vector Quantization network (LVQ). This study used 80 data samples from the database of FVC2004. This model obtained classification accuracy of up to 86.3%. Keywords—fingerprint, classification, ridge, LVQ
Penapisan Derau Gaussian, Speckle dan Salt&Pepper Pada Citra Warna Ika Purwanti Ningrum; Agfianto Eko Putra; Dian Nursantika
IJCCS (Indonesian Journal of Computing and Cybernetics Systems) Vol 5, No 3 (2011): November
Publisher : IndoCEISS in colaboration with Universitas Gadjah Mada, Indonesia.

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.22146/ijccs.5209

Abstract

Quality of digital image can decrease becouse some noises. Noise can come from lower quality of image recorder, disturb when transmission data process and weather. Noise filtering can make image better becouse will filtering that noise from the image and can improve quality of digital image. This research have aim to improve color image quality with filtering noise. Noise (Gaussian, Speckle, Salt&Pepper) will apply to original image, noise from image will filtering use Bilateral Filter method, Median Filter method and Average Filter method so can improve color image quality. To know how well this research do, we use PSNR (Peak Signal to Noise Ratio) criteria with compared original image and filtering image (image after using noise and filtering noise).This research result with noise filtering Gaussian (variance = 0.5), highest PSNR value found in the Bilateral Filter method is 27.69. Noise filtering Speckle (variance = 0.5), highest PSNR value found in the Average Filter method is 34.12. Noise filtering Salt&Pepper (variance = 0.5), highest PSNR value found in the Median Filter method is 31.27. Keywords— Bilateral Filter, image restoration, derau Gaussian, Speckle dan Salt&Pepper
PENDEKATAN ALGORITMA GENETIKA DALAM MENYELESAIKAN PERMASALAHAN FUZZY LINEAR PROGRAMMING Siska Dewi Lestari; Subanar Subanar
IJCCS (Indonesian Journal of Computing and Cybernetics Systems) Vol 5, No 3 (2011): November
Publisher : IndoCEISS in colaboration with Universitas Gadjah Mada, Indonesia.

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.22146/ijccs.5211

Abstract

Fuzzy linear programming is one of the linear programming developments which able to accommodate uncertainty in the real world. Genetic algorithm approach in solving linear programming problems with fuzzy constraints has been introduced by Lin (2008) by providing a case which consists of two decision variables and three constraint functions. Other linear programming problem arise with the presence of some coefficients which are fuzzy in linear programming problems, such as the coefficient of the objective function, the coefficient of constraint functions, and right-hand side coefficients constraint functions. In this study, the problem studied is to explain the genetic algorithm approach to solve linear programming problems where the objective function coefficients and right-hand sides are fuzzy constraint functions.PT Dakota Furniture study case provides a linear programming formulation with a given objective function coefficients and right-hand side coefficients are fuzzy constraint functions. This study describes the use of genetic algorithm approach to solve the problem of linear programming of PT Dakota to maximize the mean income. The genetic algorithm approach is done by simulate every fuzzy number and each fuzzy numbers by distributing them on certain partition points. Then genetic algorithm is used to evaluate the value for each partition point. As a result, the Final Value represents the coefficient of fuzzy number.  Fitness function is done by calculating the value of the objective function of linear programming problems. Empirical results indicated that the genetic algorithm approach can provide a very good solution by giving some limitations on each fuzzy coefficient.Genetic algorithm approach can be extended not only to resolve the case of PT Dakota Furniture, but can also be used to solve other linear programming case with some coefficients in the objective function and constraint functions are fuzzy.Keywords : Genetic Algorithm, Fuzzy Linear Programming, Linear Programming, Two-Phase Simplex Method
SIM Kemiskinan Sebagai Dasar Informasi Geografis Untuk Pemetaan Prioritas Pengentasan Kemiskinan di Kabupaten Banjarnegara Aji Supriyanto; Edy Winarno; Agus Prasetyo
IJCCS (Indonesian Journal of Computing and Cybernetics Systems) Vol 5, No 3 (2011): November
Publisher : IndoCEISS in colaboration with Universitas Gadjah Mada, Indonesia.

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.22146/ijccs.5212

Abstract

Program pengentasan  kemiskinan merupakan prioritas bagi pemerintah daerah Kabupaten Banjarnegara yang harus ditangani. Penelitan ini bermaksud merancang bangun sebuah sistem informasi yang mengolah data penduduk yang dapat diolah menjadi sebuah informasi  kemiskinan yang dapat diakses  melalui web dengan menggunakan standar indikator kemiskinan menurut BPS. Metode yang digunakan dalam penelitian ini adalah dengan cara action research dan model pengembangan sistem informasi adalah secara terstruktur menggunakan waterfall. Hasil dari penelitian ini adalah dapat menyajikan  informasi yang dapat menetukan kriteria kemiskinan dengan model singgle-criteria maupun multiple-criteria sesuai kebutuhan indikator kemiskinan yang ditentukan hingga pada tingkat desa, serta memberikan informasi tentang jenis-jenis bantuan yang telah diberikan pada setiap penduduk berdasarkan nama dan alamat (by name by address). Hasil selanjutnya adalah dapat dijadikan sebagai dasar pemetaan digital (Sistem Informasi Geografis/SIG) untuk menentukan kantong kemiskinan di suatu daerah, dengan memberikan pewarnaan yang menjadi indikator tingkat kemiskinan. Kata Kunci : kemiskinan, sistem informasi, penduduk, indikator BPS, GIS.
SPASIAL DATA MINING MENGGUNAKAN MODEL SAR-KRIGING Atje Setiawan; Rudi Rosadi
IJCCS (Indonesian Journal of Computing and Cybernetics Systems) Vol 5, No 3 (2011): November
Publisher : IndoCEISS in colaboration with Universitas Gadjah Mada, Indonesia.

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.22146/ijccs.5213

Abstract

The region of Indonesia is very sparse and it has a variation condition in social, economic and culture, so the problem in education quality at many locations is an interesting topic to be studied. Database used in this research is Base Survey of National Education 2003, while a spatial data is presented by district coordinate as a least analysis unit. The aim of this research is to study and to apply spatial data mining to predict education quality at elementary and junior high schools using SAR-Kriging method which combines an expansion SAR and Kriging method. Spatial data mining process has three stages. preprocessing, process of data mining, and post processing.For processing data and checking model, we built software application of Spatial Data Mining using SAR-Kriging method. An application is used to predict education quality at unsample locations at some cities at DIY Province.  The result shows that SAR-Kriging method for some cities at DIY for elementary school has an average percentage error 6.43%. We can conclude that for elementary school, SAR-Kriging method can be used as a fitted model. Keywords—  Expansion SAR, SAR-Kriging, quality education
Analisis dan Perancangan Sistem Manajemen Event Berbasis Mobile Push Notification Ardiansyah Ardiansyah
IJCCS (Indonesian Journal of Computing and Cybernetics Systems) Vol 5, No 3 (2011): November
Publisher : IndoCEISS in colaboration with Universitas Gadjah Mada, Indonesia.

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.22146/ijccs.5214

Abstract

Konvergensi teknologi Internet dan piranti mobile/smartphone saat ini bisa dimanfaatkan secara optimal sebagai salah satu media promosi dan pengelolaan sebuah acara. Dengan keberadaan teknologi push service akan memungkinkan setiap informasi acara baru dapat diterima oleh calon peserta yang prospektif. Selain itu pula dengan mengusung teknologi cloud computing, setiap penyelenggara acara cukup menggunakan service yang disediakan khusus di server Internet untuk mengelola acara yang akan diselenggarakan tanpa harus menyediakan infrastruktur sendiri. Pada penelitian ini telah berhasil dibuat rancangan sistem manajemen acara (event) yang diselenggarakan oleh event organizer atau sering disebut EO. Rancangan yang dibuat meliputi struktur tabel, menu hingga antarmuka aplikasi meliputi antarmuka berbasis web untuk administrator EO dan antarmuka berbasis mobile iPhone untuk user. Keywords: event, push notification, mobile, antarmuka.
PENERAPAN SISTIM PENDUKUNG KEPUTUSAN DALAM SISTEM PENGUJIAN COMPUTERIZED ADAPTIVE TESTING Rukli Rukli; Sri Hartati
IJCCS (Indonesian Journal of Computing and Cybernetics Systems) Vol 5, No 3 (2011): November
Publisher : IndoCEISS in colaboration with Universitas Gadjah Mada, Indonesia.

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.22146/ijccs.5215

Abstract

This study aims to make design decision support system adaptive to examinee ability to go to college.Decision support systems are made using one parameter logistic model by taking into account the difficulty level of questions adapted to the ability of the examinee. Questions are selected so that the items follow the ability of examinee more accurate assessment of ability with a lesser number of items.CAT a web-based applications require lesser number of items in determining the ability of examinee. College can determine the appropriate characteristics of the ability of examinee acceptance criteria for each department with domain weighting, and then determine the minimum level of capability that will be received and an appropriate amount to be received. Key word: Decision Support System, Computerized Adaptive Testing
Modifikasi Algoritma Genetika untuk Penyelesaian Permasalahan Penjadwalan Pelajaran Sekolah Rahman Erama; Retantyo Wardoyo
IJCCS (Indonesian Journal of Computing and Cybernetics Systems) Vol 8, No 2 (2014): July
Publisher : IndoCEISS in colaboration with Universitas Gadjah Mada, Indonesia.

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.22146/ijccs.6539

Abstract

AbstrakModifikasi Algoritma Genetika pada penelitian ini dilakukan berdasarkan temuan-temuan para peneliti sebelumnya tentang kelemahan Algoritma Genetika. Temuan-temuan yang dimakasud terkait proses crossover sebagai salah satu tahapan terpenting dalam Algoritma Genetika dinilai tidak menjamin solusi yang lebih baik oleh beberapa peneliti. Berdasarkan temuan-temuan oleh beberapa peneliti sebelumnya, maka penelitian ini akan mencoba memodifikasi Algoritma Genetika dengan mengeliminasi proses crossover yang menjadi inti permasalahan dari beberapa peneliti tersebut. Eliminasi proses crossover ini diharapkan melahirkan algoritma yang lebih efektif sebagai alternative untuk penyelesaian permasalahan khususnya penjadwalan pelajaran sekolah.Tujuan dari penelitian ini adalah Memodifikasi Algoritma Genetika menjadi algoritma alternatif untuk menyelesaikan permasalahan penjadwalan sekolah, sehingga diharapkan terciptanya algoritma alternatif ini bisa menjadi tambahan referensi bagi para peneliti untuk menyelesaikan permasalahan penjadwalan lainnya.Algoritma hasil modifikasi yang mengeliminasi tahapan crossover pada algoritma genetika ini mampu memberikan performa 3,06% lebih baik dibandingkan algoritma genetika sederhana dalam menyelesaikan permasalahan penjadwalan sekolah. Kata kunci—algoritma genetika, penjadwalan sekolah, eliminasi crossover  AbstractModified Genetic Algorithm in this study was based on the findings of previous researchers about the weakness of Genetic Algorithms. crossover as one of the most important stages in the Genetic Algorithms considered not guarantee a better solution by several researchers. Based on the findings by previous researchers, this research will try to modify the genetic algorithm by eliminating crossover2 which is the core problem of several researchers. Elimination crossover is expected to create a more effective algorithm as an alternative to the settlement issue in particular scheduling school.This study is intended to modify the genetic algorithm into an algorithm that is more effective as an alternative to solve the problems of school scheduling. So expect the creation of this alternative algorithm could be an additional resource for researchers to solve other scheduling problems.Modified algorithm that eliminates the crossover phase of the genetic algorithm is able to provide 2,30% better performance than standard genetic algorithm in solving scheduling problems school. Keywords—Genetic Algorithm, timetabling school, eliminate crossover
Aplikasi Algoritma CBA untuk Klasifikasi Resiko Pemberian Kredit (Studi kasus: PT. Telkom CDC Sub Area Kupang) Robynson Amseke; Edi Winarko
IJCCS (Indonesian Journal of Computing and Cybernetics Systems) Vol 8, No 2 (2014): July
Publisher : IndoCEISS in colaboration with Universitas Gadjah Mada, Indonesia.

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.22146/ijccs.6540

Abstract

AbstrakSalah satu penyebab kredit bermasalahberasal dari pihak internal, yaitu kurang telitinya timdalam melakukan survei dan analisis, atau bisa juga karena penilaian dan analisis yang bersifat subjektif.Penyebab ini dapat diatasi dengan sistem komputer, yaitu aplikasi komputer yang menggunakan teknik data mining.Teknik data mining digunakan dalam penelitian ini untuk klasifikasi resiko pemberian kredit dengan menerapkan algoritma Classification Based On Association (CBA). Algoritma ini merupakan salah satu algoritma klasifikasi dalam data mining yang mengintegrasikan teknik asosiasi dan klasifikasi. Data kredit awal yang telah di-preprocessing, diproses menggunakan algoritma CBA untuk membangun model, lalu model tersebut digunakan untuk mengklasifikasi data pelaku usaha baru yang mengajukan kredit ke dalam kelas lancar atau macet.Teknik Pengujian akurasi model diukur menggunakan 10-fold cross validation. Hasil pengujian menunjukkan bahwa rata-rata nilai akurasi menggunakan algoritma CBA (57,86%), sedikit lebih tinggi dibandingkan rata-rata nilai akurasi menggunakan algoritma Naive Bayes dan SVM dari perangkat lunak Rapid Miner 5.3 (56,35% dan 55,03%). Kata kunci—classification based on association, CBA, data mining, klasifikasi, resiko pemberian kredit  AbstractOne of the causes of non-performing loans come from the internal, that is caused by a lack of rigorous team in conducting the survey and analysis, or it could be due to subjective evaluation and analysis. The cause of this can be solved by a computer system, the computer application that uses data mining techniques. Data mining technique, was usedin this study toclassifycreditriskby applyingalgorithmsClassificationBasedonAssociation(CBA). This algorithm is an algorithm classification of data mining which integratingassociationandclassificationtechniques. Preprocessed initial-credit data, will be processed using theCBAalgorithmto create a model of which is toclassifythe newloandata into swift class or bad one. Testing techniques the accuracy of the model was measured by 10-fold cross validation. The resultshowsthatthe accuracy averagevalue using theCBAalgorithm(57,86%), was slightly higher than those using thealgorithmsofSVM andNaiveBayes from RapidMiner5.3software(56,35% and55,03%, respectively). Keywords—classification based on association, CBA, data mining, classification, credit risk 
Sistem Identifikasi Relief pada Situs Bersejarah Menggunakan Perangkat Mobile Android (Studi Kasus Candi Borobudur) Rajif Agung Yunmar; Agus Harjoko
IJCCS (Indonesian Journal of Computing and Cybernetics Systems) Vol 8, No 2 (2014): July
Publisher : IndoCEISS in colaboration with Universitas Gadjah Mada, Indonesia.

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.22146/ijccs.6541

Abstract

Abstrak            Bangsa yang besar adalah bangsa yang menghargai sejarah dan asal usulnya. Relief yang terdapat pada candi Borobudur menggambarkan banyak cerita, termasuk sejarah dan asal usul bangsa ini. Mulai dari cerita kehidupan kalangan kerajaan, kehidupan masyarakat, dan adat istiadat pada saat bangunan candi tersebut dibuat, dsb.            Penelitian ini merancang sebuah perangkat lunak mobile Android untuk identifikasi citra relief Candi Borobudur sehingga dapat membantu wisatawan dalam menerjemahkan pesan dan informasi yang terkandung didalamnya. Metode ekstraksi ciri yang digunakan adalah Speeded-Up Robust Feature (SURF) dan hierarchical k-means tree nearest-neighbor untuk identifikasinya.            Pengujian identifikasi citra relief dilakukan dengan berbagai macam variasi, yaitu sudut, jarak, rotasi, intensitas cahaya dan keutuhan citra masukan untuk melihat pengaruhnya terhadap hasil pengenalan citra relief tersebut. Metode identifikasi yang diajukan memberikan hasil pengenalan sebesar 93.30% dengan rata-rata waktu komputasi 59.55 detik.  Abstract            The great nation built from people who can respects they history and origins. Reliefs at Borobudur temple contained many stories, including the history and origins of this nation. Starting from the life story of the royal, society, and customs at the time of the building of the temple was made, and so on.            This study develops mobile Android software for identification of Borobudur Temple relief image object so that it can help travelers in translating the story and the information contained therein. Feature extraction method used is speeded-Up Robust Feature (SURF) and hierarchical k-means tree nearest-neighbor for identification.            Identification testing of relief images is done by different variations, ie angle, distance, rotation, intensity of the light and wholeness of image input to see the effect on the relief image recognition results. The proposed identification method gives recognition results of 93.30% and the average computation time for 59.55 seconds.

Page 10 of 47 | Total Record : 466

 8   9   10   11   12 

Filter by Year

2006 2025


Reset
Filter By Issues
All Issue Vol 19, No 4 (2025): October Vol 19, No 3 (2025): July Vol 19, No 2 (2025): April Vol 19, No 1 (2025): January Vol 18, No 4 (2024): October Vol 18, No 3 (2024): July Vol 18, No 2 (2024): April Vol 18, No 1 (2024): January Vol 17, No 4 (2023): October Vol 17, No 3 (2023): July Vol 17, No 2 (2023): April Vol 17, No 1 (2023): January Vol 16, No 4 (2022): October Vol 16, No 3 (2022): July Vol 16, No 2 (2022): April Vol 16, No 1 (2022): January Vol 15, No 4 (2021): October Vol 15, No 3 (2021): July Vol 15, No 2 (2021): April Vol 15, No 1 (2021): January Vol 14, No 4 (2020): October Vol 14, No 3 (2020): July Vol 14, No 2 (2020): April Vol 14, No 1 (2020): January Vol 13, No 4 (2019): October Vol 13, No 3 (2019): July Vol 13, No 2 (2019): April Vol 13, No 1 (2019): January Vol 12, No 2 (2018): July Vol 12, No 1 (2018): January Vol 11, No 2 (2017): July Vol 11, No 1 (2017): January Vol 10, No 2 (2016): July Vol 10, No 1 (2016): January Vol 9, No 2 (2015): July Vol 9, No 1 (2015): January Vol 8, No 2 (2014): July Vol 8, No 1 (2014): January Vol 7, No 2 (2013): July Vol 7, No 1 (2013): January Vol 6, No 2 (2012): July Vol 6, No 1 (2012): January Vol 5, No 3 (2011): November Vol 5, No 2 (2011): July Vol 5, No 1 (2011): January Vol 1, No 2 (2007): July Vol 1, No 1 (2006): January More Issue