The theory of concept lattices is an efficient tool for knowledge representation and knowledge discovery, and is applied to many fields successfully. One focus of knowledge discovery is knowledge reduction. Based on t...The theory of concept lattices is an efficient tool for knowledge representation and knowledge discovery, and is applied to many fields successfully. One focus of knowledge discovery is knowledge reduction. Based on the reduction theory of classical formal context, this paper proposes the definition of decision formal context and its reduction theory, which extends the reduction theory of concept lattices. In this paper, strong consistence and weak consistence of decision formal context are defined respectively. For strongly consistent decision formal context, the judgment theorems of consistent sets are examined, and approaches to reduction are given. For weakly consistent decision formal context, implication mapping is defined, and its reduction is studied. Finally, the relation between reducts of weakly consistent decision formal context and reducts of implication mapping is discussed.展开更多
The research mainly discuss that public speeches should be made and delivered in accordance of speaking situation. By investigating different sample public speeches, it can be found that proper use of"context of ...The research mainly discuss that public speeches should be made and delivered in accordance of speaking situation. By investigating different sample public speeches, it can be found that proper use of"context of situation"plays an important role in making public speeches appropriate both in linguistic scope and in social scope. The research also gives some suggestions on writing of public speeches.展开更多
There is an intimate correlation between rough set theory and formal concept analysis theory, so rough set approximations can be realized by means of formal concept analysis. For any given multiple valued information ...There is an intimate correlation between rough set theory and formal concept analysis theory, so rough set approximations can be realized by means of formal concept analysis. For any given multiple valued information system, the realization of rough set approximation operation has two major steps, firstly convert the information system from multiple valued one to single valued formal context, secondly realize rough set approximation operations aided by concept lattice, which is equivalent to a query operation under some necessary conditions.展开更多
动态网络分析是复杂网络背景下机器学习和人工智能研究的热门方向之一。将形式概念分析方法与动态网络分析方法相结合,对动态网络中的概念及其网络特征值的动态性进行研究具有重要意义。首先,提出了动态网络形式背景,将动态网络数据与...动态网络分析是复杂网络背景下机器学习和人工智能研究的热门方向之一。将形式概念分析方法与动态网络分析方法相结合,对动态网络中的概念及其网络特征值的动态性进行研究具有重要意义。首先,提出了动态网络形式背景,将动态网络数据与形式概念分析统一到一个数据框架下,结合现实中的动态网络数据类型,对其中一类动态网络形式背景进行了分类和构造性分析;其次,提出了动态网络概念及其网络特征值的定义,为后面研究网络概念的动态性奠定了基础;接着,给出了各种网络概念特征值的变化速率的定义,并提出了网络对象概念动态性分析算法和网络属性概念动态性分析算法;最后,利用从Web of Science核心期刊库中提取的数据对所提出的两个算法进行实验,实验表明所提算法能对网络概念及其特征值的动态性进行有效的分析。展开更多
In order to reduce knowledge reasoning space and improve knowledge processing efficiency, a framework of distributed attribute reduction in concept lattices is presented. By employing the idea similar to that of the r...In order to reduce knowledge reasoning space and improve knowledge processing efficiency, a framework of distributed attribute reduction in concept lattices is presented. By employing the idea similar to that of the rough set, the characterization of core attributes, dispensable attributes and unnecessary attributes are described from the point of view of local formal contexts and virtual global contexts. A determinant theorem of attribute reduction is derived. Based on these results, an approach for distributed attribute reduction is presented. It first performs reduction independently on each local context using the existing approaches, and then local reducts are merged to compute reducts of global contexts. An algorithm implementation is provided and its effectiveness is validated. The distributed reduction algorithm facilitates not only improving computation efficiency but also avoiding the problems caused by the existing approaches, such as data privacy and communication overhead.展开更多
基金the National 973 Program of China (Grant No.2002CB312200)the National Natural Science Foundation of China (Grant Nos.60703117, 60433010 and 60673096)the Doctor Research Fund of Northwest University in China
文摘The theory of concept lattices is an efficient tool for knowledge representation and knowledge discovery, and is applied to many fields successfully. One focus of knowledge discovery is knowledge reduction. Based on the reduction theory of classical formal context, this paper proposes the definition of decision formal context and its reduction theory, which extends the reduction theory of concept lattices. In this paper, strong consistence and weak consistence of decision formal context are defined respectively. For strongly consistent decision formal context, the judgment theorems of consistent sets are examined, and approaches to reduction are given. For weakly consistent decision formal context, implication mapping is defined, and its reduction is studied. Finally, the relation between reducts of weakly consistent decision formal context and reducts of implication mapping is discussed.
文摘The research mainly discuss that public speeches should be made and delivered in accordance of speaking situation. By investigating different sample public speeches, it can be found that proper use of"context of situation"plays an important role in making public speeches appropriate both in linguistic scope and in social scope. The research also gives some suggestions on writing of public speeches.
文摘There is an intimate correlation between rough set theory and formal concept analysis theory, so rough set approximations can be realized by means of formal concept analysis. For any given multiple valued information system, the realization of rough set approximation operation has two major steps, firstly convert the information system from multiple valued one to single valued formal context, secondly realize rough set approximation operations aided by concept lattice, which is equivalent to a query operation under some necessary conditions.
文摘动态网络分析是复杂网络背景下机器学习和人工智能研究的热门方向之一。将形式概念分析方法与动态网络分析方法相结合,对动态网络中的概念及其网络特征值的动态性进行研究具有重要意义。首先,提出了动态网络形式背景,将动态网络数据与形式概念分析统一到一个数据框架下,结合现实中的动态网络数据类型,对其中一类动态网络形式背景进行了分类和构造性分析;其次,提出了动态网络概念及其网络特征值的定义,为后面研究网络概念的动态性奠定了基础;接着,给出了各种网络概念特征值的变化速率的定义,并提出了网络对象概念动态性分析算法和网络属性概念动态性分析算法;最后,利用从Web of Science核心期刊库中提取的数据对所提出的两个算法进行实验,实验表明所提算法能对网络概念及其特征值的动态性进行有效的分析。
基金The National Outstanding Young Scientist Foundationby NSFC(No.60425206)the National Natural Science Foundation of Chi-na(No.60503020)the Natural Science Foundation of Jiangsu Province(No.BK2006094).
文摘In order to reduce knowledge reasoning space and improve knowledge processing efficiency, a framework of distributed attribute reduction in concept lattices is presented. By employing the idea similar to that of the rough set, the characterization of core attributes, dispensable attributes and unnecessary attributes are described from the point of view of local formal contexts and virtual global contexts. A determinant theorem of attribute reduction is derived. Based on these results, an approach for distributed attribute reduction is presented. It first performs reduction independently on each local context using the existing approaches, and then local reducts are merged to compute reducts of global contexts. An algorithm implementation is provided and its effectiveness is validated. The distributed reduction algorithm facilitates not only improving computation efficiency but also avoiding the problems caused by the existing approaches, such as data privacy and communication overhead.
