scholarly journals Information Analysis on Neural Tuning in Dorsal Premotor Cortex for Reaching and Grasping

2013 ◽  
Vol 2013 ◽  
pp. 1-9 ◽  
Author(s):  
Yan Cao ◽  
Yaoyao Hao ◽  
Yuxi Liao ◽  
Kai Xu ◽  
Yiwen Wang ◽  
...  
Keyword(s):  
Support Vector Machine ◽  
Premotor Cortex ◽  
Support Vector ◽  
Information Analysis ◽  
Dorsal Premotor Cortex ◽  
Two Factors ◽  
Neuron Ensemble ◽  
Decoding Accuracy ◽  
Specific Contribution ◽  
Tuning Property

Previous studies have shown that the dorsal premotor cortex (PMd) neurons are relevant to reaching as well as grasping. In order to investigate their specific contribution to reaching and grasping, respectively, we design two experimental paradigms to separate these two factors. Two monkeys are instructed to reach in four directions but grasp the same object and grasp four different objects but reach in the same direction. Activities of the neuron ensemble in PMd of the two monkeys are collected while performing the tasks. Mutual information (MI) is carried out to quantitatively evaluate the neurons’ tuning property in both tasks. We find that there exist neurons in PMd that are tuned only to reaching, tuned only to grasping, and tuned to both tasks. When applied with a support vector machine (SVM), the movement decoding accuracy by the tuned neuron subset in either task is quite close to the performance by full ensemble. Furthermore, the decoding performance improves significantly by adding the neurons tuned to both tasks into the neurons tuned to one property only. These results quantitatively distinguish the diversity of the neurons tuned to reaching and grasping in the PMd area and verify their corresponding contributions to BMI decoding.

scholarly journals WR-SVM Model Based on the Margin Radius Approach for Solving the Minimum Enclosing Ball Problem in Support Vector Machine Classification

2021 ◽  
Vol 11 (10) ◽  
pp. 4657
Author(s):  
Atif Rizwan ◽  
Naeem Iqbal ◽  
Rashid Ahmad ◽  
Do-Hyeun Kim
Keyword(s):  
Support Vector Machine ◽  
Computational Cost ◽  
Experimental Results ◽  
Support Vector ◽  
Svm Classifier ◽  
Limited Area ◽  
Robust Solution ◽  
Two Factors ◽  
Benchmark Datasets ◽  
Minimum Enclosing Ball

The generalization error of conventional support vector machine (SVM) depends on the ratio of two factors; radius and margin. The traditional SVM aims to maximize margin but ignore minimization of radius, which decreases the overall performance of the SVM classifier. However, different approaches are developed to achieve a trade-off between the margin and radius. Still, the computational cost of all these approaches is high due to the requirements of matrix transformation. Furthermore, a conventional SVM tries to set the best hyperplane between classes, and due to some robust kernel tricks, an SVM is used in many non-linear and complex problems. The configuration of the best hyperplane between classes is not effective; therefore, it is required to bind a class within its limited area to enhance the performance of the SVM classifier. The area enclosed by a class is called its Minimum Enclosing Ball (MEB), and it is one of the emerging problems of SVM. Therefore, a robust solution is needed to improve the performance of the conventional SVM to overcome the highlighted issues. In this research study, a novel weighted radius SVM (WR-SVM) is proposed to determine the tighter bounds of MEB. The proposed solution uses a weighted mean to find tighter bounds of radius, due to which the size of MEB decreases. Experiments are conducted on nine different benchmark datasets and one synthetic dataset to demonstrate the effectiveness of our proposed model. The experimental results reveal that the proposed WR-SVM significantly performed well compared to the conventional SVM classifier. Furthermore, experimental results are compared with F-SVM and traditional SVM in terms of classification accuracy to demonstrate the significance of the proposed WR-SVM.

Support vector machine? – not only for MRI-images

2020 ◽  
Author(s):  
V Vasilevska ◽  
K Schlaaf ◽  
H Dobrowolny ◽  
G Meyer-Lotz ◽  
HG Bernstein ◽  
...  
Keyword(s):  
Support Vector Machine ◽  
Support Vector

KLASIFIKASI SMS SPAM MENGGUNAKAN SUPPORT VECTOR MACHINE

2019 ◽  
Vol 15 (2) ◽  
pp. 275-280
Author(s):  
Agus Setiyono ◽  
Hilman F Pardede
Keyword(s):  
Data Mining ◽  
Support Vector Machine ◽  
Decision Tree ◽  
Naive Bayes ◽  
Naïve Bayes ◽  
Support Vector ◽  
Spam Detection ◽  
Support Vector Machine Algorithm ◽  
Data Mining Techniques ◽  
To Receive

It is now common for a cellphone to receive spam messages. Great number of received messages making it difficult for human to classify those messages to Spam or no Spam.  One way to overcome this problem is to use Data Mining for automatic classifications. In this paper, we investigate various data mining techniques, named Support Vector Machine, Multinomial Naïve Bayes and Decision Tree for automatic spam detection. Our experimental results show that Support Vector Machine algorithm is the best algorithm over three evaluated algorithms. Support Vector Machine achieves 98.33%, while Multinomial Naïve Bayes achieves 98.13% and Decision Tree is at 97.10 % accuracy.

Classification of Fatigued Bills Based on a Support Vector Machine by Using the Amplitude Difference Features of Acoustic Signals

2011 ◽  
Vol 131 (8) ◽  
pp. 1495-1501
Author(s):  
Dongshik Kang ◽  
Masaki Higa ◽  
Hayao Miyagi ◽  
Ikugo Mitsui ◽  
Masanobu Fujita ◽  
...  
Keyword(s):  
Support Vector Machine ◽  
Acoustic Signals ◽  
Support Vector ◽  
Amplitude Difference

An Accurate Packer Identification Method Using Support Vector Machine

2014 ◽  
Vol E97.A (1) ◽  
pp. 253-263 ◽  
Author(s):  
Ryoichi ISAWA ◽  
Tao BAN ◽  
Shanqing GUO ◽  
Daisuke INOUE ◽  
Koji NAKAO
Keyword(s):  
Support Vector Machine ◽  
Support Vector ◽  
Identification Method

Analysis of Feature Reduction Techniques for Online News Popularity Prediction

2018 ◽  
Vol 4 (10) ◽  
pp. 6
Author(s):  
Shivangi Bhargava ◽  
Dr. Shivnath Ghosh
Keyword(s):  
Neural Network ◽  
Support Vector Machine ◽  
Particle Swarm Optimization ◽  
Naive Bayes ◽  
Particle Swarm ◽  
Naïve Bayes ◽  
Online News ◽  
Feature Reduction ◽  
Support Vector ◽  
Swarm Optimization

News popularity is the maximum growth of attention given for particular news article. The popularity of online news depends on various factors such as the number of social media, the number of visitor comments, the number of Likes, etc. It is therefore necessary to build an automatic decision support system to predict the popularity of the news as it will help in business intelligence too. The work presented in this study aims to find the best model to predict the popularity of online news using machine learning methods. In this work, the result analysis is performed by applying Co-relation algorithm, particle swarm optimization and principal component analysis. For performance evaluation support vector machine, naïve bayes, k-nearest neighbor and neural network classifiers are used to classify the popular and unpopular data. From the experimental results, it is observed that support vector machine and naïve bayes outperforms better with co-relation algorithm as well as k-NN and neural network outperforms better with particle swarm optimization.

Sign in / Sign up

Export Citation Format

Share Document