Articles
389 Documents
ALGORITMA SHARED NEAREST NEIGHBOR BERBASIS DATA SHRINKING
Zainal, Rifki Fahrial;
Djunaidy, Arif
JUTI: Jurnal Ilmiah Teknologi Informasi Vol 7, No 1, Januari 2008
Publisher : Department of Informatics, Institut Teknologi Sepuluh Nopember
Show Abstract
|
Download Original
|
Original Source
|
Check in Google Scholar
|
Full PDF (178.689 KB)
|
DOI: 10.12962/j24068535.v7i1.a56
Shared Nearest Neighbor (SNN) algorithm constructs a neighbor graph that uses similarity between data points based on amount of nearest neighbor which shared together. Cluster obtained from representative points that are selected from the neighbor graph. The representative point is used to reduce number of clusterization errors, but also reduces accuracy. Data based shrinking SNN algorithm (SSNN) uses the concept of data movement from data shrinking algorithm to increase accuracy of obtained data shrinking. The concept of data movement will strengthen the density of neighbor graph so that the cluster formation process could be done from neighbor graph components which still has a neighbor relationship. Test result shows SSNN algorithm accuracy is 2% until 8% higher than SNN algorithm, because of the termination of relationship between weak data points in the neighbor graph is done slowly in several iteration. However, the computation time required by SSNN algorithm is three times longer than SNN algoritm computational time, because SSNN algorithm constructs neighbor graph in several iteration.
A STUDY ON RANKING METHOD IN RETRIEVING WEB PAGES BASED ON CONTENT AND LINK ANALYSIS: COMBINATION OF FOURIER DOMAIN SCORING AND PAGERANK SCORING
Purwitasari, Diana
JUTI: Jurnal Ilmiah Teknologi Informasi Vol 7, No 1, Januari 2008
Publisher : Department of Informatics, Institut Teknologi Sepuluh Nopember
Show Abstract
|
Download Original
|
Original Source
|
Check in Google Scholar
|
Full PDF (2047.368 KB)
|
DOI: 10.12962/j24068535.v7i1.a57
Ranking module is an important component of search process which sorts through relevant pages. Since collection of Web pages has additional information inherent in the hyperlink structure of the Web, it can be represented as link score and then combined with the usual information retrieval techniques of content score. In this paper we report our studies about ranking score of Web pages combined from link analysis, PageRank Scoring, and content analysis, Fourier Domain Scoring. Our experiments use collection of Web pages relate to Statistic subject from Wikipedia with objectives to check correctness and performance evaluation of combination ranking method. Evaluation of PageRank Scoring show that the highest score does not always relate to Statistic. Since the links within Wikipedia articles exists so that users are always one click away from more information on any point that has a link attached, it it possible that unrelated topics to Statistic are most likely frequently mentioned in the collection. While the combination method show link score which is given proportional weight to content score of Web pages does effect the retrieval results.
STUDI ANALISIS EIGENFACE DAN EIGEN FUZZY SET UNTUK EKSTRAKSI CIRI BIBIR PADA SISTEM IDENTIFIKASI WAJAH
Widyanto, M. Rahmat;
Puspasari, Shinta
JUTI: Jurnal Ilmiah Teknologi Informasi Vol 7, No 1, Januari 2008
Publisher : Department of Informatics, Institut Teknologi Sepuluh Nopember
Show Abstract
|
Download Original
|
Original Source
|
Check in Google Scholar
|
Full PDF (2047.286 KB)
|
DOI: 10.12962/j24068535.v7i1.a58
This paper compares the performance of eigenface and eigen fuzzy set to extract lip traits. Testing is conducted by implementing the two methods in a face identification system based on lip traits. The database used is primary data that consists of front-face image and lip image. The test result shows that eigenface is more effective with average precisionrecall value 0.22% higher. However, statistical tests show that there are no significant differences between the two methods. An optimal extraction method will be used to develop face identification system based on facial components.
PENJADWALAN MATAKULIAH DENGAN MENGGUNAKAN ALGORITMA GENETIKA DAN METODE CONSTRAINT SATISFACTION
Buliali, Joko Lianto;
Herumurti, Darlis;
Wiriapradja, Giri
JUTI: Jurnal Ilmiah Teknologi Informasi Vol 7, No 1, Januari 2008
Publisher : Department of Informatics, Institut Teknologi Sepuluh Nopember
Show Abstract
|
Download Original
|
Original Source
|
Check in Google Scholar
|
Full PDF (2047.249 KB)
|
DOI: 10.12962/j24068535.v7i1.a59
Course scheduling problem has gained attention from many researchers. A number of methods have been produced to get optimum schedule. Classical definition of course scheduling cannot fulfill the special needs of lecture scheduling in universities, therefore several additional rules have to be added to this problem. Lecture scheduling is computationally NP-hard problem, therefore a number of researches apply heuristic methods to do automation to this problem. This research applied Genetic Algorithm combined with Constraint Satisfaction Problem, with chromosomes generated by Genetic Algorithm processed by Constraint Satisfaction Problem. By using this combination, constraints in lecture scheduling that must be fulfilled can be guaranteed not violated. This will make heuristic process in Genetic Algorithm focused and make the entire process more efficient. The case study is the case in Informatics Department, Faculty of Information Technology, ITS. From the analysis of testing results, it is concluded that the system can handle specific requested time slot for a lecture, that the system can process all the offered lectures, and that the system can produce schedules without violating the given constraints. It is also seen that Genetic Algorithm in the system has done optimation in finding the minimum student waiting time between lectures.
PENERAPAN ALGORITMA WEIGHTED TREE SIMILARITY UNTUK PENCARIAN SEMANTIK
Sarno, Riyanarto;
Rahutomo, Faisal
JUTI: Jurnal Ilmiah Teknologi Informasi Vol 7, No 1, Januari 2008
Publisher : Department of Informatics, Institut Teknologi Sepuluh Nopember
Show Abstract
|
Download Original
|
Original Source
|
Check in Google Scholar
|
Full PDF (612.589 KB)
|
DOI: 10.12962/j24068535.v7i1.a60
Full-text search and metadata-enabled search have weakness in the precision of the searched article. This research offers weighted tree similarity algorithm combined with cosine similarity method to count similarity in semantic search. In this method metadata is constructed based on the tree of labelled node, labelled and weighted branch. The structure of tree metadata is constructed based on semantic information like taxonomi, ontologi, preference, synonim, homonym and stemming. From testing result, the precision of search using weighted tree similarity algorithm is better that full-text search and metadata-enabled search.
RANCANG BANGUN APLIKASI PENGAMBILAN BERITA SECARA OTOMATIS MENGGUNAKAN CONTENT SYNDICATION BERBASIS XML DENGAN PLATFORM MICROSOFT .NET
Purwitasari, Diana;
Samopa, Febriliyan;
Afrian, Ade
JUTI: Jurnal Ilmiah Teknologi Informasi Vol 3, No 1 Januari 2004
Publisher : Department of Informatics, Institut Teknologi Sepuluh Nopember
Show Abstract
|
Download Original
|
Original Source
|
Check in Google Scholar
|
Full PDF (207.357 KB)
|
DOI: 10.12962/j24068535.v3i1.a128
Banyaknya kebutuhan akan informasi di internet menyebabkan penyedia jasa situs berita untuk memberikan berita yang selalu yang terbaru. Salah satu alternatif solusi adalah dengan melakukan content syndication. Content syndication adalah adalah proses dimana suatu isi berita dikirimkan atau disediakan, biasanya dengan biaya tertentu, dari penyedia berita, biasanya disebut originators, ke pasar yang membutuhkan atau subscribers. RSS (Rich Site Summary) adalah format yang secara umum digunakan untuk melakukannya. RSS pada dasarnya adalah suatu file yang berada di suatu situs, yang menyediakan informasi tentang isi dari situs tersebut. File tersebut biasa disebut sebagai RSS Feeds dan dapat di ambil dan diolah untuk mendapatkan informasi tentang isi situs tersebut. Dibuat sebuah aplikasi untuk pengambilan situs berita secara otomatis menggunakan content syndication yang memerlukan aplikasi pada proses background untuk mengambil RSS Feeds secara berkala pada komputer yang berfungsi sebagai server. Server yang mengambil berita dari situs penyedia terdiri dari aplikasi yang mengatur konfigurasi berita tersebut, dan sebuah windows service untuk mengambil RSS feeds kemudian mengolahnya secara otomatis. Sedangkan aplikasi untuk membaca berita dari RSS server terdapat pada client berupa sebuah komponen plug-in. Uji coba pertama dilakukan dengan menguji keberhasilan aplikasi dalam mengatur konfigurasi skema, atribut tabel, dan pengaturan kategori situs penyedia RSS. Sedangkan ujicoba kedua dilakukan dengan melakukan perbandingan hasil pencarian berita yang didapat dari program dengan berita dari situs lain yang tidak menerapkan content syndication. Dari hasil pengujian diketahui bahwa aplikasi dengan content syndication mampu melakukan pencarian berita dan memberikan hasil yang lebih baik. Kata Kunci: Content Syndication, RSS, Windows Service, Band Object.
PERANGKAT LUNAK PENGUCAPAN KATA BAHASA INDONESIA BERDASARKAN PEMENGGALAN KATA DENGAN FINITE STATE AUTOMATA
Kuswardayan, Imam;
Tjahyanto, Aris;
Siregar, Krisma Marinda Sormin
JUTI: Jurnal Ilmiah Teknologi Informasi Vol 3, No 1 Januari 2004
Publisher : Department of Informatics, Institut Teknologi Sepuluh Nopember
Show Abstract
|
Download Original
|
Original Source
|
Check in Google Scholar
|
Full PDF (132.463 KB)
|
DOI: 10.12962/j24068535.v3i1.a133
Pada tugas akhir ini dikembangkan sebuah perangkat lunak yang berfungsi untuk mengetahui bagaimana pengucapan kata bahasa Indonesia. Pengucapan kata berdasarkan hasil pemenggalan kata dengan menggunakan Finite State Automata (FSA), yaitu suatu model dari mesin pengenal yang mampu mengenali kelas bahasa yang paling sederhana yaitu kelas bahasa Reguler. Pemenggalan kata berdasarkan bagaimana kata tersebut diucapakan. Teks bahasa Indonesia akan disajikan dalam bentuk suara atau ucapan. Pembacaan teks berdasarkan hasil pemenggalan kata. Suara yang disimpan adalah berupa rekaman dari tiap penggalan kata, sehingga akan lebih efisien karena setiap penggalan kata dapat digunakan dalam berbagai kata. Pembuatan perangkat lunak ini didahului dengan perancangan sistem aplikasi. Kemudian rancangan tersebut diimplementasikan. Implementasi aplikasi ini terdiri dari empat proses, yaitu proses pengisian array dari database, proses membersihkan teks, proses FSA dan proses pemenggalan kata. Setelah dimplementasikan, perangkat lunak ini diuji coba sesuai dengan spesifikasi kebutuhan dan kemampuan yang dimiliki yaitu melakukan pemenggalan kata bahasa Indonesia. Seperti memenggal kata dalam sebuah kalimat, kata homograf, diftong, kata berimbuhan dan kata serapan. Hasil pemenggalan kata disajikan dalam bentuk suara atau ucapan. Selain itu, aplikasi ini juga dapat memenggal angka yang sebelumnya dikonversi dulu menjadi kata yang kemudian angka akan dibaca satu per satu. Dengan demikian perangkat lunak ini dapat digunakan sebagaimana mestinya Kata Kunci: FSA, Pemenggalan Kata.
IMPLEMENTING ONLINE CUSTOMER RELATIONSHIP MANAGEMENT IN SMALL AND MEDIUM SIZE ENTERPRISE (SME): CASES BALI HANDICRAFT SMALL INDUSTRY
Wicaksono, Soetam Rizky
JUTI: Jurnal Ilmiah Teknologi Informasi Vol 9, No 1, Januari 2011
Publisher : Department of Informatics, Institut Teknologi Sepuluh Nopember
Show Abstract
|
Download Original
|
Original Source
|
Check in Google Scholar
|
Full PDF (399.237 KB)
|
DOI: 10.12962/j24068535.v9i1.a62
Online customer relationship management (CRM) implementation is becoming such terrifying activity for most firms, especially those which are categorized as SME (Small and Medium size Enterprise). Since that SME often lack of technical expertise and they really care for cost spending especially in internet connection cost. However, those barriers actually can be released when its implementation is being done with proper technology that can reduce cost while it will not reduce customer satisfaction in using online CRM. This paper tries to explain online CRM implementation in SME that will break all worries of SME’s management. On the other hand, brief literature review can bring clear explanation for importance of online CRM implementation in many level of industry.
USER STORY SOFTWARE ESTIMATION:A SIMPLIFICATION OF SOFTWARE ESTIMATION MODEL WITH DISTRIBUTED EXTREME PROGRAMMING ESTIMATION TECHNIQUE
Ferdiana, Ridi;
Santoso, Paulus Insap;
Nugroho, Lukito Edi;
Ashari, Ahmad
JUTI: Jurnal Ilmiah Teknologi Informasi Vol 9, No 1, Januari 2011
Publisher : Department of Informatics, Institut Teknologi Sepuluh Nopember
Show Abstract
|
Download Original
|
Original Source
|
Check in Google Scholar
|
Full PDF (287.5 KB)
|
DOI: 10.12962/j24068535.v9i1.a67
Software estimation is an area of software engineering concerned with the identification, classification and measurement of features of software that affect the cost of developing and sustaining computer programs [19]. Measuring the software through software estimation has purpose to know the complexity of the software, estimate the human resources, and get better visibility of execution and process model. There is a lot of software estimation that work sufficiently in certain conditions or step in software engineering for example measuring line of codes, function point, COCOMO, or use case points. This paper proposes another estimation technique called Distributed eXtreme Programming Estimation (DXP Estimation). DXP estimation provides a basic technique for the team that using eXtreme Programming method in onsite or distributed development. According to writer knowledge this is a first estimation technique that applied into agile method in eXtreme Programming.
PROTOTIPE KANTIN TANPA UANG BERBASIS KARTU PINTAR
Santosa, Paulus Insap
JUTI: Jurnal Ilmiah Teknologi Informasi Vol 8, No 1, Januari 2010
Publisher : Department of Informatics, Institut Teknologi Sepuluh Nopember
Show Abstract
|
Download Original
|
Original Source
|
Check in Google Scholar
|
Full PDF (729.687 KB)
|
DOI: 10.12962/j24068535.v8i1.a72
This paper presents a desktop application prototype that uses smart cards for payment mode without cash transaction at a canteen. Smart cards, used for authentication, are also designed to have information of cash balance and some personal data of card holders. Application developed is still a prototype that has not connected into the banking system to refill the balance into the smart card. This prototype is a desktop application. Features that have been successfully developed and run well in these applications include food settings, user settings, and reports sales per period.