'Graph Theory' Category
Discussion of LexRank by Erkan and Radev
POTW 2/18/07: LexRank: Graph-based Lexical Centrality as Salience in Text Summarization
The LexRank paper by Erkan and Radev is another PageRank/Graph Theory based approach to working with text, this time applied to the task of summarization.
Key parts of sections 1 and 2 discuss the general problem of corpus-based summarization. Unlike TextRank by Mihalcea, Erkan and Radev [...]Popularity: 7% [?]
POTW 2/18/07: LexRank: Graph-based Lexical Centrality as Salience in Text Summarization
The POTW for 2/18/07 is another graph-based approach, this time by another leader in this area, Dragomir Radev. The paper is
LexRank: Graph-based Lexical Centrality as Salience in Text Summarization
Enjoy!
Popularity: 5% [?]Popularity: 5% [?]
POTW 2/11/07: Discussion of sections 5-8 of Minkov, et. al
POTW 2/11/07: Contextual Search and Name Disambiguation in Email Using Graphs
Discussion of Sections 5 through 8
The remaining sections of this paper are discussions of two applications of the algorithms plus the body of related work and conclusions that can be drawn from the work. Section 5 gives the details on what corpora were used [...]Popularity: 6% [?]
POTW 2/11/07: Contextual Search and Name Disambiguation in Email Using Graphs by Minkov, et. al
This week’s paper is another graph theory (do you sense a trend?) by Minkov, et. al title “Contextual Search and Name Disambiguation in Email Using Graphs” and appeared in SIGIR ‘06.
email, graph theory, disambiguation
Popularity: 8% [?]Technorati Tags: email, graph theory, disambiguationPopularity: 8% [?]
Remaining Sections of Kleinberg
Sections 5 through 7 of Authoritative Sources in a Hyperlinked Environment cover some more applications of the hubs and authorities approach and then wraps up with the conclusion.
Section 5 examines the quality of the authority measure by comparing the results achieved by running the Kleinberg algorithm against some of the searchable hierarchies that exist on [...]Popularity: 5% [?]
