On the Development of Binary Classification Algorithm Based on Principles of Geometry and Statistical Inference

• URL: http://arxiv.org/abs/2503.01703v1
• Date: Mon, 03 Mar 2025 16:16:28 GMT
• Title: On the Development of Binary Classification Algorithm Based on Principles of Geometry and Statistical Inference
• Authors: Vatsal Srivastava,
• Abstract summary: The paper investigates an attempt to build a binary classification algorithm using principles of geometry such as vectors, planes, and vector algebra.<n>Since the algorithm focuses on moving the points through the hyperspace to which the dataset has been mapped, it has been dubbed as moving points algorithm.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The aim of this paper is to investigate an attempt to build a binary classification algorithm using principles of geometry such as vectors, planes, and vector algebra. The basic idea behind the proposed algorithm is that a hyperplane can be used to completely separate a given set of data points mapped to n dimensional space, if the given data points are linearly separable in the n dimensions. Since points are the foundational elements of any geometrical construct, by manipulating the position of points used for the construction of a given hyperplane, the position of the hyperplane itself can be manipulated. The paper includes testing data against other classifiers on a variety of standard machine learning datasets. With a focus on support vector machines, since they and our proposed classifier use the same geometrical construct of hyperplane, and the versatility of SVMs make them a good bench mark for comparison. Since the algorithm focuses on moving the points through the hyperspace to which the dataset has been mapped, it has been dubbed as moving points algorithm.

Related papers

• Direction of Arrival Estimation with Sparse Subarrays [0.0]
  We introduce array architectures that incorporate two distinct array categories, namely type-I and type-II arrays. We devise two Direction of Arrival (DOA) estimation algorithms that are suitable for partially-calibrated array scenarios. The algorithms are capable of estimating a greater number of sources than the number of available physical sensors.
  arXiv  Detail & Related papers  (2024-08-17T23:47:24Z)
• Boundary Detection Algorithm Inspired by Locally Linear Embedding [8.259071011958254]
  We propose a method for detecting boundary points inspired by the widely used locally linear embedding algorithm. We implement this method using two nearest neighborhood search schemes: the $epsilon$-radius ball scheme and the $K$-nearest neighbor scheme.
  arXiv  Detail & Related papers  (2024-06-26T16:05:57Z)
• An example of use of Variational Methods in Quantum Machine Learning [0.0]
  This paper introduces a quantum neural network for the binary classification of points of a specific geometric pattern on a plane. The intention was to produce a quantum deep neural network with the minimum number of trainable parameters capable of correctly recognising and classifying points.
  arXiv  Detail & Related papers  (2022-08-07T03:52:42Z)
• Learning Implicit Feature Alignment Function for Semantic Segmentation [51.36809814890326]
  Implicit Feature Alignment function (IFA) is inspired by the rapidly expanding topic of implicit neural representations. We show that IFA implicitly aligns the feature maps at different levels and is capable of producing segmentation maps in arbitrary resolutions. Our method can be combined with improvement on various architectures, and it achieves state-of-the-art accuracy trade-off on common benchmarks.
  arXiv  Detail & Related papers  (2022-06-17T09:40:14Z)
• Unfolding Projection-free SDP Relaxation of Binary Graph Classifier via GDPA Linearization [59.87663954467815]
  Algorithm unfolding creates an interpretable and parsimonious neural network architecture by implementing each iteration of a model-based algorithm as a neural layer. In this paper, leveraging a recent linear algebraic theorem called Gershgorin disc perfect alignment (GDPA), we unroll a projection-free algorithm for semi-definite programming relaxation (SDR) of a binary graph. Experimental results show that our unrolled network outperformed pure model-based graph classifiers, and achieved comparable performance to pure data-driven networks but using far fewer parameters.
  arXiv  Detail & Related papers  (2021-09-10T07:01:15Z)
• PointFlow: Flowing Semantics Through Points for Aerial Image Segmentation [96.76882806139251]
  We propose a point-wise affinity propagation module based on the Feature Pyramid Network (FPN) framework, named PointFlow. Rather than dense affinity learning, a sparse affinity map is generated upon selected points between the adjacent features. Experimental results on three different aerial segmentation datasets suggest that the proposed method is more effective and efficient than state-of-the-art general semantic segmentation methods.
  arXiv  Detail & Related papers  (2021-03-11T09:42:32Z)
• Determinantal consensus clustering [77.34726150561087]
  We propose the use of determinantal point processes or DPP for the random restart of clustering algorithms. DPPs favor diversity of the center points within subsets. We show through simulations that, contrary to DPP, this technique fails both to ensure diversity, and to obtain a good coverage of all data facets.
  arXiv  Detail & Related papers  (2021-02-07T23:48:24Z)
• Generalized Penalty for Circular Coordinate Representation [4.054792094932801]
  Topological Data Analysis (TDA) provides novel approaches to analyze the geometrical shapes and topological structures of a dataset. We propose a method to adapt the circular coordinate framework to take into account the roughness of circular coordinates in change-point and high-dimensional applications.
  arXiv  Detail & Related papers  (2020-06-03T22:01:10Z)
• Clustering by Constructing Hyper-Planes [0.0]
  We present a clustering algorithm by finding hyper-planes to distinguish data points. It relies on the marginal space between the points to determine centers and numbers of clusters. Because the algorithm is based on linear structures, it can approximate the distribution of datasets accurately and flexibly.
  arXiv  Detail & Related papers  (2020-04-25T08:52:21Z)
• Unsupervised Learning of Category-Specific Symmetric 3D Keypoints from Point Sets [71.84892018102465]
  This paper aims at learning category-specific 3D keypoints, in an unsupervised manner, using a collection of misaligned 3D point clouds of objects from an unknown category. To the best of our knowledge, this is the first work on learning such keypoints directly from 3D point clouds.
  arXiv  Detail & Related papers  (2020-03-17T10:28:02Z)
• PUGeo-Net: A Geometry-centric Network for 3D Point Cloud Upsampling [103.09504572409449]
  We propose a novel deep neural network based method, called PUGeo-Net, to generate uniform dense point clouds. Thanks to its geometry-centric nature, PUGeo-Net works well for both CAD models with sharp features and scanned models with rich geometric details.
  arXiv  Detail & Related papers  (2020-02-24T14:13:29Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.