Recently,much interest has been given tomulti-granulation rough sets (MGRS), and various types ofMGRSmodelshave been developed from different viewpoints. In this paper, we introduce two techniques for the classificati...Recently,much interest has been given tomulti-granulation rough sets (MGRS), and various types ofMGRSmodelshave been developed from different viewpoints. In this paper, we introduce two techniques for the classificationof MGRS. Firstly, we generate multi-topologies from multi-relations defined in the universe. Hence, a novelapproximation space is established by leveraging the underlying topological structure. The characteristics of thenewly proposed approximation space are discussed.We introduce an algorithmfor the reduction ofmulti-relations.Secondly, a new approach for the classification ofMGRS based on neighborhood concepts is introduced. Finally, areal-life application from medical records is introduced via our approach to the classification of MGRS.展开更多
As an extension of overlap functions, pseudo-semi-overlap functions are a crucial class of aggregation functions. Therefore, (I, PSO)-fuzzy rough sets are introduced, utilizing pseudo-semi-overlap functions, and furth...As an extension of overlap functions, pseudo-semi-overlap functions are a crucial class of aggregation functions. Therefore, (I, PSO)-fuzzy rough sets are introduced, utilizing pseudo-semi-overlap functions, and further extended for applications in image edge extraction. Firstly, a new clustering function, the pseudo-semi-overlap function, is introduced by eliminating the symmetry and right continuity present in the overlap function. The relaxed nature of this function enhances its applicability in image edge extraction. Secondly, the definitions of (I, PSO)-fuzzy rough sets are provided, using (I, PSO)-fuzzy rough sets, a pair of new fuzzy mathematical morphological operators (IPSOFMM operators) is proposed. Finally, by combining the fuzzy C-means algorithm and IPSOFMM operators, a novel image edge extraction algorithm (FCM-IPSO algorithm) is proposed and implemented. Compared to existing algorithms, the FCM-IPSO algorithm exhibits more image edges and a 73.81% decrease in the noise introduction rate. The outstanding performance of (I, PSO)-fuzzy rough sets in image edge extraction demonstrates their practical application value.展开更多
This article focuses on the relationship between mathematical morphology operations and rough sets,mainly based on the context of image retrieval and the basic image correspondence problem.Mathematical morphological p...This article focuses on the relationship between mathematical morphology operations and rough sets,mainly based on the context of image retrieval and the basic image correspondence problem.Mathematical morphological procedures and set approximations in rough set theory have some clear parallels.Numerous initiatives have been made to connect rough sets with mathematical morphology.Numerous significant publications have been written in this field.Others attempt to show a direct connection between mathematical morphology and rough sets through relations,a pair of dual operations,and neighborhood systems.Rough sets are used to suggest a strategy to approximatemathematicalmorphology within the general paradigm of soft computing.A single framework is defined using a different technique that incorporates the key ideas of both rough sets and mathematical morphology.This paper examines rough set theory from the viewpoint of mathematical morphology to derive rough forms of themorphological structures of dilation,erosion,opening,and closing.These newly defined structures are applied to develop algorithm for the differential analysis of chest X-ray images from a COVID-19 patient with acute pneumonia and a health subject.The algorithm and rough morphological operations show promise for the delineation of lung occlusion in COVID-19 patients from chest X-rays.The foundations of mathematical morphology are covered in this article.After that,rough set theory ideas are taken into account,and their connections are examined.Finally,a suggested image retrieval application of the concepts from these two fields is provided.展开更多
This paper presents a general framework for the study of relation-based intuitionistic fuzzy rough sets determined by two intuitionistic fuzzy implicators.By employing two intuitionistic fuzzy implicators I and J,I -l...This paper presents a general framework for the study of relation-based intuitionistic fuzzy rough sets determined by two intuitionistic fuzzy implicators.By employing two intuitionistic fuzzy implicators I and J,I -lower and J-upper approximations of intuitionistic fuzzy sets with respect to an intuitionistic fuzzy approximation space are first defined.Properties of(I,J) -intuitionistic fuzzy rough approximation operators are then examined.The connections between special types of intuitionistic fuzzy relations and properties of (I,J)-intuitionistic fuzzy approximation operators are also established.展开更多
The coveting rough sets theory is a generalization of traditional rough set theory, and can also describe information with incompleteness and fuzziness in information systems. In this paper, we first provide the defin...The coveting rough sets theory is a generalization of traditional rough set theory, and can also describe information with incompleteness and fuzziness in information systems. In this paper, we first provide the definitions of several upper and lower covering approximation operators on the covering approximation space. Then, we study the properties of these operators. Finally, we propose the mutual relations between approximation operators and similar relations of the operator ( I ) based on the covering rough sets.展开更多
The conceptions of the knowledge screen generated by S-rough sets are given: f- screen and - screen , and then puts forward - filter theorem, - filter theorem of knowledge. At last, the applications of knowledge separ...The conceptions of the knowledge screen generated by S-rough sets are given: f- screen and - screen , and then puts forward - filter theorem, - filter theorem of knowledge. At last, the applications of knowledge separation are given according to - screen and - screen.展开更多
Multi-attribute decision problems where the performances of the alternatives are random variables are considered. The suggested approach grades the probabilities of preference of one alternative over another with resp...Multi-attribute decision problems where the performances of the alternatives are random variables are considered. The suggested approach grades the probabilities of preference of one alternative over another with respect to the same attribute. Based on the graded probabilistic dominance relation, the pairwise comparison information table is defined. The global preferences of the decision maker can be seen as a rough binary relation. The present paper proposes to approximate this preference relation by means of the graded probabilistic dominance relation with respect to the subsets of attributes. At last, the method is illustrated by an example.展开更多
Rough set theory provides a useful mathematical foundation for developing automated computational systems that can help understand and make use of imperfect knowledge. Despite its recency, the theory and its extension...Rough set theory provides a useful mathematical foundation for developing automated computational systems that can help understand and make use of imperfect knowledge. Despite its recency, the theory and its extensions have been widely applied to many problems, including decision analysis, data mining, intelligent control and pattern recognition. This paper presents an outline of the basic concepts of rough sets and their major extensions, covering variable precision, tolerance and fuzzy rough sets. It also shows the diversity of successful applications these theories have entailed, ranging from financial and business, through biological and medicine, to physical, art, and meteorological.展开更多
Covering-based rough sets process data organized by a covering of the universe. A soft set is a parameterized family of subsets of the universe. Both theories can deal with the uncertainties of data. Soft sets have no...Covering-based rough sets process data organized by a covering of the universe. A soft set is a parameterized family of subsets of the universe. Both theories can deal with the uncertainties of data. Soft sets have not any restrictions on the approximate description of the object,and they might form a covering of the universe. From this viewpoint,we establish a connection between these two theories. Specifically,we propose a complementary parameter for this purpose. With this parameter,the soft covering approximation space is established and the two theories are bridged. Furthermore,we study some relations between the covering and the soft covering approximation space and obtain some significant results. Finally,we define a notion of combine parameter which can help us to simplify the set of parameters and reduce the storage requirement of a soft covering approximation space.展开更多
Data mining (also known as Knowledge Discovery in Databases - KDD) is defined as the nontrivial extraction of implicit, previously unknown, and potentially useful information from data. The aims and objectives of data...Data mining (also known as Knowledge Discovery in Databases - KDD) is defined as the nontrivial extraction of implicit, previously unknown, and potentially useful information from data. The aims and objectives of data mining are to discover knowledge of interest to user needs.Data mining is really a useful tool in many domains such as marketing, decision making, etc. However, some basic issues of data mining are ignored. What is data mining? What is the product of a data mining process? What are we doing in a data mining process? Is there any rule we should obey in a data mining process? In order to discover patterns and knowledge really interesting and actionable to the real world Zhang et al proposed a domain-driven human-machine-cooperated data mining process.Zhao and Yao proposed an interactive user-driven classification method using the granule network. In our work, we find that data mining is a kind of knowledge transforming process to transform knowledge from data format into symbol format. Thus, no new knowledge could be generated (born) in a data mining process. In a data mining process, knowledge is just transformed from data format, which is not understandable for human, into symbol format,which is understandable for human and easy to be used.It is similar to the process of translating a book from Chinese into English.In this translating process,the knowledge itself in the book should remain unchanged. What will be changed is the format of the knowledge only. That is, the knowledge in the English book should be kept the same as the knowledge in the Chinese one.Otherwise, there must be some mistakes in the translating proces, that is, we are transforming knowledge from one format into another format while not producing new knowledge in a data mining process. The knowledge is originally stored in data (data is a representation format of knowledge). Unfortunately, we can not read, understand, or use it, since we can not understand data. With this understanding of data mining, we proposed a data-driven knowledge acquisition method based on rough sets. It also improved the performance of classical knowledge acquisition methods. In fact, we also find that the domain-driven data mining and user-driven data mining do not conflict with our data-driven data mining. They could be integrated into domain-oriented data-driven data mining. It is just like the views of data base. Users with different views could look at different partial data of a data base. Thus, users with different tasks or objectives wish, or could discover different knowledge (partial knowledge) from the same data base. However, all these partial knowledge should be originally existed in the data base. So, a domain-oriented data-driven data mining method would help us to extract the knowledge which is really existed in a data base, and really interesting and actionable to the real world.展开更多
Decision trees induction algorithms have been used for classification in a wide range of application domains. In the process of constructing a tree, the criteria of selecting test attributes will influence the classif...Decision trees induction algorithms have been used for classification in a wide range of application domains. In the process of constructing a tree, the criteria of selecting test attributes will influence the classification accuracy of the tree.In this paper,the degree of dependency of decision attribute to condition attribute,based on rough set theory,is used as a heuristic for selecting the attribute that will best separate the samples into individual classes.The result of an example shows that compared with the entropy-based approach,our approach is a better way to select nodes for constructing decision trees.展开更多
The improved method has been presented for knowledge reduction in rough sets (R-S) theory, when R-S is used to model the information expression of oil and vibration diagnosis. Therefore, the typical fault simulation...The improved method has been presented for knowledge reduction in rough sets (R-S) theory, when R-S is used to model the information expression of oil and vibration diagnosis. Therefore, the typical fault simulation tests of rolling bearings have been made, and the application method of R-S has been also analysed in this paper. The diagnosis model of holding rack fault in rolling bearing was presented based on the improved reduction method. It is suited to information fusion to combine information when oil analysis and vibration analysis are combined for fault diagnosis.展开更多
Computer aided process planning(CAPP) is an important content of computer integrated manufacturing, and intelligentizing is the orientation of development of CAPP. Process planning has characters of empirical and ti...Computer aided process planning(CAPP) is an important content of computer integrated manufacturing, and intelligentizing is the orientation of development of CAPP. Process planning has characters of empirical and time-consuming to finalize, and the same technical aim always can be achieved by different process schemes, so intelligentizing of process decision making always be a difficult point of CAPP and computer integrated manufacturing (CIM). For the purpose of intelligent aided process decision making and reuse of process resource, this paper proposed a decision making method based on rough sets(RS) and regular distance computing. The main contents and methods of process planning decision making are analyzed under agile response manufacturing environment, the concept of process knowledge granule is represented, and the methods of process knowledge granule partitioning and granularity analysis are put forward. Based on the theory of RS and combined the method of process attributes importance identification, the paper brought forward a computing model for process scheme regulation distance under the same attribute conditions, and conflict resolution strategy was introduced to acquire process scheme fit for actual situation of enterprise's manufacturing resources, so as to realize process resources' conflict resolution and quick excavate and reuse of enterprises' existing process knowledge, to advance measures of process decision making and improve the rationality and capability of agile response of process planning.展开更多
To investigate the judging problem of optimal dividing matrix among several fuzzy dividing matrices in fuzzy dividing space, correspondingly, which is determined by the various choices of cluster samples in the totali...To investigate the judging problem of optimal dividing matrix among several fuzzy dividing matrices in fuzzy dividing space, correspondingly, which is determined by the various choices of cluster samples in the totality sample space, two algorithms are proposed on the basis of the data analysis method in rough sets theory: information system discrete algorithm (algorithm 1) and samples representatives judging algorithm (algorithm 2). On the principle of the farthest distance, algorithm 1 transforms continuous data into discrete form which could be transacted by rough sets theory. Taking the approximate precision as a criterion, algorithm 2 chooses the sample space with a good representative. Hence, the clustering sample set in inducing and computing optimal dividing matrix can be achieved. Several theorems are proposed to provide strict theoretic foundations for the execution of the algorithm model. An applied example based on the new algorithm model is given, whose result verifies the feasibility of this new algorithm model.展开更多
Machine intelligence,is out of the system by the artificial intelligence shown.It is usually achieved by the average computer intelligence.Rough sets and Information Granules in uncertainty management and soft computi...Machine intelligence,is out of the system by the artificial intelligence shown.It is usually achieved by the average computer intelligence.Rough sets and Information Granules in uncertainty management and soft computing and granular computing is widely used in many fields,such as in protein sequence analysis and biobasis determination,TSM and Web service classification Etc.展开更多
Covering rough sets are improvements of traditional rough sets by considering cover of universe instead of partition.In this paper,we develop several measures based on evidence theory to characterize covering rough se...Covering rough sets are improvements of traditional rough sets by considering cover of universe instead of partition.In this paper,we develop several measures based on evidence theory to characterize covering rough sets.First,we present belief and plausibility functions in covering information systems and study their properties.With these measures we characterize lower and upper approximation operators and attribute reductions in covering information systems and decision systems respectively.With these discussions we propose a basic framework of numerical characterizations of covering rough sets.展开更多
This paper combines interval-valued intuitionistic fuzzy sets and rough sets.It studies rougheness in interval-valued intuitionistic fuzzy sets and proposes one kind of interval-valued intuitionistic fuzzy-rough sets ...This paper combines interval-valued intuitionistic fuzzy sets and rough sets.It studies rougheness in interval-valued intuitionistic fuzzy sets and proposes one kind of interval-valued intuitionistic fuzzy-rough sets models under the equivalence relation in crisp sets.That extends the classical rough set defined by Pawlak.展开更多
1 Introduction In[5]we investigated the significance of some truth-functional three valued logics of ill-known sets described by pairs of disjoint(or pairs of nested) subsets.In particular,we referred to the case of r...1 Introduction In[5]we investigated the significance of some truth-functional three valued logics of ill-known sets described by pairs of disjoint(or pairs of nested) subsets.In particular,we referred to the case of rough sets showing that if from a mathematical standpoint we obtain sound results,the interpretation with respect展开更多
Since the introduction of rough sets in 1982 by Professor Zdzisaw Pawlak, we have witnessed great advances in both theory and applications. Rough set theory is closely related to knowledge technology in a variety of...Since the introduction of rough sets in 1982 by Professor Zdzisaw Pawlak, we have witnessed great advances in both theory and applications. Rough set theory is closely related to knowledge technology in a variety of forms such as knowledge discovery, approximate reasoning, intelligent and multiagent system design, knowledge intensive computations. The cutting-edge knowledge technologies have great impact on learning, pattern recognition, machine intelligence and automation of acquisition, transformation, communication, exploration and exploitation of knowledge. A principal thrust of such technologies is the utilization of methodologies that facilitate knowledge processing. To present the state-of-the-art scientific results, encourage academic and industrial interaction, and promote collaborative research in rough sets and knowledge technology worldwide, the 3rd International Conference on Rough Sets and Knowledge Technology will be held in Chengdu, China, May 17~19, 2008. It will provide a forum for researchers to discuss new results and exchange ideas, following the successful RSKT'06 (Chongqing, China) and JRS'07 (RSKT'07 together with RSFDGrC'07) (Toronto, Canada).展开更多
This paper is a purely mathematical one dealing with a common possible foundation of Fuzzy Set Theory and Rough Set Theory.It begins with a generalization of Obtulowicz's paper,rough sets and Heyting algebra value...This paper is a purely mathematical one dealing with a common possible foundation of Fuzzy Set Theory and Rough Set Theory.It begins with a generalization of Obtulowicz's paper,rough sets and Heyting algebra valued sets,published in Bull.Polish Acad Sc.(math),198.In this paper Obtulowicz proposes a special subcategory展开更多
文摘Recently,much interest has been given tomulti-granulation rough sets (MGRS), and various types ofMGRSmodelshave been developed from different viewpoints. In this paper, we introduce two techniques for the classificationof MGRS. Firstly, we generate multi-topologies from multi-relations defined in the universe. Hence, a novelapproximation space is established by leveraging the underlying topological structure. The characteristics of thenewly proposed approximation space are discussed.We introduce an algorithmfor the reduction ofmulti-relations.Secondly, a new approach for the classification ofMGRS based on neighborhood concepts is introduced. Finally, areal-life application from medical records is introduced via our approach to the classification of MGRS.
文摘As an extension of overlap functions, pseudo-semi-overlap functions are a crucial class of aggregation functions. Therefore, (I, PSO)-fuzzy rough sets are introduced, utilizing pseudo-semi-overlap functions, and further extended for applications in image edge extraction. Firstly, a new clustering function, the pseudo-semi-overlap function, is introduced by eliminating the symmetry and right continuity present in the overlap function. The relaxed nature of this function enhances its applicability in image edge extraction. Secondly, the definitions of (I, PSO)-fuzzy rough sets are provided, using (I, PSO)-fuzzy rough sets, a pair of new fuzzy mathematical morphological operators (IPSOFMM operators) is proposed. Finally, by combining the fuzzy C-means algorithm and IPSOFMM operators, a novel image edge extraction algorithm (FCM-IPSO algorithm) is proposed and implemented. Compared to existing algorithms, the FCM-IPSO algorithm exhibits more image edges and a 73.81% decrease in the noise introduction rate. The outstanding performance of (I, PSO)-fuzzy rough sets in image edge extraction demonstrates their practical application value.
文摘This article focuses on the relationship between mathematical morphology operations and rough sets,mainly based on the context of image retrieval and the basic image correspondence problem.Mathematical morphological procedures and set approximations in rough set theory have some clear parallels.Numerous initiatives have been made to connect rough sets with mathematical morphology.Numerous significant publications have been written in this field.Others attempt to show a direct connection between mathematical morphology and rough sets through relations,a pair of dual operations,and neighborhood systems.Rough sets are used to suggest a strategy to approximatemathematicalmorphology within the general paradigm of soft computing.A single framework is defined using a different technique that incorporates the key ideas of both rough sets and mathematical morphology.This paper examines rough set theory from the viewpoint of mathematical morphology to derive rough forms of themorphological structures of dilation,erosion,opening,and closing.These newly defined structures are applied to develop algorithm for the differential analysis of chest X-ray images from a COVID-19 patient with acute pneumonia and a health subject.The algorithm and rough morphological operations show promise for the delineation of lung occlusion in COVID-19 patients from chest X-rays.The foundations of mathematical morphology are covered in this article.After that,rough set theory ideas are taken into account,and their connections are examined.Finally,a suggested image retrieval application of the concepts from these two fields is provided.
基金supported by grants from the National Natural Science Foundation of China(Nos.61075120, 60673096 and 60773174)the Natural Science Foundation of Zhejiang Province in China(No.Y107262).
文摘This paper presents a general framework for the study of relation-based intuitionistic fuzzy rough sets determined by two intuitionistic fuzzy implicators.By employing two intuitionistic fuzzy implicators I and J,I -lower and J-upper approximations of intuitionistic fuzzy sets with respect to an intuitionistic fuzzy approximation space are first defined.Properties of(I,J) -intuitionistic fuzzy rough approximation operators are then examined.The connections between special types of intuitionistic fuzzy relations and properties of (I,J)-intuitionistic fuzzy approximation operators are also established.
基金The National Natural Science Foundation of China(No.60474022)
文摘The coveting rough sets theory is a generalization of traditional rough set theory, and can also describe information with incompleteness and fuzziness in information systems. In this paper, we first provide the definitions of several upper and lower covering approximation operators on the covering approximation space. Then, we study the properties of these operators. Finally, we propose the mutual relations between approximation operators and similar relations of the operator ( I ) based on the covering rough sets.
文摘The conceptions of the knowledge screen generated by S-rough sets are given: f- screen and - screen , and then puts forward - filter theorem, - filter theorem of knowledge. At last, the applications of knowledge separation are given according to - screen and - screen.
文摘Multi-attribute decision problems where the performances of the alternatives are random variables are considered. The suggested approach grades the probabilities of preference of one alternative over another with respect to the same attribute. Based on the graded probabilistic dominance relation, the pairwise comparison information table is defined. The global preferences of the decision maker can be seen as a rough binary relation. The present paper proposes to approximate this preference relation by means of the graded probabilistic dominance relation with respect to the subsets of attributes. At last, the method is illustrated by an example.
基金revised date May 14,2007 This work was partly supported by the UK EPSRC Grant(No.GR/S98603/01).
文摘Rough set theory provides a useful mathematical foundation for developing automated computational systems that can help understand and make use of imperfect knowledge. Despite its recency, the theory and its extensions have been widely applied to many problems, including decision analysis, data mining, intelligent control and pattern recognition. This paper presents an outline of the basic concepts of rough sets and their major extensions, covering variable precision, tolerance and fuzzy rough sets. It also shows the diversity of successful applications these theories have entailed, ranging from financial and business, through biological and medicine, to physical, art, and meteorological.
基金supported by National Natural Science Foundation of China under Grant No. 60873077/F020107the Science Research Project of Zhangzhou Normal University under Grant No. SK09002
文摘Covering-based rough sets process data organized by a covering of the universe. A soft set is a parameterized family of subsets of the universe. Both theories can deal with the uncertainties of data. Soft sets have not any restrictions on the approximate description of the object,and they might form a covering of the universe. From this viewpoint,we establish a connection between these two theories. Specifically,we propose a complementary parameter for this purpose. With this parameter,the soft covering approximation space is established and the two theories are bridged. Furthermore,we study some relations between the covering and the soft covering approximation space and obtain some significant results. Finally,we define a notion of combine parameter which can help us to simplify the set of parameters and reduce the storage requirement of a soft covering approximation space.
文摘Data mining (also known as Knowledge Discovery in Databases - KDD) is defined as the nontrivial extraction of implicit, previously unknown, and potentially useful information from data. The aims and objectives of data mining are to discover knowledge of interest to user needs.Data mining is really a useful tool in many domains such as marketing, decision making, etc. However, some basic issues of data mining are ignored. What is data mining? What is the product of a data mining process? What are we doing in a data mining process? Is there any rule we should obey in a data mining process? In order to discover patterns and knowledge really interesting and actionable to the real world Zhang et al proposed a domain-driven human-machine-cooperated data mining process.Zhao and Yao proposed an interactive user-driven classification method using the granule network. In our work, we find that data mining is a kind of knowledge transforming process to transform knowledge from data format into symbol format. Thus, no new knowledge could be generated (born) in a data mining process. In a data mining process, knowledge is just transformed from data format, which is not understandable for human, into symbol format,which is understandable for human and easy to be used.It is similar to the process of translating a book from Chinese into English.In this translating process,the knowledge itself in the book should remain unchanged. What will be changed is the format of the knowledge only. That is, the knowledge in the English book should be kept the same as the knowledge in the Chinese one.Otherwise, there must be some mistakes in the translating proces, that is, we are transforming knowledge from one format into another format while not producing new knowledge in a data mining process. The knowledge is originally stored in data (data is a representation format of knowledge). Unfortunately, we can not read, understand, or use it, since we can not understand data. With this understanding of data mining, we proposed a data-driven knowledge acquisition method based on rough sets. It also improved the performance of classical knowledge acquisition methods. In fact, we also find that the domain-driven data mining and user-driven data mining do not conflict with our data-driven data mining. They could be integrated into domain-oriented data-driven data mining. It is just like the views of data base. Users with different views could look at different partial data of a data base. Thus, users with different tasks or objectives wish, or could discover different knowledge (partial knowledge) from the same data base. However, all these partial knowledge should be originally existed in the data base. So, a domain-oriented data-driven data mining method would help us to extract the knowledge which is really existed in a data base, and really interesting and actionable to the real world.
文摘Decision trees induction algorithms have been used for classification in a wide range of application domains. In the process of constructing a tree, the criteria of selecting test attributes will influence the classification accuracy of the tree.In this paper,the degree of dependency of decision attribute to condition attribute,based on rough set theory,is used as a heuristic for selecting the attribute that will best separate the samples into individual classes.The result of an example shows that compared with the entropy-based approach,our approach is a better way to select nodes for constructing decision trees.
文摘The improved method has been presented for knowledge reduction in rough sets (R-S) theory, when R-S is used to model the information expression of oil and vibration diagnosis. Therefore, the typical fault simulation tests of rolling bearings have been made, and the application method of R-S has been also analysed in this paper. The diagnosis model of holding rack fault in rolling bearing was presented based on the improved reduction method. It is suited to information fusion to combine information when oil analysis and vibration analysis are combined for fault diagnosis.
基金supported by National Key Technology R&D Program of China (Grant No. 2006BAF01A07)National Hi-tech Research and Development Program of China (863 Program, Grant No. 2007AA04Z190)
文摘Computer aided process planning(CAPP) is an important content of computer integrated manufacturing, and intelligentizing is the orientation of development of CAPP. Process planning has characters of empirical and time-consuming to finalize, and the same technical aim always can be achieved by different process schemes, so intelligentizing of process decision making always be a difficult point of CAPP and computer integrated manufacturing (CIM). For the purpose of intelligent aided process decision making and reuse of process resource, this paper proposed a decision making method based on rough sets(RS) and regular distance computing. The main contents and methods of process planning decision making are analyzed under agile response manufacturing environment, the concept of process knowledge granule is represented, and the methods of process knowledge granule partitioning and granularity analysis are put forward. Based on the theory of RS and combined the method of process attributes importance identification, the paper brought forward a computing model for process scheme regulation distance under the same attribute conditions, and conflict resolution strategy was introduced to acquire process scheme fit for actual situation of enterprise's manufacturing resources, so as to realize process resources' conflict resolution and quick excavate and reuse of enterprises' existing process knowledge, to advance measures of process decision making and improve the rationality and capability of agile response of process planning.
文摘To investigate the judging problem of optimal dividing matrix among several fuzzy dividing matrices in fuzzy dividing space, correspondingly, which is determined by the various choices of cluster samples in the totality sample space, two algorithms are proposed on the basis of the data analysis method in rough sets theory: information system discrete algorithm (algorithm 1) and samples representatives judging algorithm (algorithm 2). On the principle of the farthest distance, algorithm 1 transforms continuous data into discrete form which could be transacted by rough sets theory. Taking the approximate precision as a criterion, algorithm 2 chooses the sample space with a good representative. Hence, the clustering sample set in inducing and computing optimal dividing matrix can be achieved. Several theorems are proposed to provide strict theoretic foundations for the execution of the algorithm model. An applied example based on the new algorithm model is given, whose result verifies the feasibility of this new algorithm model.
文摘Machine intelligence,is out of the system by the artificial intelligence shown.It is usually achieved by the average computer intelligence.Rough sets and Information Granules in uncertainty management and soft computing and granular computing is widely used in many fields,such as in protein sequence analysis and biobasis determination,TSM and Web service classification Etc.
基金supported by a grant of NSFC(70871036)a grant of National Basic Research Program of China(2009CB219801-3)
文摘Covering rough sets are improvements of traditional rough sets by considering cover of universe instead of partition.In this paper,we develop several measures based on evidence theory to characterize covering rough sets.First,we present belief and plausibility functions in covering information systems and study their properties.With these measures we characterize lower and upper approximation operators and attribute reductions in covering information systems and decision systems respectively.With these discussions we propose a basic framework of numerical characterizations of covering rough sets.
基金supported by grants from the National Natural Science Foundation of China(Nos.10971185 and 10971186)the Natural Science Foundation of Fujiang Province in China(No.2008F5066).
文摘This paper combines interval-valued intuitionistic fuzzy sets and rough sets.It studies rougheness in interval-valued intuitionistic fuzzy sets and proposes one kind of interval-valued intuitionistic fuzzy-rough sets models under the equivalence relation in crisp sets.That extends the classical rough set defined by Pawlak.
文摘1 Introduction In[5]we investigated the significance of some truth-functional three valued logics of ill-known sets described by pairs of disjoint(or pairs of nested) subsets.In particular,we referred to the case of rough sets showing that if from a mathematical standpoint we obtain sound results,the interpretation with respect
文摘Since the introduction of rough sets in 1982 by Professor Zdzisaw Pawlak, we have witnessed great advances in both theory and applications. Rough set theory is closely related to knowledge technology in a variety of forms such as knowledge discovery, approximate reasoning, intelligent and multiagent system design, knowledge intensive computations. The cutting-edge knowledge technologies have great impact on learning, pattern recognition, machine intelligence and automation of acquisition, transformation, communication, exploration and exploitation of knowledge. A principal thrust of such technologies is the utilization of methodologies that facilitate knowledge processing. To present the state-of-the-art scientific results, encourage academic and industrial interaction, and promote collaborative research in rough sets and knowledge technology worldwide, the 3rd International Conference on Rough Sets and Knowledge Technology will be held in Chengdu, China, May 17~19, 2008. It will provide a forum for researchers to discuss new results and exchange ideas, following the successful RSKT'06 (Chongqing, China) and JRS'07 (RSKT'07 together with RSFDGrC'07) (Toronto, Canada).
文摘This paper is a purely mathematical one dealing with a common possible foundation of Fuzzy Set Theory and Rough Set Theory.It begins with a generalization of Obtulowicz's paper,rough sets and Heyting algebra valued sets,published in Bull.Polish Acad Sc.(math),198.In this paper Obtulowicz proposes a special subcategory