StreamSoNG: A Soft Streaming Classification Approach

by   Wenlong Wu, et al.

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 crisp labels (into one of the structures) and that structure's footprints are 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 (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 with excellent results.


page 7

page 8


Separating Adaptive Streaming from Oblivious Streaming

We present a streaming problem for which every adversarially-robust stre...

Improved Algorithms for Edge Colouring in the W-Streaming Model

In the W-streaming model, an algorithm is given O(n polylog n) space and...

A Streaming Algorithm for Crowdsourced Data Classification

We propose a streaming algorithm for the binary classification of data b...

Online Clustering by Penalized Weighted GMM

With the dawn of the Big Data era, data sets are growing rapidly. Data i...

Streaming Classification of Variable Stars

In the last years, automatic classification of variable stars has receiv...

Lifelong Machine Learning with Deep Streaming Linear Discriminant Analysis

When a robot acquires new information, ideally it would immediately be c...

Analysis of Kelner and Levin graph sparsification algorithm for a streaming setting

We derive a new proof to show that the incremental resparsification algo...

Please sign up or login with your details

Forgot password? Click here to reset