Deducing Complete Selection Rule Set for Driver Nodes to Guarantee Network’s Structural Controllability

Structural controllability is critical for operating and controlling large-scale complex networks. In real applications, for a given network, it is always desirable to have more selections for driver nodes which make the network structurally controllable. Different from the works in complex network field where structural controllability is often used to explore the emergence properties of complex networks at a macro level,in this paper, we investigate it for control design purpose at the application level and focus on describing and obtaining the solution space for all selections of driver nodes to guarantee structural controllability. In accord with practical applications,we define the complete selection rule set as the solution space which is composed of a series of selection rules expressed by intuitive algebraic forms. It explicitly indicates which nodes must be controlled and how many nodes need to be controlled in a node set and thus is particularly helpful for freely selecting driver nodes. Based on two algebraic criteria of structural controllability, we separately develop an input-connectivity algorithm and a relevancy algorithm to deduce selection rules for driver nodes. In order to reduce the computational complexity,we propose a pretreatment algorithm to reduce the scale of network's structural matrix efficiently, and a rearrangement algorithm to partition the matrix into several smaller ones. A general procedure is proposed to get the complete selection rule set for driver nodes which guarantee network's structural controllability. Simulation tests with efficiency analysis of the proposed algorithms are given and the result of applying the proposed procedure to some real networks is also shown, and these all indicate the validity of the proposed procedure.

The information content of rules and rule sets and its application

The information content of rules is categorized into inner mutual information content and outer impartation information content. Actually, the conventional objective interestingness measures based on information theory are all inner mutual information, which represent the confidence of rules and the mutual information between the antecedent and consequent. Moreover, almost all of these measures lose sight of the outer impartation information, which is conveyed to the user and help the user to make decisions. We put forward the viewpoint that the outer impartation information content of rules and rule sets can be represented by the relations from input universe to output universe. By binary relations, the interaction of rules in a rule set can be easily represented by operators： union and intersection. Based on the entropy of relations, the outer impartation information content of rules and rule sets are well measured. Then, the conditional information content of rules and rule sets, the independence of rules and rule sets and the inconsistent knowledge of rule sets are defined and measured. The properties of these new measures are discussed and some interesting results are proven, such as the information content of a rule set may be bigger than the sum of the information content of rules in the rule set, and the conditional information content of rules may be negative. At last, the applications of these new measures are discussed. The new method for the appraisement of rule mining algorithm, and two rule pruning algorithms, λ-choice and RPClC, are put forward. These new methods and algorithms have predominance in satisfying the need of more efficient decision information.

Rough Set Theory Based Approach for Fault Diagnosis Rule Extraction of Distribution System

As the first step of service restoration of distribution system,rapid fault diagnosis is a significant task for reducing power outage time,decreasing outage loss,and subsequently improving service reliability and safety.This paper analyzes a fault diagnosis approach by using rough set theory in which how to reduce decision table of data set is a main calculation intensive task.Aiming at this reduction problem,a heuristic reduction algorithm based on attribution length and frequency is proposed.At the same time,the corresponding value reduction method is proposed in order to fulfill the reduction and diagnosis rules extraction.Meanwhile,a Euclid matching method is introduced to solve confliction problems among the extracted rules when some information is lacking.Principal of the whole algorithm is clear and diagnostic rules distilled from the reduction are concise.Moreover,it needs less calculation towards specific discernibility matrix,and thus avoids the corresponding NP hard problem.The whole process is realized by MATLAB programming.A simulation example shows that the method has a fast calculation speed,and the extracted rules can reflect the characteristic of fault with a concise form.The rule database,formed by different reduction of decision table,can diagnose single fault and multi-faults efficiently,and give satisfied results even when the existed information is incomplete.The proposed method has good error-tolerate capability and the potential for on-line fault diagnosis.

Extracting Decision Rules for Cooperative Team Air Combat Based on Rough Set Theory

In order to reduce redundant features in air combat information and to meet the requirements of real-time decision in combat, rough set theory is introduced to the tactical decision analysis in cooperative team air combat. An algorithm of attribute reduction for extracting key combat information and generating tactical rules from given air combat databases is presented. Then, considering the practical requirements of team combat, a method for reduction of attribute-values under single decision attribute is extended to the reduction under multi-decision attributes. Finally, the algorithm is verified with an example for tactical choices in team air combat. The results show that, the redundant attributes in air combat information can be reduced, and that the main combat attributes, i.e., the information about radar command and medium-range guided missile, can be obtained with the algorithm mentioned above, moreover, the minimal reduced strategy for tactical decision can be generated without losing the result of key information classification. The decision rules extracted agree with the real situation of team air combat.

Mining Frequent Sets Using Fuzzy Multiple-Level Association Rules

At present, most of the association rules algorithms are based on the Boolean attribute and single-level association rules mining. But data of the real world has various types, the multi-level and quantitative attributes are got more and more attention. And the most important step is to mine frequent sets. In this paper, we propose an algorithm that is called fuzzy multiple-level association （FMA） rules to mine frequent sets. It is based on the improved Eclat algorithm that is different to many researchers’ proposed algorithms thatused the Apriori algorithm. We analyze quantitative data’s frequent sets by using the fuzzy theory, dividing the hierarchy of concept and softening the boundary of attributes’ values and frequency. In this paper, we use the vertical-style data and the improved Eclat algorithm to describe the proposed method, we use this algorithm to analyze the data of Beijing logistics route. Experiments show that the algorithm has a good performance, it has better effectiveness and high efficiency.

Rough Set Based K-Exception Approach to Approximate Rule Reduction

There are rules refering to infrequent instances after the procession of attribute reductionand value reduction with traditional methods.A rough set RS based k-exception approach (RSKEA) torule reduction is presented.Its main idea lies in a two-phase RS based rule reduction.An ordinarydecision table is attained through general method of RS knowledge reduction in the first phase.Then a k-exception candidate set is nominated according to the decision table.RS rule reduction is employed forthe reformed source data set,which remove all the instances included in the k-exception set.We apply theapproach to the automobile database.Results show that it can reduce the number and complexity of ruleswith adjustable conflict rate,which contributes to approximate rule reduction.

Research on knowledge acquisition method about the IF/THEN rules based on rough set theory

The basic principles of IF/THEN rules in rough set theory are analyzed first, and then the automatic process of knowledge acquisition is given. The numerical data is qualitatively processed by the classification of membership functions and membership degrees to get the normative decision table. The regular method of relations and the reduction algorithm of attributes are studied. The reduced relations are presented by the multi-representvalue method and its algorithm is offered. The whole knowledge acquisition process has high degree of automation and the extracted knowledge is true and reliable.

基于Rough set理论的增量式规则获取算法

从 Rough set理论出发 ,讨论在新增数据时 ,新数据与已有规则集的关系、属性约简以及值约简的变化规律 .并在此基础上提出一个新的基于 Rough Set理论的增量式算法 .从理论上和实验上对新算法和传统算法在算法复杂度上做了分析与比较 .

基于Rough Set的规则自动抽取设计方案

知识获取是专家系统的重要研究领域,而理论以理论的独特之处成为这一领域的有效工具。文章针对一具体专家系统Rough Set--专家系统在知识获取方面能力的不足,简要介绍其知识表示和知识获取的方法后,提出了一种基于理论的规则自动抽取OTCA-ES--Rough Set的设计方案。

基于Rough Set的缺省加权规则挖掘算法

本文在引入规则加权支持度概念后 ,提出了一种基于RoughSet的缺省加权规则挖掘算法———MDWRBR算法 .实验结果表明 ,该算法能有效地过滤躁声、提高规则的挖掘效率 .

基于Rough Set的CLS算法研究

用粗集理论对CLS算法进行了分析,得出CLS算法生成的决策树的特性.

一种基于Rough Sets和模糊神经网络的规则获取的方法

该文提出了一种基于RoughSets思想获取初始规则，并通过模糊神经网络优化，最后再进行简化获取模糊规则，及模糊系统参数学习的方法。并通过实例进行了自动列车运行系统仿真。文中还基于上述实例，将这种基于模糊神经网络的学习与控制方法与标准的BP网络和基本的模糊系统方法进行了比较，并总结了这种方法的特点。结论表明，该文所提出的模糊规则生成和模糊系统学习方法是行之有效的。

基于Rough Sets的传感器异常数据处理

在各种传感器的应用中,经常要对传感器的测量数据进行处理,以保证测量结果的可靠性．为了利用粗糙集理论处理不确定数据的优点,根据粗糙集理论的思想,先由已知测量数据提取出决策表,再进行补全、离散化等预处理,最后进行属性约简并提取出分类规则,对测量数据进行分类,剔除测量数据中的异常数据．实验结果显示该异常数据发现方法比常用的异常数据处理方法更为客观、精确和可靠．

基于不完备信息系统的Rough Set决策规则提取方法

对象信息的不完备性是从实例中归纳学习的最大障碍。针对不完备的信息,研究了基于不完备信息系统的粗糙集决策规则提取方法,利用分层递减约简算法,通过实例有效地分析和处理了含有缺省数据和不精确数据的信息系统,扩展了粗糙集的应用领域。

基于Rough Set的任务分配模型与算法

该文运用RoughSets理论,在由任务确定协同集的基础上,基于Agent完成任务的开销、质量、当前负荷、时间等属性,构造决策表,生成确定的决策规则与可能的决策规则。为便于仿真实现,给出基于Roughset的任务分配模型与算法。

RoughSet-NN模型在林业信息处理上的应用

运用计算机技术解决林业问题成为数字农业的一个热点研究领域,融合了粗糙集和神经网络的各自优势,利用粗糙集可以减少信息表达的属性数量,使用神经网络方法系统具有较强的容错及抗干扰能力,为处理不确定、不完整信息提供了一条解决方法,因此,将粗糙集约简技术和神经网络方法结合进行应用,建立了RoughSet-NN模型,并将该模型对给定立地条件的杨树生长状况进行预测。实验表明,该方法收敛,预测准确度高。

基于Rough Set的最小决策算法的研究

在决策表中 ,每一行对应了一条决策规则 ,但并非所有的条件属性对该决策都起作用 ,所以要进行决策规则的简化 ,简化后的规则集中仍可能会含有可以去掉而又不影响决策制定过程的冗余规则 ,找到最小规则集 ,能去掉所有的冗余信息 ,达到最简化目的 ,因而最小决策算法的研究很有意义。文中提出一种算法 ,可在不求得核值表的情况下 ,直接找到各规则的最小前提条件属性集 ,获得最小决策算法。

一种基于roug hset的多用户检测算法

将粗糙集(RoughSet)与多用户检测相结合,提出一种新型的多用户检测算法。粗糙集可以在期望用户的特征波形、定时、时延和多径等信息未知时,对接收数据进行约简,提取出接收数据与期望用户符号之间的规则,从而进行有效的分类,可以较好地应用于复杂的信道环境。理论分析和仿真结果表明了该方法的有效性和实用性。

基于DiffNodeset结构的最大频繁项集挖掘算法

在数据挖掘中,通过挖掘最大频繁项集来代替挖掘频繁项集可以大大地提升系统的运行效率。针对现有的最大频繁项集挖掘算法的运行时间消耗仍然很大的问题,提出了一种基于DiffNodeset结构的最大频繁项集挖掘(DNMFIM)算法。首先,采用了一种新的数据结构DiffNodeset来实现求交集以及支持度的快速计算;其次,引入一种新的线性复杂度的连接方法来降低两个DiffNodeset在连接过程中的复杂度,避免了多次的无效计算;然后,将集合枚举树作为搜索空间,同时采用多种优化剪枝策略来缩小搜索空间;最后,再结合最大频繁项集挖掘算法(MAFIA)中所使用的超集检测技术来有效地提高算法的准确性。实验结果表明,DNMFIM算法在时间效率方面性能优于MAFIA与基于N-list的MAFIA(NB-MAFIA),该算法在不同类型数据集中进行最大频繁项集挖掘时均有良好的效果。