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

学习型Bloom过滤器中分类器选择的批判性分析

A Critical Analysis of Classifier Selection in Learned Bloom Filters

University of Milan(米兰大学);University of Palermo(巴勒莫大学)

Dario Malchiodi, Davide Raimondi, Giacomo Fumagalli, Raffaele Giancarlo, Marco Frasca

摘要:

学习布隆过滤器,即,通过机器学习技术从数据导出的模型和解决近似集合成员问题,最近已经被引入,目的是增强标准布隆过滤器的性能,特别关注空间占用。与经典情况不同,用于构建过滤器的数据的“复杂性”可能会严重影响其性能。因此,在这里,我们提出了第一个深入的分析,尽我们所知,对于给定的学习布隆过滤器的性能评估,结合给定的分类器,在给定的分类复杂度的数据集上。事实上,我们提出了一种新的方法,支持软件,用于设计,分析和实施学习布隆过滤器的功能,其多标准的性质(即,涉及空间效率,误报率和拒绝时间的限制)的特定约束。我们的实验表明,所提出的方法和支持软件是有效的和有用的:我们发现,只有两个分类器具有理想的属性与不同的数据复杂性的问题,有趣的是,他们都没有被认为是迄今为止在文献中。我们还通过实验表明,三明治变体的学习布隆过滤器是最强大的数据复杂性和分类器性能的变化,以及那些通常具有较小的拒绝时间。该软件可以很容易地用来测试新的学习布隆过滤器的建议,可以与这里确定的最好的比较。

英文摘要:

Learned Bloom Filters, i.e., models induced from data via machine learning techniques and solving the approximate set membership problem, have recently been introduced with the aim of enhancing the performance of standard Bloom Filters, with special focus on space occupancy. Unlike in the classical case, the "complexity" of the data used to build the filter might heavily impact on its performance. Therefore, here we propose the first in-depth analysis, to the best of our knowledge, for the performance assessment of a given Learned Bloom Filter, in conjunction with a given classifier, on a dataset of a given classification complexity. Indeed, we propose a novel methodology, supported by software, for designing, analyzing and implementing Learned Bloom Filters in function of specific constraints on their multi-criteria nature (that is, constraints involving space efficiency, false positive rate, and reject time). Our experiments show that the proposed methodology and the supporting software are valid and useful: we find out that only two classifiers have desirable properties in relation to problems with different data complexity, and, interestingly, none of them has been considered so far in the literature. We also experimentally show that the Sandwiched variant of Learned Bloom filters is the most robust to data complexity and classifier performance variability, as well as those usually having smaller reject times. The software can be readily used to test new Learned Bloom Filter proposals, which can be compared with the best ones identified here.

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

↑