activity and structure of these molecules, we build predictive QSAR models using k-nearest neighbor algorithm. From the best model (R2=0.75, RMSE=0.47) we found that several descriptors have
Relief algorithm greedily attempts to minimize the Bayes error estimated by the k-Nearest-Neighbor (kNN) method. This new interpretation insightfully reveals the secret behind the family of margin-based
common techniques used for machine learning are Support Vector Machine, Artificial Neural Networks, K Nearest Neighbor and Decision Tree. Machine learning techniques are widely used techniques in bioinformatics to solve
using collaborative learning, where the traditional derivative based algorithms like K-means, K-nearest neighbor failed. Present research focus on the development of multi-objective and constrained approaches
fusion of RGB and depth ROIs representation is achieved at matching score level with nearest neighbor classifier. It is observed that among all combinations of feature representations
using incremental model is presented. Compared with the Bayes learning method and the K-nearest neighbor method experimental results verify the effectiveness of the proposed algorithm. Experiments show that
character and each class in training database are computed in distance element, and the nearest neighbor classification is carried out in classification element. Parallel and pipeline acceleration technique are combined
simple and effective classification algorithm, k-Nearest Neighbor (K-NN) algorithm is widely used in many fields. In order to improve the efficiency of classification in Liver Cancer Detection
method produces orthogonal basis functions and can have more locality preserving power than LPP. Nearest neighbor classification using OLPP are used to obtain the error rate
analysis, the Mahalanobis dissimilarity measure was estimated, and the dendrogram was generated using the nearest neighbor method. From the values generated by the dissimilarity matrix and the clusters formed among
defines the intensity of the scaled pixel with the weighted average of the four nearest neighboring pixels, interpolated images become smooth and loss of edge information. The adaptive edge enhancement
Eastern shore of Lake Huron, Ontario province of Canada. Maximum likelihood pixel-based and nearest neighbor object-based methods were used in this approach. Land cover classes that obtained traditional
transfer the information highly effective. we proposed algorithm for Adoptive Parent based algorithm, K-nearest neighbor search algorithm. The effective tree construction form of topology constructed using mobile nodes…
texture image and Gabor image. For candidate selection use high level Adaptive K-Nearest neighbor Classifier. It’s improving the accuracy of candidate selection with the need of low level
features and Machine Learning Classifiers are available, such as Gaussian Naïve Bayes (GNB),k-Nearest Neighbor (kNN), Generalized Linear Models (GLM), Artificial Neural Networks classifiers such as Self Organizing Maps
cloaking algorithm performance and location privacy.A fundamental approach to perform the class of k- Nearest Neighbor (k-NN) queries, the core class of queries used in many of the location
classification algorithmsare compared to choose the best for object classification of image. NN (Nearest Neighbor), k-NN and Minimum Mean Distance (MMD) algorithms were considered for comparison. All the methods
BaSe and CeSe has been predicted using the simple potential model considered third nearest neighbor interaction. The calculated values of B1-B2 phase transition pressure, equation of state (Compression curve
then weights are obtained through solving a linear equation. Particularly, in our proposed model, nearest neighbor clustering algorithm is exploited to choose the centroids of clusters. Finally, experiments are conducted
maximal region is to generate the inherent graph and penalty graph, with the nearest neighbor premise preservation. With inherent picture, the structured nonlinear can be found on the high-dimensioned
criminal datasets in this paper, including C4.5 algorithm, Naive Bayesian algorithm and K nearest neighbor (KNN) algorithm. However, quite a lot of missing data values can result in a seriously
characteristic attribute, calculating the similarity degree between characteristic attribute respectively. Next, using the nearest neighbor method to calculate the similarity degree between cases. Finally, using the…
For authors and organisers
Publish, present and keep up with your field
Find the right journal for your paper and submit your manuscript.