A complexity metric approach to software quality measurement

Traditional statistical quality control for dealing with quality variation during mass production is not appropriate for software quality assessment. Therefore determination and measurement of user desirable software attributes become a subject of research interest. In this paper, software attributes are classified into attributes of subjective judgment, attributes based on complexity metrics, and attributes with rigorous mathematical definition. Methods of measuring those attributes are proposed in the paper. To measure the quality of software as a whole, model that integrates qualitative software attributes and quantitative complexity metrics is also given. Finally, distribution of software life cycle costs in relation to the weighting of software quality attributes is discussed.     

UML类图中面向非功能属性的描述和检验

为系统构建模型是软件开发中的一项关键活动.一个高质量的模型不仅要包含系统的功能属性,即系统能够做什么,同时还应包含系统的非功能属性,即系统的质量如何.目前,通用的建模方法和工具对功能属性建模支持良好,而对如何为非功能属性建模关注得不多,特别是如何将二者统一起来并对描述的非功能属性的有关性质进行检验.通过在UML类图中增加非功能属性标注和约束关系表等建模元素来扩展UML类图,使其能够描述非功能属性.在此基础上,又提供了对扩展UML类图中非功能属性的一致性和可满足性进行检验的方法.通过实例对上述的面向非功能属     

基于BP神经网络的属性匹配方法研究

为了实现异构数据库的数据共享,关键的问题就是要找出数据库间的相同属性。目前主要采用的方法是通过比较所有的属性来实现属性的相似性匹配,但是当同一属性用不同数据类型表示时,由于描述属性的元数据信息和取值信息的极大差异性,这些方法就不能找出相同的属性。并且将不同数据类型描述的属性放在一起匹配,还会造成属性数据之间的干扰,影响匹配结果的准确性。为此,本文提出一种基于BP神经网络的二步检查法属性匹配算法。该算法中属性首先根据数据类型进行分类,然后用分类后的属性集分别多次训练神经网络,并对每次的匹配结果求交集作为最终的属性匹配结果,进行两阶段检查,即二步检查法。该算法能有效地消除不一致信息的干扰,降低神经网络的规模,并且可以实现不同数据类型的属性集之间属性匹配过程的并行计算。实验结果显示本文提出的方法能明显地提高系统的运行效率、属性匹配的查准率和查全率。     

BIRCH混合属性数据聚类方法

数据聚类是数据挖掘中的重要研究内容。现实世界中的数据往往同时具有连续属性和离散属性,但现有大多数算法局限于仅处理其中一种属性,而对另一种采取简单舍弃的办法丢失聚类信息和降低聚类质量。一些能处理混合属性的算法又往往处理的属性过多,导致计算量的大增。提出了一种基于BIRCH算法的混合属性数据的聚类算法;在UCI数据集上的实验表明,文中提出的算法具有较好的性能。     

加权关联规则挖掘算法的研究

讨论了加权关联规则的挖掘算法，对布尔型属性，在挖掘算法MINWAL（O）和MINWAL（W）的基础上给出一种改进的加权关联规则挖掘算法，此算法能有效地考虑布尔型属必的重要性和规则中所含属性的个数，对数量型属性，应用竞争聚集算法将数量型属性划分成若干个模糊集，产系统地提出加权模糊关联规则的挖掘算法，此算法能有效地考虑数量型属性的重要性和规则中所含属性的个数，并适用于大型数据库。     

一种基于知识粒度的启发式属性约简算法

属性约简是粗糙集理论进行知识获取的核心问题之一。根据属性相似度与知识粒度的一致性,通过条件属性与决策属性以及条件属性之间的相似度度量,提出了一种基于知识粒度的启发式属性约简算法。根据条件属性与决策属性的相似度对条件属性进行降序排列,根据条件属性之间的相似度度量选择重要的属性,从而得到约简集合。理论分析与实验结果表明,该算法具有较高的运行效率和较好的约简效果。     

Mining optimized association rules with categorical and numericattributes

Mining association rules on large data sets has received considerable attention in recent years. Association rules are useful for determining correlations between attributes of a relation and have applications in marketing, financial, and retail sectors. Furthermore, optimized association rules are an effective way to focus on the most interesting characteristics involving certain attributes. Optimized association rules are permitted to contain uninstantiated attributes and the problem is to determine instantiations such that either the support or confidence of the rule is maximized. In this paper, we generalize the optimized association rules problem in three ways: (1) association rules are allowed to contain disjunctions over uninstantiated attributes, (2) association rules are permitted to contain an arbitrary number of uninstantiated attributes, and (3) uninstantiated attributes can be either categorical or numeric. Our generalized association rules enable us to extract more useful information about seasonal and local patterns involving multiple attributes. We present effective techniques for pruning the search space when computing optimized association rules for both categorical and numeric attributes. Finally, we report the results of our experiments that indicate that our pruning algorithms are efficient for a large number of uninstantiated attributes, disjunctions, and values in the domain of the attributes     

A statistical approach to knowledge acquisition for expert systems

Classical expert systems are rule based, depending on predicates expressed over attributes and their values. In the process of building expert systems, the attributes and constants used to interpret their values need to be specified. Standard techniques for doing this are drawn from psychology, for instance, interviewing and protocol analysis. This paper describes a statistical approach to deriving interpreting constants for given attributes. It is also possible to suggest the need for attributes beyond those given.The approach for selecting an interpreting constant is demonstrated by an example. The data to be fitted are first generated by selecting a representative collection of instances of the narrow decision addressed by a rule, then making a judgement for each instance, and defining an initial set of potentially explanatory attributes. A decision rule graph plots the judgements made against pairs of attributes. It reveals rules and key instances directly. It also shows when no rule is possible, thus suggesting the need for additional attributes. A study of a collection of seven rule based models shows that the attributes defined during the fitting process improved the fit of the final models to the judgements by twenty percent over models built with only the initial attributes.     

ISAD:一种新的基于属性距离和的孤立点检测算法

孤立点是数据对象在某些属性(维)上波动形成的.由此,本文提出了关键属性的概念,用于描述影响数据稳定性的属性.在真实数据集中,只有一部分属性是能够决定某数据是否是孤立点的关键属性.由此,本文提出了关键属性隶属度的定义及其求解算法,并在此基础上提出了一种新的基于属性距离和的孤立点检测算法.实验结果表明,该算法较基于单元的算法在效率及雏数可扩展方面均有显著提高.     

一种混合属性数据流聚类算法

数据流聚类是数据流挖掘中的重要问题.现实世界中的数据流往往同时具有连续属性和标称属性,但现有算法局限于仅处理其中一种属性,而对另一种采取简单舍弃的办法.目前还没有能在算法层次上进行混合属性数据流聚类的算法.文中提出了一种针对混合属性数据流的聚类算法;建立了数据流到达的泊松过程模型;用频度直方图对离散属性进行了描述;给出了混合属性条件下微聚类生成、更新、合并和删除算法.在公共数据集上的实验表明,文中提出的算法具有鲁棒的性能.     

一种基于粗糙集属性频度约简算法的改进

为了获得有效的属性最小相对约简,在基于属性频度的启发式约简算法的基础上,提出了一种同时满足属性重要性和频度改进的启发式约简算法。该算法的基本思想是：以属性的核为基础,以频度作为选择属性的启发信息,即把属性频度最大的属性添加到核属性中,这样就把分类能力较强的属性添加到约简集合中,从而能够获得较优的约简。     

Relevant, irredundant feature selection and noisy example elimination

In many real-world situations, the method for computing the desired output from a set of inputs is unknown. One strategy for solving these types of problems is to learn the input-output functionality from examples in a training set. However, in many situations it is difficult to know what information is relevant to the task at hand. Subsequently, researchers have investigated ways to deal with the so-called problem of consistency of attributes, i.e., attributes that can distinguish examples from different classes. In this paper, we first prove that the notion of relevance of attributes is directly related to the consistency of attributes, and show how relevant, irredundant attributes can be selected. We then compare different relevant attribute selection algorithms, and show the superiority of algorithms that select irredundant attributes over those that select relevant attributes. We also show that searching for an "optimal" subset of attributes, which is considered to be the main purpose of attribute selection, is not the best way to improve the accuracy of classifiers. Employing sets of relevant, irredundant attributes improves classification accuracy in many more cases. Finally, we propose a new method for selecting relevant examples, which is based on filtering the so-called pattern frequency domain. By identifying examples that are nontypical in the determination of relevant, irredundant attributes, irrelevant examples can be eliminated prior to the learning process. Empirical results using artificial and real databases show the effectiveness of the proposed method in selecting relevant examples leading to improved performance even on greatly reduced training sets.     

融合单纯形映射与熵加权的聚类方法

由于分类型和数值型属性特性的差异,设计混合类型数据聚类算法时通常需要对两种类型属性区别对待,增加了聚类算法的设计与实现难度。另外,不同属性所包含的信息量存在差异,但现有算法通常平等对待各个属性。提出了一种融合单纯形映射与信息熵加权的混合类型数据聚类算法。基于单纯形理论将分类型属性映射为高维数值属性向量,应用信息熵理论为各属性分配权重建立相似性度量公式,将该度量方法应用于K-Means算法框架得到聚类算法。在6个UCI的混合数据集上的实验表明,提出的聚类算法优于传统映射聚类算法和K-Prototype算法,在准确度上分别提高了2.70％和18.33％。     

A hybrid discretization method for naïve Bayesian classifiers

Since naïve Bayesian classifiers are suitable for processing discrete attributes, many methods have been proposed for discretizing continuous ones. However, none of the previous studies apply more than one discretization method to the continuous attributes in a data set for naïve Bayesian classifiers. Different approaches employ different information embedded in continuous attributes to determine the boundaries for discretization. It is likely that discretizing the continuous attributes in a data set using different methods can utilize the information embedded in the attributes more thoroughly and thus improve the performance of naïve Bayesian classifiers. In this study, we propose a nonparametric measure to evaluate the dependence level between a continuous attribute and the class. The nonparametric measure is then used to develop a hybrid method for discretizing continuous attributes so that the accuracy of the naïve Bayesian classifier can be enhanced. This hybrid method is tested on 20 data sets, and the results demonstrate that discretizing the continuous attributes in a data set by various methods can generally have a higher prediction accuracy.     

会话属性优化的网络异常检测模型

网络异常检测模型的检测性能在很大程度上依赖于网络会话属性,因网络会话属性在本质上刻画了网络行为模式。基于假设验证的实验分析手段,采用Tcpdump网络数据包作为实验数据源,在将数据包解析成具有基本属性的网络会话记录基础上,提出了一组简洁和精确的会话属性组合模式。实验结果表明,优化后的会话属性组合模式确实能够有效地提高网络异常检测模型‘对未知攻击的检测能力,采用基本属性、全部属性和任意部分属性训练检测模型,并不能获得良好的检测效果。     

装备维修保障系统实体属性建模

装备维修保障系统实体属性是研究装备维修保障系统特性的基本依据。针对现有实体属性建模方法得到的实体属性集耦合封闭性差,不利于系统分析和系统聚合解聚研究的不足,根据维修保障系统实体活动特点和实体内部特征关系,给出一种耦合封闭的实体属性划分,并详细阐述了各属性面的内涵,在此基础上,提出一种六边形的实体属性模型。为基于实体的装备维修保障系统分析和聚合解聚研究提供基础。     

加权模糊关联规则的研究

1 引言关联规则是展示属性-值频繁地在给定的数据集中一起出现的条件,最常见的是对大型超市的事务数据库进行货篮分析,文[1]提出了解决此类问题的布尔型属性关联规则的Apriori算法。数量关联在股市分析、银行存款分析和医疗诊断等众多方面都有重要应用价值。数量关联用来描述数量型属性特征之间的相互关系,用数量型关联规则来表示,如“10％年龄在50-70之间的已婚人员至少拥有两辆汽车”。文[2]首先讨论数量型关联规则,文中的挖掘算法将数量型属性划分成多个区间,但这样的方法会引起划分边界过硬的缺点。     

Bayesian network classifiers based on Gaussian kernel density

For learning a Bayesian network classifier, continuous attributes usually need to be discretized. But the discretization of continuous attributes may bring information missing, noise and less sensitivity to the changing of the attributes towards class variables. In this paper, we use the Gaussian kernel function with smoothing parameter to estimate the density of attributes. Bayesian network classifier with continuous attributes is established by the dependency extension of Naive Bayes classifiers. We also analyze the information provided to a class for each attributes as a basis for the dependency extension of Naive Bayes classifiers. Experimental studies on UCI data sets show that Bayesian network classifiers using Gaussian kernel function provide good classification accuracy comparing to other approaches when dealing with continuous attributes.     

基于社交媒体的关联性用户属性推断

挖掘用户属性对用户建模、用户检索和个性化服务等具有十分重要的意义.已有的相关研究工作都是单独挖掘各种属性,而且忽略了各属性之间的相关关系.提出一种基于超图学习的用户属性推断的方法.在超图中,顶点表示社会媒体中的用户,超边表示用户产生的内容相似性与属性之间的关系.在建好的超图模型上,把用户属性挖掘形式化成一个正则化的标签相似传播问题,可以有效推断得到用户的各种属性.利用从Google+上收集的标记过全部属性的数据集进行了大量的实验,其结果表明了该方法在用户属性挖掘中的有效性.     

概念格的内涵缩减研究

利用概念格作为属性约简的数据模型,对概念格上的父子关系和内涵属性来源进行了分析:在概念格中任意若干个概念如果存在共同的子概念,那么只存在一个共同的子概念;概念的属性有两种来源,其一是继承的父节点的属性,其二是概念细化过程中增加的属性。相应地提出了两条内涵缩减的规则:如果一个节点只有一个父节点,那么其内涵缩减来源于它的内涵与父节点内涵的差集;如果一个节点有两个或两个以上的父节点,那么其内涵缩减来源于任意两个父亲节点属性的并集。然后对两条规则进行了证明,并设计了计算内涵缩减的算法。