Claim Missing Document
Check
Articles

Found 5 Documents
Search

PENENTUAN MINAT BAKAT MENGGUNAKAN METODE BAYES BERBASIS WEB Manurung, Joseph Eky; Putri, Eviana Tjatur
KONVERGENSI Vol 16 No 2 (2020)
Publisher : Informatics, Universitas 17 Agustus 1945 Surabaya

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30996/konv.v16i2.3940

Abstract

Penentuan minat bakat seseorang, di tentukan seorang psikologi/pakar membutukan waktu yang cukup lama untuk menganilasa jawaban dan mendapatkan output tes dari perhitungan dengan metode tertentu secara manual.  Dalam hal ini penentuan minat bakat siswa siswi sma yang mau melanjutkan ke perguruan tinggi di arahkan untuk memilih jurusan studi berdasarkan minat dan bakat agar lebih fokus untukberkembang sesuai minat dan bakat nya. Jurusan yang tidak tepat bisa sanggat merugikan para siswa-siswi dan masa depanya Dalam penelitian  ini aplikasi penentuan minat – bakat dibuat untuk memberikan saran ke pada siswa-siswi yang mau melanjutkan ke perguruan tinggi. Akan ada data yang di berilkan kepada siswa-siswi kemudian di isi dan data tersebut di proses dengan menggunakan metode bayes berdasarkan dataset yang yang menjadi acaun pennetuan. Gambaran mengenai penentuan mengunakan metode bayes ada data di kelolah menggunakan metode bayes dan hasil perhitungan nya yang terbesar merupakan hasil dari minat – bakat berdasarkan data yang di inputkan oleh siswa-siswi. Aplikasi penentuan minat bakat siswa-siswi sma mengunakan metode bayes dengan memakai bahasa pemogram PHP dan Mysql sebagai basis datanya. dan datasetnya yang sebagai basis data untuk penentuan minat bakat di dapat dari lembaga psikologi.
Development Of Decision Related Engine Using Integration Of Genetic Algorithm And Text Mining Eviana Tjatur Putri; . Mardalena; . Asmah
International Conference on Engineering and Technology Development (ICETD) 2012: 1st ICETD 2012
Publisher : Bandar Lampung University (UBL)

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

Abstract

Text Miningas a popular method used to perform text-based information retrieval can not be denied its use. At the beginning of the text mining method is based on the purpose of seeking to represent a collection of words from a document. Tokenizing, filtering, Stemming, Tagging and Analyzing are the critical process sequence in the methods of Text Mining, which ultimately yield important information of the most dominant in a document  that analyzed.Applying Genetic Algorithms on Text Mining methodaims to create a Related Decision Engine, a machine capable of making decisions that relate among one another and the results of analysis carried out. Analysis carried out in this study is the analysis applied to digital libraries, the information starting from the synopsis, preface and the title of the book, which will be processed the information by the methods of Text Mining. Users often only presented the information in accordance with what books you are looking for, without giving a few other books that likely her relationship with the books to be searched. Though likely will also be of interest to the user associated with the book that will be sought. In this case, the users who will find the documents were also given another information that her relationship with books that may also be an option in the user's search.This application created a web-based, using the Apache Web Server and MySQL database to support the completeness of applications built on digital libraries.
Implementasi Metode Market Basket Analysis Untuk Menentukan Menu Paket Penjualan Di Bius Café Susilayani, Asrini; Putri, Eviana Tjatur; Hartono, Lies; Ardi, Mohamad
Journal of Big Data Analytic and Artificial Intelligence Vol 7 No 2 (2024): JBIDAI Desember 2024
Publisher : STMIK PPKIA Tarakanita Rahmawati

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.71302/jbidai.v7i2.63

Abstract

A café in Tarakan City, Bius Café, is looking for sales strategies due to increasing business competition. One promotional step that a restaurant industry can take is creating package menus that are more affordable than buying items individually, making consumers happier with such menus. Bius Café, a café with a considerable number of patrons, intends to create package menus. These packages will be a combination of food and drink items from the café, taking into account how often these combinations are chosen by customers. The Apriori Algorithm is a data mining algorithm for extracting association rules. It is a type of association rule in data mining, often referred to as affinity analysis or market basket analysis. Based on the analysis results, using the Apriori algorithm to determine sales patterns shows that to form rules, the process starts with the formation of combinations from transaction analysis of 1-itemset, 2-itemset, and 3-itemset combinations that meet the support and confidence values in forming these combinations. Several transactions are selected according to the minimum support and confidence requirements, forming rules that are then ranked with the highest confidence value of 72%, which includes "Mie Goreng" and "Bius Café". Thus, the business owner can create promotional package menus by combining these two items.
Analisis Preprocessing Pada Similarity Judul Skripsi Menggunakan TF-IDF Dan Cosine Similarity Eviana Tjatur Putri; Mohamad Ardi
Journal of Big Data Analytic and Artificial Intelligence Vol 9 No 1 (2026): JBIDAI Juni 2026
Publisher : STMIK PPKIA Tarakanita Rahmawati

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.71302/jbidai.v9i1.98

Abstract

The similarity of undergraduate thesis titles may lead to the repetition of research topics and reduce the diversity of student research. This study aims to analyze the effect of preprocessing stages on thesis title similarity using the TF-IDF and Cosine Similarity methods. The dataset consists of 480 information technology thesis titles used as reference data for similarity computation. System evaluation was conducted using 50 testing titles outside the reference dataset, comprising 25 thesis titles from previous academic periods and 25 newly proposed titles submitted in the 2025 even semester. The preprocessing stages evaluated include raw text, cleaning, stopword removal, and stemming. The results indicate that each preprocessing stage produces variations in similarity values. For the previous thesis title group, the average similarity values were 36.89%, 37.07%, 36.61%, and 38.28%, respectively, while the corresponding values for the newly proposed title group were 39.18%, 39.44%, 39.07%, and 39.62%. Among the evaluated preprocessing stages, stemming produced the highest average similarity values for both testing groups. However, the improvement was relatively small, indicating that the effect of preprocessing on similarity values was limited for the dataset used in this study. In addition, this research developed a web-based system that can support a faster and more objective evaluation of undergraduate thesis title submissions.
Deteksi Pola Ketidakaktifan Akademik Mahasiswa pada Mata Kuliah Pembelajaran Mesin Menggunakan DBSCAN Mohamad Ardi; Endyk Noviyantono; Eviana Tjatur Putri
Jurnal Informatika Terpadu Vol 12 No 2 (2026): September, 2026 (On Going)
Publisher : LPPM STT Terpadu Nurul Fikri

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.54914/jit.v12i2.3074

Abstract

Lecturers often recognize students at risk of receiving a grade E only after the final examination. This study explores whether Density-Based Spatial Clustering of Applications with Noise (DBSCAN) can identify academic inactivity patterns associated with grade E before the final examination. The data comprised 142 records of a machine learning course across two odd semesters of the 2024/2025 and 2025/2026 academic years, described by five pre-final features: participation, project, assignment, quiz, and midterm scores. In this dataset, every grade E coincided with a zero final-examination score, so "at risk" denotes non-completion of the final examination. DBSCAN parameters were selected using internal validity indices without using final grades. DBSCAN formed two clusters and 17 noise records. In a retrospective evaluation, the 25 records outside the main cluster included 21 of 28 grade-E records (precision 0.84, recall 0.75, F1-score 0.79, MCC 0.75). Isolation Forest performed identically, and cross-semester validation showed limited generalization (F1-score 0.39–0.40). DBSCAN therefore offers an interpretable exploratory approach for identifying inactivity patterns, not a validated early-warning system. Future work should use prospective validation and attendance or learning-log data.