检索结果-南通市图书馆

维普期刊数据库

I/O Efficient Early Bursting Cohesive Subgraph Discovery in Massive temporal networks

在线全文

学校读者我要写书评

暂无评论

Journal of Computer Science & Technology 2022年第6期37卷 1337-1355页

作者：李源戴捷范晓林赵宇海王国仁 School of Information Science and Technology North China University of TechnologyBeijing 100144China School of Computer Science and Engineering Northeastern UniversityShenyang 110169China School of Computer Beijing Institute of TechnologyBeijing 100081China

temporal networks are an effective way to encode temporal information into graph data *** the bursting cohesive subgraph(BCS),which accumulates its cohesiveness at the fastest rate,is an important problem in temporal *** BCS has a large number of applications,such as representing emergency events in social media,traffic congestion in road networks and epidemic outbreak in ***,existing methods demand the BCS lasting for a time interval,which neglects the timeliness of the *** this paper,we design an early bursting cohesive subgraph(EBCS)model based on the k-core to enable identifying the burstiness as soon as *** find the EBCS,we first construct a time weight graph(TWG)to measure the bursting level by integrating the topological and temporal ***,we propose a global search algorithm,called GS-EBCS,which can find the exact EBCS by iteratively removing nodes from the ***,we propose a local search algorithm,named LS-EBCS,to find the EBCS by first expanding from a seed node until obtaining a candidate k-core and then refining the k-core to the result subgraph in an optimal time ***,considering the situation that the massive temporal networks cannot be completely put into the memory,we first design an I/O method to build the TWG and then develop I/O efficient global search and local search algorithms,namely I/O-GS and I/O-LS respectively,to find the EBCS under the semi-external *** experiments,conducted on four real temporal networks,demonstrate the efficiency and effectiveness of our proposed *** example,on the DBLP dataset,I/O-LS and LS-EBCS have comparable running time,while the maximum memory usage of I/O-LS is only 6.5 MB,which is much smaller than that of LS-EBCS taking 308.7 MB.

关键词： early bursting cohesive subgraph(EBCS) I/O efficient algorithm semi-external model temporal network

Predictability of real temporal networks

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

National Science Review 2020年第5期7卷 929-937页

作者： Disheng Tang Wenbo Du Louis Shekhtman Yijie Wang Shlomo Havlin Xianbin Cao Gang Yan School of Electronic and Information Engineering Beihang University Shanghai Institute of Intelligence Science and Technology Tongji University network Science Institute Northeastern University Department of Physics Bar Ilan University CAS Center for Excellence in Brain Science and Intelligence Technology Chinese Academy of Sciences National Engineering Laboratory of Big Data Application Technologies of Comprehensive Transportation School of Physics Science and Engineering Tongji University

Links in most real networks often change over time. Such temporality of links encodes the ordering and causality of interactions between nodes and has a profound effect on network dynamics and *** evidence has shown that the temporal nature of links in many real-world networks is not ***, it is challenging to predict temporal link patterns while considering the entanglement between topological and temporal link patterns. Here, we propose an entropy-rate-based framework, based on combined topological–temporal regularities, for quantifying the predictability of any temporal network. We apply our framework on various model networks, demonstrating that it indeed captures the intrinsic topological–temporal regularities whereas previous methods considered only temporal aspects. We also apply our framework on 18 real networks of different types and determine their predictability. Interestingly,we find that, for most real temporal networks, despite the greater complexity of predictability brought by the increase in dimension, the combined topological–temporal predictability is higher than the temporal predictability. Our results demonstrate the necessity for incorporating both temporal and topological aspects of networks in order to improve predictions of dynamical processes.

关键词： temporal network predictability network entropy predictive algorithm

Shortest path of temporal networks:An information spreading-based approach

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Chinese Physics B 2020年第12期29卷 590-596页

作者：马一心薛潇雨蔡萌王伟 College of Cybersecurity Sichuan UniversityChengdu 610065China Cybersecurity Research Institute Sichuan UniversityChengdu 610065China School of Humanities and Social Sciences Xi'an Jiaotong UniversityXi'an 710049China

The shortest path is a widely studied network science problem and has attracted great ***,it draws little attention in temporal networks,in which temporal edges determine information *** this paper,we propose an information spreading-based method to calculate the shortest paths distribution in temporal *** verify our method on both artificial and real-world temporal networks and obtain a good *** further generalize our method to identify influential nodes and found an effective ***,we verify the influential nodes identifying method on four networks.

关键词： temporal network shortest path information spreading

维普期刊数据库

Accumulative Time Based Ranking Method to Reputation Evaluation in Information networks

在线全文

学校读者我要写书评

暂无评论

Journal of Computer Science & Technology 2022年第4期37卷 960-974页

作者：廖好刘启鑫黄泽成陆克中杨志豪张翼成 National Engineering Laboratory on Big Data System Computing Technology College of Computer Science and SoftwareEngineeringShenzhen UniversityShenzhen 518060China Guangdong Province Key Laboratory of Popular High Performance Computers Shenzhen UniversityShenzhen 518060China Guangdong Province Engineering Center of China-Made High Performance Data Computing System College of ComputerScience and Software EngineeringShenzhen UniversityShenzhen 518060China Institute of Big Data Intelligent Management and Decision Shenzhen UniversityShenzhen 518060China Department of Science and Environmental Studies The Education University of Hong KongHong Kong 999077China Department of Physics University of FribourgFribourg 1700Switzerland

Due to over-abundant information on the Web, information filtering becomes a key task for online users to obtain relevant suggestions and how to extract the most related item is always a key topic for researchers in various fields. In this paper, we adopt tools used to analyze complex networks to evaluate user reputation and item quality. In our proposed Accumulative Time Based Ranking (ATR) algorithm, we take into account the growth record of the network to identify the evolution of the reputation of users and the quality of items, by incorporating two behavior weighting factors which can capture the hidden facts on reputation and quality dynamics for each user and item respectively. Our proposed ATR algorithm mainly combines the iterative approach to rank user reputation and item quality with temporal dependence compared with other reputation evaluation methods. We show that our algorithm outperforms other benchmark ranking algorithms in terms of precision and robustness on empirical datasets from various online retailers and the citation datasets among research publications. Therefore, our proposed method has the capability to effectively evaluate user reputation and item quality.

关键词： temporal network behavior dynamics reputation evaluation ranking algorithm

Discovering Cohesive temporal Subgraphs with temporal Density Aware Exploration

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Journal of Computer Science & Technology 2022年第5期37卷 1068-1085页

作者：朱春雪林隆龙袁平鹏金海 National Engineering Research Center for Big Data Technology and System Huazhong University of Science and TechnologyWuhan 430074China Service Computing Technology and System Laboratory Huazhong University of Science and TechnologyWuhan 430074China Cluster and Grid Computing Laboratory Huazhong University of Science and TechnologyWuhan 430074China School of Computer Science and Technology Huazhong University of Science and TechnologyWuhan 430074China

Real-world networks,such as social networks,cryptocurrency networks,and e-commerce networks,always have occurrence time of interactions between *** networks are typically modeled as temporal *** cohesive subgraphs from temporal graphs is practical and essential in numerous data mining applications,since mining cohesive subgraphs gets insights into the time-varying nature of temporal ***,existing studies on mining cohesive subgraphs,such as Densest-Exact and k-truss,are mainly tailored for static graphs(whose edges have no temporal information).Therefore,those cohesive subgraph models cannot indicate both the temporal and the structural characteristics of *** this end,we explore the model of cohesive temporal subgraphs by incorporating both the evolving and the structural characteristics of temporal ***,the volume of time intervals in a temporal network is *** a result,the time complexity of mining temporal cohesive subgraphs is *** efficiently address the problem,we first mine the temporal density distribution of temporal *** by the distribution,we can safely prune many unqualified time intervals with the linear time ***,the remaining time intervals where cohesive temporal subgraphs fall in are examined using the greedy *** results of the experiments on nine real-world temporal graphs indicate that our model outperforms state-of-the-art solutions in efficiency and ***,our model only takes less than two minutes on a million-vertex DBLP and has the highest overall average ranking in EDB and TC metrics.

关键词： temporal network temporal feature distribution cohesive subgraph convex property

Economic importance and structural robustness of the international pesticide trade networks

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Journal of Management Science and Engineering 2023年第4期8卷 512-528页

作者： Jian-An Li Li Wang Wen-Jie Xie Wei-Xing Zhou School of Business East China University of Science and TechnologyShanghai200237China International Elite Engineering School East China University of Science and TechnologyShanghai200237China Research Center for Econophysics East China University of Science and TechnologyShanghai200237China School of Mathematics East China University of Science and TechnologyShanghai200237China

Pesticides are agricultural inputs that can significantly reduce yield losses,regulate plant growth,effectively liberate agricultural productivity,and improve food *** availability of pesticides in economies worldwide is ensured by redistribution through international trade,with different economies playing different roles in this *** this study,we measured and ranked the importance of economies using nine node *** found that the clustering coefficient was negatively correlated with the other eight node metrics,whereas the other eight node metrics were positively correlated with each other and could be grouped into three communities(betweenness;in-degree,PageRank,authority,and in-closeness;out-degree,hub,and out-closeness).We further investigated the structural robustness of international pesticide trade networks proxied by large component size under three types of shocks to economies(node removal in descending,random,and ascending orders).The results showed that,except for the clustering coefficient,international pesticide trade networks are relatively robust under shocks to economies in ascending order but fragile under shocks to economies in descending *** contrast,removing nodes with a clustering coefficient in ascending and descending order yielded similar robustness ***,the structural robustness related to large component size evolved over time and exhibited an inverse U-shaped pattern.

关键词： Econophysics International pesticide trade network temporal network Structural robustness

Dynamics of air transport networks：A review from a complex systems perspective

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Chinese Journal of Aeronautics 2017年第2期30卷 469-478页

作者： Luis E.C.Rocha Department of Public Health Sciences Karolinska Institutet Stockholm 17177 Sweden Department of Mathematics University of Namur 5000 Belgium

Air transport systems are highly dynamic at temporal scales from minutes to *** dynamic behavior not only characterizes the evolution of the system but also affect the system＇s *** the evolutionary mechanisms is thus fundamental in order to better design optimal air transport networks that benefits companies,passengers and the *** this review,we briefly present and discuss the state-of-the-art on time-evolving air transport *** distinguish the structural analysis of sequences of network snapshots,ideal for long-term network evolution（*** evolution）,and temporal paths,preferred for short-term dynamics（*** evolution）.We emphasize that most previous research focused on the first modeling approach（***-term） whereas only a few studies look at high-resolution temporal *** conclude the review highlighting that much research remains to be done,both to apply already available methods and to develop new measures for temporal paths on air transport *** particular,we identify that the study of delays,network resilience and optimization of resources（aircraft and crew） are critical topics.

关键词： Air transport Airport network Complex network Dynamic network temporal network

维普期刊数据库

Identifying Vital Nodes on temporal networks: An Edge-Based K-Shell Decomposition

在线全文

学校读者我要写书评

暂无评论

Identifying Vital Nodes on Temporal Networks: An Edge-Based ...