Academia.eduAcademia.edu

Outline

Title
Abstract
Introduction
Related Work
Experiment and Result
Data-Sets
Experimental Setup
Conclusion and Future Work
References
All Topics
Computer Science
Artificial Intelligence

SDSV: Angle Measurement for Supervised Classification

Profile image of Engr. Md. Imran HossenEngr. Md. Imran Hossen

Procedia Computer Science

https://doi.org/10.1016/J.PROCS.2021.05.085
visibility

…

description

8 pages

link

1 file

Abstract

Data classification is one of the most fundamental tasks that can be accomplished by supervised machine learning. There exists a lot of algorithms, and they have the specific case of uses. Different classification methods follow different techniques to map the relationship between input and output. This article proposes an angle measurement-based classification technique called Support Directional Shifting Vectors (SDSV) to segment a spectral domain into regions with a very effective solution for classification problems. This method introduces two shifting vectors, named Support Direction Vector (SDV) and Support Origin Vector (SOV). These vectors are formed as a linear function to measure cosine-angle by the dot product of two separated data classes, named target data points and non-target data points. Considering the target class samples, the vectors get aligned in a way that the angle with the target class gets minimized, while the angle with the non-target class gets maximized. The error in the position of the linear function has been modeled as the loss function. Then, the vector position is updated iteratively by optimizing this loss function using a gradient descent algorithm. We have used this model to classify data from two different machine learning datasets to evaluate the performance of the proposed method. Finally, we have carefully examined the results and compared them with the other standard classification algorithms. In summary, the proposed SDSV algorithm has shown a comparable accuracy compared to different standard algorithms.

Related papers

Support Vector Classifier via Mathematica
Lajos Volgyesi

In this case study a Support Vector Classifier function has been developed in Mathematica. Starting with a brief summary of support vector classification method, the step by step implementation of the classification algorithm in Mathematica is presented and explained. To check our function, two test problems, learning a chess board and classification of two intertwined spirals are solved. In addition an application to filtering of airborne digital land image by pixel classification is demonstrated using a new SVM kernel family, the KMOD, a kernel with moderate decreasing.

View PDFchevron_right
Support Vector Machines
Alessia Mammone

2009

Support vector machines (SVMs) are a family of machine learning methods, originally introduced for the problem of classification and later generalized to various other situations. They are based on principles of statistical learning theory and convex optimization, and are currently used in various domains of application, including bioinformatics, text categorization, and computer vision.  2009 John Wiley & Sons, Inc. WIREs Comp Stat 2009 1 283-289 S upport vector machines (SVMs), introduced by

View PDFchevron_right

References (19)

  1. Md. Kowsher et al / Procedia Computer Science 00 (2019) 000-000
  2. FISHER RA. THE USE OF MULTIPLE MEASUREMENTS IN TAXONOMIC PROBLEMS. Ann Eugen 1936;7:179-88. https://doi.org/10.1111/j.1469- 1809.1936.tb02137.x.
  3. White BW, Rosenblatt F. Principles of Neurodynamics: Perceptrons and the Theory of Brain Mechanisms. vol. 76. Cornell Aeronautical Lab Inc Buffalo NY; 1963. https://doi.org/10.2307/1419730.
  4. Cortes C, Vapnik V, Saitta L. Support-Vector Networks Editor. vol. 20. Kluwer Academic Publishers; 1995.
  5. Kowsher, Md, Anik Tahabilder, and Saydul Akbar Murad. "Impact-learning: a robust machine learning algorithm." Proceedings of the 8th International Conference on Computer and Communications Management. 2020.
  6. Quinlan JR. Induction of Decision Trees. Mach Learn 1986;1:81-106. https://doi.org/10.1023/A:1022643204877.
  7. Breiman L. Random forests. Mach Learn 2001;45:5-32. https://doi.org/10.1023/A:1010933404324.
  8. Freund Y, Schapire RE. A decision-theoretic generalization of on-line learning and an application to boosting. Lect. Notes Comput. Sci. (including Subser. Lect. Notes Artif. Intell. Lect. Notes Bioinformatics), vol. 904, 1995, p. 23-37.
  9. Cunningham P, Delany SJ. k-Nearest neighbour classifiers 2nd edition (with python examples). ArXiv 2020.
  10. Liu H, Zhang S, Zhao J, Zhao X, Mo Y. A new classification algorithm using mutual nearest neighbors. Proc. -9th Int. Conf. Grid Cloud Comput. GCC 2010, 2010, p. 52-7. https://doi.org/10.1109/GCC.2010.23.
  11. Pernes D, Fernandes K, Cardoso JS. Directional Support Vector Machines. MdpiCom 2019. https://doi.org/10.3390/app9040725.
  12. López-Cruz PL, Bielza C, Larrañaga P. Directional naive Bayes classifiers. Pattern Anal Appl 2015;18:225-46.
  13. Friedman, N., Geiger, D. & Goldszmidt, M. Bayesian Network Classifiers. Machine Learning 29, 131-163 (1997).
  14. David M. Blei, Andrew Y. Ng, and Michael I. Jordan. 2003. Latent dirichlet allocation. J. Mach. Learn. Res.3, null (3/1/2003), 993-1022.
  15. Cabrera Casado Y, Siles Molina M, Velasco MV. Classification of three-dimensional evolution algebras. Linear Algebra Appl 2017;524:68-108. https://doi.org/10.1016/j.laa.2017.02.015.
  16. Kowsher, Md, Md Uddin, Mir Md Moheuddin, and Mahbuba Yesmin Turaba. "Two New Regression and Curve Fitting Techniques Using Numerical Methods." Algorithms for Intelligent Systems, Springer (2020).
  17. Aggarwal C. Linear Algebra and Optimization for Machine Learning. 2020.
  18. Kowsher, Md, Md Zahidul Islam Sanjid, Avishek Das, Mahid Ahmed, and Md Murad Hossain Sarker. "Machine Learning and Deep Learning based Information Extraction from Bangla Names." Procedia Computer Science 178 (2020): 224-233.
  19. Kowsher, Md, Anik Tahabilder, Nusrat Jahan Prottasha, Md. Abdur-Rakib, Md. Moyez Uddin, and Puspita Saha. "Bangla Topic Classification Using Supervised Learning". Computational Intelligence in Pattern Recognition. Springer, Singapore, 2021 (In press)

Related papers

Support Directional Shifting Vector: A Direction Based Machine Learning Classifier
Md. Kowsher, Anik Tahabilder

Emerging Science Journal

Machine learning models have been very popular nowadays for providing rigorous solutions to complicated real-life problems. There are three main domains named supervised, unsupervised, and reinforcement. Supervised learning mainly deals with regression and classification. There exist several types of classification algorithms, and these are based on various bases. The classification performance varies based on the dataset velocity and the algorithm selection. In this article, we have focused on developing a model of angular nature that performs supervised classification. Here, we have used two shifting vectors named Support Direction Vector (SDV) and Support Origin Vector (SOV) to form a linear function. These vectors form a linear function to measure cosine-angle with both the target class data and the non-target class data. Considering target data points, the linear function takes such a position that minimizes its angle with target class data and maximizes its angle with non-targ...

View PDFchevron_right
Angle-based twin parametric-margin support vector machine for pattern classification
Pooja Saigal

Knowledge-Based Systems, 2018

In this paper, a novel angle-based twin parametric-margin support vector machine (ATP-SVM) is proposed, which can efficiently handle heteroscedastic noise. Taking motivation from twin parametric-margin support vector machine (TPMSVM), ATP-SVM determines two nonparallel parametric-margin hyperplanes, such that the angle between their normal is maximized. Unlike TPMSVM, it solves only one modified quadratic programming problem (QPP) with fewer number of representative samples. Further, it avoids the explicit computation of inverse of matrices in the dual and has efficient learning time as compared to other single problem classifiers like nonparallel SVM based on one optimization problem (NSVMOOP). The efficacy of ATP-SVM is tested by conducting experiments on a wide range of benchmark UCI datasets. ATP-SVM is extended for multi-category classification using state-of-the-art one-against-all (OAA) and binary tree (BT) based multi-category classification approaches. This work also proposes the application of ATP-SVM for segmentation of color images.

View PDFchevron_right
A new trigonometric kernel function for support vector machine
Sajad Fathi-Hafshejani

Cornell University - arXiv, 2022

In the last few years, various types of machine learning algorithms, such as Support Vector Machine (SVM), Support Vector Regression (SVR), and Non-negative Matrix Factorization (NMF) have been introduced. The kernel approach is an effective method for increasing the classification accuracy of machine learning algorithms. This paper introduces a family of one-parameter kernel functions for improving the accuracy of SVM classification. The proposed kernel function consists of a trigonometric term and differs from all existing kernel functions. We show this function is a positive definite kernel function. Finally, we evaluate the SVM method based on the new trigonometric kernel, the Gaussian kernel, the polynomial kernel, and a convex combination of the new kernel function and the Gaussian kernel function on various types of datasets. Empirical results show that the SVM based on the new trigonometric kernel function and the mixed kernel function achieve the best classification accuracy. Moreover, some numerical results of performing the SVR based on the new trigonometric kernel function and the mixed kernel function are presented.

View PDFchevron_right
A practical guide to support vector classification
Chao Chang

Journal of Intelligent and Fuzzy Systems, 2002

The support vector machine (SVM) is a popular classification technique. However, beginners who are not familiar with SVM often get unsatisfactory results since they miss some easy but significant steps. In this guide, we propose a simple procedure which usually gives reasonable results. ξ i ≥ 0.

View PDFchevron_right
A Geometric Approach to Support Vector Machine (SVM) Classification
Sergios Theodoridis

IEEE Transactions on Neural Networks, 2006

The geometric framework for the support vector machine (SVM) classification problem provides an intuitive ground for the understanding and the application of geometric optimization algorithms, leading to practical solutions of real world classification problems. In this work, the notion of "reduced convex hull" is employed and supported by a set of new theoretical results. These results allow existing geometric algorithms to be directly and practically applied to solve not only separable, but also nonseparable classification problems both accurately and efficiently. As a practical application of the new theoretical results, a known geometric algorithm has been employed and transformed accordingly to solve nonseparable problems successfully.

View PDFchevron_right

Related topics

  • Computer Science
  • Artificial Intelligence
  • Technology
  • Dot Product
  • Trigonometric Functions
    • 580 California St., Suite 400
    San Francisco, CA, 94104
    © 2025 Academia. All rights reserved