Article Per Year (5 Year)
p-Index From 2020 - 2025
0
P-Index
This Author published in this journals
All Journal Jurnal Informatika Jurnal technoscientia JURNAL TEKNOLOGI TECHNOSCIENTIA
F Soesianto
Universitas Gadjah Mada
Chemical Engineering, Chemistry & Bioengineering Computer Science & IT Earth & Planetary Sciences Engineering Industrial & Manufacturing Engineering Materials Science & Nanotechnology Mechanical Engineering

Published : 3 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 3 Documents
Search

 1 
DESAIN MODEL SPESIFIKASI AKSES PENGGUNA DI LINGKUNGAN JARINGAN BERKECEPATAN RENDAH Wardani, Ratna; Soesianto, F; Nugroho, Lukito Edi; Ashari, Ahmad
Jurnal Informatika Vol 4, No 1: January 2010
Publisher : Universitas Ahmad Dahlan

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (23.425 KB)

Abstract

The Internet has the potential to provide universal and easy access to the various types of information services on a single multi-service, but unreliable quality connection can sometime prevent access to the Internet altogether. There are many efforts have been started to resolve the Internet access problem. The main idea behind them is to provide a set of objective parameters that can be used to compare and negotiate in a network. Relatively little emphasis has been put on issues concerning end users, especially on the relationship of user perception and Quality of Service parameters.  In order to implement Quality of Service schemes successfully, users must be taken into account to establish users´ subjective perceptions of Quality of Service.This paper is concerned to the study of mechanism of providing Quality of Service specification for Internet access in low-quality connection. We propose the conceptual model for the specification of user access and allow the users to specify their subjective preferences through the Quality of Service parameters. This model provides the alternative option for user access if resource availability in the system is limited. The user is given opportunity to define their access and determine the parameter for each application which they are chosen. The system will check the resource availability and then compare to the user preferences. In the case resource availability is lower than user preferences, the system can exchange to another option as determined by user requirements.
STUDI KOMPARASI ALGORITMA HIERARCHICAL DAN PARTITIONAL UNTUK CLUSTERING DOKUMEN TEKS BERBAHASA INDONESIA Hamzah, Amir; Susanto, Adhi; Soesianto, F; Istiyanto, Jazi Eko
JURNAL TEKNOLOGI TECHNOSCIENTIA Academia Ista Vol 12 No 01 Agustus 2007
Publisher : Lembaga Penelitian & Pengabdian Kepada Masyarakat (LPPM), IST AKPRIND Yogyakarta

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (250.368 KB) | DOI: 10.34151/technoscientia.v0i0.1972

Abstract

Text document clustering is a technique which has been intensively studied be-cause of its important role in the text-mining and information retrieval. In the vector spa-ce model it is typically known two main clustering approaches,i.e. hierachical algorithm and partitional algorithm. The hierarchical algorithm produces deterministic result known as a dendogram, but its weakness is high complexity in time and memory. On the other hand, partitiaonal algorithm has linear time and memory complexity although its clustering result is not independent from its initial cluster. The aim of this research was to study experimentally to compare the perfor-mances of several techniques of hierarchical algorithms and partitional algorithms applied to text documents written in Bahasa Indonesia. The five similarity techniques i.e. UPGM-A, CSI, IST,SL and CL were chosen from hierarchical, whereas K-Means, Bisecting K-Mean and Buckshot are chosen for partitonal ones. The documents were collected from 200 to 800 Indonesian news text that have been categorized manually and used to test these algorithms using F-measure for clustering performance. This value was derived from Recall and Precision and can be used to measure the performance of the algorithms to correctly classify the collections. Results showed that Bisecting K-Mean as a variant of partitional algorithm performed comparably with the two best hierarchical techniques,i.e. UPGMA and CL but with much lower time complexity.
STUDI KOMPARASI ALGORITMA HIERARCHICAL DAN PARTITIONAL UNTUK CLUSTERING DOKUMEN TEKS BERBAHASA INDONESIA Hamzah, Amir; Susanto, Adhi; Soesianto, F; Istiyanto, Jazi Eko
JURNAL TEKNOLOGI TECHNOSCIENTIA Academia Ista Vol 12 No 01 Agustus 2007
Publisher : Lembaga Penelitian & Pengabdian Kepada Masyarakat (LPPM), IST AKPRIND Yogyakarta

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.34151/technoscientia.v0i0.1972

Abstract

Text document clustering is a technique which has been intensively studied be-cause of its important role in the text-mining and information retrieval. In the vector spa-ce model it is typically known two main clustering approaches,i.e. hierachical algorithm and partitional algorithm. The hierarchical algorithm produces deterministic result known as a dendogram, but its weakness is high complexity in time and memory. On the other hand, partitiaonal algorithm has linear time and memory complexity although its clustering result is not independent from its initial cluster. The aim of this research was to study experimentally to compare the perfor-mances of several techniques of hierarchical algorithms and partitional algorithms applied to text documents written in Bahasa Indonesia. The five similarity techniques i.e. UPGM-A, CSI, IST,SL and CL were chosen from hierarchical, whereas K-Means, Bisecting K-Mean and Buckshot are chosen for partitonal ones. The documents were collected from 200 to 800 Indonesian news text that have been categorized manually and used to test these algorithms using F-measure for clustering performance. This value was derived from Recall and Precision and can be used to measure the performance of the algorithms to correctly classify the collections. Results showed that Bisecting K-Mean as a variant of partitional algorithm performed comparably with the two best hierarchical techniques,i.e. UPGMA and CL but with much lower time complexity.
Co-Authors Adhi Susanto Ahmad Ashari Jazi Eko Istiyanto Lukito Edi Nugroho Ratna Wardani Wiwik Handayani