Skip to main content

Preference Aware Influence Maximization

  • Conference paper
  • First Online:
Multi-agent and Complex Systems

Part of the book series: Studies in Computational Intelligence ((SCI,volume 670))

Abstract

With the development of social network, online marketing has become more popular and developed in an unprecedented scale. Viral marketing propagates influence through ‘word-of-mouth’ effect. As for development of viral marketing, it is critical to select a set of influential users in the network to propagate influence as much as possible with limited resources. In this chapter, we proposed a model called Preference-based Trust Independent Cascade Model. Based on the experimental results, the Preference-based Trust Independent Cascade Model is able to obtain better results than some traditional models. Comparing with other existing methods, such as trust-only approach and random selection approach, the proposed Preference-based Trust Independent Cascade Model considers both user preference and trust connectivity.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover 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

Institutional subscriptions

Notes

  1. 1.

    https://grouplens.org/datasets/movielens.

References

  1. Ahmed, S., Ezeife, C.I.: Discovering influential nodes from trust network. In: Proceedings of the 28th Annual ACM Symposium on Applied Computing, pp. 121–128. ACM, Coimbra, Portugal (2013)

    Google Scholar 

  2. Chen, W., Wang, Y., Yang, S.: Efficient influence maximization in social networks. In: Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 199–208. ACM, New York, USA (2009)

    Google Scholar 

  3. Chen, W., Yuan, Y., Zhang, L.: Scalable influence maximization in social networks under the linear threshold model. In: Proceeding of the 10th IEEE International Conference on Data Mining (ICDM), pp. 88–97. IEEE, Washington, D.C., USA (2010)

    Google Scholar 

  4. Domingos, P., Richardson, M.: Mining the network value of customers. In: Proceedings of the 7th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 57–66. ACM, New York, USA (2001)

    Google Scholar 

  5. Fortunato, S.: Community detection in graphs. Phys. Rep. 486(3), 75–174 (2010)

    Article  MathSciNet  Google Scholar 

  6. Huang, J., Sun, H., Han, J., Deng, H., Sun, Y., Liu, Y.: Shrink: a structural clustering algorithm for detecting hierarchical communities in networks. In: Proceedings of the 19th ACM International Conference on Information and Knowledge Management, pp. 219–228. ACM, New York, USA (2010)

    Google Scholar 

  7. Kempe, D., Kleinberg, J., Tardos, É.: Maximizing the spread of influence through a social network. In: Proceedings of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 137–146. ACM, New York, USA (2003)

    Google Scholar 

  8. Pan, Y., Li, D.-H., Liu, J.-G., Liang, J.-Z.: Detecting community structure in complex networks via node similarity. Phys. A: Stat. Mech. Appl. 389(14), 2849–2857 (2010)

    Article  Google Scholar 

  9. Phung, D.Q. Venkatesh, S., et al.: Preference networks: probabilistic models for recommendation systems. In: Proceedings of the 6th Australasian Conference on Data Mining and Analytics,-vol. 70, pp. 195–202. Australian Computer Society, Inc., Darlinghurst, Australia (2007)

    Google Scholar 

  10. Rashid, A.M., Albert, I., Cosley, D., Lam, S.K. McNee, S.M., Konstan, J.A., Riedl, J.: Getting to know you: learning new user preferences in recommender systems. In: Proceedings of the 7th International Conference on Intelligent User Interfaces, pp. 127–134. ACM, New York, USA (2002)

    Google Scholar 

  11. Richardson, M., Domingos, P.: Mining knowledge-sharing sites for viral marketing. In: Proceedings of the 8th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 61–70. ACM, New York, USA (2002)

    Google Scholar 

  12. Wang, C., Chen, W., Wang, Y.: Scalable influence maximization for independent cascade model in large-scale social networks. Data Min. Knowl. Discov. 25(3), 545–576 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  13. Zhou, J., Zhang, Y., Cheng, J.: Preference-based mining of top-k influential nodes in social networks. Future Gener. Comput. Syst. 31, 40–47 (2014)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Chang Jiang .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer Science+Business Media Singapore

About this paper

Cite this paper

Jiang, C., Li, W., Bai, Q., Zhang, M. (2017). Preference Aware Influence Maximization. In: Bai, Q., Ren, F., Fujita, K., Zhang, M., Ito, T. (eds) Multi-agent and Complex Systems. Studies in Computational Intelligence, vol 670. Springer, Singapore. https://doi.org/10.1007/978-981-10-2564-8_11

Download citation

  • DOI: https://doi.org/10.1007/978-981-10-2564-8_11

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-10-2563-1

  • Online ISBN: 978-981-10-2564-8

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics