Abstract
Many real-world data can be represented as networks in which the vertices and edges represent data entities and the interrelationship between them, respectively. The discovery of network clusters, which are typical latent structures, is one of the most significant tasks of network analytics. Currently, there are no effective approaches that are able to deal with linked data with features from multimodality. To address it, we propose an effective model for learning latent factors in linked multimodality data, named as LFLMD. Given the link structure and multimodality features associated with vertices, LFLMD formulates a constrained optimization problem to learn corresponding latent spaces representing the strength that each vertex belongs to the latent components w.r.t. link structure and multimodality features. Besides, LFLMD further adopts an effective method to model the affinity between pairwise vertices so that the cluster membership for each vertex can be revealed by grouping vertices sharing more similar latent structures. For model inference, a series of iterative algorithms for updating the variables in the latent spaces are derived. LFLMD has been tested on several sets of networked data with different modalities of features and it is found LFLMD is very effective.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Fortunato, S.: Community detection in graphs. Phys. Rep. 486(3–5), 75–174 (2010)
He, T., Chan, K.C.C.: Evolutionary community detection in social networks. In: Proceedings of CEC 2014, Beijing, pp. 1496–1503 (2014)
Hu, L., Chan, K.C.C.: Fuzzy clustering in a complex network based on content relevance and link structures. IEEE TFS 24(2), 456–470 (2016)
He, T., Chan, K.C.C.: Evolutionary graph clustering for protein complex identification. IEEE/ACM TCBB 15(3), 892–904 (2018)
Chang, L., Li, W., Qin, L., Zhang, W., Yang, S.: pSCAN: fast and exact structural graph clustering. IEEE TKDE 29(2), 387–401 (2017)
Frey, B.J., Dueck, D.: Clustering by passing messages between data points. Science 16, 972–976 (2007)
Luxburg, U.: A tutorial on spectral clustering. Stat. Comput. 17(4), 395–426 (2007)
Shi, J., Malik, J.: Normalized cuts and image segmentation. IEEE TPAMI 22(8), 888–905 (2000)
Veldt, N., Gleich, D.F., Wirth, A.: A correlation clustering framework for community detection. In: Proceedings of WWW 2018, Lyon, pp. 439–448 (2018)
Yang, J., McAuley, J., Leskovec, J.: Detecting cohesive and 2-mode communities in directed and undirected networks. In: Proceedings of WSDM 2014, New York, pp. 323–332 (2014)
MacKay, D.J.C.: Information Theory, Inference, and Learning Algorithms. Cambridge University Press, Cambridge (2003)
Guo, T., Wu, J., Zhu, X., Zhang, C.: Combining structured node content and topology information for networked graph clustering. ACM Trans. Knowl. Disc. Data (TKDD) 11(3), 29 (2017)
Yang, J., McAuley, J., Leskovec, J.: Community detection in networks with node attributes. In: Proceedings of ICDM 2013, Dallas, pp. 1151–1156 (2013)
Bao, Q., Cheung, W.K., Zhang, Y., Liu, J.: A component-based diffusion model with structural diversity for social networks. IEEE TCYB 47(4), 1078–1089 (2017)
He, T., Chan, K.C.C.: MISAGA: an algorithm for mining interesting sub-graphs in attributed graphs. IEEE TCYB 48(5), 1369–1382 (2018)
He, T., Chan, K.C.C.: Discovering fuzzy structural patterns for graph analytics. IEEE TFS (2018). https://doi.org/10.1109/TFUZZ.2018.2791951
Dempster, A., Laird, N., Rubin, D.: Maximum likelihood from incomplete data via the EM algorithm. J. R. Stat. Soc. B 39, 1–38 (1977)
Wang, F., Li, T., Wang, X., Zhu, S., Ding, C.: Community discovery using nonnegative matrix factorization. Data Min. Knowl. Disc. 22, 493–521 (2011)
Akata, Z., Thurau, C., Bauckhage, C.: Non-negative matrix factorization in multimodality data for segmentation and label prediction. In: Proceedings of CVWW 2011, Mitterberg, pp. 1–8 (2011)
Greene, D., Cunningham, P.: Producing a unified graph representation from multiple social network views. In: Proceedings of WebSci 2013, Paris, pp. 1–4 (2013)
Lu, Q., Getoor, L.: Link-based classification. In: Proceedings of ICML 2003, Washington DC, pp. 189–207 (2003)
Yang, B., Liu, J., Feng, J.: On the spectral characterization and scalable mining of network communities. IEEE TKDE 24(2), 326–337 (2012)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer Nature Switzerland AG
About this paper
Cite this paper
He, T., Chan, K.C.C. (2018). Learning Latent Factors in Linked Multi-modality Data. In: Ceci, M., Japkowicz, N., Liu, J., Papadopoulos, G., RaÅ›, Z. (eds) Foundations of Intelligent Systems. ISMIS 2018. Lecture Notes in Computer Science(), vol 11177. Springer, Cham. https://doi.org/10.1007/978-3-030-01851-1_21
Download citation
DOI: https://doi.org/10.1007/978-3-030-01851-1_21
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-01850-4
Online ISBN: 978-3-030-01851-1
eBook Packages: Computer ScienceComputer Science (R0)