并举例说明,对于不一致决策表,其属性约简的代数表示不能用条件信息量来等价表示。
Through examples, it shows that attribute reduction of an inconsistent decision table cannot entirely be represented by conditional information quantity.
知识约简是粗糙集理论的重要研究内容。
Knowledge reduction is one of important issues in rough set theory.
属性约简是数据挖掘领域中的核心内容之一。
Reduction of attributes is one of the major concerns in the field of data mining.
知识约简是粗糙集理论研究中的重要内容之一。
Knowledge reduction is one of the important contents in the research on rough set theory.
属性约简问题是粗糙集理论中一个核心的研究课题。
Attribute reduction is a core subject in the domain of rough set theory.
属性约简是粗糙集理论的核心内容。
将决策表进行属性约简,值约简。
属性约简是知识获取中的关键问题之一。
Attribute reduction is one of the key problems for the knowledge acquisition.
属性约简是粗糙集理论中的一个研究重点。
Attribute reduction is a research focus in rough set theory.
属性约简是粗糙集理论中的一个重要课题。
Reduction of attribute is another important subject in Rough Set theory.
特征约简可通过特征提取或特征选择实现。
Feature reduction can generally fall into feature extraction or feature selection.
将属性约简算法与其他算法结合在一起使用。
Connecting the improved attributes reduction algorithm with other algorithms.
属性约简是粗糙集用于数据分析的重要概念。
Attribute reduction is an important concept in rough sets data analysis.
后面又提到了基于信息熵的相对属性约简算法。
And then a relative attribute reduction algorithm is mentioned based on information entropy.
提出一种基于粗糙集属性重要性的属性约简算法。
Proposed an algorithm of attribute reduction based on attribute importance of rough set.
属性约简是粗糙集(RS)理论的核心内容之一。
The attribute reduction is one of the cores of Rough Set (RS) theory.
特征选择和特征抽取是维数约简常用的两种方法。
Feature selection and feature extraction are common methods for dimensionality reduction.
首先,研究了在不完备信息系统下的属性约简算法。
Firstly, the attributes reduction algorithm is studied under the incomplete information systems.
因此,有必要对每一个镜头检测决策进行特征约简。
Therefore, it is necessary to perform feature reduction for every decision of the shot boundary.
针对海量信息系统的约简问题提出了分层约简算法。
A hierarchical reduction algorithm is proposed to reduce a huge information system.
讨论几种属性约简定义的代数性质和信息熵改变规律。
This paper discusses algebra properties and changing law of entropy for some attribute reduction definitions.
提出了一种基于决策属性支持度的属性相对约简算法。
A kind of attribute relative reduction for decision attribute support degree was proposed.
并在此基础上提出了基于差分演化算法的属性约简算法。
And on this basis, an attribute reduction algorithm based on the improved differential evolutionary algorithm was put forward.
为此,设计了一种面向个性化知识发现的属性约简算法。
So a reduction algorithm of attribute for personalized knowledge discovery was designed.
实验结果表明该算法是有效的,能快速地进行属性约简。
The experimental results show that the algorithm is effective and fast.
为此,将这一事实与最近提出的量子到经典的约简定理相结合。
This inherent fact is combined with the recently proposed quantum to classical reduction theorem.
最佳知识约简问题是信息系统与知识发现中面临的一个重要问题。
A problem in the information system and knowledge discovery, is a problem of processing optimal knowledge reduction.
最后证明了属性约简在布尔矩阵和代数两种不同表示下是等价的。
Finally, the equivalence properties between Boolean matrix representation and algebra representation of attribute reduction are proved.
在计算属性约简集的基础上,建立了雷达干扰空间的偏序关系矩阵。
Based on the reduction of attribute sets, the partial order relation matrix of radar jamming space is obtained.
在计算属性约简集的基础上,建立了雷达干扰空间的偏序关系矩阵。
Based on the reduction of attribute sets, the partial order relation matrix of radar jamming space is obtained.
应用推荐