一种具有等级结构的无标度网络模型

无标度网络的发现,使人类对于复杂网络的认识进入了一个新的天地.为了更好地描述真实网络的主要拓扑特性,主要研究复杂网络的演化机制,提出了一种通过边的迭代方式生成一种等级网络模型的方法.在此模型的基础上对网络的统计特性进行了理论推导,并通过计算机编程仿真了它的统计特性.理论计算和数值仿真结果可知,迭代生成的网络具有等级结构,度分布服从幂律分布,幂指数在2到3之间可调,平均路径长度以网络规模呈对数形式增长和较大的聚类系数.从而有效地论证了具有等级结构的网络模型很好地符合实际网络,说明实际网络的无标度和高聚类是等级网络自组织的结果.     

给定平均连接度的无标度网络演化模型

由于Internet、www等网络的复杂性，需要构造符合真实网络特性的仿真网络来对其进行研究。在BA模型的基础上，提出了一种给定平均连接度无标度网络演化模型，网络生长时，按照概率pk添加k个连接。通过速率方程证明了该网络是节点度分布符合幂律分布的无标度网络，其幂指数为-3，且平均连接度为给定值。仿真结果和理论计算值很好地吻合。     

一种无尺度网络上垃圾邮件蠕虫的传播模型

用有向图描述了电子邮件网络的结构,并分析了电子邮件网络的无尺度特性。在此基础上,通过用户检查邮件的频率和打开邮件附件的概率建立了一种电子邮件蠕虫的传播模型。分别仿真了电子邮件蠕虫在无尺度网络和随机网络中的传播,结果表明,邮件蠕虫在无尺度网络中的传播速度比在随机网络中更快,与理论分析相一致。     

Scale-free fully informed particle swarm optimization algorithm

This paper proposes a novel PSO algorithm, referred to as SFIPSO (Scale-free fully informed particle swarm optimization). In the proposed algorithm a modified Barabási-Albert (BA) model [4] is used as a self-organizing construction mechanism, in order to adaptively generate the population topology exhibiting scale-free property. The swarm population is divided into two subpopulations: the active particles and the inactive particles. The former fly around the solution space to find the global optima; whereas the latter are iteratively activated by the active particles via attaching to them, according to their own degrees, fitness values, and spatial positions. Therefore, the topology will be gradually generated as the construction process and the optimization process progress synchronously. Moreover, the cognitive effect and the social effect on the variance of a particle’s velocity vector are distributed by its “contextual fitness” value, and the social effect is further distributed via a time-varying weighted fully informed mechanism that originated from [27]. It is proved by the results of comparative experiments carried out on eight benchmark test functions that the scale-free population topology construction mechanism and the weighted fully informed learning strategy can provide the swarm population with stronger diversity during the convergent process. As a result, SFIPSO obtained success rate of 100% on all of the eight test functions. Furthermore, SFIPSO also yielded good-quality solutions, especially on multimodal test functions. We further test the network properties of the generated population topology. The results prove that (1) the degree distribution of the topology follows power-law, therefore exhibits scale-free property, and (2) the topology exhibits “disassortative mixing” property, which can be interpreted as an important condition for the reinforcement of population diversity.     

Exploration of classification confidence in ensemble learning

Ensemble learning has attracted considerable attention owing to its good generalization performance. The main issues in constructing a powerful ensemble include training a set of diverse and accurate base classifiers, and effectively combining them. Ensemble margin, computed as the difference of the vote numbers received by the correct class and the another class received with the most votes, is widely used to explain the success of ensemble learning. This definition of the ensemble margin does not consider the classification confidence of base classifiers. In this work, we explore the influence of the classification confidence of the base classifiers in ensemble learning and obtain some interesting conclusions. First, we extend the definition of ensemble margin based on the classification confidence of the base classifiers. Then, an optimization objective is designed to compute the weights of the base classifiers by minimizing the margin induced classification loss. Several strategies are tried to utilize the classification confidences and the weights. It is observed that weighted voting based on classification confidence is better than simple voting if all the base classifiers are used. In addition, ensemble pruning can further improve the performance of a weighted voting ensemble. We also compare the proposed fusion technique with some classical algorithms. The experimental results also show the effectiveness of weighted voting with classification confidence.     

基于藕合系数的无标度网络建模

经典的无标度网络模型在全局范围内按照一定的概率选取节点进行优先连接,而现实网络很难做到这一点。为了解决这一问题,在BA无标度网络模型的基础上,通过新增两个参数耦合系数和吸引因子来构建基于耦合系数的无标度网络模型,并通过理论计算得出该演化模型的度分布。分析发现,它具有更明显的无标度网络特性。实验仿真结果也表明,其度分布在服从幂律分布的基础上更具有平稳性和广泛的适用性。     

基于无尺度易感应用网络的拓扑蠕虫传播模型

分析了基于无尺度易感应用网络的拓扑蠕虫的传播特性，包括其感染整个应用网络所需要的传播时间和其在传播过程中对相关主机和网络资源的占用情况等。通过与扫描蠕虫相比较，分析出该类拓扑蠕虫传播时间更短，并且在传播过程中具有更好的隐蔽性，在实施最终攻击前很难被检测，从而使其对网络和主机具有更大威胁。针对这种威胁，文章提出了几种用于检测和防御基于无尺度网络应用拓扑蠕虫的可能方法。     

无标度网络上带人工免疫的SIRS模型的动力学行为及其免疫控制策略

在典型的SIRS模型的基础上,提出了一种无标度网络中带人工免疫的SIRS类传染病模型.运用平均场理论方法分析了所提模型的动力学行为,研究了在两种不同的人工免疫策略下病毒在一种特定的无标度网络上的传播情况,并模拟了两种免疫策略对病毒传播的影响.模拟结果表明,通过人工免疫可以有效降低稳态感染比例,提高系统的传播阈值,从而有效控制病毒在复杂网络上的传播.     

基于耦合系数的无标度网络模型(BA-S)的中心化研究

针对基于耦合系数的无标度网络演化模型中的节点进行中心化研究,首先对常用的中心化指标进行了分析,接着对经典的无标度(BA)模型和演化的BA-S模型中各节点的几种指标进行了累积概率分布研究,最后对两种模型的中心化程度和效率进行了中心化测试对比研究,结果证明,演化的BA-S模型较BA模型具有更强的鲁棒性以及抗故障的能力。     

An infinite hierarchy induced by depth synchronization

Depth-synchronization measures the number of parallel derivation steps in a synchronized context-free (SCF) grammar. When not bounded by a constant the depth-synchronization measure of an SCF grammar is at least logarithmic and at most linear with respect to the word length. Languages with linear depth-synchronization measure and languages with a depth-synchronization measure in between logarithmic and linear are proven to exist. This gives rise to a strict infinite hierarchy within the family of SCF (and ET0L) languages.     

Generalized chaos control and synchronization by nonlinear high-order approach

This paper investigates the generalized control and synchronization of chaotic dynamical systems. First, we show that it is possible to stabilize the unstable periodic orbits (UPOs) when we use a high-order derivation of the OGY control that is known as one of useful methods for controlling chaotic systems. Then we examine synchronization of identical chaotic systems coupled in a master/slave manner. A rigorous criterion based on the transverse stability is presented which, if satisfied, guarantees that synchronization is asymptotically stable. The Rössler attractor and Chen system are used as examples to demonstrate the effectiveness of the developed approach and the improvement over some existing results.     

Exploring the diversity in cluster ensemble generation: Random sampling and random projection

Cluster ensemble first generates a large library of different clustering solutions and then combines them into a more accurate consensus clustering. It is commonly accepted that for cluster ensemble to work well the member partitions should be different from each other, and meanwhile the quality of each partition should remain at an acceptable level. Many different strategies have been used to generate different base partitions for cluster ensemble. Similar to ensemble classification, many studies have been focusing on generating different partitions of the original dataset, i.e., clustering on different subsets (e.g., obtained using random sampling) or clustering in different feature spaces (e.g., obtained using random projection). However, little attention has been paid to the diversity and quality of the partitions generated using these two approaches. In this paper, we propose a novel cluster generation method based on random sampling, which uses the nearest neighbor method to fill the category information of the missing samples (abbreviated as RS-NN). We evaluate its performance in comparison with k-means ensemble, a typical random projection method (Random Feature Subset, abbreviated as FS), and another random sampling method (Random Sampling based on Nearest Centroid, abbreviated as RS-NC). Experimental results indicate that the FS method always generates more diverse partitions while RS-NC method generates high-quality partitions. Our proposed method, RS-NN, generates base partitions with a good balance between the quality and the diversity and achieves significant improvement over alternative methods. Furthermore, to introduce more diversity, we propose a dual random sampling method which combines RS-NN and FS methods. The proposed method can achieve higher diversity with good quality on most datasets.     

Clustering ensemble via structured hypergraph learning

Clustering ensemble integrates multiple base clustering results to obtain a consensus result and thus improves the stability and robustness of the single clustering method. Since it is natural to use a hypergraph to represent the multiple base clustering results, where instances are represented by nodes and base clusters are represented by hyperedges, some hypergraph based clustering ensemble methods are proposed. Conventional hypergraph based methods obtain the final consensus result by partitioning a pre-defined static hypergraph. However, since base clusters may be imperfect due to the unreliability of base clustering methods, the pre-defined hypergraph constructed from the base clusters is also unreliable. Therefore, directly obtaining the final clustering result by partitioning the unreliable hypergraph is inappropriate. To tackle this problem, in this paper, we propose a clustering ensemble method via structured hypergraph learning, i.e., instead of being constructed directly, the hypergraph is dynamically learned from base results, which will be more reliable. Moreover, when dynamically learning the hypergraph, we enforce it to have a clear clustering structure, which will be more appropriate for clustering tasks, and thus we do not need to perform any uncertain postprocessing, such as hypergraph partitioning. Extensive experiments show that, our method not only performs better than the conventional hypergraph based ensemble methods, but also outperforms the state-of-the-art clustering ensemble methods.     

Identifying manufacturing operational conditions by physics-based feature extraction and ensemble clustering

Manufacturing processes usually exhibit mixed operational conditions (OCs) due to changes in process/tool/equipment health status. Undesired OCs are direct causes of out-of-control production and thus need to be identified. Data-driven OC identification has been widely used for recognizing undesired OCs, yet most methods of this kind require labels indicating the OCs in model training. In industrial applications, such labels are rarely available due to delay, incompleteness or physical constraints in data collection. A typical case is the thermal images acquired by in-process infrared camera and pyrometer, which contain rich information about process health status but are unlabeled. To facilitate data-driven OC identification with unlabeled thermal images, this study proposes a feature extraction-clustering framework that characterizes the heat-affected zone by its temperature profile and performs ensemble clustering on the extracted features to label the data. Domain knowledge from plant manufacturing is incorporated in the framework to map cluster labels to OCs. Both offline OC recovery and online OC identification are studied. Thermal images from hot stamping in automotive manufacturing are used to demonstrate and validate the proposed method. The feasibility, effectiveness and generality are well justified by the case study results.     

On self-synchronization and controlled synchronization

An attempt is made to give a general formalism for synchronization in dynamical systems encompassing most of the known definitions and applications. The proposed set-up describes synchronization of interconnected systems with respect to a set of functionals and captures peculiarities of both self-synchronization and controlled synchronization. Various illustrative examples are given.     

Random Forests with ensemble of feature spaces

Random Forests receive much attention from researchers because of their excellent performance. As Breiman suggested, the performance of Random Forests depends on the strength of the weak learners in the forests and the diversity among them. However, in the literature, many researchers only considered pre-processing of the data or post-processing of the Random Forests models. In this paper, we propose a new method to increase the diversity of each tree in the forests and thereby improve the overall accuracy. During the training process of each individual tree in the forest, different rotation spaces are concatenated into a higher space at the root node. Then the best split is exhaustively searched within this higher space. The location where the best split lies decides which rotation method to be used for all subsequent nodes. The performance of the proposed method here is evaluated on 42 benchmark data sets from various research fields and compared with the standard Random Forests. The results show that the proposed method improves the performance of the Random Forests in most cases.     

Stability and synchronization of random brain networks with a distribution of connection strengths

The impact of stability and synchronization of electrical activity on the structure of random brain networks with a distribution of connection strengths is investigated using a physiological model of brain activity. Connection strength is measured by the gain of the connection, which describes the effect of changes in the firing rate of neurons in one component on the neurons of another component. The stability of a network is calculated from the eigenvalue spectrum of the network's matrix of gains. Using random matrix theory, we predict and numerically verify the eigenvalue spectrum of randomly connected networks with gain values determined by a probability distribution. From the eigenvalue spectrum, the probability that a network is stable is calculated and shown to constrain the structural and physiological parameters of the network. In particular, stability constrains the variance of the gains. The complex vector of component amplitudes, or mode, corresponding to each dispersion root is an eigenvector of the network's gain matrix and is used to calculate the synchronization of each component's electrical activity. Synchronization is shown to decrease as the variance of the connection gain increases and inhibitory connections become more likely. Brain networks with large gain variance are shown to have multiple eigenvalues close to the stability boundary and to be partially synchronized. Such a network would have multiple partially synchronized modes strongly excited by a stimulus.     

Accurate ensemble pruning with PL-bagging

Ensemble pruning deals with the selection of base learners prior to combination in order to improve prediction accuracy and efficiency. In the ensemble literature, it has been pointed out that in order for an ensemble classifier to achieve higher prediction accuracy, it is critical for the ensemble classifier to consist of accurate classifiers which at the same time diverse as much as possible. In this paper, a novel ensemble pruning method, called PL-bagging, is proposed. In order to attain the balance between diversity and accuracy of base learners, PL-bagging employs positive Lasso to assign weights to base learners in the combination step. Simulation studies and theoretical investigation showed that PL-bagging filters out redundant base learners while it assigns higher weights to more accurate base learners. Such improved weighting scheme of PL-bagging further results in higher classification accuracy and the improvement becomes even more significant as the ensemble size increases. The performance of PL-bagging was compared with state-of-the-art ensemble pruning methods for aggregation of bootstrapped base learners using 22 real and 4 synthetic datasets. The results indicate that PL-bagging significantly outperforms state-of-the-art ensemble pruning methods such as Boosting-based pruning and Trimmed bagging.     

基于Bagging的组合k-NN预测模型与方法

k-近邻方法基于单一k值预测,无法兼顾不同实例可能存在的特征差异,总体预测精度难以保证.针对该问题,提出了一种基于Bagging的组合k-NN预测模型,并在此基础上实现了具有属性选择的Bgk-NN预测方法.该方法通过训练建立个性化预测模型集合,各模型独立生成未知实例预测值,并以各预测值的中位数作为组合预测结果.Bgk-NN预测可适用于包含离散值属性及连续值属性的各种类型数据集.标准数据集上的实验表明,Bgk-NN预测精度较之传统k-NN方法有了明显提高.