Skip to main content

A Novel Diversity Measure for Understanding Movie Ranks in Movie Collaboration Networks

  • Conference paper
  • First Online:
Advances in Knowledge Discovery and Data Mining (PAKDD 2017)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 10234))

Included in the following conference series:

  • 3768 Accesses

Abstract

We are interested in the relationship between the team composition and the outcome in the filmmaking process. We studied the “diversity” of the group of actors and directors and how it is related to the movie rank given by the audience. The “diversity” is considered as the representation of the degree of variety based on the possibilities of collaborations among its actors and directors. Their collaboration network for the movie was first generated from the “background” network of the collaborations from other works. Then a shortest-path method together with the Adamic/Adar method are used to form indirect links. Finally the “complete” collaboration network can be generated and the “diversity” measures are thus defined accordingly. We experimented on the France and Germany datasets and identified consistent patterns: the lower the “diversity” is, the lower the movie rank will be. We also demonstrated that a subset of our diversity measures were effective in the binary classification task for movie ranks, while the advantages are prone to Precision/Recall depending on the specific dataset. This further shows that the “diversity” measure is feasible and effective in distinguishing movie ranks.

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 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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

Notes

  1. 1.

    www.imdb.com/interfaces.

References

  1. Watts, D.J., Strogatz, S.H.: Collective dynamics of small-world networks. Nature 393(6684), 440–442 (1998)

    Article  Google Scholar 

  2. Adamic, L.A., Adar, E.: Friends and neighbors on the web. Soc. Netw. 25(3), 211–230 (2003)

    Article  Google Scholar 

  3. Liben-Nowell, D., Kleinberg, J.: The link-prediction problem for social networks. J. Am. Soc. Inf. Sci. Technol. 58(7), 1019–1031 (2007)

    Article  Google Scholar 

  4. Murata, T., Moriyasu, S.: Link prediction of social networks based on weighted proximity measures. In: Web Intelligence, IEEE/WIC/ACM international conference on, pp. 85–88. IEEE (2007)

    Google Scholar 

  5. Davis, D., Lichtenwalter, R., Chawla, N.V.: Multi-relational link prediction in heterogeneous information networks. In: International Conference on Advances in Social Networks Analysis and Mining (ASONAM), pp. 281–288. IEEE (2011)

    Google Scholar 

  6. Newman, M.E.J.: Scientific collaboration networks. II. Shortest paths, weighted networks, centrality. Phys. Rev. E 64(1), 016132 (2001)

    Article  Google Scholar 

  7. Onnela, J.-P., Saramäki, J., Kertész, J., Kaski, K.: Intensity and coherence of motifs in weighted complex networks. Phys. Rev. E 71(6), 065103 (2005)

    Article  Google Scholar 

  8. Bishop, C.M.: Pattern recognition. Mach. Learn. 128 (2006)

    Google Scholar 

  9. Amaral, L.A.N., Scala, A., Barthelemy, M., Stanley, H.E.: Classes of small-world networks. Proc. Nat. Acad. Sci. 97(21), 11149–11152 (2000)

    Article  Google Scholar 

  10. Newman, M.E.J., Watts, D.J., Strogatz, S.H.: Random graph models of social networks. Proc. Nat. Acad. Sci. 99(suppl 1), 2566–2572 (2002)

    Article  MATH  Google Scholar 

  11. Ramasco, J.J., Dorogovtsev, S.N., Pastor-Satorras, R.: Self-organization of collaboration networks. Phys. Rev. E 70(3), 036106 (2004)

    Article  Google Scholar 

  12. Kameshwaran, S., Pandit, V., Mehta, S., Viswanadham, N., Dixit, K.: Outcome aware ranking in interaction networks. In: Proceedings of the 19th ACM International Conference on Information and Knowledge Management, pp. 229–238. ACM (2010)

    Google Scholar 

  13. Abbasi, A., Altmann, J.: On the correlation between research performance and social network analysis measures applied to research collaboration networks. In: 44th Hawaii International Conference on System Sciences (HICSS), pp. 1–10. IEEE (2011)

    Google Scholar 

Download references

Acknowledgements

This work is supported by the National Natural Science Foundation of China (Grant Nos. 61373051, 61472159, 61572227).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Zhe Wang .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Ma, M., Pang, W., Huang, L., Wang, Z. (2017). A Novel Diversity Measure for Understanding Movie Ranks in Movie Collaboration Networks. In: Kim, J., Shim, K., Cao, L., Lee, JG., Lin, X., Moon, YS. (eds) Advances in Knowledge Discovery and Data Mining. PAKDD 2017. Lecture Notes in Computer Science(), vol 10234. Springer, Cham. https://doi.org/10.1007/978-3-319-57454-7_58

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-57454-7_58

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-57453-0

  • Online ISBN: 978-3-319-57454-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics