{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,20]],"date-time":"2025-07-20T04:18:57Z","timestamp":1752985137616,"version":"3.37.3"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2023,10,16]],"date-time":"2023-10-16T00:00:00Z","timestamp":1697414400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,10,16]],"date-time":"2023-10-16T00:00:00Z","timestamp":1697414400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61876101","61802234"],"award-info":[{"award-number":["61876101","61802234"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Complex Intell. Syst."],"published-print":{"date-parts":[[2024,4]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Network embedding has been extensively used in several practical applications and achieved great success. However, existing studies mainly focus on single task or single view and cannot obtain deeper relevant information for accomplishing tasks. In this paper, a novel approach is proposed to address the problem of insufficient information consideration in network embedding, which is termed multi-task-oriented adaptive dual-channel graph convolutional network (TAD-GCN). We firstly use kNN graph construction method to generate three views for each network dataset. Then, the proposed TAD-GCN contains dual-channel GCN which can extract the specific and shared embeddings from multiple views simultaneously, and attention mechanism is adopted to fuse them adaptively. In addition, we design similarity constraint and difference constraint to further enhance their semantic similarity and ensure that they capture the different information. Lastly, a multi-task learning module is introduced to solve multiple tasks simultaneously and optimize the model with its losses. The experimental results demonstrate that our model TAD-GCN not only completes multiple downstream tasks at the same time, but also achieves excellent performance compared with eight state-of-the-art methods.<\/jats:p>","DOI":"10.1007\/s40747-023-01250-w","type":"journal-article","created":{"date-parts":[[2023,10,16]],"date-time":"2023-10-16T04:01:21Z","timestamp":1697428881000},"page":"1953-1969","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Multi-view dual-channel graph convolutional networks with multi-task learning"],"prefix":"10.1007","volume":"10","author":[{"given":"Yuting","family":"Ling","sequence":"first","affiliation":[]},{"given":"Yuan","family":"Li","sequence":"additional","affiliation":[]},{"given":"Xiyu","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Jianhua","family":"Qu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,10,16]]},"reference":[{"issue":"5","key":"1250_CR1","doi-asserted-by":"publisher","first-page":"833","DOI":"10.1109\/TKDE.2018.2849727","volume":"31","author":"P Cui","year":"2019","unstructured":"Cui P, Wang X, Pei J, Zhu W (2019) A survey on network embedding. IEEE Trans Knowl Data Eng 31(5):833\u2013852","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"1250_CR2","doi-asserted-by":"crossref","unstructured":"Tang J, Qu M, Wang M, et al (2015) Line: large-scale information network embedding. Proceedings of the 24th international conference on world wide web 1067\u20131077","DOI":"10.1145\/2736277.2741093"},{"key":"1250_CR3","doi-asserted-by":"crossref","unstructured":"Grover A, Leskovec J (2016) node2vec: scalable feature learning for networks. Proceedings of the 22nd ACM SIGKDD international conference on Knowledge discovery and data mining, pp 855\u2013864","DOI":"10.1145\/2939672.2939754"},{"key":"1250_CR4","doi-asserted-by":"crossref","unstructured":"Wang D, Cui P, Zhu W (2016) Structural deep network embedding. Proceedings of the 22nd ACM SIGKDD international conference on Knowledge discovery and data mining, pp 1225\u20131234","DOI":"10.1145\/2939672.2939753"},{"key":"1250_CR5","doi-asserted-by":"crossref","unstructured":"Ribeiro L, Saverese P, Figueiredo D (2017) struc2vec: learning node representations from structural identity[C]. Proceedings of the 23rd ACM SIGKDD international conference on knowledge discovery and data mining, pp 385\u2013394","DOI":"10.1145\/3097983.3098061"},{"key":"1250_CR6","doi-asserted-by":"publisher","first-page":"108215","DOI":"10.1016\/j.patcog.2021.108215","volume":"121","author":"J Wang","year":"2021","unstructured":"Wang J, Liang J, Yao K et al (2021) Graph convolutional autoencoders with co-learning of graph structure and node attributes. Pattern Recognition 121:108215","journal-title":"Pattern Recognition"},{"issue":"3","key":"1250_CR7","doi-asserted-by":"publisher","first-page":"102917","DOI":"10.1016\/j.ipm.2022.102917","volume":"59","author":"A Sc","year":"2022","unstructured":"Sc A, Wei S, Mz A (2022) Structure information learning for neutral links in signed network embedding. Inform Process Manag 59(3):102917","journal-title":"Inform Process Manag"},{"key":"1250_CR8","first-page":"3844","volume":"29","author":"M Defferrard","year":"2016","unstructured":"Defferrard M, Bresson X et al (2016) Convolutional neural networks on graphs with fast localized spectral filtering. Adv Neural Inform Proces Syst 29:3844\u20133852","journal-title":"Adv Neural Inform Proces Syst"},{"key":"1250_CR9","doi-asserted-by":"crossref","unstructured":"Gao H, Huang H (2018) Deep attributed network embedding. Proceedings of the 27th International Joint Conference on Artificial Intelligence (IJCAI)), pp 3364\u20133370","DOI":"10.24963\/ijcai.2018\/467"},{"issue":"7","key":"1250_CR10","doi-asserted-by":"publisher","first-page":"5935","DOI":"10.1109\/TCYB.2021.3064092","volume":"52","author":"J Chen","year":"2021","unstructured":"Chen J, Zhong M, Li J et al (2021) Effective deep attributed network representation learning with topology adapted smoothing. IEEE Transact Cybern 52(7):5935\u20135946","journal-title":"IEEE Transact Cybern"},{"key":"1250_CR11","unstructured":"Huang J, Li Z, Zheng VW et al (2018) Unsupervised multi-view nonlinear graph embedding. In: UAI, pp 319\u2013328"},{"key":"1250_CR12","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2022.103708","volume":"307","author":"K Yao","year":"2022","unstructured":"Yao K, Liang J, Liang J et al (2022) Multi-view graph convolutional networks with attention mechanism. Artif Intell 307:103708","journal-title":"Artif Intell"},{"key":"1250_CR13","first-page":"3155","volume":"18","author":"Z Zhang","year":"2018","unstructured":"Zhang Z, Yang H, Bu J et al (2018) ANRL: attributed network representation learning via deep neural networks. Proc IJCAI 18:3155\u20133161","journal-title":"Proc IJCAI"},{"key":"1250_CR14","unstructured":"Kipf T N, Welling M (2016) Variational graph auto-encoders. arXiv preprint arXiv:1611.07308"},{"issue":"2","key":"1250_CR15","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipm.2020.102443","volume":"58","author":"D Pedronette","year":"2021","unstructured":"Pedronette D, Latecki LJ (2021) Rank-based self-training for graph convolutional networks. Inform Process Manag 58(2):102443","journal-title":"Inform Process Manag"},{"issue":"6","key":"1250_CR16","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipm.2021.102709","volume":"58","author":"W Zhu","year":"2021","unstructured":"Zhu W, Liu S, Liu C (2021) Incorporating syntactic and phonetic information into multimodal word embeddings using graph convolutional networks. Inform Proces Manag 58(6):102709","journal-title":"Inform Proces Manag"},{"key":"1250_CR17","doi-asserted-by":"crossref","unstructured":"Li Q, Han Z, Wu X M (2018) Deeper insights into graph convolutional networks for semi-supervised learning. Proceedings of the 32nd AAAI conference on artificial intelligence, 538\u20133545","DOI":"10.1609\/aaai.v32i1.11604"},{"key":"1250_CR18","unstructured":"Nt H, Maehara T (2019) Revisiting graph neural networks: all we have is low-pass filters. arXiv preprint arXiv. 1905.09550"},{"key":"1250_CR19","unstructured":"Wu F, Souza A, Zhang T, et al (2019) Simplifying graph convolutional networks. Int Conference on Machine Learning. PMLR, pp 6861\u20136871"},{"key":"1250_CR20","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/j.aiopen.2021.01.001","volume":"1","author":"J Zhou","year":"2020","unstructured":"Zhou J, Cui G, Hu S et al (2020) Graph neural networks: a review of methods and applications. AI Open 1:57\u201381","journal-title":"AI Open"},{"issue":"09","key":"1250_CR21","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1007\/s10915-020-01242-9","volume":"47","author":"Y Ding","year":"2020","unstructured":"Ding Y, Wei H, Pan Z et al (2020) Survey of network representation learning. Comput Sci 47(09):52\u201359","journal-title":"Comput Sci"},{"key":"1250_CR22","unstructured":"Hamiltion W, Ying Z, Leskovec J (2017) Inductive representation learning on large graphs. In: Advances in neural information processing systems, p 30"},{"key":"1250_CR23","unstructured":"Veli\u010dkovi\u0107 P, Cucurull G, Casanova A, et al (2017) Graph attention networks. arXiv preprint arXiv.: 1710.10903"},{"key":"1250_CR24","unstructured":"Bruna J, Zaremba W, Szlam A, et al (2014) Spectral networks and locally connected networks on graphs. Proceedings of the 2nd international conference Learning Representation, pp 1\u20135"},{"key":"1250_CR25","unstructured":"Thomas N. Kipf, Max Welling (2017) Semi-supervised classification with graph convolutional networks. Proceedings of ICLR"},{"key":"1250_CR26","doi-asserted-by":"publisher","first-page":"107448","DOI":"10.1016\/j.knosys.2021.107448","volume":"232","author":"D Lai","year":"2021","unstructured":"Lai D, Wang S, Chong Z et al (2021) Task-oriented attributed network embedding by multi-view features. Knowledge-Based Syst 232:107448","journal-title":"Knowledge-Based Syst"},{"key":"1250_CR27","unstructured":"Tran PV (2018) Multi-task graph autoencoders. Adv Neural Inform Process Syst 1811.02798"},{"key":"1250_CR28","unstructured":"Rizi FS, Granitzer M (2020) Multi-task network embedding with adaptive loss weighting. Proceedings of 2020 IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM). IEEE, 1\u20135"},{"issue":"12","key":"1250_CR29","doi-asserted-by":"publisher","first-page":"3324","DOI":"10.1109\/TKDE.2016.2603983","volume":"28","author":"X Zhang","year":"2016","unstructured":"Zhang X, Zhang X, Liu H et al (2016) Multi-task multi-view clustering. IEEE Trans Knowl Data Eng 28(12):3324\u20133338","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"3","key":"1250_CR30","doi-asserted-by":"publisher","first-page":"983","DOI":"10.1109\/TNNLS.2020.3036825","volume":"33","author":"H Huang","year":"2020","unstructured":"Huang H, Song Y, Wu Y et al (2020) Multitask representation learning with multiview graph convolutional networks. IEEE Transact Neural Netw Learn Syst 33(3):983\u2013995","journal-title":"IEEE Transact Neural Netw Learn Syst"},{"key":"1250_CR31","doi-asserted-by":"crossref","unstructured":"Meng Z, Liang S, Bao H, et al (2019) Co-embedding attributed networks. Proceedings of the twelfth ACM international conference on web search and data mining, pp 393\u2013401","DOI":"10.1145\/3289600.3291015"},{"key":"1250_CR32","doi-asserted-by":"crossref","unstructured":"Wang X, Ji H, Shi C, et al (2019) Heterogeneous graph attention network. Proceedings of the WWW\u201919: The World Wide Web Conference, pp 2022\u20132032","DOI":"10.1145\/3308558.3313562"},{"key":"1250_CR33","doi-asserted-by":"crossref","unstructured":"Yang H, Pan S, Zhang P, et al (2018) Binarized attributed network embedding. 2018 IEEE International conference on data mining (ICDM). IEEE, pp 1476\u20131481","DOI":"10.1109\/ICDM.2018.8626170"},{"key":"1250_CR34","unstructured":"Bojchevski A, G\u00a8unnemann S (2018) Deep gaussian embedding of graphs: unsupervised inductive learning via ranking. Proceedings of International Conference on Learning Representations"},{"key":"1250_CR35","doi-asserted-by":"crossref","unstructured":"Perozzi B, Rfou RA, Skiena S (2014) DeepWalk: online learning of social representations. Proceedings of ACM SIGKDD international conference on Knowledge discovery and data mining, pp 701\u2013710","DOI":"10.1145\/2623330.2623732"},{"key":"1250_CR36","doi-asserted-by":"crossref","unstructured":"Wang C, Pan S, Hu R, et al (2019) Attributed graph clustering: a deep Attentional embedding approach. Proceedings of the 28th International Joint Conference on Artificial Intelligence (IJCAI'19). AAAI Press, pp 3670\u20133676","DOI":"10.24963\/ijcai.2019\/509"},{"key":"1250_CR37","first-page":"2973","volume":"2021","author":"J Cheng","year":"2021","unstructured":"Cheng J, Wang Q, Tao Z et al (2021) Multi-view attribute graph convolution networks for clustering. Proceedings of the Twenty-Ninth International Conference on International Joint Conferences on Artificial Intelligence 2021:2973\u20132979","journal-title":"Proceedings of the Twenty-Ninth International Conference on International Joint Conferences on Artificial Intelligence"},{"issue":"2605","key":"1250_CR38","first-page":"2579","volume":"9","author":"L Maaten","year":"2008","unstructured":"Maaten L, Hinton G (2008) Visualizing data using t-SNE. J Mach Learn Res 9(2605):2579\u20132605","journal-title":"J Mach Learn Res"},{"key":"1250_CR39","unstructured":"Ruder S (2017) An overview of multi-task learning in deep neural networks. http:\/\/arxiv.org\/abs\/1706.05098"}],"container-title":["Complex &amp; Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-023-01250-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40747-023-01250-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-023-01250-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,30]],"date-time":"2024-03-30T15:21:35Z","timestamp":1711812095000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40747-023-01250-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,10,16]]},"references-count":39,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2024,4]]}},"alternative-id":["1250"],"URL":"https:\/\/doi.org\/10.1007\/s40747-023-01250-w","relation":{},"ISSN":["2199-4536","2198-6053"],"issn-type":[{"type":"print","value":"2199-4536"},{"type":"electronic","value":"2198-6053"}],"subject":[],"published":{"date-parts":[[2023,10,16]]},"assertion":[{"value":"31 October 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 September 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 October 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}