Abstract
We propose a novel centrality measure that is called Content Centrality for a given network that considers the feature vector of each node generated from its posting activities in social media, its own properties and so forth, in order to extract nodes who have neighbors with similar features. We assume that nodes with similar features are located near each other and unevenly distributed over a network, and the density gradually or rapidly decreases according to the distance from the center of the feature distribution (node). We quantify the degree of the feature concentration around each node by calculating the cosine similarity between the feature vector of each node and the resultant vector of its neighbors with distance-based decay weights, then rank all the nodes according to the value of cosine similarities. In experimental evaluations with three real networks, we confirm the validity of the centrality rankings and discuss the relation between the estimated parameters and the nature of nodes.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
We use the term “content distribution” in the same sense with “feature distribution”.
- 2.
- 3.
- 4.
References
Bonacich, P.: Power and centrality: a family of measures. Am. J. Sociol. 92(5), 1170–1182 (1987)
Cheng, Y.: Mean shift, mode seeking, and clustering. IEEE Trans. Pattern Anal. Mach. Intell. 17(8), 790–799 (1995)
Clauset, A., Newman, M.E.J., Moore, C.: Finding community structure in very large networks. Phys. Rev. E 70(6), 66111 (2004)
Domingos, P.: Mining social networks for viral marketing. IEEE Intell. Syst. 20(1), 80–82 (2005)
Gruhl, D., Guha, R., Liben-Nowell, D., Tomkins, A.: Information diffusion through blog space. In: Proceedings of the 13th International Conference on World Wide Web, WWW 2004, pp. 491–501. ACM, New York (2004)
Kuramochi, T., Okada, N., Tanikawa, K., Hijikata, Y., Nishida, S.: Community extracting using intersection graph and content analysisin complex network. In: Proceedings of the 2012 IEEE/WIC/ACM International Joint Conferences on Web Intelligence and Intelligent Agent Technology, vol. 1 WI-IAT 2012, pp. 222–229. IEEE Computer Society, Washington, DC, USA (2012)
Langville, A.N., Meyer, C.D.: Deeper inside page rank. Int. Math. 1(3), 335–380 (2004)
Natarajan, N., Sen, P., Chaoji, V.: Community detection in content-sharing social networks. In: Proceedings of the 2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2013, pp. 82–89. ACM, New York, NY, USA (2013)
Newman, M.E.J.: Assortative mixing in networks. Structure 2(4), 5 (2002)
Newman, M.E.J.: The structure and function of complex networks. SIAM Rev. 45, 167–256 (2003)
Newman, M.E.J.: Finding community structure in networks using the eigenvectors ofmatrices. Phys. Rev. E 74(3), 36104 (2006)
Newman, M.E.J., Forrest, S., Balthrop, J.: Email networks and the spread of computer viruses. Phys. Rev. E 66, 035101 (2002)
Parzen, E.: On estimation of a probability density function and mode. Ann. Math. Statist. 33(3), 1065–1076 (1962)
Sun, J., Papadimitriou, S., Lin, C.-Y., Cao, N., Liu, S., Qian, W.: Multivis: Content-based social network exploration through multi-wayvisual analysis. In: SIAM International Conference on Data Mining, pp. 1064–1075. SIAM (2009)
Ting, I.-H., Wang, S.-L., Chi, H.-M., Wu, J.-S.: Content matters: A study of hate groups detection based on social networks analysis and web mining. In: Proceedings of the 2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2013, pp. 1196–1201. ACM, New York, NY, USA (2013)
Wu, Y., Jin, R., Zhu, X., Zhang, X.: Finding dense and connected subgraphs in dual networks. In: Proceedings of the IEEE 31st International Conference on Data Engineering (ICDE2015), pp. 915–926 (2015)
Yang, T., Jin, R., Chi, Y., Zhu, S.: Combining link and content for community detection: A discriminative approach. In: Proceedings of the 15th ACM SIGKDD International Conferenceon Knowledge Discovery and Data Mining, KDD 2009, pp. 927–936. ACM, New York, NY, USA (2009)
Zhou, Y., Cheng, H., Yu, J.X.: Graph clustering based on structural/attribute similarities. Proc. VLDB Endow. 2(1), 718–729 (2009)
Acknowledgements
This work was supported by JSPS KAKENHI Grant No. 15J00735 and by NII’s strategic open-type collaborative research. In our experiments, we used recipe data provided by Cookpad and the National Institute of Informatics.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing AG
About this paper
Cite this paper
Fushimi, T., Satoh, T., Saito, K., Kazama, K., Kando, N. (2016). Content Centrality Measure for Networks: Introducing Distance-Based Decay Weights. In: Spiro, E., Ahn, YY. (eds) Social Informatics. SocInfo 2016. Lecture Notes in Computer Science(), vol 10047. Springer, Cham. https://doi.org/10.1007/978-3-319-47874-6_4
Download citation
DOI: https://doi.org/10.1007/978-3-319-47874-6_4
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-47873-9
Online ISBN: 978-3-319-47874-6
eBook Packages: Computer ScienceComputer Science (R0)