StreamSoNG: A Soft Streaming Classification Approach

• URL: http://arxiv.org/abs/2010.00635v2
• Date: Tue, 13 Jul 2021 16:52:18 GMT
• Title: StreamSoNG: A Soft Streaming Classification Approach
• Authors: Wenlong Wu, James M. Keller, Jeffrey Dale, James C. Bezdek
• Abstract summary: We propose a new streaming classification algorithm that uses Neural Gas prototypes as footprints. The approach is tested on synthetic and real image datasets. We compare our approach to three other streaming classifiers based on the Adaptive Random Forest, Very Fast Decision Rules, and the DenStream algorithm with excellent results.
• Score: 7.70734146948411
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Examining most streaming clustering algorithms leads to the understanding that they are actually incremental classification models. They model existing and newly discovered structures via summary information that we call footprints. Incoming data is normally assigned a crisp label (into one of the structures) and that structure's footprint is incrementally updated. There is no reason that these assignments need to be crisp. In this paper, we propose a new streaming classification algorithm that uses Neural Gas prototypes as footprints and produces a possibilistic label vector (of typicalities) for each incoming vector. These typicalities are generated by a modified possibilistic k-nearest neighbor algorithm. The approach is tested on synthetic and real image datasets. We compare our approach to three other streaming classifiers based on the Adaptive Random Forest, Very Fast Decision Rules, and the DenStream algorithm with excellent results.

Related papers

• Dynamic Perceiver for Efficient Visual Recognition [87.08210214417309]
  We propose Dynamic Perceiver (Dyn-Perceiver) to decouple the feature extraction procedure and the early classification task. A feature branch serves to extract image features, while a classification branch processes a latent code assigned for classification tasks. Early exits are placed exclusively within the classification branch, thus eliminating the need for linear separability in low-level features.
  arXiv  Detail & Related papers  (2023-06-20T03:00:22Z)
• Real-time AdaBoost cascade face tracker based on likelihood map and optical flow [59.17685450892182]
  The authors present a novel face tracking approach where optical flow information is incorporated into a modified version of the Viola Jones detection algorithm. In the original algorithm, detection is static, as information from previous frames is not considered. The proposed tracker preserves information about the number of classification stages passed by each window.
  arXiv  Detail & Related papers  (2022-10-25T10:15:07Z)
• Autoregressive Search Engines: Generating Substrings as Document Identifiers [53.0729058170278]
  Autoregressive language models are emerging as the de-facto standard for generating answers. Previous work has explored ways to partition the search space into hierarchical structures. In this work we propose an alternative that doesn't force any structure in the search space: using all ngrams in a passage as its possible identifiers.
  arXiv  Detail & Related papers  (2022-04-22T10:45:01Z)
• DeDUCE: Generating Counterfactual Explanations Efficiently [26.300599540027893]
  We develop a new algorithm providing counterfactual explanations for large image classifiers trained with spectral normalisation at low computational cost. We empirically compare this algorithm against baselines from the literature; our novel algorithm consistently finds counterfactuals that are much closer to the original inputs.
  arXiv  Detail & Related papers  (2021-11-29T17:47:21Z)
• Neural Network Modeling of Probabilities for Coding the Octree Representation of Point Clouds [0.0]
  This paper describes a novel point cloud compression algorithm that uses a neural network for estimating the coding probabilities for the occupancy status of voxels. The proposed algorithms yield state-of-the-art results on benchmark datasets.
  arXiv  Detail & Related papers  (2021-06-11T16:07:46Z)
• Streaming Belief Propagation for Community Detection [16.89299967467454]
  In real-world applications, the network structure is typically dynamic, with nodes that join over time. We introduce a simple model for networks growing over time which we refer to as streaming block model (StSBM) Within this model, we prove that voting algorithms have fundamental limitations. We also develop a streaming-propagation (StreamBP) approach, for which we prove optimality in certain regimes.
  arXiv  Detail & Related papers  (2021-06-09T04:36:09Z)
• Traffic Scenario Clustering by Iterative Optimisation of Self-Supervised Networks Using a Random Forest Activation Pattern Similarity [0.9711326718689492]
  This work introduces a clustering technique based on a novel data-adaptive similarity measure, called Random Forest Activation Pattern (RFAP) similarity. The RFAP similarity is generated using a tree encoding scheme in a Random Forest algorithm. The clustering method proposed in this work takes into account that there are labelled scenarios available and the information from the labelled scenarios can help to guide the clustering of unlabelled scenarios.
  arXiv  Detail & Related papers  (2021-05-17T06:54:59Z)
• Predictive K-means with local models [0.028675177318965035]
  Predictive clustering seeks to obtain the best of the two worlds. We present two new algorithms using this technique and show on a variety of data sets that they are competitive for prediction performance.
  arXiv  Detail & Related papers  (2020-12-16T10:49:36Z)
• Searching towards Class-Aware Generators for Conditional Generative Adversarial Networks [132.29772160843825]
  Conditional Generative Adversarial Networks (cGAN) were designed to generate images based on the provided conditions. Existing methods have used the same generating architecture for all classes. This paper presents a novel idea that adopts NAS to find a distinct architecture for each class.
  arXiv  Detail & Related papers  (2020-06-25T07:05:28Z)
• Heuristic Semi-Supervised Learning for Graph Generation Inspired by Electoral College [80.67842220664231]
  We propose a novel pre-processing technique, namely ELectoral COllege (ELCO), which automatically expands new nodes and edges to refine the label similarity within a dense subgraph. In all setups tested, our method boosts the average score of base models by a large margin of 4.7 points, as well as consistently outperforms the state-of-the-art.
  arXiv  Detail & Related papers  (2020-06-10T14:48:48Z)
• Ensemble Wrapper Subsampling for Deep Modulation Classification [70.91089216571035]
  Subsampling of received wireless signals is important for relaxing hardware requirements as well as the computational cost of signal processing algorithms. We propose a subsampling technique to facilitate the use of deep learning for automatic modulation classification in wireless communication systems.
  arXiv  Detail & Related papers  (2020-05-10T06:11:13Z)

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.