Skip to main content

Relevance Search on Signed Heterogeneous Information Network Based on Meta-path Factorization

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 9098))

Abstract

Relevance search is a primitive operation in heterogeneous information networks, where the task is to measure the relatedness of objects with different types. Due to the semantics implied by network links, conventional research on relevance search is often based on meta-path in heterogeneous information networks. However, existing approaches mainly focus on studying non-signed information networks, without considering the polarity of the links in the network. In reality, there are many signed heterogeneous networks that the links can be either positive (such as trust, preference, friendship, etc.) or negative (such as distrust, dislike, opposition, etc.). It is challenging to utilize the semantic information of the two kinds of links in meta-paths and integrate them in a unified way to measure relevance.

In this paper, a relevance search measure called SignSim is proposed, which can measure the relatedness of objects in signed heterogeneous information networks based on signed meta-path factorization. SignSim firstly defines the atomic meta-paths and gives the computing paradigm of similarity between objects with the same type based on atomic meta-paths, with collaborative filtering using positive and negative user preferences. Then, on basis of the combination of different atomic meta-paths, SignSim can measure the relatedness between objects with different types based on multi-length signed meta-paths. Experimental results on real-world dataset verify the effectiveness of our proposed approach.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Sun,Y., Han, J., Yan, X., Yu, P.: Mining knowledge from interconnected data: a heterogeneous information network analysis approach. In: Proceedings of the VLDB Endowment, pp. 2022–2023. ACM Press, New York (2012)

    Google Scholar 

  2. Xu, X., Yuruk, N., Feng, Z., Schweiger, T.A.J.: SCAN: a structural clustering algorithm for networks. In: Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 824–833. ACM Press, New York (2007)

    Google Scholar 

  3. Lao, N., Cohen, W.: Fast query execution for retrieval models based on path constrained random walks. In: Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 881–888. ACM Press, New York (2010)

    Google Scholar 

  4. Jeh, G., Widom, J.: Simrank: a measure of structural-context similarity. In: Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 538–543. ACM Press, New York (2002)

    Google Scholar 

  5. Ye, J., Cheng, H., Zhu, Z., Chen, M.: Predicting positive and negative links in signed social networks by transfer learning. In: WWW, Switzerland (2013)

    Google Scholar 

  6. Sun, Y., Han, J., Yan, X., Yu, P., Wu, T.: Pathsim: meta path-based Top-k similarity search in heterogeneous information networks. In: PVLDB, pp. 992–1003 (2011)

    Google Scholar 

  7. Sun, Y., Han, J., Aggarwal, C., Chawla, N.V.: When will it happen? : relationship prediction in heterogeneous information networks. In: Proceedings of the Fifth ACM International Conference on Web Search and Data Mining, pp. 663–672. ACM Press, New York (2012)

    Google Scholar 

  8. Sun, Y., Barber, R., Gupta, M., Aggarwal, C.C., Han, J.: Co-author relationship prediction in heterogeneous information networks. In: Proceedings of the 2011 International Conference on Advances in Social Networks Analysis and Mining, pp. 121–128. IEEE Computer Society Press, Washington (2011)

    Google Scholar 

  9. Sun, Y., Norick, B., Han, J., Yan, X., Yu, P.S., Yu, X.: Integrating meta-path selection with user-guided object clustering in heterogeneous information networks. In: Proceedings of the 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 1348–1356. ACM Press, New York (2012)

    Google Scholar 

  10. Tong, H., Faloutsos, C., Pan, J.Y.: Fast random walk with restart and its applications. In: Proceedings of the Sixth International Conference on Data Mining, pp. 613–622. IEEE Computer Society Press, Washington (2006)

    Google Scholar 

  11. Liben-Nowell, D., Kleinberg, J.: The link-prediction problem for social networks. J. Am. Soc. Inf. Sci. Technol., 1019–1031 (2007). John Wiley & Sons, Inc. Press

    Google Scholar 

  12. Lichtenwalter, R.N., Lussier, J.T., Chawla, N.V.: New perspectives and methods in link prediction. In: Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 243–252. ACM Press, New York (2010)

    Google Scholar 

  13. Leskovec, J., Huttenlocher, D., Kleinberg, J.: Predicting positive and negative links in online social networks. In: Proceedings of the 19th International Conference on World Wide Web, pp. 641–650. ACM Press, New York (2010)

    Google Scholar 

  14. Shi, C., Kong, X., Huang, Y., et al.: HeteSim: a general framework for relevance measure in heterogeneous networks. In: IEEE Transactions on Knowledge and Data Engineering, pp. 2479–2492. IEEE Computer Society, Washington (2014)

    Google Scholar 

  15. Symeonidis, P., Tiakas, E., Manolopoulos, Y.: Transitive node similarity for link prediction in social networks with positive and negative links. In: Proceedings of the Fourth ACM Conference on Recommender Systems, pp.183–190. ACM Press, New York (2010)

    Google Scholar 

  16. DuBois, T., Golbeck, J., Srinivasan, A.: Predicting trust and distrust in social networks. In: Agent and Multi-Agent Systems: Technologies and Applications, pp. 122–131. Springer Berlin Heidelberg Press, Heidelberg (2011)

    Google Scholar 

  17. Sun, L., Cheng, R., Li, X., Cheung, D.W., Han, J.: On Link-based similarity join. In: Proceedings of 37th International Conference on Very Large Data Bases (2011)

    Google Scholar 

  18. hetrec2011-movielens. http://grouplens.org/datasets/hetrec-2011/

  19. Wang, S.Z., Yan, Z., Hu, X., Yu, P.S., Li, Z.J.: Burst time prediction in cascades. In: Proceedings of 29th AAAI Conference on Artificial Intelligence (2015)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Zhaohui Peng .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Zhu, M. et al. (2015). Relevance Search on Signed Heterogeneous Information Network Based on Meta-path Factorization. In: Dong, X., Yu, X., Li, J., Sun, Y. (eds) Web-Age Information Management. WAIM 2015. Lecture Notes in Computer Science(), vol 9098. Springer, Cham. https://doi.org/10.1007/978-3-319-21042-1_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-21042-1_15

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-21041-4

  • Online ISBN: 978-3-319-21042-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics