{"id":"https://openalex.org/W2251328522","doi":"https://doi.org/10.3115/v1/w14-3703","title":"Multi-document Summarization Using Bipartite Graphs","display_name":"Multi-document Summarization Using Bipartite Graphs","publication_year":2014,"publication_date":"2014-01-01","ids":{"openalex":"https://openalex.org/W2251328522","doi":"https://doi.org/10.3115/v1/w14-3703","mag":"2251328522"},"language":"en","primary_location":{"id":"doi:10.3115/v1/w14-3703","is_oa":true,"landing_page_url":"https://doi.org/10.3115/v1/w14-3703","pdf_url":"https://doi.org/10.3115/v1/w14-3703","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of TextGraphs-9: the workshop on Graph-based Methods for Natural Language Processing","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.3115/v1/w14-3703","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5046729774","display_name":"Daraksha Parveen","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Daraksha Parveen","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5020347604","display_name":"Michael Strube","orcid":"https://orcid.org/0000-0002-4731-8142"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Michael Strube","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":17,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"15","last_page":"24"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10028","display_name":"Topic Modeling","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10028","display_name":"Topic Modeling","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T13083","display_name":"Advanced Text Analysis Techniques","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10181","display_name":"Natural Language Processing Techniques","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/automatic-summarization","display_name":"Automatic summarization","score":0.9000840187072754},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.8942821025848389},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7722725868225098},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5562359690666199},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4940820038318634},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.47223660349845886},{"id":"https://openalex.org/keywords/information-retrieval","display_name":"Information retrieval","score":0.3898872137069702},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.060344427824020386}],"concepts":[{"id":"https://openalex.org/C170858558","wikidata":"https://www.wikidata.org/wiki/Q1394144","display_name":"Automatic summarization","level":2,"score":0.9000840187072754},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.8942821025848389},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7722725868225098},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5562359690666199},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4940820038318634},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.47223660349845886},{"id":"https://openalex.org/C23123220","wikidata":"https://www.wikidata.org/wiki/Q816826","display_name":"Information retrieval","level":1,"score":0.3898872137069702},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.060344427824020386}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.3115/v1/w14-3703","is_oa":true,"landing_page_url":"https://doi.org/10.3115/v1/w14-3703","pdf_url":"https://doi.org/10.3115/v1/w14-3703","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of TextGraphs-9: the workshop on Graph-based Methods for Natural Language Processing","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.673.572","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.673.572","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.aclweb.org/anthology/W/W14/W14-3703.pdf","raw_type":"text"}],"best_oa_location":{"id":"doi:10.3115/v1/w14-3703","is_oa":true,"landing_page_url":"https://doi.org/10.3115/v1/w14-3703","pdf_url":"https://doi.org/10.3115/v1/w14-3703","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of TextGraphs-9: the workshop on Graph-based Methods for Natural Language Processing","raw_type":"proceedings-article"},"sustainable_development_goals":[{"score":0.5699999928474426,"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":34,"referenced_works":["https://openalex.org/W100656083","https://openalex.org/W179757531","https://openalex.org/W1525595230","https://openalex.org/W1537217019","https://openalex.org/W1573514622","https://openalex.org/W1578268952","https://openalex.org/W1884372994","https://openalex.org/W1959120443","https://openalex.org/W1967082914","https://openalex.org/W1974339500","https://openalex.org/W1975579663","https://openalex.org/W1980813323","https://openalex.org/W2066636486","https://openalex.org/W2083305840","https://openalex.org/W2094515246","https://openalex.org/W2097606805","https://openalex.org/W2105542801","https://openalex.org/W2111619374","https://openalex.org/W2117504225","https://openalex.org/W2122311631","https://openalex.org/W2123849094","https://openalex.org/W2125420881","https://openalex.org/W2138621811","https://openalex.org/W2140676672","https://openalex.org/W2144270295","https://openalex.org/W2152052831","https://openalex.org/W2152992673","https://openalex.org/W2154652894","https://openalex.org/W2158751803","https://openalex.org/W2163038589","https://openalex.org/W2250327935","https://openalex.org/W2250710312","https://openalex.org/W2916445322","https://openalex.org/W3101913037"],"related_works":["https://openalex.org/W2366403280","https://openalex.org/W1495108544","https://openalex.org/W2091301346","https://openalex.org/W3148229873","https://openalex.org/W4389760904","https://openalex.org/W2150160875","https://openalex.org/W4242223894","https://openalex.org/W125753862","https://openalex.org/W3088754131","https://openalex.org/W3038848193"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3,41],"introduce":[4],"a":[5,19,43],"novel":[6],"graph":[7,21,49],"based":[8,12],"technique":[9,45],"for":[10],"topic":[11],"multi-document":[13],"summarization.":[14],"We":[15,57],"transform":[16],"documents":[17],"into":[18],"bipartite":[20,48],"where":[22],"one":[23],"set":[24,32],"of":[25,33,61],"nodes":[26,34],"represents":[27,35],"entities":[28],"and":[29,68],"the":[30,39,47,59,72],"other":[31],"sentences.":[36],"To":[37],"obtain":[38],"summary":[40],"apply":[42],"ranking":[44],"to":[46,71],"which":[50],"is":[51],"followed":[52],"by":[53],"an":[54],"optimization":[55],"step.":[56],"test":[58],"performance":[60],"our":[62],"method":[63],"on":[64],"several":[65],"DUC":[66],"datasets":[67],"compare":[69],"it":[70],"state-of-the-art.":[73],"1":[74]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}