Abstract
Search result diversification is an effective way to tackle query ambiguity and enhance result novelty. In the context of large information networks, diversifying search result is also critical for further design of applications such as link prediction and citation recommendation. In previous work, this problem has mainly been tackled in a way of implicit query intent. To further enhance the performance on attributed networks, we propose a novel search result diversification approach via nonnegative matrix factorization. Our approach encodes latent query intents as well as nodes as representation vectors by a novel nonnegative matrix factorization model, and the diversity of the results accounts for the query relevance and the novelty w.r.t. these vectors. To learn the representation vectors of nodes, we derive the multiplicative updating rules to train the nonnegative matrix factorization model. We perform a comprehensive evaluation on our approach with various baselines. The results show the effectiveness of our proposed solution, and verify that attributes do help improve diversification performance.
Original language | English |
---|---|
Pages (from-to) | 1277-1291 |
Number of pages | 15 |
Journal | Information Processing and Management |
Volume | 54 |
Issue number | 6 |
DOIs | |
Publication status | Published - Nov 2018 |
Externally published | Yes |
Keywords
- Attributed network
- Diversification
- Graph search
- Nonnegative matrix factorization