不完备信息系统中对象的相似性刻画

信息系统知识约简与知识发现是粗糙集理论的重要研究方向。通过对不完备信息系统中对象的相似性刻画方式以及相应的粗糙集模型进行对比分析,基于限制容差关系提出了一种新的限制相似关系,建立了基于限制相似关系的粗糙集模型,讨论了模型的基本性质及其与已有模型之间的关系。     

On the finite and general implication problems of independence atoms and keys

We investigate implication problems for keys and independence atoms in relational databases. For keys and unary independence atoms we show that finite implication is not finitely axiomatizable, and establish a finite axiomatization for general implication. The same axiomatization is also sound and complete for finite and general implication of unary keys and independence atoms, which coincide. We show that the general implication of keys and unary independence atoms and of unary keys and general independence atoms is decidable in polynomial time. For these two classes we also show how to construct Armstrong relations. Finally, we establish tractable conditions that are sufficient for certain classes of keys and independence atoms not to interact.     

Single Criterion Net Flow Using Concordance and Discordance Relations

This article proposes a flow-based method using the single criterion net flow for pattern classification. Traditional single criterion net flow, generated on the basis of net partial concordance indices, measures the preference intensity for one pattern with respect to all others on this criterion. A concordance index measures the intensity of preference for one pattern over another pattern. Contrary to traditional flow-based methods, such as PROMETHEE, in which only the concordance relation is taken into account, the proposed method proposes a new definition of single criterion net flow using both concordance and discordance relations. This can balance pros and cons for the preference of one pattern over another pattern for a criterion. The final classification decision for a new pattern depends on its net flow. Criteria weights are determined using a genetic-algorithm-based approach. Empirical results involving bankruptcy prediction demonstrate that the proposed method performs well compared to other well-known classification methods.     

基于模式的远监督关系抽取算法

远监督关系抽取算法能够自动将关系库中的关系与无标注的文本对齐,以进行文本中的关系抽取。目前提出的远监督关系抽取算法中,大多数是基于特征的。然而,此类算法在将实例转换为特征时,经常会出现关键信息不突出、数据集线性不可分等问题,影响关系抽取的效果。该文提出了一种基于模式的远监督关系抽取算法,其中引入了基于模式的向量,并使用了基于核的机器学习算法来克服上述问题。实验结果表明,该文提出的基于模式的远监督关系抽取算法,能够有效地提升远监督关系抽取的准确率。     

网页中商品“属性—值”关系的自动抽取方法研究

商品属性及其对应值的自动挖掘,对于基于Web的商品市场需求分析、商品推荐、售后服务等诸多领域有重要的应用价值。该文提出一种基于网页标题的模板构建方法,从结构化网页中抽取完整的商品“属性—值”关系。该方法包含四个关键技术 1)利用商品网页标题构建领域相关的属性词包;2)基于预设分隔符细化文本节点;3)结合领域商品属性词包获取种子“属性—值”关系;4)结合网页布局信息和字符信息来筛选与构建模板。该文的实验基于相机和手机两个领域展开,获得94.68%的准确率和90.57%的召回率。     

Minimizing a linear objective function under a fuzzy max-t norm relation equation constraint

The work examines the feasibility of minimizing a linear objective function subject to a max-t fuzzy relation equation constraint, where t is a continuous/Archimedean t-norm. Conventional methods for solving this problem are significantly improved by, first separating the problem into two sub-problems according to the availability of positive coefficients. This decomposition is thus more easily handled than in previous literature. Next, based on use of the maximum solution of the constraint equation, the sub-problem with non-positive coefficients is solved and the size of the sub-problem with positive coefficients reduced as well. This step is unique among conventional methods, owing to its ability to determine as many optimal variables as possible. Additionally, several rules are developed for simplifying the remaining problem. Finally, those undecided optimal variables are obtained using the covering problem rather than the branch-and-bound methods. Three illustrative examples demonstrate that the proposed approach outperforms conventional schemes. Its potential applications are discussed as well.     

基于本体的语义分析过程与方法的研究应用*

为了提高信息化环境下语义分析能力,将本体引入语义分析。通过对典型本体构建方法的比较与综合,形成一种持续优化的本体构建方法,在此基础上进行概念分析、关系推理。进一步对比基于本体的语义分析和其它语义分析方法,指出基于本体的语义分析更具系统性、针对性,推理能力强。最后,将基于本体的语义分析应用到软件缺陷分析系统中。结果表明,它能够集成到原有系统中并有效进行关系推理和冲突识别。     

基于等量效果的Vague集转化为Fuzzy集的方法

针对当前Vague集转化为Fuzzy集的方法更多是根据直观,而没能详细阐述所基于的原理。为能更好理解Vague集转化为Fuzzy集的过程,考虑将Vague集转化为Fuzzy集模拟为一个最终无弃权票的多轮投票过程,从而构造了一种效果函数的定义,用以表示支持力度。并结合积分第一中值定理的意义提出了一种新的基于等量效果的转化方法,以保证在转化过程中,所关心的总效果没有发生变化。最后结合数据,严格分析了该方法的良好性质以及合理性。     

模糊集间的R_0-相似关系及其性质

将王国俊教授在R0-型逻辑系统中建立的R0-蕴涵算子应用于模糊数学理论之中,在非空集合X为论域的模糊集族F(X)上定义了一种新型运算-R0蕴含运算,并讨论了F(X)上R0-蕴含运算的一些基本性质。通过R0-蕴含运算在F(X)上定义了一个二元模糊相似关系-R0-相似关系,并对其性质进行了较为详细的讨论。在有限论域X确定的模糊集族F(X)上给出了几个R0-相似关系的具体实例。     

最小归纳依赖关系在采掘聚类关联规则中的应用研究

数据集中的冗余属性会降低数据采掘结果的解释能力及精度。该文介绍了在非项目集类型的数据集中采掘聚类关联规则的基本原理,并利用RoughSet理论对属性间的归纳依赖关系进行了分析,提出了一个在数据集中发现没有冗余属性的最小归纳依赖关系的算法,使采掘出的关联规则的精度及解释能力都达到令人满意的水平。