{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,8]],"date-time":"2025-11-08T13:27:59Z","timestamp":1762608479743},"reference-count":45,"publisher":"Association for Computing Machinery (ACM)","issue":"13","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2021,9]]},"abstract":"<jats:p>\n            Many real-world networks have been evolving, and are finely modeled as temporal graphs from the viewpoint of the graph theory. A temporal graph is informative, and always contains two types of information, i.e., the temporal information and topological information, where the temporal information reflects the time when the relationships are established, and the topological information focuses on the structure of the graph. In this paper, we perform time-topology analysis on temporal graphs to extract useful information. Firstly, a new metric named T-cohesiveness is proposed to evaluate the cohesiveness of a temporal subgraph. It defines the cohesiveness of a temporal subgraph from the time and topology dimensions jointly. Specifically, given a temporal graph\n            <jats:italic>\n              G\n              <jats:sub>s<\/jats:sub>\n            <\/jats:italic>\n            = (\n            <jats:italic>Vs<\/jats:italic>\n            , \u03b5\n            <jats:italic>Es<\/jats:italic>\n            ), cohesiveness in the time dimension reflects whether the connections in\n            <jats:italic>\n              G\n              <jats:sub>s<\/jats:sub>\n            <\/jats:italic>\n            happen in a short period of time, while cohesiveness in the topology dimension indicates whether the vertices in\n            <jats:italic>\n              V\n              <jats:sub>s<\/jats:sub>\n            <\/jats:italic>\n            are densely connected and have few connections with vertices out of\n            <jats:italic>\n              G\n              <jats:sub>s<\/jats:sub>\n            <\/jats:italic>\n            . Then, T-cohesiveness is utilized to perform time-topology analysis on temporal graphs, and two time-topology analysis methods are proposed. In detail, T-cohesiveness evolution tracking traces the evolution of the T-cohesiveness of a subgraph, and combo searching finds out all the subgraphs that contain the query vertex and have T-cohesiveness larger than a given threshold. Moreover, a pruning strategy is proposed to improve the efficiency of combo searching. Experimental results confirm the efficiency of the proposed time-topology analysis methods and the pruning strategy.\n          <\/jats:p>","DOI":"10.14778\/3484224.3484230","type":"journal-article","created":{"date-parts":[[2021,10,28]],"date-time":"2021-10-28T22:36:50Z","timestamp":1635460610000},"page":"3322-3334","source":"Crossref","is-referenced-by-count":5,"title":["Time-topology analysis"],"prefix":"10.14778","volume":"14","author":[{"given":"Yunkai","family":"Lou","sequence":"first","affiliation":[{"name":"Tsinghua University, Beijing, China"}]},{"given":"Chaokun","family":"Wang","sequence":"additional","affiliation":[{"name":"Tsinghua University, Beijing, China"}]},{"given":"Tiankai","family":"Gu","sequence":"additional","affiliation":[{"name":"Tsinghua University, Beijing, China"}]},{"given":"Hao","family":"Feng","sequence":"additional","affiliation":[{"name":"Tsinghua University, Beijing, China"}]},{"given":"Jun","family":"Chen","sequence":"additional","affiliation":[{"name":"Baidu Inc., Beijing, China"}]},{"given":"Jeffrey Xu","family":"Yu","sequence":"additional","affiliation":[{"name":"The Chinese University of Hong Kong, Hong Kong, China"}]}],"member":"320","published-online":{"date-parts":[[2021,10,28]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.14778\/3137628.3137640"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1088\/1742-5468\/2008\/10\/P10008"},{"key":"e_1_2_1_3_1","doi-asserted-by":"crossref","volume-title":"Contextual community search over large social networks","author":"Chen Lu","DOI":"10.1109\/ICDE.2019.00017"},{"key":"e_1_2_1_4_1","volume-title":"Trusses: Cohesive subgraphs for social network analysis. National security agency technical report 16","author":"Cohen Jonathan","year":"2008"},{"key":"e_1_2_1_5_1","volume-title":"Time-frequency analysis","author":"Cohen Leon"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2463722"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2612179"},{"key":"e_1_2_1_8_1","volume-title":"International conference on digital society (icds). 7--12","author":"Dang TA","year":"2012"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3178876.3186125"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3178876.3186125"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/3191835.3191985"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-019-00556-x"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.14778\/3380750.3380756"},{"key":"e_1_2_1_14_1","doi-asserted-by":"crossref","unstructured":"S. Fortunato and D. Hric. 2016. Community detection in networks: A user guide. Physics Reports 659 (Nov. 2016) 1--44.  S. Fortunato and D. Hric. 2016. Community detection in networks: A user guide. Physics Reports 659 (Nov. 2016) 1--44.","DOI":"10.1016\/j.physrep.2016.09.002"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.122653799"},{"key":"e_1_2_1_16_1","volume-title":"Evolutionary community structure discovery in dynamic weighted networks. Physica A: Statistical Mechanics and its Applications 413","author":"Guo Chonghui","year":"2014"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2592798.2592799"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2610495"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/3365087"},{"key":"e_1_2_1_20_1","first-page":"1","article-title":"Node attribute-enhanced community detection in complex networks","volume":"7","author":"Jia Caiyan","year":"2017","journal-title":"Scientific Reports"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.14778\/2850469.2850471"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1217299.1217301"},{"key":"e_1_2_1_23_1","doi-asserted-by":"crossref","unstructured":"I. X. Y. Leung H. Pan P. Lio and J. Crowcroft. 2009. Towards real-time community detection in large networks. Physical review. E Statistical nonlinear and soft matter physics 79 6 Pt 2 (June 2009) 066107.  I. X. Y. Leung H. Pan P. Lio and J. Crowcroft. 2009. Towards real-time community detection in large networks. Physical review. E Statistical nonlinear and soft matter physics 79 6 Pt 2 (June 2009) 066107.","DOI":"10.1103\/PhysRevE.79.066107"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1086\/501508"},{"key":"e_1_2_1_25_1","volume-title":"Jeffrey Xu Yu, and Qiangqiang Dai","author":"Li Rong-Hua","year":"2018"},{"key":"e_1_2_1_26_1","volume-title":"VAC: Vertex-Centric Attributed Community Search. In 2020 IEEE 36th International Conference on Data Engineering (ICDE). IEEE, 937--948","author":"Liu Qing","year":"2020"},{"key":"e_1_2_1_28_1","volume-title":"Efficient Attribute-Constrained Co-Located Community Search. In 2020 IEEE 36th International Conference on Data Engineering (ICDE). IEEE, 1201--1212","author":"Luo Jiehuan","year":"2020"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.5555\/1543767.1543769"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/3018661.3018731"},{"key":"e_1_2_1_31_1","volume-title":"Risk Management and regulation in banking","author":"Pyle David H"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.76.036106"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/3172867"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.5555\/2888116.2888372"},{"key":"e_1_2_1_35_1","volume-title":"Network structure and minimum degree. Social networks 5, 3","author":"Seidman Stephen B","year":"1983"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/1835804.1835923"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/1281192.1281266"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.sbspro.2011.07.055"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.3301758"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.14778\/2794367.2794370"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.5555\/3015812.3015851"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.3301329"},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.14778\/2752939.2752948"},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/2979681"},{"key":"e_1_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3330721"},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2019.2951419"}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/3484224.3484230","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T09:37:42Z","timestamp":1672220262000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/3484224.3484230"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,9]]},"references-count":45,"journal-issue":{"issue":"13","published-print":{"date-parts":[[2021,9]]}},"alternative-id":["10.14778\/3484224.3484230"],"URL":"https:\/\/doi.org\/10.14778\/3484224.3484230","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2021,9]]}}}