Dual Implicit Mining-Based Latent Friend Recommendation
- Publisher:
- Institute of Electrical and Electronics Engineers
- Publication Type:
- Journal Article
- Citation:
- IEEE Transactions on Systems Man and Cybernetics: Systems, 2020, 50, (5), pp. 1663-1678
- Issue Date:
- 2020
Closed Access
| Filename | Description | Size | |||
|---|---|---|---|---|---|
| 08259037.pdf | Published version | 3.09 MB |
Copyright Clearance Process
- Recently Added
- In Progress
- Closed Access
This item is closed access and not available.
IEEE The latent friend recommendation in online social media is interesting, yet challenging, because the user-item ratings and the user-user relationships are both sparse. In this paper, we propose a new dual implicit mining-based latent friend recommendation model that simultaneously considers the implicit interest topics of users and the implicit link relationships between the users in the local topic cliques. Specifically, we first propose an algorithm called all reviews from a user and all tags from their corresponding items to learn the implicit interest topics of the users and their corresponding topic weights, then compute the user interest topic similarity using a symmetric Jensen-Shannon divergence. After that, we adopt the proposed weighted local random walk with restart algorithm to analyze the implicit link relationships between the users in the local topic cliques and calculate the weighted link relationship similarity between the users. Combining the user interest topic similarity with the weighted link relationship similarity in a unified way, we get the final latent friend recommendation list. The experiments on real-world datasets demonstrate that the proposed method outperforms the state-of-the-art latent friend recommendation methods under four different types of evaluation metrics.
Please use this identifier to cite or link to this item: