| J14-1003 | . Then , they study different | graph-based centrality | algorithms for deciding the relevance |
| J14-1003 | . They also compare different | graph-based centrality | algorithms to rank the vertices |
| E09-1005 | . Then , they study different | graph-based centrality | algorithms for deciding the relevance |
| E09-1005 | . They also compare different | graph-based centrality | algorithms to rank the vertices |
| W04-3247 | 3.3 Comparison with Centroid The | graph-based centrality | approach we have introduced has |
| W07-0204 | define sentence importance based on | graph-based centrality | ranking of sentences . They construct |
| D08-1032 | Radev , 2004 ) , the concept of | graph-based centrality | is used to rank a set of sentences |
| E09-2002 | method to extract sentences : " | Graph-based centrality | " extractor ( Erkan and Radev |
| S14-1005 | effectiveness across a range of | graph-based centrality | measures and subgraph construction |
| S14-1005 | subgraphs from LKBs , and then runs | graph-based centrality | measures such as PageRank ( Brin |
| S14-1005 | ... , si , k } , are scored by a | graph-based centrality | measure φ , over subgraph |
| S14-1005 | and b , in which our arbitrary | graph-based centrality | measure 0 has selected the second |
| N06-5003 | analysis * Node-ranking algorithms * | Graph-based centrality | * Graph-based clustering * Machine |
