Abstract
Dynamic graphs are a data structure widely used in representing changeable relationships or connections between different entities. This paper proposes a novel type of node similarity, based on the frequency of connections between nodes to describe the changeable relationships between entities over a period; this has not been considered before as an indication of similarity between two nodes. In other words, if two entities have a history of frequent connections, this means that they have something in common and have a durable relationship. In this paper, durable relationships describe the frequency of connections rather than only the continuous connection between two nodes. Thus, durable relationships are defined in two dimensions: (i) In the dimension of time, they can be categorized based on the length of duration as short-term, medium-term, or long-term relationships; (ii) Based on frequencies of connections over a period, they can be categorized into four statuses (No Relationship, Weak Relationship, In Relationship, and Strong Relationship). Based on this definition of durable relationships, a node similarity measurement algorithm is proposed, to study the status of relationships from a longitudinal study point of view. This method provides a new way to describe the semantics of relationships (such as collaborative relationships, or customer loyalty descriptions) and also gives a practical application of node similarity measurement in a real world, which is to provide a prediction of relationship. Our extensive experiments have shown that the proposed method can effectively describe durable relationships and especially predict future relationships.
Similar content being viewed by others
References
Backstrom, L., Huttenlocher, D., Kleinberg, J., Lan, X.: Group formation in large social networks: membership, growth, and evolution. In: Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining, pp. 44-54. ACM (2006)
Berlingerio, M., Pinelli, F., Calabrese, F.: Abacus: frequent pattern mining-based community discovery in multidimensional networks. Data Mining and Knowledge Discovery. 27(3), 294–320 (2013)
Qian, G., Sural, S., Gu, Y., Pramanik, S.: Similarity between Euclidean and cosine angle distance for nearest neighbor queries. In: Proceedings of the 2004 ACM symposium on Applied computing, pp. 1232-1237. ACM (2004)
Coogan, S., Arcak, M.: Dynamical properties of a compartmental model for traffic networks. In: Proceedings of the 2014 American Control Conference (ACC), pp. 2511-2516. IEEE (2014)
Cui, W., Xiao, Y., Wang, H., Lu, Y., Wang, W.: Online search of overlapping communities. In: Proceedings of the 2013 ACM SIGMOD international conference on Management of data, pp. 277-288. ACM (2013)
Deza, M. M., Elena D.: Encyclopedia of distances. Encyclopedia of Distances, 1-583. Springer Berlin Heidelberg, 2009
Dice, L.R.: Measures of the amount of ecologic association between species. Ecology. 26(3), 297–302 (1945)
Ding, L., Li, Z., Ji, W., Song, B.: Reachability query of large scale dynamic graph based on improved Huffman coding. Acta Electronica Sinica. 45(2), 359–367 (2017)
Ellison, N.B., Vitak, J., Gray, R., Lampe, C.: Cultivating social resources on social network sites: Facebook relationship maintenance behaviors and their role in social capital processes. Journal of Computer-Mediated Communication. 19(4), 855–870 (2014)
Freitas, A. A. Data mining and knowledge discovery with evolutionary algorithms. Springer Science & Business Media (2013)
Gao, Y., Lin, M., Wang, R.: Adaptive support framework for wisdom web of things. World Wide Web. 16(4), 379–398 (2013)
Guo, T., Wu, J., Zhu, X., Zhang, C.: Combining Structured Node Content and Topology Information for Networked Graph Clustering. ACM Transactions on Knowledge Discovery from Data (TKDD). 11(3), 29 (2017)
Horace, W. II, and John B. N.: Method and system for implementing a custom workspace for a social relationship management system. U.S. Patent Application, 14/828, 466 (2015)
Ipsen, M., Mikhailov, A.S.: Evolutionary reconstruction of networks. Physical Review E. 66(4), 046109 (2002)
Jaccard, P.: Étude comparative de la distribution florale dans une portion des Alpes et des Jura. Bull Soc Vaudoise Sci Nat. 37, 547–579 (1901)
Kusumoto, M., Maehara, T., Kawarabayashi, K. I.: Scalable similarity search for SimRank. In: Proceedings of the 2014 ACM SIGMOD international conference on Management of data, pp. 325-336. ACM (2014)
Li, X., Chang, L., Zheng, K., Huang, Z., Zhou, X.: Ranking weighted clustering coefficient in large dynamic graphs. World Wide Web. 20(5), 855–883 (2017)
Makvana, K., Shah, P., Shah, P.: A novel approach to personalize web search through user profiling and query reformulation. In: Proceedings of the 2014 Data Mining and Intelligent Computing (ICDMIC), pp. 1-10. IEEE (2014)
Ochiai, A.: Zoogeographic studies on the solenoid fishes found in Japan and its neighboring regions. Bull. Jpn. Soc. Sci. Fish. 22(9), 526–530 (1957)
Ren, K., Qian, X.: Research on User Similarity Measurement Method in Collaborative Filtering Algorithm. Computer Engineering. 41(8), 18–22 (2015)
Shang, J., Wang, C., Wang, C., Guo, G., Qian, J.: An attribute-based community search method with graph refining. J. Supercomput. 1-28 (2017). https://doi.org/10.1007/s11227-017-1976-z
Song, B., Ji, W., Ding, L.: Similarity nodes query algorithm on large dynamic graph based on the snapshots. Journal of Computer Applications. 36(2), 358–363 (2016)
Tantipathananandh, C., Berger-Wolf, T., Kempe, D.: A framework for community identification in dynamic social networks. In: Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining, pp. 717-726. ACM (2007)
Wang, T., Qin, Z., Zhang, S., Zhang, C.: Cost-sensitive classification with inadequate labeled data. Information Systems. 37(5), 508–516 (2012)
Wang, J., Song, Y., Leung, T., Rosenberg, C., Wang, J., Philbin, J., Wu, Y.: Learning fine-grained image similarity with deep ranking. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp. 1386-1393. (2014)
Wang, P., Gao, L., Ma, X.: Dynamic community detection based on network structural perturbation and topological similarity. Journal of Statistical Mechanics: Theory and Experiments. 2017(1), 013401 (2017)
Wu, T., Chen, L., Zhong, L., Xian, X.: Predicting the evolution of complex networks via similarity dynamics. Physica A: Statistical Mechanics and its Applications. 465, 662–672 (2017)
Yang, Y., Pei, J., Al-Barakati, A.: Measuring in-network node similarity based on neighborhoods: a unified parametric approach. Knowl Inf Syst, 53, 43-70 (2017)
Yu, Y., Gao, Y., Wang, H., Wang, R. Joint user knowledge and matrix factorization for recommender systems. In International Conference on Web Information Systems Engineering, 77-91. Springer International Publishing, 2016
Yuksel, A., Yuksel, F., Bilim, Y.: Destination attachment: Effects on customer satisfaction and cognitive, affective and conative loyalty. Tourism management. 31(2), 274–284 (2010)
Zhang, S.: Shell-neighbor method and its application in missing data imputation. Applied Intelligence. 35(1), 123–133 (2011)
Zhang, S., Chen, F., Jin, Z., Wang, R.: Mining class-bridge rules based on rough sets, Expert Systems with Applications, Vol.36 (3). Part. 2, 6453–6460 (2009)
Zhang, S., Jin, Z., Zhu, X.: Missing data imputation by utilizing information within incomplete instances. Journal of Systems and Software. 84(3), 452–459 (2011)
Zhu, X., Zhang, S., Jin, Z., Zhang, Z., Xu, Z.: Missing value estimation for mixed-attribute data sets. IEEE Transactions on Knowledge and Data Engineering. 23(1), 110–121 (2011)
Zhu, X., Li, X., Zhang, S., Ju, C., Wu, X.: Robust joint graph sparse coding for unsupervised spectral feature selection. IEEE Transactions on Neural Networks and Learning Systems. 28(6), 1263–1275 (2017a)
Zhu, X., Li, X., Zhang, S., Xu, Z., Yu, L., Wang, C.: Graph PCA Hashing for Similarity Search. IEEE Transactions on Multimedia. (2017b)
Acknowledgements
This work is supported in part by the New Zealand Marsden Fund, the Chinese Scholarship Council, and the National Natural Science Foundation of China under Grant (No.61472169).
Author information
Authors and Affiliations
Corresponding author
Additional information
This article belongs to the Topical Collection: Special Issue on Deep Mining Big Social Data
Guest Editors: Xiaofeng Zhu, Gerard Sanroma, Jilian Zhang, and Brent C. Munsell
Appendix
Appendix
Rights and permissions
About this article
Cite this article
Wang, R., Ji, W. & Song, B. Durable relationship prediction and description using a large dynamic graph. World Wide Web 21, 1575–1600 (2018). https://doi.org/10.1007/s11280-017-0510-9
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11280-017-0510-9