arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2010.00635cs.CVeess.IV
收藏

StreamSoNG:一种软流分类方法

StreamSoNG: A Soft Streaming Classification Approach

Wenlong Wu, James M. Keller, Jeffrey Dale, James C. Bezdek

摘要:

检查大多数流聚类算法会导致理解它们实际上是增量分类模型。他们通过我们称之为足迹的摘要信息来模拟现有和新发现的结构。传入的数据通常被分配一个清晰的标签(到其中一个结构中),并且该结构的足迹被增量更新。没有理由要求这些任务必须干净利落。在本文中,我们提出了一种新的流分类算法,该算法使用神经气体原型作为足迹,并为每个输入向量生成一个可能性标签向量(典型性)。这些典型性是由一个修改的可能性k-近邻算法。该方法在合成和真实图像数据集上进行了测试。我们将我们的方法与其他三种基于自适应随机森林,非常快速的决策规则和DenStream算法的流分类器进行比较,结果非常好。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑