Claim Missing Document
Check
Articles

Analisis Sentimen Pada Kuisioner Kepuasan Terhadap Layanan Dan Fasilitas Universitas Dengan Menggunakan Klasifikasi Support Vector Machine (svm) Iman Nur Fakhri; Jondri Jondri; Rian Febrian Umbara
eProceedings of Engineering Vol 6, No 2 (2019): Agustus 2019
Publisher : eProceedings of Engineering

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

AbstrakPerguruan tinggi sebagai sarana untuk proses memajukan kehidupan berbangsa dan bernegara perlumelakukan adanya peningkatan mutu dan kualitas layanan yang diberikan kepada mahasiswa. Kepuasanmahasiswa dianggap sebagai salah satu masalah utama perguruan tinggi yang harus dipecahkan agarterciptanya perguruan tinggi yang mampu menduduki peringkat nasional maupun internasional. Layananyang berpengaruh cukup besar dalam hal ini adalah layanan akademik. Tingkat kepuasan mahasiswaterhadap layanan berorientasi pada tenaga pendidik (dosen) sebagai pemberi jasa dan kualitas layanandalam sarana dan prasarana kegiatan perkuliahan. Oleh sebab itu dilakukan penelitian yang bertujuanuntuk mengetahui kepuasan mahasiswa terhadap layanan dan fasilitas universitas. Penelitian dilakukandengan pengklasifikasian menggunakan Support Vector Machine (SVM) dan pembobotan menggunakanTerm Frequency – Invers Document Frequency (TF-IDF) serta performansi sistem diukur menggunakanConfusion Matrix. Hasil survei kepuasan mahasiswa di Universitas Telkom dari 10000 isian terdapat 67%sentimeen positif dan 33% sentimen negatif. Nilai akurasi tertinggi yang didapatkan pada sistem ini sebesar70.39% dengan 10000 isian menggunakan kernel Linier.Kata kunci : Layanan Universitas, Analisis Sentimen, Support Vector Machine (SVM), TF-IDFAbstract Higher education as a means for the process of advancing the life of the nation and state needs to make anincrease in the quality and quality of services provided to students. Student satisfaction is considered as oneof the main problems of higher education that must be solved so that universities can be ranked nationallyand internationally. Services that have a significant influence in this regard are academic services. The levelof student satisfaction with services is oriented to the teaching staff (lecturers) as service providers andservice quality in the facilities and infrastructure of lecture activities. Therefore research is conducted whichaims to determine student satisfaction with university services and facilities. The research was conductedby classifying using Support Vector Machine (SVM) and weighting using Term Frequency - InverseDocument Frequency (TF-IDF) and system performance measured using Confusion Matrix. The results ofthe student satisfaction survey at Telkom University from 10000 entries contained 67% positive sentimeenand 33% negative sentiment. The highest accuracy value obtained in this system is 70.39% with 10000entries using the Linear kernel.Keywords: University Services, Sentiment Analysis , Support Vector Machine (SVM), TF-IDF
On the inverse graph of a finite group and its rainbow connection number Rian Febrian Umbara; A.N.M. Salman; Pritta Etriana Putri
Electronic Journal of Graph Theory and Applications (EJGTA) Vol 11, No 1 (2023): Electronic Journal of Graph Theory and Applications
Publisher : GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.5614/ejgta.2023.11.1.11

Abstract

A rainbow path in an edge-colored graph G is a path that every two edges have different colors. The minimum number of colors needed to color the edges of G such that every two distinct vertices are connected by a rainbow path is called the rainbow connection number of G. Let (Γ, *) be a finite group with TΓ = {t ∈ Γ|t ≠ t−1}. The inverse graph of Γ, denoted by IG(Γ), is a graph whose vertex set is Γ and two distinct vertices, u and v, are adjacent if u * v ∈ TΓ or v * u ∈ TΓ. In this paper, we determine the necessary and sufficient conditions for the inverse graph of a finite group to be connected. We show that the inverse graph of a finite group is connected if and only if the group has a set of generators whose all elements are non-self-invertible. We also determine the rainbow connection numbers of the inverse graphs of finite groups.
Co-Authors A. Maulana Mukhsin A.N.M. Salman Abdurrahman Muttaqiin Abdurrazaq Naufal Agri Pratomo Alberila Fraida Loceseima Putri Alfian Yudha Iswara Ali Assegaf Almaya Sofariah Andri Saputra Aniq Atiqi Rohmawati Anjar Pratiwi Annisa Aditsania Annisa Resnianty Ardhia Pringgowati Ardhyka Dewantara Arfian Nurdiansyah Astri Asroviana Putri Ayunda Firsty Trisnowati Bambang Eko Supriyadi Bambang Hidayat Barini Harahap Budi Ihsan Daulay Cipta Rahmadayanti Clara Amanda Danang Triantoro Murdiansyah Defy Ayu Dela Tantri Riyandani Deni Saepudin Dika Rizky Nurcholis Erick Anugrah Prihananta Esther Laura Christy Felix Octavianus Hasudungan Fiqi Ruli Setiawan Firdaus Maringga Firdaus Maringga Firdaus Maringga Gege Safet Yanto Raharjo Hafiz Denasputra Harry Susilodharma I Komang Gede Rusmawan I Wayan Ade Sugisnawan Dandysmara I Wayan Ade Sugisnawan Dandysmara Iman Nur Fakhri Indra Utama Sitorus Indwiarti Irma Palupi Isman Kurniawan Izzatul Ummah Jeshurun Eliezer Cussoy Jondri Jondri Karina Priscilia Karina Priscilia Lintong Aldiron Sihombing Lisbeth Evalina Siahaan Lola Yolanda Ruth Herinis Lumbanraja May Rozakhi Takkas Mohammad Adietya Perdana Muhamad Lutfi Chandra Muhammad Faizal Muhammad Farhan Muzakki Muhammad Gentur WitjaksonoKurniawan Muhammad Gentur WitjaksonoKurniawan Muhammad Saddam Salsabillah Muhammad Saddam Salsabillah Muhammad Saddam Salsabillah Nathan Sukmawan Nurseno Bayu Aji Nurseno Bayu Aji Patma Oktaviana Pritta Etriana Putri Putri Haryati Rizki Putri Haryati Rizki Rahmi Putri Amalia Resi Annisa Nur Rinaldi Wibiyanto Riski Hamonangan Simanjuntak Riyadi Lazuardi Sirait Rizki Ayudiah Kartika Paramita Rizky Farida Utami Rizky Retno Utami Sheila Nur Fadhila Siti Rahmah Madusari Sri Suryani Sri Suryani Sri Suryani Tedo Hariscandra Tegar Tionanda Putra Triyana Kadarisman Uggi Stivani Savitri Yanuar Ishaq Yuliant Sibaroni