Extraction Automatic Abstract Method Based on Bert and Graph Model
Article No.: 137, Pages 1 - 7
References
[1]
Hovy, E, Lin, C.”Automated text summarization and the summarist system.” in Access. 1998.
[2]
Hakan Inan, Khashayar Khosravi, and Richard. Tying word vectors and word classifiers: A loss framework for language modeling. Socher.2017.
[3]
Yogesh Kumar Meena, Dinesh Gopalani. Evolutionary Algorithms for Extractive Automatic Text Summarization [J]. Procedia Computer Science, 48, 2015.
[4]
Darmawan R, Wijaya A. Integration Distance Similarity with Keyword Algorithm for Improving Cohesion between Sentences in Text Summarization[C]//IOP Conference Series: Materials Science and Engineering. IOP Publishing, 532(1): 012-019, 2019.
[5]
Yadav C, Sharan A. A New LSA and Entropy-based Approach for Automatic Text Document Summarization [J]. International Journal on Semantic Web and Information Systems (IJSWIS), 14(4): 1-32, 2018.
[6]
Chang Yinglang, Chen J T. Latent Dirichlet learning for document summarization [C]// IEEE International Conference on Acoustics, Speech and Signal Processing. Piscataway, NJ: IEEE Press, 2009: 1689-1692.
[7]
Ramesh Nallapati, Feifei Zhai, Bowen Zhou. SummaRuNNer: A Recurrent Neural Network Based Sequence Model for Extractive Summarization of Documents.2017.
[8]
Qingyu Zhou, Nan Yang, Furu Wei.Neural Document Summarization by Jointly Learning to Score and Select Sentences. 2018.
[9]
LexRank: graph-based lexical centrality as salience in text summarization. Günes Erkan,Dragomir R. Radev. Journal of Artificial Organs. 2004.
[10]
Textrank: Bringing order into text. In Proceedings of the 2004 conference on empirical methods in natural language processing. Rada Mihalcea and Paul Tarau. 2004.
[11]
Wafaa S. El-Kassas, Cherif R. Salama, Ahmed A. Rafea, EdgeSumm: Graph-based framework for automatic text summarization. 57 (6), 2020.
[12]
Page L,Brin S,Motwani R,et al. The PageRank citation ranking: bringing order to the web. 7th International World Wide Web Conference. 1998.
[13]
Changjian Fang, Dejun Mu, Zhenghong Deng, Zhiang Wu. Word-sentence co-ranking for automatic extractive text summarization [J]. Expert Systems With Applications, 2017, 72.
[14]
LeQ, Mikolov T. Distributed representations of sentences and documents[C]//International Conference on Machine Learning. pp. 1188-11962014
[15]
Alguliyev, R. M., Aliguliyev, R. M., Isazade, N. R., Abdi, A., & Idris, N. COSUM: Text summarization based on clustering and optimization. Expert Systems, 36, e12340.2019.
[16]
Wafaa S.El-Kassas, Cherif Salama, Ahmed A. Rafea, Hoda K. Mohamed. EdgeSumm: Graph-based framework for automatic text summarization.2019.
[17]
Howard J, Ruder S. Universal Language Model Fine-tuning for Text Classification [J]. 2018.
[18]
Alec Radford, Karthik Narasimhan, Tim Salimans, Ilya Sutskever. Improving Language Understanding by Generative Pre-Training. 2019.
[19]
Jacob Devlin Ming-Wei Chang Kenton Lee Kristina Toutanova. BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding. 2019.
[20]
Lin CY. ROUGE: A package for automatic evaluation of summaries[C]// Proceedings of the Workshop on Text Summarization Branches Out .2004.
Recommendations
Removable edges in a 5-connected graph and a construction method of 5-connected graphs
An edge e of a k-connected graph G is said to be a removable edge if G@?e is still k-connected. A k-connected graph G is said to be a quasi (k+1)-connected if G has no nontrivial k-separator. The existence of removable edges of 3-connected and 4-...
Removable edges in a k-connected graph and a construction method for k-connected graphs
An edge e of a k-connected graph G is said to be a removable edge if G@?e is still k-connected, where G@?e denotes the graph obtained from G by deleting e to get G-e and, for any end vertex of e with degree k-1 in G-e, say x, deleting x and then adding ...
Comments
Information & Contributors
Information
Published In
May 2021
2053 pages
ISBN:9781450390200
DOI:10.1145/3469213
Copyright © 2021 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 18 August 2021
Check for updates
Qualifiers
- Research-article
- Research
- Refereed limited
Conference
ICAIIS 2021
ICAIIS 2021: 2021 2nd International Conference on Artificial Intelligence and Information Systems
May 28 - 30, 2021
Chongqing, China
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 78Total Downloads
- Downloads (Last 12 months)16
- Downloads (Last 6 weeks)1
Reflects downloads up to 30 Aug 2024
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign inFull Access
View options
View or Download as a PDF file.
PDFeReader
View online with eReader.
eReaderHTML Format
View this article in HTML Format.
HTML Format