Multiview Temporal Graph Clustering

As an emerging task, temporal graph clustering (TGC) is committed to clustering nodes on temporal graphs through interaction sequence-based batch-processing patterns. These patterns allow for more flexibility in finding a balance between time and space requirements than adjacency matrix-based static...

Full description

Saved in:
Bibliographic Details
Published inIEEE transaction on neural networks and learning systems Vol. PP; pp. 1 - 14
Main Authors Liu, Meng, Liang, Ke, Yu, Hao, Meng, Lingyuan, Wang, Siwei, Zhou, Sihang, Liu, Xinwang
Format Journal Article
LanguageEnglish
Published United States IEEE 15.07.2025
Subjects
Online AccessGet full text

Cover

Loading…
Abstract As an emerging task, temporal graph clustering (TGC) is committed to clustering nodes on temporal graphs through interaction sequence-based batch-processing patterns. These patterns allow for more flexibility in finding a balance between time and space requirements than adjacency matrix-based static graph clustering. However, as a new task, TGC still has important unresolved challenges, such as insufficient information. This challenge manifests itself in a variety of problems in real-world datasets, including missing features (eigenvalues are missing or even nonexistent), long-tail nodes (most inactive nodes have little interaction), and noisy data (data is subject to anomalies, errors, and sparsity). These problems occur before training, making it difficult for the model to train well with insufficient information. To solve the challenge, we propose a method that introduces multiview clustering (MVC) into TGC, called MVTGC. Our method aims to perform data augmentation on the temporal graph by constructing multiple views to increase the information richness. In particular, we utilize different techniques to model a certain part of the temporal graph to generate enhanced views focusing on different angles. These views are combined into training through early fusion and late fusion and ultimately enhance the model's receptive field and information richness. Comparative experiments and a case study on real-world datasets demonstrate the significance and effectiveness of MVTGC, which achieves at most 10.48% performance improvement. The code and data are available at https://github.com/MGitHubL/MVTGC
AbstractList As an emerging task, temporal graph clustering (TGC) is committed to clustering nodes on temporal graphs through interaction sequence-based batch-processing patterns. These patterns allow for more flexibility in finding a balance between time and space requirements than adjacency matrix-based static graph clustering. However, as a new task, TGC still has important unresolved challenges, such as insufficient information. This challenge manifests itself in a variety of problems in real-world datasets, including missing features (eigenvalues are missing or even nonexistent), long-tail nodes (most inactive nodes have little interaction), and noisy data (data is subject to anomalies, errors, and sparsity). These problems occur before training, making it difficult for the model to train well with insufficient information. To solve the challenge, we propose a method that introduces multiview clustering (MVC) into TGC, called MVTGC. Our method aims to perform data augmentation on the temporal graph by constructing multiple views to increase the information richness. In particular, we utilize different techniques to model a certain part of the temporal graph to generate enhanced views focusing on different angles. These views are combined into training through early fusion and late fusion and ultimately enhance the model's receptive field and information richness. Comparative experiments and a case study on real-world datasets demonstrate the significance and effectiveness of MVTGC, which achieves at most 10.48% performance improvement. The code and data are available at https://github.com/MGitHubL/MVTGC.As an emerging task, temporal graph clustering (TGC) is committed to clustering nodes on temporal graphs through interaction sequence-based batch-processing patterns. These patterns allow for more flexibility in finding a balance between time and space requirements than adjacency matrix-based static graph clustering. However, as a new task, TGC still has important unresolved challenges, such as insufficient information. This challenge manifests itself in a variety of problems in real-world datasets, including missing features (eigenvalues are missing or even nonexistent), long-tail nodes (most inactive nodes have little interaction), and noisy data (data is subject to anomalies, errors, and sparsity). These problems occur before training, making it difficult for the model to train well with insufficient information. To solve the challenge, we propose a method that introduces multiview clustering (MVC) into TGC, called MVTGC. Our method aims to perform data augmentation on the temporal graph by constructing multiple views to increase the information richness. In particular, we utilize different techniques to model a certain part of the temporal graph to generate enhanced views focusing on different angles. These views are combined into training through early fusion and late fusion and ultimately enhance the model's receptive field and information richness. Comparative experiments and a case study on real-world datasets demonstrate the significance and effectiveness of MVTGC, which achieves at most 10.48% performance improvement. The code and data are available at https://github.com/MGitHubL/MVTGC.
As an emerging task, temporal graph clustering (TGC) is committed to clustering nodes on temporal graphs through interaction sequence-based batch-processing patterns. These patterns allow for more flexibility in finding a balance between time and space requirements than adjacency matrix-based static graph clustering. However, as a new task, TGC still has important unresolved challenges, such as insufficient information. This challenge manifests itself in a variety of problems in real-world datasets, including missing features (eigenvalues are missing or even nonexistent), long-tail nodes (most inactive nodes have little interaction), and noisy data (data is subject to anomalies, errors, and sparsity). These problems occur before training, making it difficult for the model to train well with insufficient information. To solve the challenge, we propose a method that introduces multiview clustering (MVC) into TGC, called MVTGC. Our method aims to perform data augmentation on the temporal graph by constructing multiple views to increase the information richness. In particular, we utilize different techniques to model a certain part of the temporal graph to generate enhanced views focusing on different angles. These views are combined into training through early fusion and late fusion and ultimately enhance the model's receptive field and information richness. Comparative experiments and a case study on real-world datasets demonstrate the significance and effectiveness of MVTGC, which achieves at most 10.48% performance improvement. The code and data are available at https://github.com/MGitHubL/MVTGC
As an emerging task, temporal graph clustering (TGC) is committed to clustering nodes on temporal graphs through interaction sequence-based batch-processing patterns. These patterns allow for more flexibility in finding a balance between time and space requirements than adjacency matrix-based static graph clustering. However, as a new task, TGC still has important unresolved challenges, such as insufficient information. This challenge manifests itself in a variety of problems in real-world datasets, including missing features (eigenvalues are missing or even nonexistent), long-tail nodes (most inactive nodes have little interaction), and noisy data (data is subject to anomalies, errors, and sparsity). These problems occur before training, making it difficult for the model to train well with insufficient information. To solve the challenge, we propose a method that introduces multiview clustering (MVC) into TGC, called MVTGC. Our method aims to perform data augmentation on the temporal graph by constructing multiple views to increase the information richness. In particular, we utilize different techniques to model a certain part of the temporal graph to generate enhanced views focusing on different angles. These views are combined into training through early fusion and late fusion and ultimately enhance the model's receptive field and information richness. Comparative experiments and a case study on real-world datasets demonstrate the significance and effectiveness of MVTGC, which achieves at most 10.48% performance improvement. The code and data are available at https://github.com/MGitHubL/MVTGC.
Author Zhou, Sihang
Wang, Siwei
Liang, Ke
Meng, Lingyuan
Yu, Hao
Liu, Xinwang
Liu, Meng
Author_xml – sequence: 1
  givenname: Meng
  orcidid: 0000-0003-3900-4204
  surname: Liu
  fullname: Liu, Meng
  email: mengliuedu@163.com
  organization: College of Computer Science and Technology, National University of Defense Technology, Changsha, China
– sequence: 2
  givenname: Ke
  orcidid: 0000-0002-4837-455X
  surname: Liang
  fullname: Liang, Ke
  organization: College of Computer Science and Technology, National University of Defense Technology, Changsha, China
– sequence: 3
  givenname: Hao
  orcidid: 0000-0001-9044-4841
  surname: Yu
  fullname: Yu, Hao
  organization: College of Computer Science and Technology, National University of Defense Technology, Changsha, China
– sequence: 4
  givenname: Lingyuan
  orcidid: 0000-0002-2489-573X
  surname: Meng
  fullname: Meng, Lingyuan
  organization: College of Computer Science and Technology, National University of Defense Technology, Changsha, China
– sequence: 5
  givenname: Siwei
  orcidid: 0000-0001-9517-262X
  surname: Wang
  fullname: Wang, Siwei
  organization: Intelligent Game and Decision Laboratory, Beijing, China
– sequence: 6
  givenname: Sihang
  orcidid: 0000-0003-1491-4594
  surname: Zhou
  fullname: Zhou, Sihang
  organization: College of Intelligence Science and Technology, National University of Defense Technology, Changsha, China
– sequence: 7
  givenname: Xinwang
  orcidid: 0000-0001-9066-1475
  surname: Liu
  fullname: Liu, Xinwang
  email: xinwangliu@nudt.edu.cn
  organization: College of Computer Science and Technology, National University of Defense Technology, Changsha, China
BackLink https://www.ncbi.nlm.nih.gov/pubmed/40663658$$D View this record in MEDLINE/PubMed
BookMark eNpFkE1Lw0AQhhep2Fr7B0Sk4MVL6uxXNjlK0SrUerCCt2WzmWgkX-4miv_e1NY6l3cOzzswzzEZVHWFhJxSmFEK8dV6tVo-zRgwOeMyEjwSB2TEaMgCxqNosN_Vy5BMvH-HfkKQoYiPyFBAGPJQRiNy8dAVbf6Z49d0jWVTO1NMF840b9N50fkWXV69npDDzBQeJ7sck-fbm_X8Llg-Lu7n18vAMqXaIEpYysBkGQhQSkgUHAUISQFSllkwKqWWW5qBTSjGykQJQhybJE7SzCbAx-Rye7dx9UeHvtVl7i0Whamw7rzmjINkknPZo-c7tEtKTHXj8tK4b_33WA-wLWBd7b3DbI9Q0BuB-leg3gjUO4F96WxbyhHxv0BBxUxJ_gMVm2p_
CODEN ITNNAL
ContentType Journal Article
DBID 97E
RIA
RIE
AAYXX
CITATION
NPM
7X8
DOI 10.1109/TNNLS.2025.3584384
DatabaseName IEEE All-Society Periodicals Package (ASPP) 2005–Present
IEEE All-Society Periodicals Package (ASPP) 1998–Present
IEEE Electronic Library (IEL)
CrossRef
PubMed
MEDLINE - Academic
DatabaseTitle CrossRef
PubMed
MEDLINE - Academic
DatabaseTitleList MEDLINE - Academic

PubMed
Database_xml – sequence: 1
  dbid: NPM
  name: PubMed
  url: https://proxy.k.utb.cz/login?url=http://www.ncbi.nlm.nih.gov/entrez/query.fcgi?db=PubMed
  sourceTypes: Index Database
– sequence: 2
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://proxy.k.utb.cz/login?url=https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EISSN 2162-2388
EndPage 14
ExternalDocumentID 40663658
10_1109_TNNLS_2025_3584384
11079275
Genre orig-research
Journal Article
GrantInformation_xml – fundername: Major Program Project of Xiangjiang Laboratory
  grantid: 24XJJCYJ01002
– fundername: National Natural Science Foundation of China
  grantid: 62276271; 62441618; 62376279
– fundername: National Natural Science Foundation of China for Distinguished Young Scholar
  grantid: 62325604
GroupedDBID 0R~
4.4
5VS
6IK
97E
AAJGR
AARMG
AASAJ
AAWTH
ABAZT
ABQJQ
ABVLG
ACIWK
ACPRK
AENEX
AFRAH
AGQYO
AHBIQ
AKJIK
AKQYR
ALMA_UNASSIGNED_HOLDINGS
ATWAV
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
EBS
IFIPE
IPLJI
JAVBF
M43
MS~
O9-
OCL
PQQKQ
RIA
RIE
RNS
AAYXX
AGSQL
CITATION
EJD
RIG
NPM
7X8
ID FETCH-LOGICAL-c277t-8b2d20aff0407745e43e4045100d2fc0a7d1c3c1f0cb1e97a8be099ab9bdfcb03
IEDL.DBID RIE
ISSN 2162-237X
2162-2388
IngestDate Sun Jul 27 13:58:54 EDT 2025
Thu Jul 17 02:09:01 EDT 2025
Wed Jul 16 16:48:30 EDT 2025
Wed Aug 27 02:13:42 EDT 2025
IsPeerReviewed false
IsScholarly true
Language English
License https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html
https://doi.org/10.15223/policy-029
https://doi.org/10.15223/policy-037
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c277t-8b2d20aff0407745e43e4045100d2fc0a7d1c3c1f0cb1e97a8be099ab9bdfcb03
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ORCID 0000-0002-4837-455X
0000-0001-9066-1475
0000-0003-3900-4204
0000-0001-9044-4841
0000-0002-2489-573X
0000-0001-9517-262X
0000-0003-1491-4594
PMID 40663658
PQID 3230525335
PQPubID 23479
PageCount 14
ParticipantIDs pubmed_primary_40663658
proquest_miscellaneous_3230525335
ieee_primary_11079275
crossref_primary_10_1109_TNNLS_2025_3584384
PublicationCentury 2000
PublicationDate 2025-07-15
PublicationDateYYYYMMDD 2025-07-15
PublicationDate_xml – month: 07
  year: 2025
  text: 2025-07-15
  day: 15
PublicationDecade 2020
PublicationPlace United States
PublicationPlace_xml – name: United States
PublicationTitle IEEE transaction on neural networks and learning systems
PublicationTitleAbbrev TNNLS
PublicationTitleAlternate IEEE Trans Neural Netw Learn Syst
PublicationYear 2025
Publisher IEEE
Publisher_xml – name: IEEE
SSID ssj0000605649
Score 2.4735734
Snippet As an emerging task, temporal graph clustering (TGC) is committed to clustering nodes on temporal graphs through interaction sequence-based batch-processing...
SourceID proquest
pubmed
crossref
ieee
SourceType Aggregation Database
Index Database
Publisher
StartPage 1
SubjectTerms Clustering methods
Data models
Focusing
Graph learning
Heavily-tailed distribution
Learning systems
Matrix decomposition
multiview clustering (MVC)
Noise measurement
Reliability
Sparse matrices
temporal graph clustering (TGC)
Training
Title Multiview Temporal Graph Clustering
URI https://ieeexplore.ieee.org/document/11079275
https://www.ncbi.nlm.nih.gov/pubmed/40663658
https://www.proquest.com/docview/3230525335
Volume PP
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV07T8MwELZoJxbKo0B5KQg2lNaxnTgZUUWpEGShlbpF8SMLVYsgWfj13DlJEUiV2DI4rztb9313vs-E3IpEAvnnHHUquS9kQf1YJeAQrHbmMlKxxQbnlzSazsXTIlw0zequF8Za6zaf2SFeulq-WesKU2Uj5CoJk2GHdIC51c1am4QKBWAeObjLgoj5jMtF2yRDk9EsTZ9fgQ6ycMgh5vJY_ApE7mSV7SDTBZtJj6TtZ9Z7TN6GVamG-uuPguO__2Of7DWw07uv58kB2bGrQ9Jrj3TwmhV-RG5cQy6WC7xZLVq19B5R09obLyvUVIBI1yfzycNsPPWbcxR8zaQswfjMMJoXBSxYQHuhFdwK1JWh1LBC01yaQHMdFFSrwIKLYmUBOOYqUabQivJj0l2tV_aUeNxIGhvMFslCaBUpI3IFnM4oXQS5EQNy1xo1e6_lMjJHM2iSORdk6IKsccGA9NE4PyMbuwzIdeuIDGY7ljDylV1XnxkHxhQygKgw5qT20OZugegJANXZlqeek118OSZmg_CCdMuPyl4CoijVlZtJ3xlCxQs
linkProvider IEEE
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV1LT-MwEB5BOSwXHruwlNcGwQ2ldWwnTo4IAWW35EKReoviRy6LWgTNhV_PjJMUgYTELQcncuazNd_MeD4DnMlMYfAvBOlUilCqioWpzhAQqnaWKtGpowbnuzwZPci_03jaNqv7XhjnnD985gb06Gv5dm5qSpUNKVbJuIpXYQ0dfxw17VrLlApDap54wsujhIdcqGnXJsOy4STPx_cYEPJ4INDrilR-cEX-bpWvaaZ3N9ebkHcTbU6Z_B_UCz0wr580HL_9J1uw0RLP4KJZKduw4mY_YbO71CFo9_gvOPUtuVQwCCaNbNVjcEOq1sHlY02qCujrduDh-mpyOQrbmxRCw5VaoPm55aysKtyyyPdiJ4WTpCzDmOWVYaWykREmqpjRkUOQUu2QOpY607Yymold6M3mM7cHgbCKpZbyRaqSRifaylJjVGe1qaLSyj6cd0YtnhrBjMIHGiwrPAQFQVC0EPRhh4zzPrK1Sx9OOiAKXO9UxChnbl6_FAJjppgjScUxvxuElm9L4k9Iqfa_-Oof-DGa3I2L8W3-7wDWaSKUpo3iQ-gtnmt3hPxioY_9qnoDjyjIVA
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Multiview+Temporal+Graph+Clustering&rft.jtitle=IEEE+transaction+on+neural+networks+and+learning+systems&rft.au=Liu%2C+Meng&rft.au=Liang%2C+Ke&rft.au=Yu%2C+Hao&rft.au=Meng%2C+Lingyuan&rft.date=2025-07-15&rft.issn=2162-2388&rft.eissn=2162-2388&rft.volume=PP&rft_id=info:doi/10.1109%2FTNNLS.2025.3584384&rft.externalDBID=NO_FULL_TEXT
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2162-237X&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2162-237X&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2162-237X&client=summon