scholarly journals Detection of Brain Tumor Using K-Nearest Neighbor (KNN) Based Classification Model and Self Organizing Map (SOM) Algorithm

2020 ◽  
Vol 7 ◽  
Keyword(s):  
Data Mining ◽  
Brain Tumor ◽  
Nearest Neighbor ◽  
Classification Model ◽  
Discrete Wavelet ◽  
Self Organizing Map ◽  
K Nearest Neighbor ◽  
Data Set ◽  
Novel Approach ◽  
Self Organizing

Knowledge discovery is also known as Data mining in databases, in recent years that technique plays a major role in research area. Data mining in healthcare domain has noteworthy usage in real world. The mining method can enable the healthcare field for the enhancement of institutionalization of its administrations and become quicker with best in class technologies. Innovation utilization isn't restricted to basic leadership in undertakings, yet spread to different social statuses in all fields. In this paper a novel approach for the detection of brain tumor is proposed. The novel approach uses the classification technique of K-nearest neighbor (KNN) and for ignoring the error of the dataset image SOM (self-organizing map) algorithm has been used. Discrete wavelet transform (DWT) is used for transforming input image data set, in which RGB color of input data image has been converted into gray scale. Then it has been classified using KNN after that the error avoiding algorithm has been carried out. This will help to differentiate tumor cells and the normal cells. The presence of tumor in brain image is detected using parametric analysis by simulation.

scholarly journals Analysis and Prediction of CET4 Scores Based on Data Mining Algorithm

Complexity ◽  
2021 ◽  
Vol 2021 ◽  
pp. 1-11
Author(s):  
Hongyan Wang
Keyword(s):  
Data Mining ◽  
Linear Regression ◽  
Test Score ◽  
Nearest Neighbor ◽  
Classification Model ◽  
Data Mining Algorithm ◽  
K Nearest Neighbor ◽  
Nearest Neighbor Algorithm ◽  
K Nearest Neighbor Algorithm ◽  
Classification Efficiency

This paper presents the concept and algorithm of data mining and focuses on the linear regression algorithm. Based on the multiple linear regression algorithm, many factors affecting CET4 are analyzed. Ideas based on data mining, collecting history data and appropriate to transform, using statistical analysis techniques to the many factors influencing the CET-4 test were analyzed, and we have obtained the CET-4 test result and its influencing factors. It was found that the linear regression relationship between the degrees of fit was relatively high. We further improve the algorithm and establish a partition-weighted K-nearest neighbor algorithm. The K-weighted K nearest neighbor algorithm and the partition algorithm are used in the CET-4 test score classification prediction, and the statistical method is used to study the relevant factors that affect the CET-4 test score, and screen classification is performed to predict when the comparison verification will pass. The weight K of the input feature and the adjacent feature are weighted, although the allocation algorithm of the adjacent classification effect has not been significantly improved, but the stability classification is better than K-nearest neighbor algorithm, its classification efficiency is greatly improved, classification time is greatly reduced, and classification efficiency is increased by 119%. In order to detect potential risk graduating students earlier, this paper proposes an appropriate and timely early warning and preschool K-nearest neighbor algorithm classification model. Taking test scores or make-up exams and re-learning as input features, the classification model can effectively predict ordinary students who have not graduated.

BAYESIAN SELF-ORGANIZING MAP FOR DATA CLASSIFICATION AND CLUSTERING

2013 ◽  
Vol 11 (05) ◽  
pp. 1350037 ◽  
Author(s):  
XIAOLIAN GUO ◽  
HAIYING WANG ◽  
DAVID H. GLASS
Keyword(s):  
Learning Process ◽  
Bayesian Learning ◽  
Nearest Neighbor ◽  
Information Criterion ◽  
Gaussian Mixture ◽  
Optimal Number ◽  
Support Vector ◽  
Self Organizing Map ◽  
K Nearest Neighbor ◽  
Self Organizing

The Bayesian self-organizing map (BSOM) has typically been used for density estimation. In this study, we implemented an adaptation of the model for performing unsupervized and supervised classification. In order to determine the optimal number of neurons to represent the given dataset during the learning process, an extended Bayesian learning process is proposed called the growing BSOM. It starts with two neurons and adds new neurons to the network via a process in which the neuron with the lowest individual log-likelihood is identified. The system has been tested using three synthetic datasets and one real dataset. The experimental results suggest that the BSOM-based approach can achieve better classification performance in comparisons to several widely-used models such as k-nearest neighbor (KNN), support vector machine (SVM) and Gaussian mixture model (GMM). By using the Bayesian information criterion (BIC) as a stopping criterion, the growing BSOM can model the data under study and estimate the number of clusters.

scholarly journals Perbandingan Metode SOM/Kohonen dengan ART 2 pada Data Mining Perusahaan Retail

2017 ◽  
Vol 16 (2) ◽  
pp. 55
Author(s):  
Anak Agung Gede Bagus Ariana ◽  
I Ketut Gede Darma Putra ◽  
Linawati Linawati
Keyword(s):  
Neural Network ◽  
Data Mining ◽  
Data Clustering ◽  
Adaptive Resonance Theory ◽  
Self Organizing Map ◽  
Resonance Theory ◽  
Data Set ◽  
Adaptive Resonance ◽  
Clustering Data ◽  
Self Organizing

Abstract— This study investigates the performance of artificial neural network method on clustering method. Using UD. Fenny’s customer profile in year 2009 data set with the Recency, Frequency and Monetary model data. Clustering methods were compared in this study is between the Self Organizing Map and Adaptive Resonance Theory 2. The performance evaluation method validation is measured by the index cluster validation. Validation index clusters are used, among others, Davies-Bouldin index, index and index Dunn Silhouette. The test results show the method Self Organizing Map is better to process the data clustering. Index term— Data Mining, Artificial Neural Network, Self Organizing Map, Adaptive Resonance Theory 2. Intisari—Penelitian ini ingin mengetahui unjuk kerja metode clustering data berbasis jaringan saraf tiruan. Menggunakan data set profil pelanggan UD. Fenny tahun 2009 dengan atribut Recency, Frequency dan Monetary. Metode clustering yang dibandingkan pada penelitian ini adalah Self Organizing Map dan Adaptive Resonance Theory 2. Evaluasi kinerja metode dilakukan dengan mengukur validasi index dari cluster yang terbentuk. Validasi cluster yang digunakan antara lain Indeks Davies-Bouldin, Indeks Dunn dan Indeks Silhouette. Hasil pengujian menunjukkan metode Self Organizing Map lebih baik dalam melakukan proses clustering data. Kata Kunci— Data Mining, Jaringan Saraf Tiruan Self Organizing Map, Adaptive Resonance Theory 2.

scholarly journals A novel ensemble modeling for intrusion detection system

2020 ◽  
Vol 10 (2) ◽  
pp. 1963
Author(s):  
Pullagura Indira Priyadarsini ◽  
G. Anuradha
Keyword(s):  
Feature Selection ◽  
Intrusion Detection ◽  
Intrusion Detection System ◽  
Nearest Neighbor ◽  
Detection System ◽  
Distance Functions ◽  
Classification Model ◽  
Support Vector ◽  
K Nearest Neighbor ◽  
Data Set

Vast increase in data through internet services has made computer systems more vulnerable and difficult to protect from malicious attacks. Intrusion detection systems (IDSs) must be more potent in monitoring intrusions. Therefore an effectual Intrusion Detection system architecture is built which employs a facile classification model and generates low false alarm rates and high accuracy. Noticeably, IDS endure enormous amounts of data traffic that contain redundant and irrelevant features, which affect the performance of the IDS negatively. Despite good feature selection approaches leads to a reduction of unrelated and redundant features and attain better classification accuracy in IDS. This paper proposes a novel ensemble model for IDS based on two algorithms Fuzzy Ensemble Feature selection (FEFS) and Fusion of Multiple Classifier (FMC). FEFS is a unification of five feature scores. These scores are obtained by using feature-class distance functions. Aggregation is done using fuzzy union operation. On the other hand, the FMC is the fusion of three classifiers. It works based on Ensemble decisive function. Experiments were made on KDD cup 99 data set have shown that our proposed system works superior to well-known methods such as Support Vector Machines (SVMs), K-Nearest Neighbor (KNN) and Artificial Neural Networks (ANNs). Our examinations ensured clearly the prominence of using ensemble methodology for modeling IDSs. And hence our system is robust and efficient.

scholarly journals Improving Classification Accuracy Using Clustering Technique

2018 ◽  
Vol 7 (3) ◽  
pp. 465-470
Author(s):  
Norsyela Muhammad Noor Mathivanan ◽  
Nor Azura Md.Ghani ◽  
Roziah Mohd Janor
Keyword(s):  
Large Scale ◽  
Nearest Neighbor ◽  
Computation Time ◽  
Classification Model ◽  
K Nearest Neighbor ◽  
Real World Data ◽  
Data Set ◽  
Clustering Technique ◽  
Clustering And Classification ◽  
Correct Category

Product classification is the key issue in e-commerce domains. Many products are released to the market rapidly and to select the correct category in taxonomy for each product has become a challenging task. The application of classification model is useful to precisely classify the products. The study proposed a method to apply clustering prior to classification. This study has used a large-scale real-world data set to identify the efficiency of clustering technique to improve the classification model. The conventional text classification procedures are used in the study such as preprocessing, feature extraction and feature selection before applying the clustering technique. Results show that clustering technique improves the accuracy of the classification model. The best classification model for all three approaches which are classification model only, classification with hierarchical clustering and classification with K-means clustering is K-Nearest Neighbor (KNN) model. Even though the accuracy of the KNN models are the same across different approaches but the KNN model with K-means clustering had the shortest time of execution. Hence, applying K-means clustering prior to KNN model helps in reducing the computation time.

Machine Learning Verdict of EEG Signals in Brain Computer Interface

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.

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

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%.

scholarly journals COVIMOS: A Coastal Video Monitoring System

2017 ◽  
Vol 1 (1) ◽  
pp. 1
Author(s):  
I Made Oka Widyantara ◽  
I Made Dwi Asana Putra ◽  
Ida Bagus Putu Adnyana
Keyword(s):  
Monitoring System ◽  
Nearest Neighbor ◽  
Low Cost ◽  
Video Image ◽  
Video Monitoring ◽  
Reference Object ◽  
Self Organizing Map ◽  
K Nearest Neighbor ◽  
Ip Camera ◽  
Class Labels

This paper intends to explain the development of Coastal Video Monitoring System (CoViMoS) with the main characteristics including low-cost and easy implementation. CoViMoS characteristics have been realized using the device IP camera for video image acquisition, and development of software applications with the main features including detection of shoreline and it changes are automatically. This capability was based on segmentation and classification techniques based on data mining. Detection of shoreline is done by segmenting a video image of the beach, to get a cluster of objects, namely land, sea and sky, using Self Organizing Map (SOM) algorithms. The mechanism of classification is done using K-Nearest Neighbor (K-NN) algorithms to provide the class labels to objects that have been generated on the segmentation process. Furthermore, the classification of land used as a reference object in the detection of costline. Implementation CoViMoS system for monitoring systems in Cucukan Beach, Gianyar regency, have shown that the developed system is able to detect the shoreline and its changes automatically.

Symmetry Breaking and Training from Incomplete Data with Radial Basis Boltzmann Machines

1997 ◽  
Vol 08 (03) ◽  
pp. 301-315 ◽  
Author(s):  
Marcel J. Nijman ◽  
Hilbert J. Kappen
Keyword(s):  
Symmetry Breaking ◽  
Incomplete Data ◽  
Missing Values ◽  
Nearest Neighbor ◽  
Boltzmann Machine ◽  
K Nearest Neighbor ◽  
Data Set ◽  
Input Space ◽  
Learning Rules ◽  
Radial Basis

A Radial Basis Boltzmann Machine (RBBM) is a specialized Boltzmann Machine architecture that combines feed-forward mapping with probability estimation in the input space, and for which very efficient learning rules exist. The hidden representation of the network displays symmetry breaking as a function of the noise in the dynamics. Thus, generalization can be studied as a function of the noise in the neuron dynamics instead of as a function of the number of hidden units. We show that the RBBM can be seen as an elegant alternative of k-nearest neighbor, leading to comparable performance without the need to store all data. We show that the RBBM has good classification performance compared to the MLP. The main advantage of the RBBM is that simultaneously with the input-output mapping, a model of the input space is obtained which can be used for learning with missing values. We derive learning rules for the case of incomplete data, and show that they perform better on incomplete data than the traditional learning rules on a 'repaired' data set.

Sign in / Sign up

Export Citation Format

Share Document