Content Centrality Measure for Networks: Introducing Distance-Based Decay Weights
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 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.
- 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)Google Scholar
- 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)Google Scholar
- 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)Google Scholar
- Newman, M.E.J.: Assortative mixing in networks. Structure 2(4), 5 (2002)Google Scholar
- 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)Google Scholar
- 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)Google Scholar
- 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)Google Scholar
- 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)Google Scholar