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
 4   5   6   7   8 
An Application of Expert System to Identify Trees Utilizing Leaf Images Muhammad lhsan Sarita; Sri Hartati
IJCCS (Indonesian Journal of Computing and Cybernetics Systems) Vol 1, No 2 (2007): July
Publisher : IndoCEISS in colaboration with Universitas Gadjah Mada, Indonesia.

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

Abstract

AbstractTree identification is a very important to support almost all activities in the forest sector. Unfortunately, the inavailability of data and computer programs that is user friendly have caused ineficiency in tree identification. This research tries to make an expert system to identify trees by using the leaf images. To store the data in the knowledge base one must choose one of the some leaf images that are in the data base available in the program according the characteristic of the leaf. Each leaf image has a code and the accumulation of all codes build a tree code then this code is saved in the knowledge base. The tree code is used to identify a tree by making the comparison between input chosen by user and the tree code in the knowledge base using forward chaining. User who has information about a tree can add to the knowledge base but this information must be validated by an expert before it is used in the system. Another task of an expert is to give a CF (certainty factor) for each tree.The result of this research shows that no more errors are found due to input mistakes and the program is more user friendly. Another advantage is that the knowledge base is more flexible, dynamic and well organized Validation of knowledge base by experts can increase the quality and accuracy of using the knowledge base system.Keywords : expert system, leaf image, knowledge base, forward chaining, CF
An Application of Expert System For Diagnozing Endoparsitism Gastrointestinal Disease In Livestock Animals Rusdi Efendi; Sri Hartati
IJCCS (Indonesian Journal of Computing and Cybernetics Systems) Vol 1, No 2 (2007): July
Publisher : IndoCEISS in colaboration with Universitas Gadjah Mada, Indonesia.

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

Abstract

AbstractThe goal of this research is to make an expert system as a tool for diagnozing endoparsitism gastrointestinal disease for cows and sheep. The knowledge base of the system has been acquired from some interviews with some doctors from the internal diseases animal's unit at Animal's Hospital, Gadjah Mada University Jogjakarta, some text books, journals, and research papers. The inference machine of the system uses Forward Chaining and uncertainty data methods using Dempster-Shafer Theory.The system has a consultation session with an interactive dialog that can be used by the users. A user gives information such as user's data, and answers the questions about the endoparsitism gastrointestinal symptoms that might be had by his animal. From the answers, the system computes the possibility of the animal to suffer from endoparsitism gastrointestinal, informs the life cycle parasites, and suggests a therapy for it.Keywords : Expert System, diagnoze, endoparsitism gastrointestinal disease, Forward chaining method, Dempster-Shafer Teary
Artificial Intelligence on Computer Based Chess Game: An Implementation of Alpha-Beta-Cutoff Search Method Albert Dian Sano; Retantyo Wardoyo
IJCCS (Indonesian Journal of Computing and Cybernetics Systems) Vol 1, No 2 (2007): July
Publisher : IndoCEISS in colaboration with Universitas Gadjah Mada, Indonesia.

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

Abstract

AbstractA chess program usually consists of three main parts, that is, a move generator to generate all legal moves, an evaluation function to evaluate each move, and a search function to select the best move. The search function is the core of thinking process. The goal of this research is to implement the alpha beta cutoff as a search method. This method is derived from minimax search method and is more optimal than the minimax search method.In minimax, all nodes is searched and compared one by one to get the best value. On the other hand, the alpha beta cut of methd only searches nodes which make contribution to the previous value and cuts off nodes which are not useful. It means that the alpha beta method will not search and compare all nodes. The new node will be better than the previous one and replace the old value with the new one. This will make the alpha beta method requires smaller search time.The proposed method is tested by doing a series of matches between humans and a computer. The results show that the computer has ability to think well and performs a good artcial intelligence though it is very open to be modified and more optimized.Keywords: move generator function, evaluation function, search function, minimax, alpha beta cutoff
Fuzzy C-Means Clustering Model Data Mining For Recognizing Stock Data Sampling Pattern Sylvia Jane Annatje Sumarauw; Subanar Subanar
IJCCS (Indonesian Journal of Computing and Cybernetics Systems) Vol 1, No 2 (2007): July
Publisher : IndoCEISS in colaboration with Universitas Gadjah Mada, Indonesia.

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

Abstract

AbstractCapital market has been beneficial to companies and investor. For investors, the capital market provides two economical advantages, namely deviden and capital gain, and a non-economical one that is a voting .} hare in Shareholders General Meeting. But, it can also penalize the share owners. In order to prevent them from the risk, the investors should predict the prospect of their companies. As a consequence of having an abstract commodity, the share quality will be determined by the validity of their company profile information. Any information of stock value fluctuation from Jakarta Stock Exchange can be a useful consideration and a good measurement for data analysis. In the context of preventing the shareholders from the risk, this research focuses on stock data sample category or stock data sample pattern by using Fuzzy c-Me, MS Clustering Model which providing any useful information jar the investors. lite research analyses stock data such as Individual Index, Volume and Amount on Property and Real Estate Emitter Group at Jakarta Stock Exchange from January 1 till December 31 of 204. 'he mining process follows Cross Industry Standard Process model for Data Mining (CRISP,. DM) in the form of circle with these steps: Business Understanding, Data Understanding, Data Preparation, Modelling, Evaluation and Deployment. At this modelling process, the Fuzzy c-Means Clustering Model will be applied. Data Mining Fuzzy c-Means Clustering Model can analyze stock data in a big database with many complex variables especially for finding the data sample pattern, and then building Fuzzy Inference System for stimulating inputs to be outputs that based on Fuzzy Logic by recognising the pattern.Keywords: Data Mining, AUz..:y c-Means Clustering Model, Pattern Recognition
Stock Data Clustering of Food and Beverage Company Shofwatul Uyun; Subanar Subanar
IJCCS (Indonesian Journal of Computing and Cybernetics Systems) Vol 1, No 2 (2007): July
Publisher : IndoCEISS in colaboration with Universitas Gadjah Mada, Indonesia.

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

Abstract

AbstractCluster analysis can be defined as identifying groups of similar objects to discover distribution of patterns and interesting correlations in large data sets. Clustering analysis is important in the fields of pattern recognition and pattern classification. Over the years many methods have been developed for clustering data. In general, clustering methods can be categoried into two categories, i.e., fuzzy clustering and hard clustering. Fuzzy C-means is one of many methods of clustering based on fuzzy approach, while K-Means and K-Medoid are methods clustering based on crisp approach.This study aims to apply Fuzzy C-Means, K-Means and K-Medoid methods for clustering stock data in a jbod and beverage company. The main goal is to find a clustering method that can produce optimal clusters, The resulting clusters are validated using Dunn'• Index (DI). It is expected that the result of this reseach can be used to support decision making in the food and beverage company.Keywords : Clustering, Fuzzy C-Means, K-Means, K-Medoid, Cluster Validity, Dunn's Index (Dl)
An Implementation of Audio Security Using DES Algorithm Abdul Wahid; Retantyo Wardoyo
IJCCS (Indonesian Journal of Computing and Cybernetics Systems) Vol 1, No 2 (2007): July
Publisher : IndoCEISS in colaboration with Universitas Gadjah Mada, Indonesia.

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

Abstract

AbstractData security is an important problem in computer technology. This paper discusses security system for audio data. This technology is crucial because the multimedia technology has been improved very fast. One of the common audio format forms is wave audio format. The wave format is an uncompressed file format which is for RIFF specification owned by Microsoft. It is used for saving multimedia file. By using DES algorithm, the wave data could be encrypted for hiding information contained in the data. DES algorithm is chosen in this research because DES algorithm is one of the best symmetrical cryptography algorithms and it has been used world wide. This research is expected to give contribution to the audio security concept, especially for audio data security using wave file format.Keywords : audio security, DES algorithm, wave Omar
Asymmetric Watermarking Scheme Based on Correlation Testing Rinaldi Munir; Bambang Riyanto; Sarwono Sutikno; Wiseto P. Agung
IJCCS (Indonesian Journal of Computing and Cybernetics Systems) Vol 1, No 2 (2007): July
Publisher : IndoCEISS in colaboration with Universitas Gadjah Mada, Indonesia.

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

Abstract

AbstractAsymmetric watermarking is the second generation of watermarking scheme which uses different keys for embedding and detecting watermark. Key for embedding is private or secret, but key for detecting can be available publicly and everyone who has the key can detect watermark Watermark detection does not need to be original multimedia data. Detection of watermark is realized using correlation test between public key and multimedia data received. In most of schemes, private key is the watermark itself; public key is public watermark which correlates to the private watermark This paper presents concept of asymmetric watermarking scheme that based on correlation test and reviews some schemes of asymmetric watermarking that have been proposed by researchers.Keywords: asymmetric watermarking, private key, public key, watermark., multimeelia,:correlation.
Integrasi Database DISDUKCAPIL dan Database KPU Kabupaten Maros Memanfaatkan Web Services Frans N. Allokendek; John Soetikno; Ahmad Ashari
IJCCS (Indonesian Journal of Computing and Cybernetics Systems) Vol 7, No 1 (2013): January
Publisher : IndoCEISS in colaboration with Universitas Gadjah Mada, Indonesia.

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

Abstract

AbstrakBanyaknya permasalahan yang ditemukan dalam pelaksanaan Pemilukada, baik yang disebabkan oleh penyelenggara maupun oleh peserta.Permasalahan yang sering terjadi adalah tidak tersedianya data daftar penduduk potensi pemilih pilkada (DP4) yang ter-update, penggelembungan jumlah pemilih karena adanya data ganda, dan terbatasnya waktu untuk memverifikasi dokumen.Permasalahan yang serupa yang dihadapi oleh KPU Maros ditambah dengan terbatasnya sarana/media publikasi yang disediakan oleh KPU Maros dalam menginformasikan DPS dan DPT kepada masyarakat.Web service adalah sebuah teknologi yang meliputi sekumpulan standar yang memungkinkan dua aplikasi komputer dapat saling berkomunikasi dan bertukar data di internet. Teknologi web services menawarkan kecepatan dan kemudahan dalam mendapatkan informasi dari berbagai sumber tanpa mempermasalahkan perbedaan teknologi yang digunakan. Dalam penelitian ini, web service digunakan untuk mengkomunikasikan dua aplikasi yang berbeda yaitu SIAK DISDUKCAPIL Kabupaten Maros dan SIDP KPU Kabupaten Maros.Penelitian ini dilanjutkan dengan membuat suatu desain sistem dan implementasi berupa prototype sistem yang mengintegrasikan data dari database SIAK DISDUKCAPIL dengan database KPU di Kabupaten Maros dengan memanfaatkan teknologi web services. Hasilnya adalah didapatnya DPT yang valid serta adanya alternatif lain dalam mempublikasikan DPT kepada masyarakat, disamping tetap menggunakan media publikasi yang telah digunakan selama ini. Kata kunci— Web Services, Integrasi Data, DPT AbstractMany problems are encountered in the implementation of Local Election, which are caused by both the committee and participants. The problems that frequently occurred are the unavailability of data on the list of updated potential population to be voters in Local Election, the swallowing number of voters due to double data, and the limited time to verify documents. The similar problems that are encountered by General Election Committee of Maros Regency.Web service is a technology that includes a set of standards allowing two computer applications that can communicate with each other and exchange data in Internet. In the study, web services are used to communicate two different applications: SIAK of  the Demography and Civil Registration Office of Maros Regency and SIDP of the General Election Committee of Maros Regency.The study is followed by making the design of system and implementation such as a prototype data integration system between the database of SIAK of the Demography and Civil Registration Office of Maros Regency and that of General KPU in Maros Regency by utilizing web service technology. The result is the valid Fixed Voter List. Keywords—Web Services, Data Integration, Fixed Voter List
Klasifikasi Posting Twitter Kemacetan Lalu Lintas Kota Bandung Menggunakan Naive Bayesian Classification Sandi Fajar Rodiyansyah; Edi Winarko
IJCCS (Indonesian Journal of Computing and Cybernetics Systems) Vol 7, No 1 (2013): January
Publisher : IndoCEISS in colaboration with Universitas Gadjah Mada, Indonesia.

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

Abstract

AbstrakSetiap hari server Twitter menerima data tweet dengan jumlah yang sangat besar, dengan demikian, kita dapat melakukan data mining yang digunakan untuk tujuan tertentu. Salah satunya adalah untuk visualisasi kemacetan lalu lintas di sebuah kota.Naive bayes classifier adalah pendekatan yang mengacu pada teorema Bayes, dengan mengkombinasikan pengetahuan sebelumnya dengan pengetahuan baru. Sehingga merupakan salah satu algoritma klasifikasi yang sederhana namun memiliki akurasi tinggi. Untuk itu, dalam penelitian ini akan membuktikan kemampuan naive bayes classifier untuk mengklasifikasikan tweet yang berisi informasi dari kemacetan lalu lintas di Bandung.Dari hasil uji coba, aplikasi menunjukan bahwa nilai akurasi terkecil 78% dihasilkan pada pengujian dengan sampel sebanyak 100 dan menghasilkan nilai akurasi tinggi 91,60% pada pengujian dengan sampel sebanyak 13106. Hasil pengujian dengan perangkat lunak Rapid Miner 5.1 diperoleh nilai akurasi terkecil 72% dengan sampel sebanyak 100 dan nilai akurasi tertinggi 93,58% dengan sampel 13106 untuk metode naive bayesian classification. Sedangkan untuk metode support vector machine diperoleh nilai akurasi terkecil 92%  dengan sampel sebanyak 100 dan nilai akurasi tertinggi 99,11% dengan sampel sebanyak 13106. Kata kunci— Twitter, tweet, klasifikasi, naive bayesian classification, support vector machine  AbstractEvery day the Twitter server receives data tweet with a very large number, thus, we can perform data mining to be used for specific purpose. One of which is for the visualization of traffic jam in a city.Naive bayes classifier is an approach that refers to the bayes theorem, is a combination of prior knowledge with new knowledge. So that is one of the classification algorithm is simple but has a high accuracy. With this, in this research will prove the ability naive bayes classifier to classify the tweet that contains information of traffic jam in Bandung.The testing result, the program shows that the smallest value of the accuracy is 78% on testing by using a sample 100 record and generate high accuracy is 91,60% on the testing by using a sample 13106 record. The testing results with Rapid Miner 5.1 software obtained the smallest value of the accuracy is 72% by using a sample 100 records and the high accuracy is 93.58%  by using a sample 13.106 records for naive bayesian classification. And for the method of support vector machine obtained the smallest value is 92% accuracy by using a sample 100 records and the high accuracy of 99.11% by using a sample 13.106 records. Keywords—Twitter, tweet, classification, naive bayesian classification, support vector machine
Klasifikasi Fase Retinopati Diabetes Menggunakan Backpropagation Neural Network Rocky Yefrenes Dillak; Agus Harjoko
IJCCS (Indonesian Journal of Computing and Cybernetics Systems) Vol 7, No 1 (2013): January
Publisher : IndoCEISS in colaboration with Universitas Gadjah Mada, Indonesia.

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

Abstract

AbstrakRetinopati diabetes (DR) merupakan salah satu komplikasi pada retina yang disebabkan oleh penyakit diabetes. Tingkat keparahan DR dibagi atas empat kelas yakni: normal, non-proliferative diabetic retinopathy (NPDR), proliferative diabetic retinopathy (PDR), dan macular edema (ME). Penelitian ini bertujuan mengembangkan suatu metode yang dapat digunakan untuk melakukan klasifikasi terhadap fase DR. Data yang digunakan sebanyak 97 citra yang fitur – fiturnya  diekstrak menggunakan gray level cooccurence matrix (GLCM). Fitur ciri tersebut adalah maximum probability, correlation, contrast, energy, homogeneity, dan entropy. Fitur – fitur ini dilatih menggunakan jaringan syaraf tiruan backpropagation untuk dilakukan klasifikasi. Kinerja  yang dihasilkan dari pendekatan ini adalah sensitivity 100%, specificity 100% dan accuracy  97.73%  Kata kunci— fase retinopati diabetes, GLCM, backpropagation neural network  Abstract Diabetic retinopathy (DR) is one of the complications on retina caused by diabetes. The aim of this studyis to develop a system that can be used for automatic mass screenings of diabetic retinopathy. Four classes are identified: normal retina, non-proliferative diabetic retinopathy (NPDR), proliferative diabetic retinopathy (PDR), and macular edema (ME). Ninenty-seven retinal fundus images in used in this study. Six different texture features such as maximum probability, correlation, contrast, energy, homogeneity, and entropy were extracted from the digital fundus images using gray level cooccurence matrix (GLCM). These features were fed into a backpropagation neural network classifier for automatic classification. The  proposed approach is able to classify with sensitivity 100%, specificity 100% and accuracy  97.73%  Keywords— diabetic retinopathy stages, GLCM,  backpropagation neural network

Page 6 of 47 | Total Record : 466

 4   5   6   7   8 

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