Skip to main content
Top

2016 | OriginalPaper | Chapter

Link Prediction via Mining Markov Logic Formulas to Improve Social Recommendation

Authors : Zhuoyu Wei, Jun Zhao, Kang Liu, Shizhu He

Published in: Knowledge Graph and Semantic Computing: Semantic, Knowledge, and Linked Big Data

Publisher: Springer Singapore

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

Social networks have been a main way to obtain information in recent years, but the huge amount of information obstructs people from obtaining something that they are really interested in. Social recommendation system is introduced to solve this problem and brings a new challenge of predicting peoples preferences. In a graph view, social recommendation can be viewed as link prediction task on the social graph. Therefore, some link prediction technique can apply to social recommendation. In this paper, we propose a novel approach to bring logic formulas in social recommendation system and it can improve the accuracy of recommendations. This approach is made up of two parts: (1) It treats the whole social network with kinds of attributes as a semantic network, and finds frequent structures as logic formulas via random graph algorithms. (2) It builds a Markov Logic Network to model logic formulas, attaches weights to each of them to measure formulas contributions, and then learns the weights discriminatively from training data. In addition, the formulas with weights can be viewed as the reason why people should accept a specific recommendation, and supplying it for people may increase the probability of people accepting the recommendation. We carry out several experiments to explore and analyze the effects of various factors of our method on recommendation results, and get the final method to compare with baselines.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literature
1.
go back to reference Al Hasan, M., Zaki, M.J.: MUSK: uniform sampling of k maximal patterns. In: SDM, pp. 650–661 (2009) Al Hasan, M., Zaki, M.J.: MUSK: uniform sampling of k maximal patterns. In: SDM, pp. 650–661 (2009)
2.
go back to reference Backstrom, L., Leskovec, J.: Supervised random walks: predicting and recommending links in social networks. In: WSDM, pp. 635–644. ACM (2011) Backstrom, L., Leskovec, J.: Supervised random walks: predicting and recommending links in social networks. In: WSDM, pp. 635–644. ACM (2011)
3.
go back to reference Balabanović, M., Shoham, Y.: Fab: content-based, collaborative recommendation. Commun. ACM 40(3), 66–72 (1997)CrossRef Balabanović, M., Shoham, Y.: Fab: content-based, collaborative recommendation. Commun. ACM 40(3), 66–72 (1997)CrossRef
4.
go back to reference Basu, C., Hirsh, H., Cohen, W., et al.: Recommendation as classification: using social and content-based information in recommendation. In: AAAI/IAAI, pp. 714–720 (1998) Basu, C., Hirsh, H., Cohen, W., et al.: Recommendation as classification: using social and content-based information in recommendation. In: AAAI/IAAI, pp. 714–720 (1998)
5.
go back to reference Burda, Z., Duda, J., Luck, J., Waclaw, B.: Localization of the maximal entropy random walk. Phys. Rev. Lett. 102(16), 160602 (2009)CrossRef Burda, Z., Duda, J., Luck, J., Waclaw, B.: Localization of the maximal entropy random walk. Phys. Rev. Lett. 102(16), 160602 (2009)CrossRef
6.
go back to reference Chen, K., Chen, T., Zheng, G., Jin, O., Yao, E., Yu, Y.: Collaborative personalized tweet recommendation. In: SIGIR, pp. 661–670. ACM (2012) Chen, K., Chen, T., Zheng, G., Jin, O., Yao, E., Yu, Y.: Collaborative personalized tweet recommendation. In: SIGIR, pp. 661–670. ACM (2012)
7.
go back to reference Chen, T., Tang, L., Liu, Q., Yang, D., Xie, S., Cao, X., Wu, C., Yao, E., Liu, Z., Jiang, Z., et al.: Combining factorization model and additive forest for collaborative followee recommendation. In: Proceedings of the KDD Cup 2012 Workshop (2008) Chen, T., Tang, L., Liu, Q., Yang, D., Xie, S., Cao, X., Wu, C., Yao, E., Liu, Z., Jiang, Z., et al.: Combining factorization model and additive forest for collaborative followee recommendation. In: Proceedings of the KDD Cup 2012 Workshop (2008)
8.
go back to reference Gong, N.Z., Talwalkar, A., Mackey, L., Huang, L., Shin, E.C.R., Stefanov, E., Song, D., et al.: Jointly predicting links and inferring attributes using a social-attribute network (san). In: ACM Workshop on Social Network Mining and Analysis (SNA-KDD) (2012) Gong, N.Z., Talwalkar, A., Mackey, L., Huang, L., Shin, E.C.R., Stefanov, E., Song, D., et al.: Jointly predicting links and inferring attributes using a social-attribute network (san). In: ACM Workshop on Social Network Mining and Analysis (SNA-KDD) (2012)
9.
go back to reference Hannon, J., Bennett, M., Smyth, B.: Recommending Twitter users to follow using content and collaborative filtering approaches. In: Proceedings of the Fourth ACM Conference on Recommender Systems, pp. 199–206. ACM (2010) Hannon, J., Bennett, M., Smyth, B.: Recommending Twitter users to follow using content and collaborative filtering approaches. In: Proceedings of the Fourth ACM Conference on Recommender Systems, pp. 199–206. ACM (2010)
10.
go back to reference Huynh, T.N., Mooney, R.J.: Discriminative structure and parameter learning for Markov logic networks. In: ICML, pp. 416–423. ACM (2008) Huynh, T.N., Mooney, R.J.: Discriminative structure and parameter learning for Markov logic networks. In: ICML, pp. 416–423. ACM (2008)
11.
go back to reference Jamali, M., Ester, M.: A matrix factorization technique with trust propagation for recommendation in social networks. In: Proceedings of the Fourth ACM Conference on Recommender Systems, pp. 135–142. ACM (2010) Jamali, M., Ester, M.: A matrix factorization technique with trust propagation for recommendation in social networks. In: Proceedings of the Fourth ACM Conference on Recommender Systems, pp. 135–142. ACM (2010)
12.
go back to reference Karatzoglou, A., Amatriain, X., Baltrunas, L., Oliver, N.: Multiverse recommendation: n-dimensional tensor factorization for context-aware collaborative filtering. In: Proceedings of the Fourth ACM Conference on Recommender Systems, pp. 79–86. ACM (2010) Karatzoglou, A., Amatriain, X., Baltrunas, L., Oliver, N.: Multiverse recommendation: n-dimensional tensor factorization for context-aware collaborative filtering. In: Proceedings of the Fourth ACM Conference on Recommender Systems, pp. 79–86. ACM (2010)
13.
go back to reference Kashima, H., Kato, T., Yamanishi, Y., Sugiyama, M., Tsuda, K.: Link propagation: a fast semi-supervised learning algorithm for link prediction. In: SDM, vol. 9, pp. 1099–1110. SIAM (2009) Kashima, H., Kato, T., Yamanishi, Y., Sugiyama, M., Tsuda, K.: Link propagation: a fast semi-supervised learning algorithm for link prediction. In: SDM, vol. 9, pp. 1099–1110. SIAM (2009)
14.
go back to reference Kok, S., Domingos, P.: Learning Markov logic network structure via hypergraph lifting. In: ICML, pp. 505–512. ACM (2009) Kok, S., Domingos, P.: Learning Markov logic network structure via hypergraph lifting. In: ICML, pp. 505–512. ACM (2009)
15.
go back to reference Kok, S., Domingos, P.: Learning Markov logic networks using structural motifs. In: ICML, pp. 551–558 (2010) Kok, S., Domingos, P.: Learning Markov logic networks using structural motifs. In: ICML, pp. 551–558 (2010)
16.
go back to reference Koren, Y.: Factorization meets the neighborhood: a multifaceted collaborative filtering model. In: SIGKDD, pp. 426–434. ACM (2008) Koren, Y.: Factorization meets the neighborhood: a multifaceted collaborative filtering model. In: SIGKDD, pp. 426–434. ACM (2008)
17.
go back to reference Koren, Y., Bell, R., Volinsky, C.: Matrix factorization techniques for recommender systems. Computer 42(8), 30–37 (2009)CrossRef Koren, Y., Bell, R., Volinsky, C.: Matrix factorization techniques for recommender systems. Computer 42(8), 30–37 (2009)CrossRef
18.
go back to reference Li, G., Zaki, M.J.: Sampling minimal frequent boolean (dnf) patterns. In: SIGKDD, pp. 87–95. ACM (2012) Li, G., Zaki, M.J.: Sampling minimal frequent boolean (dnf) patterns. In: SIGKDD, pp. 87–95. ACM (2012)
19.
go back to reference Lowd, D., Domingos, P.: Efficient weight learning for Markov logic networks. In: Kok, J.N., Koronacki, J., Lopez de Mantaras, R., Matwin, S., Mladenič, D., Skowron, A. (eds.) PKDD 2007. LNCS (LNAI), vol. 4702, pp. 200–211. Springer, Heidelberg (2007). doi:10.1007/978-3-540-74976-9_21 CrossRef Lowd, D., Domingos, P.: Efficient weight learning for Markov logic networks. In: Kok, J.N., Koronacki, J., Lopez de Mantaras, R., Matwin, S., Mladenič, D., Skowron, A. (eds.) PKDD 2007. LNCS (LNAI), vol. 4702, pp. 200–211. Springer, Heidelberg (2007). doi:10.​1007/​978-3-540-74976-9_​21 CrossRef
20.
go back to reference Ma, H.: An experimental study on implicit social recommendation. In: SIGIR, pp. 73–82. ACM (2013) Ma, H.: An experimental study on implicit social recommendation. In: SIGIR, pp. 73–82. ACM (2013)
21.
go back to reference Niu, Y., Wang, Y., Sun, G., Yue, A., Dalessandro, B., Perlich, C., Hamner, B.: The tencent dataset and KDD-Cup’12. In: KDD-Cup Workshop, vol. 2012 (2012) Niu, Y., Wang, Y., Sun, G., Yue, A., Dalessandro, B., Perlich, C., Hamner, B.: The tencent dataset and KDD-Cup’12. In: KDD-Cup Workshop, vol. 2012 (2012)
22.
go back to reference Rendle, S.: Factorization machines. In: ICDM, pp. 995–1000. IEEE (2010) Rendle, S.: Factorization machines. In: ICDM, pp. 995–1000. IEEE (2010)
23.
go back to reference Rendle, S., Gantner, Z., Freudenthaler, C., Schmidt-Thieme, L.: Fast context-aware recommendations with factorization machines. In: SIGIR, pp. 635–644. ACM (2011) Rendle, S., Gantner, Z., Freudenthaler, C., Schmidt-Thieme, L.: Fast context-aware recommendations with factorization machines. In: SIGIR, pp. 635–644. ACM (2011)
24.
go back to reference Richardson, M., Domingos, P.: Markov logic networks. Mach. Learn. 62(1–2), 107–136 (2006)CrossRef Richardson, M., Domingos, P.: Markov logic networks. Mach. Learn. 62(1–2), 107–136 (2006)CrossRef
25.
go back to reference Sarwar, B., Karypis, G., Konstan, J., Riedl, J.: Item-based collaborative filtering recommendation algorithms. In: WWW, pp. 285–295. ACM (2001) Sarwar, B., Karypis, G., Konstan, J., Riedl, J.: Item-based collaborative filtering recommendation algorithms. In: WWW, pp. 285–295. ACM (2001)
26.
go back to reference Shi, Y., Larson, M., Hanjalic, A.: Exploiting user similarity based on rated-item pools for improved user-based collaborative filtering. In: Proceedings of the Third ACM Conference on Recommender Systems, pp. 125–132. ACM (2009) Shi, Y., Larson, M., Hanjalic, A.: Exploiting user similarity based on rated-item pools for improved user-based collaborative filtering. In: Proceedings of the Third ACM Conference on Recommender Systems, pp. 125–132. ACM (2009)
27.
go back to reference Yang, S.-H., Long, B., Smola, A., Sadagopan, N., Zheng, Z., Zha, H.: Like like alike: joint friendship and interest propagation in social networks. In: WWW, pp. 537–546. ACM (2011) Yang, S.-H., Long, B., Smola, A., Sadagopan, N., Zheng, Z., Zha, H.: Like like alike: joint friendship and interest propagation in social networks. In: WWW, pp. 537–546. ACM (2011)
28.
go back to reference Yin, Z., Gupta, M., Weninger, T., Han, J.: LINKREC: a unified framework for link recommendation with user attributes and graph structure. In: WWW, pp. 1211–1212. ACM (2010) Yin, Z., Gupta, M., Weninger, T., Han, J.: LINKREC: a unified framework for link recommendation with user attributes and graph structure. In: WWW, pp. 1211–1212. ACM (2010)
29.
go back to reference Yin, Z., Gupta, M., Weninger, T., Han, J.: A unified framework for link recommendation using random walks. In: International Conference on Advances in Social Networks Analysis and Mining (ASONAM), pp. 152–159. IEEE (2010) Yin, Z., Gupta, M., Weninger, T., Han, J.: A unified framework for link recommendation using random walks. In: International Conference on Advances in Social Networks Analysis and Mining (ASONAM), pp. 152–159. IEEE (2010)
30.
go back to reference Zhang, J., Wang, C., Yu, P.S., Wang, J.: Learning latent friendship propagation networks with interest awareness for link prediction. In: SIGIR, pp. 63–72. ACM (2013) Zhang, J., Wang, C., Yu, P.S., Wang, J.: Learning latent friendship propagation networks with interest awareness for link prediction. In: SIGIR, pp. 63–72. ACM (2013)
31.
go back to reference Zhu, M.: Recall, precision and average precision. Department of Statistics and Actuarial Science, University of Waterloo, Waterloo, February, 2004 Zhu, M.: Recall, precision and average precision. Department of Statistics and Actuarial Science, University of Waterloo, Waterloo, February, 2004
Metadata
Title
Link Prediction via Mining Markov Logic Formulas to Improve Social Recommendation
Authors
Zhuoyu Wei
Jun Zhao
Kang Liu
Shizhu He
Copyright Year
2016
Publisher
Springer Singapore
DOI
https://doi.org/10.1007/978-981-10-3168-7_14

Premium Partner