Abstract

Keyword extraction is a building block of information retrieval. Many techniques have been developed to tackle this problem. However, most of the existing methods suffer from high computational complexity or large corpus dependency, which limits the practical applications. Indeed, given a single document, new visions and strategies are needed for keyword extraction to face the challenges. In this work, we proposed a new graph-based measure for keyword extraction, by leveraging higher-order structural features (e.g. motifs) of word co-occurrence graph. The experiments on real datasets shows superior performance of the proposed method, compared to TF-IDF and PageRank based methods.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call