<?xml version="1.0" encoding="UTF-8"?>
<modsCollection xmlns="http://www.loc.gov/mods/v3">
<mods ID="tixier-etal-2017-combining">
    <titleInfo>
        <title>Combining Graph Degeneracy and Submodularity for Unsupervised Extractive Summarization</title>
    </titleInfo>
    <name type="personal">
        <namePart type="given">Antoine</namePart>
        <namePart type="family">Tixier</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <name type="personal">
        <namePart type="given">Polykarpos</namePart>
        <namePart type="family">Meladianos</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <name type="personal">
        <namePart type="given">Michalis</namePart>
        <namePart type="family">Vazirgiannis</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <originInfo>
        <dateIssued>2017-09</dateIssued>
    </originInfo>
    <typeOfResource>text</typeOfResource>
    <relatedItem type="host">
        <titleInfo>
            <title>Proceedings of the Workshop on New Frontiers in Summarization</title>
        </titleInfo>
        <name type="personal">
            <namePart type="given">Lu</namePart>
            <namePart type="family">Wang</namePart>
            <role>
                <roleTerm authority="marcrelator" type="text">editor</roleTerm>
            </role>
        </name>
        <name type="personal">
            <namePart type="given">Jackie</namePart>
            <namePart type="given">Chi</namePart>
            <namePart type="given">Kit</namePart>
            <namePart type="family">Cheung</namePart>
            <role>
                <roleTerm authority="marcrelator" type="text">editor</roleTerm>
            </role>
        </name>
        <name type="personal">
            <namePart type="given">Giuseppe</namePart>
            <namePart type="family">Carenini</namePart>
            <role>
                <roleTerm authority="marcrelator" type="text">editor</roleTerm>
            </role>
        </name>
        <name type="personal">
            <namePart type="given">Fei</namePart>
            <namePart type="family">Liu</namePart>
            <role>
                <roleTerm authority="marcrelator" type="text">editor</roleTerm>
            </role>
        </name>
        <originInfo>
            <publisher>Association for Computational Linguistics</publisher>
            <place>
                <placeTerm type="text">Copenhagen, Denmark</placeTerm>
            </place>
        </originInfo>
        <genre authority="marcgt">conference publication</genre>
    </relatedItem>
    <abstract>We present a fully unsupervised, extractive text summarization system that leverages a submodularity framework introduced by past research. The framework allows summaries to be generated in a greedy way while preserving near-optimal performance guarantees. Our main contribution is the novel coverage reward term of the objective function optimized by the greedy algorithm. This component builds on the graph-of-words representation of text and the k-core decomposition algorithm to assign meaningful scores to words. We evaluate our approach on the AMI and ICSI meeting speech corpora, and on the DUC2001 news corpus. We reach state-of-the-art performance on all datasets. Results indicate that our method is particularly well-suited to the meeting domain.</abstract>
    <identifier type="citekey">tixier-etal-2017-combining</identifier>
    <identifier type="doi">10.18653/v1/W17-4507</identifier>
    <location>
        <url>https://aclanthology.org/W17-4507</url>
    </location>
    <part>
        <date>2017-09</date>
        <extent unit="page">
            <start>48</start>
            <end>58</end>
        </extent>
    </part>
</mods>
</modsCollection>

%0 Conference Proceedings
%T Combining Graph Degeneracy and Submodularity for Unsupervised Extractive Summarization
%A Tixier, Antoine
%A Meladianos, Polykarpos
%A Vazirgiannis, Michalis
%Y Wang, Lu
%Y Cheung, Jackie Chi Kit
%Y Carenini, Giuseppe
%Y Liu, Fei
%S Proceedings of the Workshop on New Frontiers in Summarization
%D 2017
%8 September
%I Association for Computational Linguistics
%C Copenhagen, Denmark
%F tixier-etal-2017-combining
%X We present a fully unsupervised, extractive text summarization system that leverages a submodularity framework introduced by past research. The framework allows summaries to be generated in a greedy way while preserving near-optimal performance guarantees. Our main contribution is the novel coverage reward term of the objective function optimized by the greedy algorithm. This component builds on the graph-of-words representation of text and the k-core decomposition algorithm to assign meaningful scores to words. We evaluate our approach on the AMI and ICSI meeting speech corpora, and on the DUC2001 news corpus. We reach state-of-the-art performance on all datasets. Results indicate that our method is particularly well-suited to the meeting domain.
%R 10.18653/v1/W17-4507
%U https://aclanthology.org/W17-4507
%U https://doi.org/10.18653/v1/W17-4507
%P 48-58

Markdown (Informal)

[Combining Graph Degeneracy and Submodularity for Unsupervised Extractive Summarization](https://aclanthology.org/W17-4507) (Tixier et al., 2017)

• Combining Graph Degeneracy and Submodularity for Unsupervised Extractive Summarization (Tixier et al., 2017)

ACL

• Antoine Tixier, Polykarpos Meladianos, and Michalis Vazirgiannis. 2017. Combining Graph Degeneracy and Submodularity for Unsupervised Extractive Summarization. In Proceedings of the Workshop on New Frontiers in Summarization, pages 48–58, Copenhagen, Denmark. Association for Computational Linguistics.