共查询到20条相似文献,搜索用时 15 毫秒
1.
Topological approaches to covering rough sets 总被引:4,自引:0,他引:4
William Zhu 《Information Sciences》2007,177(6):1499-1508
Rough sets, a tool for data mining, deal with the vagueness and granularity in information systems. This paper studies covering-based rough sets from the topological view. We explore the topological properties of this type of rough sets, study the interdependency between the lower and the upper approximation operations, and establish the conditions under which two coverings generate the same lower approximation operation and the same upper approximation operation. Lastly, axiomatic systems for the lower approximation operation and the upper approximation operation are constructed. 相似文献
2.
William Zhu 《Information Sciences》2009,179(3):210-43
3.
Generalized rough sets based on relations 总被引:3,自引:0,他引:3
William Zhu 《Information Sciences》2007,177(22):4997-5011
Rough set theory has been proposed by Pawlak as a tool for dealing with the vagueness and granularity in information systems. The core concepts of classical rough sets are lower and upper approximations based on equivalence relations. This paper studies arbitrary binary relation based generalized rough sets. In this setting, a binary relation can generate a lower approximation operation and an upper approximation operation, but some of common properties of classical lower and upper approximation operations are no longer satisfied. We investigate conditions for a relation under which these properties hold for the relation based lower and upper approximation operations.This paper also explores the relationships between the lower or the upper approximation operation generated by the intersection of two binary relations and those generated by these two binary relations, respectively. Through these relationships, we prove that two different binary relations will certainly generate two different lower approximation operations and two different upper approximation operations. 相似文献
4.
近似空间中,精度与程度结合形成的双量化是一个创新课题.利用笛卡尔积进行量化信息合成,基于变精度上近似与程度下近似探讨双量化边界及其算法.首先,基于上述两个近似,自然地构建了双量化扩张粗糙集模型,定义了双量化扩张边界.接着,分析了该边界的双量化语义,得到了该边界的精确刻画与数学性质;为计算该边界,提出了近似集算法与信息粒算法,进行了算法分析与算法比较,得到了信息粒算法具有更优的算法空间复杂性的重要结论.最后,应用一个医疗实例对该边界及其算法进行了说明.该边界扩张了经典Pawlak边界,并对局部不确定性进行了双量化的完备与精细刻画,这对双量化的不确定性分析与应用具有重要意义. 相似文献
5.
模糊集、粗糙集和Vague集三种理论都是对经典集合理论的扩展,使得集合论的应用扩展到了含糊的、不确定性的问题领域。介绍了三种集合的基本思想,重点分析三种理论的区别和内在联系,同时对三种理论的发展及应用作了一些探讨性研究。 相似文献
6.
In this paper, we investigate the relationship between generalized rough sets induced by reflexive and transitive relations and the topologies on the universe which is not restricted to be finite. It is proved that there exists a one-to-one correspondence between the set of all reflexive and transitive relations and the set of all topologies which satisfy a certain kind of compactness condition. 相似文献
7.
In rough set theory, accuracy and roughness are used to characterize uncertainty of a set and approximation accuracy is employed to depict accuracy of a rough classification. Although these measures are effective, they have some limitations when the lower/upper approximation of a set under one knowledge is equal to that under another knowledge. To overcome these limitations, we address in this paper the issues of uncertainty of a set in an information system and approximation accuracy of a rough classification in a decision table. An axiomatic definition of knowledge granulation for an information system is given, under which these three measures are modified. Theoretical studies and experimental results show that the modified measures are effective and suitable for evaluating the roughness and accuracy of a set in an information system and the approximation accuracy of a rough classification in a decision table, respectively, and have a much simpler and more comprehensive form than the existing ones. 相似文献
8.
Relationship among basic concepts in covering-based rough sets 总被引:2,自引:0,他引:2
William Zhu 《Information Sciences》2009,179(14):2478-63
9.
Murat Diker 《Information Sciences》2010,180(8):1418-63
This paper presents a discussion on rough set theory from the textural point of view. A texturing is a family of subsets of a given universal set U satisfying certain conditions which are generally basic properties of the power set. The suitable morphisms between texture spaces are given by direlations defined as pairs (r,R) where r is a relation and R is a corelation. It is observed that the presections are natural generalizations for rough sets; more precisely, if (r,R) is a complemented direlation, then the inverse of the relation r (the corelation R) is actually a lower approximation operator (an upper approximation operator). 相似文献
10.
针对变精度近似与程度近似的结合问题及正域的核心地位,组建了变精度上近似与程度下近似粗糙集模型,并定义了其中的正域概念。研究了模型正域与精度量化指标和程度量化指标关联的内涵及意义,得到了模型正域的精确刻画与性质。为了计算模型正域,提出了自然算法与原子算法,并进行了算法分析与算法比较,得到了自然算法与原子算法具有相同的时间复杂性,而原子算法却具有更优的空间复杂性的结论。最后用一个医疗实例对模型正域及其算法进行了分析与说明。变精度上近似与程度下近似粗糙集模型的正域,从膨胀的优势方向完全扩展了经典粗糙集模型的正域,对与精度参数和程度参数相关的必然性知识发现具有意义。 相似文献
11.
Rough set theory has been extensively discussed in the domain of machine learning and data mining. Pawlak’s rough set theory offers a formal theoretical framework for attribute reduction and rule learning from nominal data. However, this model is not applicable to numerical data, which widely exist in real-world applications. In this work, we extend this framework to numerical feature spaces by replacing partition of universe with neighborhood covering and derive a neighborhood covering reduction based approach to extracting rules from numerical data. We first analyze the definition of covering reduction and point out its advantages and disadvantages. Then we introduce the definition of relative covering reduction and develop an algorithm to compute it. Given a feature space, we compute the neighborhood of each sample and form a neighborhood covering of the universe, and then employ the algorithm of relative covering reduction to the neighborhood covering, thus derive a minimal covering rule set. Some numerical experiments are presented to show the effectiveness of the proposed technique. 相似文献
12.
Attribute reduction is viewed as an important preprocessing step for pattern recognition and data mining. Most of researches are focused on attribute reduction by using rough sets. Recently, Tsang et al. discussed attribute reduction with covering rough sets in the paper (Tsang et al., 2008), where an approach based on discernibility matrix was presented to compute all attribute reducts. In this paper, we provide a new method for constructing simpler discernibility matrix with covering based rough sets, and improve some characterizations of attribute reduction provided by Tsang et al. It is proved that the improved discernibility matrix is equivalent to the old one, but the computational complexity of discernibility matrix is relatively reduced. Then we further study attribute reduction in decision tables based on a different strategy of identifying objects. Finally, the proposed reduction method is compared with some existing feature selection methods by numerical experiments and the experimental results show that the proposed reduction method is efficient and effective. 相似文献
13.
Ching-Hsue Cheng 《Information Sciences》2010,180(9):1610-76
In the stock market, technical analysis is a useful method for predicting stock prices. Although, professional stock analysts and fund managers usually make subjective judgments, based on objective technical indicators, it is difficult for non-professionals to apply this forecasting technique because there are too many complex technical indicators to be considered. Moreover, two drawbacks have been found in many of the past forecasting models: (1) statistical assumptions about variables are required for time series models, such as the autoregressive moving average model (ARMA) and the autoregressive conditional heteroscedasticity (ARCH), to produce forecasting models of mathematical equations, and these are not easily understood by stock investors; and (2) the rules mined from some artificial intelligence (AI) algorithms, such as neural networks (NN), are not easily realized.In order to overcome these drawbacks, this paper proposes a hybrid forecasting model, using multi-technical indicators to predict stock price trends. Further, it includes four proposed procedures in the hybrid model to provide efficient rules for forecasting, which are evolved from the extracted rules with high support value, by using the toolset based on rough sets theory (RST): (1) select the essential technical indicators, which are highly related to the future stock price, from the popular indicators based on a correlation matrix; (2) use the cumulative probability distribution approach (CDPA) and minimize the entropy principle approach (MEPA) to partition technical indicator value and daily price fluctuation into linguistic values, based on the characteristics of the data distribution; (3) employ a RST algorithm to extract linguistic rules from the linguistic technical indicator dataset; and (4) utilize genetic algorithms (GAs) to refine the extracted rules to get better forecasting accuracy and stock return. The effectiveness of the proposed model is verified with two types of performance evaluations, accuracy and stock return, and by using a six-year period of the TAIEX (Taiwan Stock Exchange Capitalization Weighted Stock Index) as the experiment dataset. The experimental results show that the proposed model is superior to the two listed forecasting models (RST and GAs) in terms of accuracy, and the stock return evaluations have revealed that the profits produced by the proposed model are higher than the three listed models (Buy-and-Hold, RST and GAs). 相似文献
14.
石黎 《计算机工程与设计》2012,33(8):3160-3164
为了更好地评价仿真系统可信度,提出了一种基于Rough Set和Fuzzy结合的仿真可信度评估方法。该方法首先将决策者经验权系数同Rough Set确定的属性重要度结合起来确定最终指标权系数,然后采用Fuzzy法对仿真系统可信度进行全面综合地评价,并用模糊状态方程式的方式表示结果。最后,以轨道交通ATC仿真系统可信度评估为例,验证了该方法的有效性和实用性,为仿真系统可信度评估提供了方便快捷的途径。 相似文献
15.
动态粒度下的粗糙集近似 总被引:6,自引:0,他引:6
粒度计算是粗糙集理论研究的一种强有力的工具。本文讨论了粒度意义下的粗糙集近似,并定义了动态粒度下的正向近似。另外,本文还从粒度的角度讨论了聚类结果和先验知识的协调度问题,并提出了一种基于动态粒度下的正向近似的聚类算法。这些结果将有助于粒度计算和粗糙集理论的研究。 相似文献
16.
This paper studies the classes of rough sets and fuzzy rough sets. We discuss the invertible lower and upper approximations and present the necessary and sufficient conditions for the lower approximation to coincide with the upper approximation in both rough sets and fuzzy rough sets. We also study the mathematical properties of a fuzzy rough set induced by a cyclic fuzzy relation. 相似文献
17.
利用覆盖算法对数据进行处理,得到论域U的一个划分,定义一种基于覆盖的条件信息熵,由新的条件信息熵定义新的属性重要性,并证明了对于一致决策表,它与代数定义下的重要性是等价的。以新的属性重要性为启发信息设计约简算法,并给出计算新的条件信息熵的算法。实验结果表明该约简算法能快速搜索到最优或次优约简。 相似文献
18.
Yu-Neng Fan Tzu-Liang Tseng Ching-Chin Chern Chun-Che Huang 《Expert systems with applications》2009,36(9):11439-11450
The incremental technique is a way to solve the issue of added-in data without re-implementing the original algorithm in a dynamic database. There are numerous studies of incremental rough set based approaches. However, these approaches are applied to traditional rough set based rule induction, which may generate redundant rules without focus, and they do not verify the classification of a decision table. In addition, these previous incremental approaches are not efficient in a large database. In this paper, an incremental rule-extraction algorithm based on the previous rule-extraction algorithm is proposed to resolve there aforementioned issues. Applying this algorithm, while a new object is added to an information system, it is unnecessary to re-compute rule sets from the very beginning. The proposed approach updates rule sets by partially modifying the original rule sets, which increases the efficiency. This is especially useful while extracting rules in a large database. 相似文献
19.
Pawlak教授提出的粗糙集理论是解决集合边界不确定的重要手段,他构建了边界不确定集合的两条精确边界,但没有给出用已有知识基来精确或近似地构建目标概念(集合)X的方法.在前期的研究中提出了寻找目标概念X的近似集方法,但并没有给出最优的近似集.首先,回顾了集合间的相似度概念和粗糙集的近似集Rλ(X)的构建方法,提出并证明了Rλ(X)所满足的运算性质.其次,找到了Rλ(X)比上近似集R(X)和下近似集R(X)更近似于目标概念X的λ成立的区间.最后,提出了R0.5(X)作为目标概念的最优近似集所满足的条件. 相似文献
20.
基于优势关系下的协调近似空间 总被引:12,自引:4,他引:8
在基于优势关系下的信息系统中引入了协调近似空间的概念,并证明了在优势关系下不协调目标信息系统也可以转化为一个协调近似空间,这进一步方便了基于优势关系下不协调目标信息系统的研究,丰富了粗糙集理论. 相似文献