BigSee
Discovering Salience in Textual Elements Using Graph Mutual Reinforcement
www.si.umich.edu/about-SI/news-detail.htm?NewsItemID=623
Notes
Discovering Salience in Textual Elements Using Graph Mutual Reinforcement → Ahmed Hassan → Ahmed came up with an elegant idea: sentences that provide the best summary of a piece of text have important words. And important words are those that are contained in important sentences. Sounds like a job for the HITS algorithm, and Ahmed takes it for a spin.
Discovering Salience in Textual Elements Using Graph Mutual Reinforcement
www.si.umich.edu/about-SI/news-detail.htm?NewsItemID=623
Notes
Discovering Salience in Textual Elements Using Graph Mutual Reinforcement → Ahmed Hassan → Ahmed came up with an elegant idea: sentences that provide the best summary of a piece of text have important words. And important words are those that are contained in important sentences. Sounds like a job for the HITS algorithm, and Ahmed takes it for a spin.