Zhan Bu

Zhan Bu

Auto-generated profile, based on publicly available information

Zhan Bu

Jiangsu Provincial Key Laboratory of E-Business, Nanjing University of Finance and Economics, Nanjing, China

Research Focus & Metrics

Academic Career Length

15Years (2012-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
5 May 2016 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
HLHuijia Li
Huijia Li
ZBZhan Bu
Zhan Bu
ALAihua Li
Aihua Li
ZLZhidong Liu
Zhidong Liu
YSYong Shi
Yong Shi
Mining communities or clusters in networks is valuable in analyzing, designing, and optimizing many natural and engineering complex systems, e.g., protein networks, power grid, and transportation systems. Most of the existing techniques view the community mining problem as an optimization problem based on a given quality function(e.g., modularity), however none of them are grounded with a systematic theory to identify the central nodes in the network. Moreover, how to reconcile the mining efficiency and the community quality still remains an open problem. In this paper, we attempt to address the above challenges by introducing a novel algorithm. First, a kernel function with a tunable influence factor is proposed to measure the leadership of each node, those nodes with highest local leadership can be viewed as the candidate central nodes. Then, we use a discrete-time dynamical system to describe the dynamical assignment of community membership; and formulate the serval conditions to guarantee the convergence of each node's dynamic trajectory, by which the hierarchical community structure of the network can be revealed. The proposed dynamical system is independent of the quality function used, so could also be applied in other community mining models. Our algorithm is highly efficient: the computational complexity analysis shows that the execution time is nearly linearly dependent on the number of nodes in sparse networks. We finally give demonstrative applications of the algorithm to a set of synthetic benchmark networks and also real-world networks to verify the algorithmic performance.

5 March 2019 in IEEE Transactions on Systems, Man, and Cybernetics: Systems
Verified
Journal Article
Closed access
JCJie Cao
Jie Cao
ZBZhan Bu
Zhan Bu
YWYuyao Wang
Yuyao Wang
HYHuan Yang
Huan Yang
JJJ. Jiang
J. Jiang
HLHuijia Li
Huijia Li

19 December 2019 in IEEE Transactions on Industrial Informatics
Verified
Journal Article
Closed access
HLHuijia Li
Huijia Li
ZBZhan Bu
Zhan Bu
ZWZhen Wang
Zhen Wang
JCJie Cao
Jie Cao
In many electronic commerce systems, detecting significant clusters is of great value to the analysis, design, and optimization of the commerce behaviors. In this article, we propose a new dynamical approach to detect the cluster configuration fast and accurately which can be applied to electronic commerce systems. First, we analyze the two-stage game in which the leader group members make contributions prior to the follower group, and propose an exact index, i.e., the leadership, to characterize the key leaders. Then an efficient dynamical system is used to guarantee the cluster configuration converges to an optimal state, which assigns each node to the corresponding cluster based on quality optimization, repeatedly. Our method is of high efficiency-the exponential term in the proposed dynamical system makes the convergence to be very fast with a nearly linear time. Extensive experiments on multiple types of datesets demonstrate the state-of-the-art performance of proposed method.

7 March 2019 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
ZBZhan Bu
Zhan Bu
HLHuijia Li
Huijia Li
CZChengcui Zhang
Chengcui Zhang
JCJie Cao
Jie Cao
ALAihua Li
Aihua Li
YSYong Shi
Yong Shi
With the explosion of social media networks, many modern applications are concerning about people's connections, which leads to the so-called social computing. An elusive question is to study how opinion communities form and evolve in real-world networks with great individual diversity and complex human connections. In this paper, we attempt to model a realistic social media network as a discrete-time dynamical system, where the opinion matrix and the community structure could mutually affect each other. The community detection in social media networks is naturally formulated as a multi-objective optimization problem, i.e., finding a set of densely connected components with similar opinion vectors. We propose a novel and powerful graph K-means framework, which is composed of three coupled phases in each discrete-time period. Specifically, the first phase uses a fast heuristic approach to identify those opinion leaders who have relatively high local reputation; the second phase adopts a novel dynamic game model to find the locally Pareto-optimal community structure; the final phase employs a robust opinion dynamics model to simulate the evolution of the opinion matrix. We conduct a series of comprehensive experiments on real-world benchmark networks to validate the performance of GK-means through comparisons with the state-of-the-art graph clustering technologies.

28 November 2017 in IEEE Transactions on Cybernetics
Verified
Journal Article
Closed access
ZBZhan Bu
Zhan Bu
HLHuijia Li
Huijia Li
JCJie Cao
Jie Cao
ZWZhen Wang
Zhen Wang
GGGuangliang Gao
Guangliang Gao
Besides the topological structure, there are additional information, i.e., node attributes, on top of the plain graphs. Usually, these systems can be well modeled by attributed graphs, where nodes represent component actors, a set of attributes describe users' portraits and edges indicate their connections. An elusive question associated with attributed graphs is to study how clusters with common internal properties form and evolve in real-world networked systems with great individual diversity, which leads to the so-called problem of attributed graph clustering (AGC). In this paper, we comprehended AGC naturally as a dynamic cluster formation game (DCFG), where each node's feasible action set can be constrained by every cluster in a discrete-time dynamical system. Specifically, we carried out a deep research on a special case of finite dynamic games, named dynamic social game (DSG), the convergence of the finite Nash equilibrium sequence in a DSG was also proved strictly. By carefully defining the feasible action set and the utility function associated with each node, the proposed DCFG can be well related to a DSG; and we showed that a balanced solution of AGC could be found by solving a finite set of coupled static Nash equilibrium problems in the related DCFG. We, finally, proposed a self-learning algorithm, which can start from any arbitrary initial cluster configuration, and, finally, find the corresponding balanced solution of AGC, where all nodes and clusters are satisfied with the final cluster configuration. Extensive experiments were applied on real-world social networks to demonstrate both effectiveness and scalability of the proposed approach by comparing with the state-of-the-art graph clustering methods in the literature.

1 September 2013 in Knowledge-Based Systems
Verified
Journal Article
Closed access
ZBZhan Bu
Zhan Bu
CZChengcui Zhang
Chengcui Zhang
ZXZhengyou Xia
Zhengyou Xia
JWJiandong Wang
Jiandong Wang