CHIEF : clustering With higher-order motifs in big networks
- Xia, Feng, Yu, Shuo, Liu, Chengfei, Li, Jianxin, Lee, Ivan
- Authors: Xia, Feng , Yu, Shuo , Liu, Chengfei , Li, Jianxin , Lee, Ivan
- Date: 2022
- Type: Text , Journal article
- Relation: IEEE Transactions on Network Science and Engineering Vol. 9, no. 3 (2022), p. 990-1005
- Full Text:
- Reviewed:
- Description: Clustering network vertices is an enabler of various applications such as social computing and Internet of Things. However, challenges arise for clustering when networks increase in scale. This paper proposes CHIEF (Clustering with HIgher-ordEr motiFs), a solution which consists of two motif clustering techniques: standard acceleration CHIEF-ST and approximate acceleration CHIEF-AP. Both algorithms firstly find the maximal $k$-edge-connected subgraphs within the target networks to lower the network scale by optimizing the network structure with maximal $k$-edge-connected subgraphs, and then use heterogeneous four-node motifs clustering in higher-order dense networks. For CHIEF-ST, we illustrate that all target motifs will be kept after this procedure when the minimum node degree of the target motif is equal or greater than $k$. For CHIEF-AP, we prove that the eigenvalues of the adjacency matrix and the Laplacian matrix are relatively stable after this step. CHIEF offers an improved efficiency of motif clustering for big networks, and it verifies higher-order motif significance. Experiments on real and synthetic networks demonstrate that the proposed solutions outperform baseline approaches in large network analysis, and higher-order motifs outperform traditional triangle motifs in clustering. © 2022 IEEE Computer Society. All rights reserved.
- Authors: Xia, Feng , Yu, Shuo , Liu, Chengfei , Li, Jianxin , Lee, Ivan
- Date: 2022
- Type: Text , Journal article
- Relation: IEEE Transactions on Network Science and Engineering Vol. 9, no. 3 (2022), p. 990-1005
- Full Text:
- Reviewed:
- Description: Clustering network vertices is an enabler of various applications such as social computing and Internet of Things. However, challenges arise for clustering when networks increase in scale. This paper proposes CHIEF (Clustering with HIgher-ordEr motiFs), a solution which consists of two motif clustering techniques: standard acceleration CHIEF-ST and approximate acceleration CHIEF-AP. Both algorithms firstly find the maximal $k$-edge-connected subgraphs within the target networks to lower the network scale by optimizing the network structure with maximal $k$-edge-connected subgraphs, and then use heterogeneous four-node motifs clustering in higher-order dense networks. For CHIEF-ST, we illustrate that all target motifs will be kept after this procedure when the minimum node degree of the target motif is equal or greater than $k$. For CHIEF-AP, we prove that the eigenvalues of the adjacency matrix and the Laplacian matrix are relatively stable after this step. CHIEF offers an improved efficiency of motif clustering for big networks, and it verifies higher-order motif significance. Experiments on real and synthetic networks demonstrate that the proposed solutions outperform baseline approaches in large network analysis, and higher-order motifs outperform traditional triangle motifs in clustering. © 2022 IEEE Computer Society. All rights reserved.
Subgraph adaptive structure-aware graph contrastive learning
- Chen, Zhikui, Peng, Yin, Yu, Shuo, Cao, Chen, Xia, Feng
- Authors: Chen, Zhikui , Peng, Yin , Yu, Shuo , Cao, Chen , Xia, Feng
- Date: 2022
- Type: Text , Journal article
- Relation: Mathematics (Basel) Vol. 10, no. 17 (2022), p. 3047
- Full Text:
- Reviewed:
- Description: Graph contrastive learning (GCL) has been subject to more attention and been widely applied to numerous graph learning tasks such as node classification and link prediction. Although it has achieved great success and even performed better than supervised methods in some tasks, most of them depend on node-level comparison, while ignoring the rich semantic information contained in graph topology, especially for social networks. However, a higher-level comparison requires subgraph construction and encoding, which remain unsolved. To address this problem, we propose a subgraph adaptive structure-aware graph contrastive learning method (PASCAL) in this work, which is a subgraph-level GCL method. In PASCAL, we construct subgraphs by merging all motifs that contain the target node. Then we encode them on the basis of motif number distribution to capture the rich information hidden in subgraphs. By incorporating motif information, PASCAL can capture richer semantic information hidden in local structures compared with other GCL methods. Extensive experiments on six benchmark datasets show that PASCAL outperforms state-of-art graph contrastive learning and supervised methods in most cases.
- Authors: Chen, Zhikui , Peng, Yin , Yu, Shuo , Cao, Chen , Xia, Feng
- Date: 2022
- Type: Text , Journal article
- Relation: Mathematics (Basel) Vol. 10, no. 17 (2022), p. 3047
- Full Text:
- Reviewed:
- Description: Graph contrastive learning (GCL) has been subject to more attention and been widely applied to numerous graph learning tasks such as node classification and link prediction. Although it has achieved great success and even performed better than supervised methods in some tasks, most of them depend on node-level comparison, while ignoring the rich semantic information contained in graph topology, especially for social networks. However, a higher-level comparison requires subgraph construction and encoding, which remain unsolved. To address this problem, we propose a subgraph adaptive structure-aware graph contrastive learning method (PASCAL) in this work, which is a subgraph-level GCL method. In PASCAL, we construct subgraphs by merging all motifs that contain the target node. Then we encode them on the basis of motif number distribution to capture the rich information hidden in subgraphs. By incorporating motif information, PASCAL can capture richer semantic information hidden in local structures compared with other GCL methods. Extensive experiments on six benchmark datasets show that PASCAL outperforms state-of-art graph contrastive learning and supervised methods in most cases.
Deep matrix factorization for trust-aware recommendation in social networks
- Wan, Liangtian, Xia, Feng, Kong, Xiangjie, Hsu, Ching-Hsien, Huang, Runhe, Ma, Jianhua
- Authors: Wan, Liangtian , Xia, Feng , Kong, Xiangjie , Hsu, Ching-Hsien , Huang, Runhe , Ma, Jianhua
- Date: 2021
- Type: Text , Journal article
- Relation: IEEE Transactions on Network Science and Engineering Vol. 8, no. 1 (2021), p. 511-528
- Full Text:
- Reviewed:
- Description: Recent years have witnessed remarkable information overload in online social networks, and social network based approaches for recommender systems have been widely studied. The trust information in social networks among users is an important factor for improving recommendation performance. Many successful recommendation tasks are treated as the matrix factorization problems. However, the prediction performance of matrix factorization based methods largely depends on the matrixes initialization of users and items. To address this challenge, we develop a novel trust-aware approach based on deep learning to alleviate the initialization dependence. First, we propose two deep matrix factorization (DMF) techniques, i.e., linear DMF and non-linear DMF to extract features from the user-item rating matrix for improving the initialization accuracy. The trust relationship is integrated into the DMF model according to the preference similarity and the derivations of users on items. Second, we exploit deep marginalized Denoising Autoencoder (Deep-MDAE) to extract the latent representation in the hidden layer from the trust relationship matrix to approximate the user factor matrix factorized from the user-item rating matrix. The community regularization is integrated in the joint optimization function to take neighbours' effects into consideration. The results of DMF are applied to initialize the updating variables of Deep-MDAE in order to further improve the recommendation performance. Finally, we validate that the proposed approach outperforms state-of-the-art baselines for recommendation, especially for the cold-start users. © 2013 IEEE.
- Authors: Wan, Liangtian , Xia, Feng , Kong, Xiangjie , Hsu, Ching-Hsien , Huang, Runhe , Ma, Jianhua
- Date: 2021
- Type: Text , Journal article
- Relation: IEEE Transactions on Network Science and Engineering Vol. 8, no. 1 (2021), p. 511-528
- Full Text:
- Reviewed:
- Description: Recent years have witnessed remarkable information overload in online social networks, and social network based approaches for recommender systems have been widely studied. The trust information in social networks among users is an important factor for improving recommendation performance. Many successful recommendation tasks are treated as the matrix factorization problems. However, the prediction performance of matrix factorization based methods largely depends on the matrixes initialization of users and items. To address this challenge, we develop a novel trust-aware approach based on deep learning to alleviate the initialization dependence. First, we propose two deep matrix factorization (DMF) techniques, i.e., linear DMF and non-linear DMF to extract features from the user-item rating matrix for improving the initialization accuracy. The trust relationship is integrated into the DMF model according to the preference similarity and the derivations of users on items. Second, we exploit deep marginalized Denoising Autoencoder (Deep-MDAE) to extract the latent representation in the hidden layer from the trust relationship matrix to approximate the user factor matrix factorized from the user-item rating matrix. The community regularization is integrated in the joint optimization function to take neighbours' effects into consideration. The results of DMF are applied to initialize the updating variables of Deep-MDAE in order to further improve the recommendation performance. Finally, we validate that the proposed approach outperforms state-of-the-art baselines for recommendation, especially for the cold-start users. © 2013 IEEE.
Predicting mental health problems with personality, behavior, and social networks
- Zhang, Dongyu, Guo, Teng, Han, Shiyu, Vahabli, Sadaf, Naseriparsa, Mehdi, Xia, Feng
- Authors: Zhang, Dongyu , Guo, Teng , Han, Shiyu , Vahabli, Sadaf , Naseriparsa, Mehdi , Xia, Feng
- Date: 2021
- Type: Text , Conference paper
- Relation: 2021 IEEE International Conference on Big Data, Big Data 2021, virtual online, 15-18 December 2021, Proceedings - 2021 IEEE International Conference on Big Data, Big Data 2021 p. 4537-4546
- Full Text:
- Reviewed:
- Description: Mental health is an integral part of human health and well-being. Unhealthy mentality leads to serious consequences such as self-mutilation and suicide, especially for college students. While the literature focused on analysing the relationship between mental health and a single factor such as personality or behavior, accurate prediction is yet to be achieved due to the lack of cross-dimensional analysis and multi-dimensional joint prediction. To this end, this work proposes leveraging multiple factors from three crucial dimensions of mental health: behaviors, personality, and social networks. We recruited 490 college students, and collected their behavioral records from smart cards. In addition, we extracted their psychological traits from questionnaires, and social networks by conducting the survey on the nominating community members. We created a neural network-based model to integrate behavioral, psychological, and social network factors to predict mental health problems. The experimental results verify the efficacy of the proposed model, and demonstrate that the classification model of various factors effectively predicts the students' mental issues. © 2021 IEEE.
- Authors: Zhang, Dongyu , Guo, Teng , Han, Shiyu , Vahabli, Sadaf , Naseriparsa, Mehdi , Xia, Feng
- Date: 2021
- Type: Text , Conference paper
- Relation: 2021 IEEE International Conference on Big Data, Big Data 2021, virtual online, 15-18 December 2021, Proceedings - 2021 IEEE International Conference on Big Data, Big Data 2021 p. 4537-4546
- Full Text:
- Reviewed:
- Description: Mental health is an integral part of human health and well-being. Unhealthy mentality leads to serious consequences such as self-mutilation and suicide, especially for college students. While the literature focused on analysing the relationship between mental health and a single factor such as personality or behavior, accurate prediction is yet to be achieved due to the lack of cross-dimensional analysis and multi-dimensional joint prediction. To this end, this work proposes leveraging multiple factors from three crucial dimensions of mental health: behaviors, personality, and social networks. We recruited 490 college students, and collected their behavioral records from smart cards. In addition, we extracted their psychological traits from questionnaires, and social networks by conducting the survey on the nominating community members. We created a neural network-based model to integrate behavioral, psychological, and social network factors to predict mental health problems. The experimental results verify the efficacy of the proposed model, and demonstrate that the classification model of various factors effectively predicts the students' mental issues. © 2021 IEEE.
- «
- ‹
- 1
- ›
- »