Tresna Maulana Fahrudin
Department of Data Science Faculty of Computer Science UPN "Veteran" Jawa Timur

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

Found 2 Documents
Search

Cluster Analysis of Hospital Inpatient Service Efficiency Based on BOR, BTO, TOI, AvLOS Indicators using Agglomerative Hierarchical Clustering Tresna Maulana Fahrudin; Prismahardi Aji Riyantoko; Kartika Maulida Hindrayani; Made Hanindia Prami Swari
Telematika Vol 18, No 2 (2021): Edisi Juni 2021
Publisher : Jurusan Teknik Informatika

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.31315/telematika.v18i2.4786

Abstract

Purpose: The research proposed an approach for grouping hospital inpatient service efficiency that have the same characteristics into certain clusters based on BOR, BTO, TOI, and AvLOS indicators using Agglomerative Hierarchical Clustering.Design/methodology/approach: Applying Agglomerative Hierarchical Clustering with dissimilarity measures such as single linkage, complete linkage, average linkage, and ward linkage.Findings/result: The experiment result has shown that ward linkage was given a quite good score of silhouette coefficient reached 0.4454 for the evaluation of cluster quality. The cluster formed using ward linkage was more proportional than the other dissimilarity measures. Ward linkage has generated cluster 0 consists of 23 members, cluster 1 consists of 34 members, while both of cluster 2 and 3 consists of only 1 member respectively. The experiment reported that each cluster had problems with inpatient indicators that were not ideal and even exceeded the ideal limit, but cluster 0 generated the ideal BOR and TOI parameters, both reached 52.17% (12 of 23 hospital inpatient) and 78.36% (18 of 23 hospital inpatient) respectively.Originality/value/state of the art: Based on previous research, this study provides an alternative to produce more proportional, representative and quality clusters in mapping hospital inpatient service efficiency that have the same characteristics into certain clusters using Agglomerative Hierarchical Clustering Method compared to the K-means Clustering Method which is often trapped in local optima. 
Implementation of Web Scraping on Google Search Engine for Text Collection Into Structured 2D List Tresna Maulana Fahrudin; Prismahardi Aji Riyantoko; Kartika Maulida Hindrayani
Telematika Vol 20, No 2 (2023): Edisi Juni 2023
Publisher : Jurusan Informatika

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.31315/telematika.v20i2.9575

Abstract

Purpose: This research proposes the implementation of web scraping on Google Search Engine to collect text into a structured 2D list.Design/methodology/approach: Implementing two important stages in the process of collecting data through web scraping, namely the HTML parsing process to extract links (URL) on Google Search Engine pages, and HTML parsing process to extract the body text from website pages on each link that has been collected.Findings/result: The inputted query is adjusted to the latest issues and news in Indonesia, for example the President's important figures, the month of Ramadan and Idul Fitri, riots tragedy (stadium) and natural disasters, rising prices of basic commodities, oil and gold, as well as other news. The least number of links obtained was 56 links and the most was 151 links, while the processing time to obtain links for each of the fastest queries was 1 minute 6.3 seconds and the longest was 2 minutes 49.1 seconds. The results of scraping links from these queries were obtained from Wikipedia, Detik, Kompas, the Election Supervisory Body (Bawaslu), CNN Indonesia, the General Election Commission (KPU), Pikiran Rakyat, and others.Originality/value/state of the art: Based on previous research, this study provides an alternative to produce optimal collection of links and text from web scraping results in the form of a 2D list structure. Lists in the Python programming language can store character sequences in the form of strings and can be accessed using index keys, and manipulate text efficiently.