activity
20152023
most citedTracking Influential Nodes in Dynamic Networks

35 citations · 47 across the 9 of their papers we have counts for

collaborators

9 papers

cs.CV2023★ 5 cited

Recognizing Unseen Objects via Multimodal Intensive Knowledge Graph Propagation

Likang Wu, Zhi Li, Hongke Zhao +5

Zero-Shot Learning (ZSL), which aims at automatically recognizing unseen objects, is a promising learning paradigm to understand new real-world knowledge for machines continuously.…

cs.DS2019

Finding Route Hotspots in Large Labeled Networks

Mingtao Lei, Xi Zhang, Lingyang Chu +3

In many advanced network analysis applications, like social networks, e-commerce, and network security, hotspots are generally considered as a group of vertices that are tightly co…

cs.DB2018★ 1 cited

Mining Top-k Sequential Patterns in Database Graphs:A New Challenging Problem and a Sampling-based Approach

Mingtao Lei, Lingyang Chu, Zhefeng Wang

In many real world networks, a vertex is usually associated with a transaction database that comprehensively describes the behaviour of the vertex. A typical example is the social…

cs.SI2018★ 3 cited

Tracking Top-K Influential Vertices in Dynamic Networks

Yu Yang, Zhefeng Wang, Tianyuan Jin +2

Influence propagation in networks has enjoyed fruitful applications and has been extensively studied in literature. However, only very limited preliminary studies tackled the chall…

cs.SI2018★ 1 cited

Mining Density Contrast Subgraphs

Yu Yang, Lingyang Chu, Yanyan Zhang +3

Dense subgraph discovery is a key primitive in many graph mining applications, such as detecting communities in social networks and mining gene correlation from biological data. Mo…

cs.DB2017

Finding Theme Communities from Database Networks

Lingyang Chu, Zhefeng Wang, Jian Pei +3

Given a database network where each vertex is associated with a transaction database, we are interested in finding theme communities. Here, a theme community is a cohesive subgraph…

cs.SI2016★ 2 cited

Activity Maximization by Effective Information Diffusion in Social Networks

Zhefeng Wang, Yu Yang, Jian Pei +1

In a social network, even about the same information the excitements between different pairs of users are different. If you want to spread a piece of new information and maximize t…

cs.SI2016★ 35 cited

Tracking Influential Nodes in Dynamic Networks

Yu Yang, Zhefeng Wang, Jian Pei +1

In this paper, we tackle a challenging problem inherent in a series of applications: tracking the influential nodes in dynamic networks. Specifically, we model a dynamic network as…

cs.SI2015

Information Coverage Maximization in Social Networks

Zhefeng Wang, Enhong Chen, Qi Liu +3

Social networks, due to their popularity, have been studied extensively these years. A rich body of these studies is related to influence maximization, which aims to select a set o…