关键词: 网络切分, 二阶切分, 鲁棒性, 边的权重

Abstract: The objective for this paper is to handle the instability of network partition. Currently, the weight of a network is usually quantified by common measurements, such as mutual information, Pearson coefficient, etc. However, no one dominates the others. The paper proposes a robust partition algorithm, called ROPART. ROPART introduces a second-order partition strategy, to overcome this shortcoming in a robust way. Benchmarked on five common datasets, evaluated by average shortest path and diameter, ROPART shows satisfactory results. In summary, ROPART is a robust strategy in network partition, whose results always belong to the best ones and never oscillate drastically.

Key words: network partition, second-order partition, robustness, edge weight