Skip to main content

An Efficient Approach for Event Prediction Using Collaborative Distance Score of Communities

  • Conference paper
  • First Online:
Distributed Computing and Internet Technology (ICDCIT 2021)

Abstract

An effective technique for prediction of events can capture the evolution of communities and help understand the collaborative trends in massive dataset applications. One major challenge is to find the derived features that can improve the accuracy of ML models in efficient prediction of events in such evolutionary patterns.

It is often observed that a group of researchers associate with another set of researchers having similar interests to pursue some common research goals. A study of such associations forms an essential basis to assess collaboration trends and to predict evolving topics of research. A hallmarked co-authorship dataset such as DBLP plays a vital role in identifying collaborative relationships among the researchers based on their academic interests.

The association between researchers can be calculated by computing their collaborative distance. Refined Classical Collaborative Distance (RCCD) proposed in this paper is an extension of existing Classical Collaborative distance (CCD).

This computed RCCD score is then considered as a derived feature along with other community features for effective prediction of events in DBLP dataset.

The experimental results show that the existing CCD method predicts events with an accuracy of 81.47%, whereas the accuracy of our proposed RCCD method improved to 84.27%. Thus, RCCD has been instrumental in enhancing the accuracy of ML models in the effective prediction of events such as trending research topics.

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 39.99
Price excludes VAT (USA)
  • Available as EPUB and 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

Institutional subscriptions

References

  1. Alamuri, M., Surampudi, B.R., Negi, A.: A survey of distance/similarity measures for categorical data. In: 2014 IJCNN, pp. 1907–1914. IEEE (2014)

    Google Scholar 

  2. Bommakanti, S.R., Panda, S.: Events detection in temporally evolving social networks. In: 2018 ICBK, pp. 235–242. IEEE (2018)

    Google Scholar 

  3. Chakraborty, T., Srinivasan, S., Ganguly, N., Mukherjee, A., Bhowmick, S.: On the permanence of vertices in network communities. In: Proceedings of the 20th ACM SIGKDD, pp. 1396–1405. ACM (2014)

    Google Scholar 

  4. Kong, X., Shi, Y., Yu, S., Liu, J., Xia, F.: Academic social networks: modeling, analysis, mining and applications. J. Network Comput. Appl. 132(3), 86–103 (2019)

    Article  Google Scholar 

  5. Leskovec, J., Lang, K.J., Dasgupta, A., Mahoney, M.W.: Statistical properties of community structure in large social and information networks. In: Proceedings of the 17th ICWWW, pp. 695–704. ACM (2008)

    Google Scholar 

  6. Newman, M.E.: Co-authorship networks and patterns of scientific collaboration. In: Proceedings of the National Academy of Sciences 101(1), pp. 5200–5205. National Acad Sciences (2004)

    Google Scholar 

  7. Papanikolaou, Y., Foulds, J.R., Rubin, T.N., Tsoumakas, G.: Dense distributions from sparse samples: improved gibbs sampling parameter estimators for LDA. J. Mach. Learn Res. 18(1), 2058–2115 (2017)

    MathSciNet  MATH  Google Scholar 

  8. Pereira, F.S., de Amo, S., Gama, J.: Detecting events in evolving social networks through node centrality analysis. In: ECML, pp. 47–60 (2016)

    Google Scholar 

  9. Pradhan, A.K., Mohanty, H., Lal, R.P.: Event detection and aspects in twitter: a bow approach. In: Fahrnberger, G., Gopinathan, S., Parida, L. (eds.) ICDCIT 2019. LNCS, vol. 11319, pp. 194–211. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-05366-6_16

    Chapter  Google Scholar 

  10. Rajita, B.S.A.S., Kumari, D., Panda, S.: A comparative analysis of community detection methods in massive datasets. In: Goel, N., Hasan, S., Kalaichelvi, V. (eds.) MoSICom 2020. LNEE, vol. 659, pp. 174–183. Springer, Singapore (2020). https://doi.org/10.1007/978-981-15-4775-1_19

    Chapter  Google Scholar 

  11. Rajita, B.S.A.S., Ranjan, Y., Umesh, C.T., Panda, S.: Spark-based parallel method for prediction of events. Arabian J. Sci. Eng. 45(4), 3437–3453 (2020). https://doi.org/10.1007/s13369-020-04437-2

    Article  Google Scholar 

  12. Saganowski, S., Bródka, P., Koziarski, M., Kazienko, P.: Analysis of group evolution prediction in complex networks. PLoS ONE 14(10), e0224194 (2019)

    Article  Google Scholar 

  13. Sharma, A., Bhavani, S.D.: A network formation model for collaboration networks. In: Fahrnberger, G., Gopinathan, S., Parida, L. (eds.) ICDCIT 2019. LNCS, vol. 11319, pp. 279–294. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-05366-6_24

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to B. S. A. S. Rajita .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2021 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Rajita, B.S.A.S., Narwa, B.S., Panda, S. (2021). An Efficient Approach for Event Prediction Using Collaborative Distance Score of Communities. In: Goswami, D., Hoang, T.A. (eds) Distributed Computing and Internet Technology. ICDCIT 2021. Lecture Notes in Computer Science(), vol 12582. Springer, Cham. https://doi.org/10.1007/978-3-030-65621-8_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-65621-8_17

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-65620-1

  • Online ISBN: 978-3-030-65621-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics