CMUNE: A clustering using mutual nearest neighbors algorithm

Aim: Prediction of coronary illness utilizing novel Novel k nearest neighbor (KNN) and contrasting its accuracy with decision tree algorithm. Materials and Methods: Two gatherings are proposed for foreseeing the accuracy (%) of coronary illness. To be specific, novel Novel k nearest neighbor and decision tree algorithm. Here we take 20 examples each for assessment and look at. The sample size was calculated using G power with pretest power at 80% and the alpha of 0.05 value. Result: The decision tree gives better accuracy (84.95%) contrasted with the Novel k nearest neighbor accuracy (76.29 %). Along these lines the factual meaning of the decision tree is superior to the novel k nearest neighbor algorithm with significance value of 0.115. Conclusion: From the outcome, it may very well be inferred that the decision tree helps in anticipating the coronary illness with more precision contrasted with the novel k nearest neighbor algorithm.

Aim: Coronary illness is one of the main sources of mortality in this current world. A basic test in the field of clinical information assessment is the expectation of cardiovascular infection. The fundamental target of this paper is to work on the exactness of the Data mining algorithms being used to improve heart disease prediction. We will be comparing the novel Random forest with K Nearest Neighbor to find out which of these can give us the best accuracy. Material and Methods: The study used 98 samples with Novel Random Forest and K Nearest Neighbor is executed with varying training and testing splits for predicting the accuracy for heart disease prediction with the 80% of G-power value and data about cardiovascular disease was gathered from numerous web sources, including latest research findings and threshold 0.05%, confidence interval 95% mean and standard deviation. The performance of the accuracy rate of the classifiers is examined using the heart disease dataset.. There was a statistical insignificant difference among Innovative Random Forest and K Nearest Neighbor p = 0.484 (p>0.05). Results and Discussion: The accuracy of predicting heart disease in Novel Random Forest 90.16% and K Nearest Neighbor 67.21% is obtained. Conclusion: Prediction of Heart disease using the innovative Random Forest (RF) technique appears to be a significant improvement over the K Nearest Neighbor (KNN) algorithm in terms of accuracy.

Introduction: Propensity score matching (PSM) is a method to reduce the impact of essential and confounders. When the number of confounders is high, there may be a problem of matching, in which, finding matched pairs for the case group is difficult, or impossible. The propensity score (PS) minimizes the effect of the confounders, and it is reduced to one dimension. There are various algorithms in the field of PSM. This study aimed to compared the nearest neighbor and caliper algorithms. Methods: Data obtained in this study were from patients undergoing angiography at Ghaem Hospital in Mashhad, between 2011-12. The study was a retrospective case-control using PSM. In total, 604 patients were included in the case and control groups. A logistic regression model was used to calculate the propensity score and adjust the variables, such as age, gender, Body Mass Index (BMI), systolic blood pressure, smoking status, and triglyceride. Then, the Odds Ratios (ORs) with 95% Confidence Intervals (CIs) for the raw data and two matching algorithms were determined to examine the relationship between type 2 diabetes and coronary artery disease (CAD). Results: Propensity score in the nearest neighbor and caliper algorithms matched the total number of 604 samples, 200 and 178 pairs, respectively. All variables were significantly different between the two groups before matching (P<0.05). The gender was significantly different between the two groups after matching using the nearest neighbor algorithm (P=0.002). No variables created a significant difference between the two groups after matching with the caliper algorithm. Conclusion: Bias reduction in the caliper algorithm was greater than for the nearest neighbor algorithm for all variables except the triglyceride variable.

Outlier detection is a key technique in data ming and machine learning fields. The deviating characters of outliers make huge detrimental effects on the learning tasks. A lot of algorithms are therefore proposed to handle outliers from different perspectives, such as distance, density, angle and so on. Among these approaches, the density-based methods achieve better performance, but also suffer from huge time complexity. Recently, in order to accelerate the speed and improve the performance, the subsampling ensemble method attracts much attention, which has a reasonable theoretical interpretation and high performance. However, existing work only gives the partial picture of outlier detection via row-sampling, the effective portfolio of bi-sampling is still void. In light of this, we propose the general outlier detection framework via bi-sampling, Bi-Sampling Outlier Detection (BSOD) and provide the effective portfolios of the row and column-sampling ratios in a theoretical way. In addition, the benefits of BSOD are fully illustrated in terms of ensemble diversity and divide-and-conquer. Further we employ LOF within BSOD as BI-LOF to conduct extensive experiments. In general, on 30 synthetic and 17 real-world data sets we thoroughly explore the characteristics of BI-LOF with different numbers of instances, features, nearest neighbors, validate the theoretical analysis of BSOD condition on synthetic data sets, and show obvious advantages over other state-of-the-art algorithms in terms of low and high dimensional real-world data sets. And finally we use BI-LOF to conduct image outlier detection and show high quality and stableness of BI-LOF.

Deep learning has been popular for a few years, and it shows great capability on unsupervised leaning of representation. Deep belief network consists of multi layers of restricted Boltzmann machine(RBM) and a deep auto-encoder, which uses a stack architecture learning feature layer by layer. The learning rule is that one deeper layer learns more complex representations, which are the high level features of the input data, from the representations learnt by the layer before. Fuzzy C-Means(FCM) is one of the most popular clustering algorithms, which allows one piece of data belong to several clusters. In this paper the authors propose a novel clustering model, and introduce a novel clustering technique(DBNOC) which combines deep belief network and fuzzy c-means. The main idea is that: first, it clusters with the high level representations learnt by stacked RBM to produce the initial cluster center, then it uses the fine-tune step including one center holding clustering algorithm and deep auto-encoder to optimize the cluster center and membership between input data and every cluster by cross iteration. The authors use FCM clustering algorithm to fulfill the model and do experiment on both low dimensional datasets and high dimensional datasets. The experiment results suggest that the proposed deep belief network oriented clustering method is better than the standard K-Means and FCM algorithm on the test datasets. Even on high dimensional datasets, the DBNOC clustering method show more generalization. What's more, the proposed model is suitable both in theoretical and practical.

The k Nearest Neighbors (KNN) algorithm has been widely applied in various supervised learning tasks due to its simplicity and effectiveness. However, the quality of KNN decision making is directly affected by the quality of the neighborhoods in the modeling space. Efforts have been made to map data to a better feature space either implicitly with kernel functions, or explicitly through learning linear or nonlinear transformations. However, all these methods use pre-determined distance or similarity functions, which may limit their learning capacity. In this paper, we propose a novel deep learning architecture, which is called the Deep Similarity-Enhanced K Nearest Neighbors (DSE-KNN), to learn an optimized similarity function of the data directly towards the goal of optimizing the KNN decision making. In other words, the type of similarity function that is used in our method is not pre-determined but rather learned to map data to a high-dimensional feature space where the accuracy of the KNN decision making is maximized. Experimental results show that DSE-KNN outperforms other common machine learning methods on classifying different types of disease datasets and predicting daily price direction of different stock ETFs.

Clustering is a basic data mining operation that groups data points with similar inherent structure. Among clustering techniques, Density Peak Clustering (DPC) is notable for detecting clusters of arbitrary shapes without requiring the number of clusters in advance. However, DPC suffers from parameter-sensitive local density estimation, inadequate handling of noise and boundary points, and rigid binary cluster assignments. To overcome these limitations, fuzzy logic is often embedded in DPC, but the selection of the most appropriate membership function is still an open research question. In this paper, we propose an enhanced DPC variant with three methodological improvements: (i) substituting cutoff distance-based density estimation with a K-Nearest Neighbors (KNN) functioned kernel to achieve stable and robust density estimation, (ii) adding a noise parameter Lambda ( λ ) to better identify and distinguish noise and boundary points, and (iii) using fuzzy membership functions to allow for probabilistic and soft cluster assignments of data points. Comparative analyses of four fuzzy membership functions (i.e., Gaussian, Combination Gaussian, Trapezoidal, and Triangular) were performed on real, synthetic, and high-dimensional datasets. The experimental results indicate that the proposed algorithm with the Gaussian fuzzy membership function outperforms other membership functions and traditional clustering algorithms including the original DPC, FKNN, and DPC-DBFN in terms of clustering accuracy, stability, adaptability, and noise resistance, and is therefore part of our final suggested method. The proposed method overall relieves original DPC shortcomings by strengthening adaptability, accuracy, and applicability to complex real-world clustering tasks. • Substituting standard cutoff-distance-based kernel with KNN for enhanced clustering. • Introducing λ parameter to manage noise and boundary points for separating clusters. • Introducing fuzzy neighborhood kernel for soft cluster membership assignment. • Investigating the impact of several fuzzy membership functions on clustering. • Proposed strategy outperforms original DPC, FKNN, and DPC-DBFN on datasets.

The aim of this article is to measure the performance metrics of an accuracy, sensitivity and specificity of the Novel Support Vector Machine (SVM) algorithm for diabetics detection and compared with a K Nearest Neighbour (KNN) algorithm. Materials and Methods: A total of 768 samples are collected from diabetics detection datasets found in kaggle. These samples are divided into a training dataset (n=500) and test dataset (n=268). Results: By comparing the Novel Support Vector Machine with KNN. The SVM has achieved better accuracy and specificity than the KNN and the KNN has better Sensitivity than the SVM algorithm. The output values of accuracy, specificity and sensitivity of the SVM are 79%, 93% and 58%. The output values of accuracy, specificity and sensitivity of the KNN algorithm are 63%, 39% and 100%. The significance value is Pi0.05. The G power is taken as 0.8. Conclusion: The output values of accuracy, specificity and sensitivity of the Novel SVM are 79%, 93% and 58%. The output values of accuracy, specificity and sensitivity of the KNN algorithm are 63%, 39% and 100

Nearest neighbor (NN) searches represent an important class of queries in geographic information systems (GIS). Most nearest neighbor algorithms rely on static distance information to compute NN queries (e.g., Euclidean distance or spatial network distance). However, the final goal of a user when performing an NN search is often to travel to one of the points of the search result. In this case, finding the nearest neighbors in terms of travel time is more important than the actual distance. In the existing NN algorithms dynamic real-time events (e.g., traffic congestions, detours, etc.) are usually not considered and hence the pre-computed nearest neighbor objects may not accurately reflect the shortest travel time. In this paper we propose a novel travel time network that integrates both spatial networks and real-time traffic event information. Based on this foundation of the travel time network, we develop a local-based greedy nearest neighbor algorithm and a global-based adaptive nearest neighbor algorithm that both utilize real-time traffic information to provide adaptive nearest neighbor search results. We have performed a theoretical analysis and simulations to verify our methods. The results indicate that our algorithms remarkably reduce the travel time compared with previous nearest neighbor solutions.

The k-nearest neighbors (k-NN) classification rule has proven extremely successful in countless many computer vision applications. For example, image categorization often relies on uniform voting among the nearest prototypes in the space of descriptors. In spite of its good generalization properties and its natural extension to multi-class problems, the classic k-NN rule suffers from high variance when dealing with sparse prototype datasets in high dimensions. A few techniques have been proposed in order to improve k-NN classification, which rely on either deforming the nearest neighborhood relationship by learning a distance function or modifying the input space by means of subspace selection. From the computational standpoint, many methods have been proposed for speeding up nearest neighbor retrieval, both for multidimensional vector spaces and nonvector spaces induced by computationally expensive distance measures. In this paper, we propose a novel boosting approach for generalizing the k-NN rule, by providing a new k-NN boosting algorithm, called UNN (Universal Nearest Neighbors), for the induction of leveraged k-NN. We emphasize that UNN is a formal boosting algorithm in the original boosting terminology. Our approach consists in redefining the voting rule as a strong classifier that linearly combines predictions from the k closest prototypes. Therefore, the k nearest neighbors examples act as weak classifiers and their weights, called leveraging coefficients, are learned by UNN so as to minimize a surrogate risk, which upper bounds the empirical misclassification rate over training data. These leveraging coefficients allows us to distinguish the most relevant prototypes for a given class. Indeed, UNN does not affect the k-nearest neighborhood relationship, but rather acts on top of k-NN search. We carried out experiments comparing UNN to k-NN, support vector machines (SVM) and AdaBoost on categorization of natural scenes, using state-of-the art image descriptors (Gist and Bag-of-Features) on real images from Oliva and Torralba (Int. J. Comput. Vis. 42(3):145–175, 2001), Fei-Fei and Perona (IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR), pp. 524–531, 2005), and Xiao et al. (IEEE Conference on Computer Vision and Pattern Recognition (CVPR), pp. 3485–3492, 2010). Results display the ability of UNN to compete with or beat the other contenders, while achieving comparatively small training and testing times.

Defining a boundary between inliers and outliers is a major challenge in unsupervised outlier detection. In the absence of labeled data, the true outliers set cannot be evaluated. This lays the burden on both the choice of an efficient outlier detection criterion, and parameter selection. While numerous unsupervised outlier detection criteria, with different parameters, have been proposed, an unsupervised evaluation of outliers is still missing. This work introduces a theoretical basis, and proposes a validity index, to evaluate the quality of outliers. This is not a trivial problem when nothing is known about the structure and density of the data. The proposed index considers the outlierness quality, the deviation between characteristics of outliers and inliers, and the data distortion. Low and high dimensional data sets are used to evaluate the proposed index.

There is no individual classification technique has been shown to deal with all kinds of classification problems. The objective is to select the technique which more possibly reaches the best performance for any domain of data set. We focus on classifying datasets in different domains and properties such as numerical, categorical, and textual. We deal with one versus all strategy to handle multi-class problems. In the experiment, we compared the performance of 4 classification techniques namely Boosted C5.0, KNN, Naïve Bayes, and SVM on 10-fold cross-validation on different number of features. For numerical data set (low and high dimensional data set), the performance of KNN was better than other classification methods. For a categorical and textual data set, Naïve Bayes and SVM were outperformed, respectively.

This research paper aims to assess and predict the Quality of Service (QoS) of wireless networks based on K- Nearest Neighbor (k-NN) Algorithm. QoS for the wireless network is mainly dependent on the parameters like packet loss, latency and jitter. In this paper, we have implemented classification of QoS and also ensured the accuracy of our results using regression analysis.KeywordsVertical Handover (VHO)Quality of Service (QoS)Vertical Handover Decision Algorithm (VHDA)K-Nearest Neighbor (k-NN) AlgorithmPacket-lossLatencyJitter

Classwms: A MATLAB GUI for water masses classification using clustering analysis and K Nearest Neighbors

<em><span lang="EN-ID">One aspect of marketing activities is distribution. In the process of distributing goods, it is important to determine the optimal route that minimize mileage and reduce costs. This study aims to provide alternative solutions in determining distribution routes with the shortest distance which has implications for shorter travel times and lower costs. This research adapts the Capacitated Vehicle Routing Problem (CVRP) model with the approach of sweep and Particle Swarm Optimization (PSO) algorithm to determine the route. To generate a comparison route, we use the Nearest Neighbor (NN) algorithm. The result was that 100 agents were divided into 6 clusters and the total distance of the PSO-generated route is 218.115 units or 85.70% of the route distance generated by Nearest Neighbor algorithm</span></em><span lang="EN-ID">.</span>