arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1805.02874cs.AIcs.DSstat.ML
收藏

在连续数据中发现频繁实体

Finding Frequent Entities in Continuous Data

MIT Computer Science and Artificial Intelligence Laboratory(麻省理工学院计算机科学与人工智能实验室)

Ferran Alet, Rohan Chitnis, Leslie P. Kaelbling, Tomas Lozano-Perez

摘要:

在涉及处理高维数据的许多应用中,重要的是识别占检测的很大一部分的一小组实体。而不是形式化这作为一个聚类问题,其中所有的检测必须分组到硬或软类别,我们将其形式化为一个实例的频繁项目或重打击者的问题,发现组的紧密聚集的对象,具有高密度的特征空间。我们表明,沉重的打击制定产生的解决方案,更准确和有效的聚类制定。此外,我们提出了一种新的在线算法,称为HAC,它解决了连续空间中的问题,并证明了其在真实视频和家庭领域的有效性。

英文摘要:

In many applications that involve processing high-dimensional data, it is important to identify a small set of entities that account for a significant fraction of detections. Rather than formalize this as a clustering problem, in which all detections must be grouped into hard or soft categories, we formalize it as an instance of the frequent items or heavy hitters problem, which finds groups of tightly clustered objects that have a high density in the feature space. We show that the heavy hitters formulation generates solutions that are more accurate and effective than the clustering formulation. In addition, we present a novel online algorithm for heavy hitters, called HAC, which addresses problems in continuous space, and demonstrate its effectiveness on real video and household domains.

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

↑