Skip to main content

Efficient Complex Social Event-Participant Planning Based on Heuristic Dynamic Programming

  • Conference paper
  • First Online:
Database Systems for Advanced Applications (DASFAA 2018)

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

Included in the following conference series:

  • 3879 Accesses

Abstract

To manage the Event Based Social Networks (EBSNs), an important task is to solve the Global Event Planning with Constraints (GEPC) problem, which arranges suitable social events to target users. Existing studies are not efficient enough because of the two-step framework. In this paper, we propose a more efficient method, called Heuristic-DP, which asynchronously considers all the constraints together. Using this method, we improve the computational complexity from \(O(|E|^2 + |U||E|^2)\) to O(|U||E|), where |U| is the number of users and |E| is the number of events in an EBSN platform. We also propose an improved heuristic strategy in one function of the heuristic-DP algorithm, which slightly increases the time cost, but can obtain a more accurate result. Finally, we verify the effectiveness and efficiency of our proposed algorithms through extensive experiments over real and synthetic datasets.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

Notes

  1. 1.

    http://www.meetup.com/.

  2. 2.

    http://plancast.com/.

References

  1. Chen, C., Zhang, D., Guo, B., Ma, X., Pan, G., Wu, Z.: TripPlanner: personalized trip planning leveraging heterogeneous crowdsourced digital footprints. T-ITS 16, 1259–1273 (2014)

    Google Scholar 

  2. Cheng, Y., Yuan, Y., Chen, L., Giraud-Carrier, C., Wang, G.: Complex event-participant planning and its incremental variant. In: 2017 IEEE 33rd International Conference on Data Engineering (ICDE), pp. 859–870. IEEE (2017)

    Google Scholar 

  3. Du, R., Yu, Z., Mei, T., Wang, Z., Wang, Z., Guo, B.: Predicting activity attendance in event-based social networks: content, context and social influence. In: UbiComp (2014)

    Google Scholar 

  4. Feng, K., Cong, G., Bhowmick, S.S., Ma, S.: In search of influential event organizers in online social networks. In: SIGMOD (2014)

    Google Scholar 

  5. Geem, Z.W., Kim, J.H., Loganathan, G.V.: A new heuristic optimization algorithm: harmony search. Simulation 76(2), 60–68 (2001)

    Article  Google Scholar 

  6. Haslum, P., Geffner, H.: Heuristic planning with time and resources. In: Sixth European Conference on Planning (2014)

    Google Scholar 

  7. Kempe, D., Kleinberg, J., Tardos, É.: Maximizing the spread of influence through a social network. In: SIGKDD (2003)

    Google Scholar 

  8. Khrouf, H., Troncy, R.: Hybrid event recommendation using linked data and user diversity. In: RecSys (2013)

    Google Scholar 

  9. Lappas, T., Liu, K., Terzi, E.: Finding a team of experts in social networks. In: SIGKDD (2009)

    Google Scholar 

  10. Li, K., Lu, W., Bhagat, S., Lakshmanan, L.V., Yu, C.: On social event organization. In: SIGKDD (2014)

    Google Scholar 

  11. Liao, G., Zhao, Y., Xie, S., Yu, P.S.: An effective latent networks fusion based model for event recommendation in offline ephemeral social networks. In: CIKM (2013)

    Google Scholar 

  12. Liu, X., He, Q., Tian, Y., Lee, W.C., McPherson, J., Han, J.: Event-based social networks: linking the online and offline social worlds. In: SIGKDD, pp. 1032–1040 (2012)

    Google Scholar 

  13. Lu, E.H.C., Chen, C.Y., Tseng, V.S.: Personalized trip recommendation with multiple constraints by mining user check-in behaviors. In: GIS (2012)

    Google Scholar 

  14. Minkov, E., Charrow, B., Ledlie, J., Teller, S., Jaakkola, T.: Collaborative future event recommendation. In: CIKM (2010)

    Google Scholar 

  15. Pham, T.A.N., Li, X., Cong, G., Zhang, Z.: A general graph-based model for recommendation in event-based social networks. In: ICDE (2015)

    Google Scholar 

  16. She, J., Tong, Y., Chen, L.: Utility-aware social event-participant planning. In: SIGMOD (2015)

    Google Scholar 

  17. She, J., Tong, Y., Chen, L., Cao, C.C.: Conflict-aware event-participant arrangement. In: ICDE (2015)

    Google Scholar 

  18. She, J., Tong, Y., Chen, L., Cao, C.C.: Conflict-aware event-participant arrangement and its variant for online setting. IEEE Trans. Knowl. Data Eng. 28(9), 2281–2295 (2016)

    Article  Google Scholar 

  19. Sun, Y.-C., Chen, C.C.: A novel social event recommendation method based on social and collaborative friendships. In: Jatowt, A., et al. (eds.) SocInfo 2013. LNCS, vol. 8238, pp. 109–118. Springer, Cham (2013). https://doi.org/10.1007/978-3-319-03260-3_10

    Chapter  Google Scholar 

  20. Tong, Y., Cao, C.C., Chen, L.: TCS: efficient topic discovery over crowd-oriented service data, pp. 861–870 (2014)

    Google Scholar 

  21. Tong, Y., She, J., Ding, B., Chen, L., Wo, T., Xu, K.: Online minimum matching in real-time spatial data: experiments and analysis. Proc. VLDB Endow. 9(12), 1053–1064 (2016)

    Article  Google Scholar 

  22. Tong, Y., She, J., Meng, R.: Bottleneck-aware arrangement over event-based social networks: the max-min approach. World Wide Web 19(6), 1151–1177 (2016)

    Article  Google Scholar 

  23. Tong, Y., Wang, L., Zhou, Z., Ding, B., Chen, L., Ye, J., Xu, K.: Flexible online task assignment in real-time spatial data. Proc. VLDB Endow. 10(11), 1334–1345 (2017)

    Article  Google Scholar 

  24. Zhang, W., Wang, J., Feng, W.: Combining latent factor model with location features for event-based group recommendation. In: SIGKDD (2013)

    Google Scholar 

Download references

Acknowledgment

The work has been supported by the National Natural Science Foundation of China (NSFC) under Grant Nos. 61472069, 61402089, 61332006 and U1401256; and the Fundamental Research Funds for the Central Universities under Grant Nos. N161602003 and N171607010.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Junchang Xin .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG, part of Springer Nature

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Xin, J., Li, M., Xu, W., Cai, Y., Lu, M., Wang, Z. (2018). Efficient Complex Social Event-Participant Planning Based on Heuristic Dynamic Programming. In: Pei, J., Manolopoulos, Y., Sadiq, S., Li, J. (eds) Database Systems for Advanced Applications. DASFAA 2018. Lecture Notes in Computer Science(), vol 10828. Springer, Cham. https://doi.org/10.1007/978-3-319-91458-9_16

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-91458-9_16

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-91457-2

  • Online ISBN: 978-3-319-91458-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics