Decoupled Extractive Summarization as Graph Nodes Pruning.
Hanwei WangPiji LiYanan CaoRuipeng JiaWang Hai-longLi Yang-chunPublished in: IJCNN (2022)
Keyphrases
- extractive summarization
- directed graph
- graph structure
- weighted graph
- adjacency matrix
- undirected graph
- root node
- edge weights
- graph structures
- dominating set
- nodes of a graph
- planar graphs
- fully connected
- spanning tree
- random walk
- connected graphs
- finding the shortest path
- graph theory
- random graphs
- graph matching
- average degree
- attributed graphs
- strongly connected
- path length
- graph representation
- text summarization
- bipartite graph
- structured data
- shortest path
- graph mining
- unsupervised learning
- information retrieval
- artificial intelligence
- small world
- graph theoretic
- supervised learning
- search space
- expert systems
- information retrieval systems
- graph model
- minimum cost
- overlapping communities
- betweenness centrality
- learning algorithm
- graphical models
- massive graphs
- connected components
- data mining