Determination of the Best Vehicle Pathway with Classification of Data Mining Twitter using K-Nearest Neighbor

Unsecured loans are the community's choice for lending to banks that provide Reviews These services. PT. RB Diori Ganda is a regional private banking company that serves savings and loans and loans without collateral for the community. Submission of unsecured loans must go through an assessor team to process the analysis of the attributes that Affect the customer's classification so that credit can be approved, the which is then submitted to the commissioner for credit approval. But what if Reviews those who apply for credit on the same day in large amounts, of course this will the make the process of credit analysis and approval will take a long time. If it is seen from the many needs of the community to apply for loans without collateral, a classification application is needed, in order to Facilitate the work of the assessor team in the process of analyzing the attributes that Affect customer classification. To find out the classification of customers who apply for unsecured loans for using data mining with the K-Nearest Neighbor algorithm. The result of this research is the classification of problematic or non-performing customers for credit applications without collateral.

Download Full-text

Data mining, fuzzy AHP and TOPSIS for optimizing taxpayer supervision

Indonesian Journal of Electrical Engineering and Computer Science ◽

10.11591/ijeecs.v18.i1.pp75-87 ◽

2020 ◽

Vol 18 (1) ◽

pp. 75

Author(s):

M. Jupri ◽

Riyanarto Sarno

Keyword(s):

Data Mining ◽

Nearest Neighbor ◽

Fuzzy Ahp ◽

Support Vector ◽

K Nearest Neighbor ◽

Data Mining Algorithms ◽

Using Data ◽

Time Required ◽

Mining Algorithms

The achievement of accepting optimal tax need effective and efficient tax supervision can be achieved by classifying taxpayer compliance to tax regulations. Considering this issue, this paper proposes the classification of taxpayer compliance using data mining algorithms; i.e. C4.5, Support Vector Machine, K-Nearest Neighbor, Naive Bayes, and Multilayer Perceptron based on the compliance of taxpayer data. The taxpayer compliance can be classified into four classes, which are (1) formal and material compliant taxpayers, (2) formal compliant taxpayers, (3) material compliant taxpayers, and (4) formal and material non-compliant taxpayers. Furthermore, the results of data mining algorithms are compared by using Fuzzy AHP and TOPSIS to determine the best performance classification based on the criteria of Accuracy, F-Score, and Time required. Selection of the taxpayer's priority for more detailed supervision at each level of taxpayer compliance is ranked using Fuzzy AHP and TOPSIS based on criteria of dataset variables. The results show that C4.5 is the best performance classification and achieves preference value of 0.998; whereas the MLP algorithm results from the lowest preference value of 0.131. Alternative taxpayer A233 is the top priority taxpayer with a preference value of 0.433; whereas alternative taxpayer A051 is the lowest priority taxpayer with a preference value of 0.036.

Download Full-text

Efisiensi Big Data Menggunakan Improved Nearest Neighbor

Jurnal Teknologi Informasi dan Ilmu Komputer ◽

10.25126/jtiik.2019662085 ◽

2019 ◽

Vol 6 (6) ◽

pp. 665

Author(s):

Aditya Hari Bawono ◽

Ahmad Afif Supianto

Keyword(s):

Data Mining ◽

Big Data ◽

Efficient Method ◽

Nearest Neighbor ◽

Classification Methods ◽

K Nearest Neighbor ◽

Knn Classification ◽

Degree Of Similarity ◽

Selection Of

Klasifikasi adalah salah satu metode penting dalam kajian data mining. Salah satu metode klasifikasi yang populer dan mendasar adalah k-nearest neighbor (kNN). Pada kNN, hubungan antar sampel diukur berdasarkan tingkat kesamaan yang direpresentasikan sebagai jarak. Pada kasus mayoritas terutama pada data berukuran besar, akan terdapat beberapa sampel yang memiliki jarak yang sama namun amat mungkin tidak terpilih menjadi tetangga, maka pemilihan parameter k akan sangat mempengaruhi hasil klasifikasi kNN. Selain itu, pengurutan pada kNN menjadi masalah komputasi ketika dilakukan pada data berukuran besar. Dalam usaha mengatasi klasifikasi data berukuran besar dibutuhkan metode yang lebih akurat dan efisien. Dependent Nearest Neighbor (dNN) sebagai metode yang diajukan dalam penelitian ini tidak menggunakan parameter k dan tidak ada proses pengurutan sampel. Hasil percobaan menunjukkan bahwa dNN dapat menghasilkan efisiensi waktu sebesar 3 kali lipat lebih cepat daripada kNN. Perbandingan akurasi dNN adalah 13% lebih baik daripada kNN.AbstractClassification is one of the important methods of data mining. One of the most popular and basic classification methods is k-nearest neighbor (kNN). In kNN, the relationships between samples are measured by the degree of similarity represented as distance. In major cases, especially on big data, there will be some samples that have the same distance but may not be selected as neighbors, then the selection of k parameters will greatly affect the results of kNN classification. Sorting phase of kNN becomes a computation problem when it is done on big data. In the effort to overcome the classification of big data a more accurate and efficient method is required. Dependent Nearest Neighbor (dNN) as method proposed in this study did not use the k parameters and no sample at the sorting phase. The proposed method resulted in 3 times faster than kNN. The accuracy of the proposed method is13% better results than kNN.

Download Full-text

PERANCANGAN SISTEM KLASIFIKASI UDANG BERACUN PADA JENIS UDANG TENGGEK MENGGUNAKAN METODE K-NEAREST NEIGHBOR (K-NN).

Selodang Mayang: Jurnal Ilmiah Badan Perencanaan Pembangunan Daerah Kabupaten Indragiri Hilir ◽

10.47521/selodangmayang.v6i1.140 ◽

2020 ◽

Vol 6 (1) ◽

pp. 1-7

Author(s):

Lisa Afrinanda ◽

Ilyas Ilyas

Keyword(s):

Data Mining ◽

Image Processing ◽

Nearest Neighbor ◽

The Body ◽

K Nearest Neighbor ◽

Class A ◽

The People ◽

Average Accuracy ◽

Class B

Shrimp is one of the seafood which is nutrient-rich needed by the body. However, due to the frequent case of the infected Tenggek-shrimp appeared, it makes people beware to consume it. The classification of Tenggek-shrimp by using image processing of the computer be able to classify the types of shrimp whether poisonous or not. The data mining techniques can be used to classify shrimp based on RGB colors (red, green, blue) and texture (energy, contrast, correlation, homogeneity). The class of Tenggek-shrimp is divided into two, The fresh Tenggek-shrimps that are caught naturally (Class A) and the poisoned Tenggek-shrimps that are caught by using the poison (Class B). The method used in this study is K-Nearest Neighbor (K-NN). This classification system is expected to help the people in selecting good and safe Tenggek-shrimp for consumption. Based on the evaluation results using the holdout method, obtained an average accuracy of 63% with an accuracy of identification of toxic tenggek shrimp of 71.66%, and the accuracy of identification of natural fresh shrimp is about 60%.

Download Full-text

Efisiensi Big Data Menggunakan Improved Nearest Neighbor

Jurnal Teknologi Informasi dan Ilmu Komputer ◽

10.25126/jtiik.2020712085 ◽

2019 ◽

Vol 6 (6) ◽

pp. 665

Author(s):

Aditya Hari Bawono ◽

Ahmad Afif Supianto

Keyword(s):

Data Mining ◽

Big Data ◽

Efficient Method ◽

Nearest Neighbor ◽

Classification Methods ◽

K Nearest Neighbor ◽

Knn Classification ◽

Degree Of Similarity ◽

Selection Of

Klasifikasi adalah salah satu metode penting dalam kajian data mining. Salah satu metode klasifikasi yang populer dan mendasar adalah k-nearest neighbor (kNN). Pada kNN, hubungan antar sampel diukur berdasarkan tingkat kesamaan yang direpresentasikan sebagai jarak. Pada kasus mayoritas terutama pada data berukuran besar, akan terdapat beberapa sampel yang memiliki jarak yang sama namun amat mungkin tidak terpilih menjadi tetangga, maka pemilihan parameter k akan sangat mempengaruhi hasil klasifikasi kNN. Selain itu, pengurutan pada kNN menjadi masalah komputasi ketika dilakukan pada data berukuran besar. Dalam usaha mengatasi klasifikasi data berukuran besar dibutuhkan metode yang lebih akurat dan efisien. Dependent Nearest Neighbor (dNN) sebagai metode yang diajukan dalam penelitian ini tidak menggunakan parameter k dan tidak ada proses pengurutan sampel. Hasil percobaan menunjukkan bahwa dNN dapat menghasilkan efisiensi waktu sebesar 3 kali lipat lebih cepat daripada kNN. Perbandingan akurasi dNN adalah 13% lebih baik daripada kNN.AbstractClassification is one of the important methods of data mining. One of the most popular and basic classification methods is k-nearest neighbor (kNN). In kNN, the relationships between samples are measured by the degree of similarity represented as distance. In major cases, especially on big data, there will be some samples that have the same distance but may not be selected as neighbors, then the selection of k parameters will greatly affect the results of kNN classification. Sorting phase of kNN becomes a computation problem when it is done on big data. In the effort to overcome the classification of big data a more accurate and efficient method is required. Dependent Nearest Neighbor (dNN) as method proposed in this study did not use the k parameters and no sample at the sorting phase. The proposed method resulted in 3 times faster than kNN. The accuracy of the proposed method is13% better results than kNN.

Download Full-text

PERBANDINGAN KINERJA MUTUAL K-NEAREST NEIGHBOR (MKNN) DAN K-NEAREST NEIGHBOR (KNN) DALAM ANALISIS KLASIFIKASI KELAYAKAN KREDIT

Jurnal Gaussian ◽

10.14710/j.gauss.v8i3.26681 ◽

2019 ◽

Vol 8 (3) ◽

pp. 366-376

Author(s):

Annisa Sugesti ◽

Moch. Abdul Mukid ◽

Tarno Tarno

Keyword(s):

Cross Validation ◽

Nearest Neighbor ◽

Nearest Neighbors ◽

Classification Performance ◽

K Nearest Neighbor ◽

Classification Technique ◽

Optimal Value ◽

Fold Cross Validation

Credit feasibility analysis is important for lenders to avoid the risk among the increasement of credit applications. This analysis can be carried out by the classification technique. Classification technique used in this research is instance-based classification. These techniques tend to be simple, but are very dependent on the determination of K values. K is number of nearest neighbor considered for class classification of new data. A small value of K is very sensitive to outliers. This weakness can be overcome using an algorithm that is able to handle outliers, one of them is Mutual K-Nearest Neighbor (MKNN). MKNN removes outliers first, then predicts new observation classes based on the majority class of their mutual nearest neighbors. The algorithm will be compared with KNN without outliers. The model is evaluated by 10-fold cross validation and the classification performance is measured by Gemoetric-Mean of sensitivity and specificity. Based on the analysis the optimal value of K is 9 for MKNN and 3 for KNN, with the highest G-Mean produced by KNN is equal to 0.718, meanwhile G-Mean produced by MKNN is 0.702. The best alternative to classifying credit feasibility in this study is K-Nearest Neighbor (KNN) algorithm with K=3.Keywords: Classification, Credit, MKNN, KNN, G-Mean.

Download Full-text

Machine Learning Verdict of EEG Signals in Brain Computer Interface

International Journal of Scientific Research in Computer Science Engineering and Information Technology ◽

10.32628/cseit1838114 ◽

2018 ◽

pp. 429-441

Author(s):

M. Jeyanthi ◽

C. Velayutham

Keyword(s):

Nearest Neighbor ◽

Technology Development ◽

Vital Role ◽

Svm Classifier ◽

K Nearest Neighbor ◽

Data Mining Technique ◽

Data Set ◽

Eeg Data ◽

Irrelevant Attributes

In Science and Technology Development BCI plays a vital role in the field of Research. Classification is a data mining technique used to predict group membership for data instances. Analyses of BCI data are challenging because feature extraction and classification of these data are more difficult as compared with those applied to raw data. In this paper, We extracted features using statistical Haralick features from the raw EEG data . Then the features are Normalized, Binning is used to improve the accuracy of the predictive models by reducing noise and eliminate some irrelevant attributes and then the classification is performed using different classification techniques such as Naïve Bayes, k-nearest neighbor classifier, SVM classifier using BCI dataset. Finally we propose the SVM classification algorithm for the BCI data set.

Download Full-text

Perancangan Aplikasi Prediksi Kelulusan Tepat Waktu Bagi Mahasiswa Baru Dengan Teknik Data Mining (Studi Kasus: Data Akademik Mahasiswa STMIK Dipanegara Makassar)

Creative Information Technology Journal ◽

10.24076/citec.2014v1i4.27 ◽

2015 ◽

Vol 1 (4) ◽

pp. 270

Author(s):

Muhammad Syukri Mustafa ◽

I. Wayan Simpen

Keyword(s):

Data Mining ◽

Nearest Neighbor ◽

Test Results ◽

K Nearest Neighbor ◽

Accuracy Rate ◽

Sample Data ◽

New Students ◽

K Nearest Neighbor Algorithm ◽

Using Data ◽

Existing Data

Penelitian ini dimaksudkan untuk melakukan prediksi terhadap kemungkian mahasiswa baru dapat menyelesaikan studi tepat waktu dengan menggunakan analisis data mining untuk menggali tumpukan histori data dengan menggunakan algoritma K-Nearest Neighbor (KNN). Aplikasi yang dihasilkan pada penelitian ini akan menggunakan berbagai atribut yang klasifikasikan dalam suatu data mining antara lain nilai ujian nasional (UN), asal sekolah/ daerah, jenis kelamin, pekerjaan dan penghasilan orang tua, jumlah bersaudara, dan lain-lain sehingga dengan menerapkan analysis KNN dapat dilakukan suatu prediksi berdasarkan kedekatan histori data yang ada dengan data yang baru, apakah mahasiswa tersebut berpeluang untuk menyelesaikan studi tepat waktu atau tidak. Dari hasil pengujian dengan menerapkan algoritma KNN dan menggunakan data sampel alumni tahun wisuda 2004 s.d. 2010 untuk kasus lama dan data alumni tahun wisuda 2011 untuk kasus baru diperoleh tingkat akurasi sebesar 83,36%.This research is intended to predict the possibility of new students time to complete studies using data mining analysis to explore the history stack data using K-Nearest Neighbor algorithm (KNN). Applications generated in this study will use a variety of attributes in a data mining classified among other Ujian Nasional scores (UN), the origin of the school / area, gender, occupation and income of parents, number of siblings, and others that by applying the analysis KNN can do a prediction based on historical proximity of existing data with new data, whether the student is likely to complete the study on time or not. From the test results by applying the KNN algorithm and uses sample data alumnus graduation year 2004 s.d 2010 for the case of a long and alumni data graduation year 2011 for new cases obtained accuracy rate of 83.36%.

Download Full-text

Hydroponic Nutrient Control System Based on Internet of Things

CommIT (Communication and Information Technology) Journal ◽

10.21512/commit.v13i2.6016 ◽

2019 ◽

Vol 13 (2) ◽

Cited By ~ 1

Author(s):

Herman Herman ◽

Demi Adidrana ◽

Nico Surantha ◽

Suharjito Suharjito

Keyword(s):

Urban Areas ◽

Human Population ◽

Mineral Water ◽

Nearest Neighbor ◽

Total Dissolved Solids ◽

K Nearest Neighbor ◽

Turn On ◽

Nutrient Film Technique ◽

Planting Method

The human population significantly increases in crowded urban areas. It causes a reduction of available farming land. Therefore, a landless planting method is needed to supply the food for society. Hydroponics is one of the solutions for gardening methods without using soil. It uses nutrient-enriched mineral water as a nutrition solution for plant growth. Traditionally, hydroponic farming is conducted manually by monitoring the nutrition such as acidity or basicity (pH), the value of Total Dissolved Solids (TDS), Electrical Conductivity (EC), and nutrient temperature. In this research, the researchers propose a system that measures pH, TDS, and nutrient temperature values in the Nutrient Film Technique (NFT) technique using a couple of sensors. The researchers use lettuce as an object of experiment and apply the k-Nearest Neighbor (k-NN) algorithm to predict the classification of nutrient conditions. The result of prediction is used to provide a command to the microcontroller to turn on or off the nutrition controller actuators simultaneously at a time. The experiment result shows that the proposed k-NN algorithm achieves 93.3% accuracy when it is k = 5.

Download Full-text