arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2104.03952cs.CVcs.CLcs.LG
收藏

按K个主要概念进行的数据集汇总

Dataset Summarization by K Principal Concepts

The Hebrew University of Jerusalem(耶路撒冷希伯来大学)

Niv Cohen, Yedid Hoshen

摘要:

提出了K主概念识别的新任务。目标是找到一组K个概念,最好地解释数据集内的变化。概念是人类可解释的高级术语,如“老虎”,“皮划艇”或“快乐”。K个概念是从一个(可能很长的)候选输入列表中选择的,我们将其表示为概念库。概念库可以从通用词典中获取,也可以由特定任务的先验知识构建。使用图像语言嵌入方法(例如CLIP)将图像和概念库映射到共享特征空间中。为了选择最能解释数据的K个概念,我们将我们的问题表述为K-无容量限制的设施选址问题。一个有效的优化技术被用来扩展本地搜索算法非常大的概念银行。我们的方法的输出是一组K个主要概念,总结了数据集。我们的方法提供了一个更明确的总结相比,选择K代表性的图像,这往往是模糊的。作为我们方法的进一步应用,K个主要概念可以用于将数据集分类为K个组。大量的实验证明了我们的方法的有效性。

英文摘要:

We propose the new task of K principal concept identification for dataset summarizarion. The objective is to find a set of K concepts that best explain the variation within the dataset. Concepts are high-level human interpretable terms such as "tiger", "kayaking" or "happy". The K concepts are selected from a (potentially long) input list of candidates, which we denote the concept-bank. The concept-bank may be taken from a generic dictionary or constructed by task-specific prior knowledge. An image-language embedding method (e.g. CLIP) is used to map the images and the concept-bank into a shared feature space. To select the K concepts that best explain the data, we formulate our problem as a K-uncapacitated facility location problem. An efficient optimization technique is used to scale the local search algorithm to very large concept-banks. The output of our method is a set of K principal concepts that summarize the dataset. Our approach provides a more explicit summary in comparison to selecting K representative images, which are often ambiguous. As a further application of our method, the K principal concepts can be used to classify the dataset into K groups. Extensive experiments demonstrate the efficacy of our approach.

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

↑