Name
Title | ||
|---|---|---|
Provable Fast Greedy Compressive Summarization with Any Monotone Submodular Function. |
Year | Venue | Field |
|---|---|---|
2018 | NAACL-HLT | Automatic summarization,Computer science,Submodular set function,Theoretical computer science,Artificial intelligence,Machine learning,Monotone polygon |
DocType | Citations | PageRank |
Conference | 0 | 0.34 |
References | Authors | |
0 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Shinsaku Sakaue | 1 | 0 | 0.34 |
| Tsutomu Hirao | 2 | 18 | 4.14 |
| Masaaki Nishino | 3 | 28 | 10.34 |
| Masaaki Nagata | 4 | 573 | 77.86 |