Advertisement

Temporal Dependency Between Evolution of Features and Dynamic Social Networks

  • Kashfia SailunazEmail author
  • Jon Rokne
  • Reda Alhajj
Chapter
Part of the Lecture Notes in Social Networks book series (LNSN)

Abstract

The complexity of analyzing dynamic social network data is higher than static networks because of the nature of the data itself. Nodes and links of dynamic social networks are unlabeled, not identically distributed and the effect of different features of the network evolves over time with the evolution of the network links. Changes in features of nodes initiate the changes in links and groups of the network and vice versa. The correlation between these changes is not parallel which makes things more complicated. The temporal effect increases the complexity of the evaluation by adding another vital parameter to the problem. In this paper, the effect of the temporal dependency on dynamic social network evolution was examined using a real life social media dataset. By extracting the most prominent features of the network after a specific time period with an unsupervised feature selection method, we computed the correlation between their evolution which was not uniformly distributed over the time span.

References

  1. 1.
    Aggarwal, C., & Subbian, K. (2014). Evolutionary network analysis: A survey. ACM Computing Surveys (CSUR), 47(1), 10.CrossRefGoogle Scholar
  2. 2.
    Blum, A. L., & Langley, P. (1997). Selection of relevant features and examples in machine learning. Artificial Intelligence, 97(1), 245–271.CrossRefGoogle Scholar
  3. 3.
    Bolon-Canedo, V., Sanchez-Marono, N., & Alonso-Betanzos, A. (2013). A review of feature selection methods on synthetic data. Knowledge and Information Systems, 34(3):483–519.CrossRefGoogle Scholar
  4. 4.
    Cai, D., Zhang, C., & He, X. (July 2010). Unsupervised feature selection for multi-cluster data. In Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (pp. 333–342). New York: ACM.Google Scholar
  5. 5.
    Chandrashekar, G., & Sahin, F. (2014). A survey on feature selection methods. Computers & Electrical Engineering, 40(1):16–28.CrossRefGoogle Scholar
  6. 6.
    He, X., Cai, D., & Niyogi, P. (2005). Laplacian score for feature selection, advances in neural information processing systems. In Proceeding NIPS’05 Proceedings of the 18th International Conference on Neural Information Processing Systems (pp. 507–514). Cambridge: MIT.Google Scholar
  7. 7.
    Li, J., Hu, X., Jian, L., & Liu, H. (December 2016). Toward time-evolving feature selection on dynamic networks. In 2016 IEEE 16th International Conference on Data Mining (ICDM) (pp. 1003–1008).Google Scholar
  8. 8.
    Li, J., Hu, X., Tang, J., & Liu, H. (October 2015). Unsupervised streaming feature selection in social media. In Proceedings of the 24th ACM International on Conference on Information and Knowledge Management (pp. 1041–1050). New York: ACM.Google Scholar
  9. 9.
    Li, J., Hu, X., Wu, L., & Liu, H. (June 2016). Robust unsupervised feature selection on networked data. In Proceedings of the 2016 SIAM International Conference on Data Mining, Society for Industrial and Applied Mathematics (pp. 387–395).Google Scholar
  10. 10.
    Liu, H., Motoda, H., Setiono, R., & Zhao, Z. (2010) Feature selection: An ever evolving frontier in data mining. Feature Selection in Data Mining, 10, 4–13.Google Scholar
  11. 11.
    Liu, H., & Yu, L. (2005). Toward integrating feature selection algorithms for classification and clustering. IEEE Transactions on Knowledge and Data Engineering, 17(4), 491–502.CrossRefGoogle Scholar
  12. 12.
    Liu, J., Ji, S., & Ye, J. (June 2009). Multi-task feature learning via efficient l 2, 1-norm minimization. In Proceedings of the Twenty-Fifth Conference on Uncertainty in Artificial Intelligence (pp. 339–348). Arlington: AUAI Press.Google Scholar
  13. 13.
    Molina, L. C., Belanche, L., & Nebot, A. (2002). Feature selection algorithms: A survey and experimental evaluation. In Proceedings of 2002 IEEE International Conference on 2002, IEEE. Data Mining, 2002. ICDM 2003 (pp. 306–313).Google Scholar
  14. 14.
    Peter, J. S., Carrington, J., & Wasserman, S. (February 2005). Models and methods in social network analysis. Cambridge: Cambridge University Press.Google Scholar
  15. 15.
    Saeys, Y., Inza, I., & Larranaga, P. (2007). A review of feature selection techniques in bioinformatics. Bioinformatics, 23(19), 2507–2517.CrossRefGoogle Scholar
  16. 16.
    Statista (2017). Number of social media users worldwide from 2010 to 2021 (in billions). [Online]. Available: https://www.statista.com/statistics/278414/number-of-worldwide-social-network-users/
  17. 17.
    Tang, J., Hu, X., Gao, H., & Liu, H. (May 2013) Unsupervised feature selection for multi-view data in social media. In Proceedings of the 2013 SIAM International Conference on Data Mining, Society for Industrial and Applied Mathematics (pp. 270–278).CrossRefGoogle Scholar
  18. 18.
    Tang, J., & Liu, H. (April 2012). Feature selection with linked data in social media. In Proceedings of the 2012 SIAM International Conference on Data Mining, Society for Industrial and Applied Mathematics (pp. 118–128).CrossRefGoogle Scholar
  19. 19.
    Tang, J., & Liu, H. (August 2012). Unsupervised feature selection for linked social media data. In Proceedings of the 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (pp. 904–912). New York: ACM.Google Scholar
  20. 20.
    Tang, J., & Liu, H. (May 2013). Coselect: Feature selection with instance selection for social media data. In Proceedings of the 2013 SIAM International Conference on Data Mining, Society for Industrial and Applied Mathematics (pp. 695–703).CrossRefGoogle Scholar
  21. 21.
    Tang, L., & Liu, H. (June 2009). Relational learning via latent social dimensions. In Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (pp. 817–826). New York: ACM.Google Scholar
  22. 22.
    Tylenda, T., Angelova, R., & Bedathur, S. (June 2009). Towards time-aware link prediction in evolving social networks. In Proceedings of the 3rd Workshop on Social Network Mining and Analysis (p. 9). New York: ACM.Google Scholar
  23. 23.
    Wang, X., Tang, L., Liu, H., & Wang, L. (2012). Learning with multi-resolution overlapping communities. Knowledge and Information Systems (KAIS), 36, 517–535.CrossRefGoogle Scholar
  24. 24.
    Yu, L., & Liu, H. (2013). Feature selection for high-dimensional data: A fast correlation-based filter solution. In Proceedings of the 20th International Conference on Machine Learning (ICML-03) (pp. 856–863).Google Scholar

Copyright information

© Springer Nature Switzerland AG 2018

Authors and Affiliations

  1. 1.Department of Computer ScienceUniversity of CalgaryCalgaryCanada

Personalised recommendations