Dataset Summarization by K Principal Concepts
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&q...
Gespeichert in:
Hauptverfasser: | , |
---|---|
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | |
---|---|
container_issue | |
container_start_page | |
container_title | |
container_volume | |
creator | Cohen, Niv Hoshen, Yedid |
description | 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. |
doi_str_mv | 10.48550/arxiv.2104.03952 |
format | Article |
fullrecord | <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_2104_03952</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2104_03952</sourcerecordid><originalsourceid>FETCH-LOGICAL-a672-fb4bb30944cd32f29175d4219716415d6d55a1f3658e76c0b26fd75e5fcb87d63</originalsourceid><addsrcrecordid>eNotzstKw0AUgOHZuCi1D9CV8wKJczszyVKibcVABbsPZ24wkKQhiWL79L3o6t_9fISsOctVAcCecfxNP7ngTOVMliAWJHvFGacw06_vrsMxnXFOx57aE_2gn2PqXRqwpdWxd2GYp0fyELGdwuq_S3LYvB2qXVbvt-_VS52hNiKLVlkrWamU81JEUXIDXgleGq4VB689APIoNRTBaMes0NEbCBCdLYzXckme_rZ3bzOM6Uo7NTd3c3fLCxarPDc</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Dataset Summarization by K Principal Concepts</title><source>arXiv.org</source><creator>Cohen, Niv ; Hoshen, Yedid</creator><creatorcontrib>Cohen, Niv ; Hoshen, Yedid</creatorcontrib><description>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.</description><identifier>DOI: 10.48550/arxiv.2104.03952</identifier><language>eng</language><subject>Computer Science - Computation and Language ; Computer Science - Computer Vision and Pattern Recognition ; Computer Science - Learning</subject><creationdate>2021-04</creationdate><rights>http://arxiv.org/licenses/nonexclusive-distrib/1.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,776,881</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/2104.03952$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.2104.03952$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Cohen, Niv</creatorcontrib><creatorcontrib>Hoshen, Yedid</creatorcontrib><title>Dataset Summarization by K Principal Concepts</title><description>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.</description><subject>Computer Science - Computation and Language</subject><subject>Computer Science - Computer Vision and Pattern Recognition</subject><subject>Computer Science - Learning</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2021</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotzstKw0AUgOHZuCi1D9CV8wKJczszyVKibcVABbsPZ24wkKQhiWL79L3o6t_9fISsOctVAcCecfxNP7ngTOVMliAWJHvFGacw06_vrsMxnXFOx57aE_2gn2PqXRqwpdWxd2GYp0fyELGdwuq_S3LYvB2qXVbvt-_VS52hNiKLVlkrWamU81JEUXIDXgleGq4VB689APIoNRTBaMes0NEbCBCdLYzXckme_rZ3bzOM6Uo7NTd3c3fLCxarPDc</recordid><startdate>20210408</startdate><enddate>20210408</enddate><creator>Cohen, Niv</creator><creator>Hoshen, Yedid</creator><scope>AKY</scope><scope>GOX</scope></search><sort><creationdate>20210408</creationdate><title>Dataset Summarization by K Principal Concepts</title><author>Cohen, Niv ; Hoshen, Yedid</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a672-fb4bb30944cd32f29175d4219716415d6d55a1f3658e76c0b26fd75e5fcb87d63</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2021</creationdate><topic>Computer Science - Computation and Language</topic><topic>Computer Science - Computer Vision and Pattern Recognition</topic><topic>Computer Science - Learning</topic><toplevel>online_resources</toplevel><creatorcontrib>Cohen, Niv</creatorcontrib><creatorcontrib>Hoshen, Yedid</creatorcontrib><collection>arXiv Computer Science</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Cohen, Niv</au><au>Hoshen, Yedid</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Dataset Summarization by K Principal Concepts</atitle><date>2021-04-08</date><risdate>2021</risdate><abstract>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.</abstract><doi>10.48550/arxiv.2104.03952</doi><oa>free_for_read</oa></addata></record> |
fulltext | fulltext_linktorsrc |
identifier | DOI: 10.48550/arxiv.2104.03952 |
ispartof | |
issn | |
language | eng |
recordid | cdi_arxiv_primary_2104_03952 |
source | arXiv.org |
subjects | Computer Science - Computation and Language Computer Science - Computer Vision and Pattern Recognition Computer Science - Learning |
title | Dataset Summarization by K Principal Concepts |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-29T07%3A30%3A00IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Dataset%20Summarization%20by%20K%20Principal%20Concepts&rft.au=Cohen,%20Niv&rft.date=2021-04-08&rft_id=info:doi/10.48550/arxiv.2104.03952&rft_dat=%3Carxiv_GOX%3E2104_03952%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |