For neighborhood rough set attribute reduction algorithms based on dependency degree,a neighborhood computation method incorporating attribute weight values and a neighborhood rough set attribute reduction algorithm u...For neighborhood rough set attribute reduction algorithms based on dependency degree,a neighborhood computation method incorporating attribute weight values and a neighborhood rough set attribute reduction algorithm using discernment as the heuristic information was proposed.The reduction algorithm comprehensively considers the dependency degree and neighborhood granulation degree of attributes,allowing for a more accurate measurement of the importance degrees of attributes.Example analyses and experimental results demonstrate the feasibility and effectiveness of the algorithm.展开更多
By using two-directional S-rough sets, the concepts of （f, f）-interference generation and （f, f）- interference law generation of knowledge, F-interference generation and F-interference law generation of two-direct...By using two-directional S-rough sets, the concepts of （f, f）-interference generation and （f, f）- interference law generation of knowledge, F-interference generation and F-interference law generation of two-directional S-rough sets are proposed. Based on the concepts above, the relation theoreras between F-interference loss and F-interference degree, the relation theorems between F-interference loss law and F-interference degree law, the dis- cernibility theorems between F-interference and F-interference law are presented. At last, the recognition criterion of F-interference law and its application are given.展开更多
With development of web services technology, the number of existing services in the internet is growing day by day. In order to achieve automatic and accurate services classification which can be beneficial for servic...With development of web services technology, the number of existing services in the internet is growing day by day. In order to achieve automatic and accurate services classification which can be beneficial for service related tasks, a rough set theory based method for services classification was proposed. First, the services descriptions were preprocessed and represented as vectors. Elicited by the discernibility matrices based attribute reduction in rough set theory and taking into account the characteristic of decision table of services classification, a method based on continuous discernibility matrices was proposed for dimensionality reduction. And finally, services classification was processed automatically. Through the experiment, the proposed method for services classification achieves approving classification result in all five testing categories. The experiment result shows that the proposed method is accurate and could be used in practical web services classification.展开更多
A method for data classification will influence the efficiency of classification. Attributes reduction based on discernibility matrix and discernibility function in rough sets can use in data classification, so we put...A method for data classification will influence the efficiency of classification. Attributes reduction based on discernibility matrix and discernibility function in rough sets can use in data classification, so we put forward a method for data classification. Namely, firstly, we use discernibility matrix and discernibility function to delete superfluous attributes in formation system and get a necessary attribute set. Secondly, we delete superfluous attribute values and get decision rules. Finally, we classify data by means of decision rules. The experiments show that data classification using this method is simpler in the structure, and can improve the efficiency of classification.展开更多
Based on equivalence relation,the classical rough set theory is unable to deal with incomplete information systems.In this case,an extended rough set model based on valued tolerance relation and prior probability obta...Based on equivalence relation,the classical rough set theory is unable to deal with incomplete information systems.In this case,an extended rough set model based on valued tolerance relation and prior probability obtained from incomplete information systems is firstly founded.As a part of the model,the corresponding discernibility matrix and an attribute reduction of incomplete information system are then proposed.Finally,the extended rough set model and the proposed attribute reduction algorithm are verified under an incomplete information system.展开更多
By employing function S-rough sets,the concepts of f-interference generation and separation of law,and the F-interference generation and separation of S-rough laws were proposed. Base on the concepts above,the F-inter...By employing function S-rough sets,the concepts of f-interference generation and separation of law,and the F-interference generation and separation of S-rough laws were proposed. Base on the concepts above,the F-interference relation theorems,the F-interference discernibility theorem,the dependent separation theorem by interfereence,and the dependent separation principle by interference were presented; finally the application was given. By employing F-interference dependence and separation of S-rough laws,the changes of characteristic of dynamic systemic regularities could be recognized.展开更多
It is well known that most of information systems are based on tolerance relation instead of the classical equivalence relation because of various factors in real-world. To acquire brief decision rules from the inform...It is well known that most of information systems are based on tolerance relation instead of the classical equivalence relation because of various factors in real-world. To acquire brief decision rules from the information systems, lower approximation reduction is needed. In this paper, the lower approximation reduction is proposed in inconsistent information systems based on tolerance relation. Moreover, the properties are discussed. Furthermore, judgment theorem and discernibility matrix are obtained, from which an approach to lower reductions can be provided in the complicated information systems.展开更多
Trochanteric bursitis is one of the most common causes of lateral hip pain in adults.The prevalence of unilateral trochanteric bursitis is 15.0%in women and 8.5%in men.Access to internet based information has increase...Trochanteric bursitis is one of the most common causes of lateral hip pain in adults.The prevalence of unilateral trochanteric bursitis is 15.0%in women and 8.5%in men.Access to internet based information has increased dramatically and health related information is now one of the most popular searches in online activity,despite this the quality of information can vary.The objective of this paper is to examine the quality and readability of internet based information of trochanteric bursitis.Overall,we have found a high variability among not only the quality but also the readability of information published.Websites that appeared first on each search engine for trochanteric bursitis did not necessarily score better,demonstrating the importance of providing patients with high quality resources.Future articles should use more critical appraisal tools in order to provide the reader with more high quality and readable information.展开更多
LINGNAN Village in Tonglu County, east China＇s Zhejiang Province. has seen bed and breakfast （B＆B） accommodations flourishing in recent years, with vil- lagers and newcomers alike taking advantage of this promisin...LINGNAN Village in Tonglu County, east China＇s Zhejiang Province. has seen bed and breakfast （B＆B） accommodations flourishing in recent years, with vil- lagers and newcomers alike taking advantage of this promising business. Zhu Zhenhua, from Zhejiang＇s capital city Hangzhou, moved to a village with his wife in 2008. They rented a courtyard property and spent about 300,000 yuan （$46,154） on its renovation. As tourists came to the village and asked whether they could pay to stay in the house, Zhu turned it into a B＆B business.展开更多
In this paper, we present reduction algorithms based on the principle of Skowron's discernibility matrix - the ordered attributes method. The completeness of the algorithms for Pawlak reduct and the uniqueness for...In this paper, we present reduction algorithms based on the principle of Skowron's discernibility matrix - the ordered attributes method. The completeness of the algorithms for Pawlak reduct and the uniqueness for a given order of the attributes are proved. Since a discernibility matrix requires the size of the memory of U2, U is a universe of objects, it would be impossible to apply these algorithms directly to a massive object set. In order to solve the problem, a so-called quasi-discernibility matrix and two reduction algorithms are proposed. Although the proposed algorithms are incomplete for Pawlak reduct, their opimal paradigms ensure the completeness as long as they satisfy some conditions. Finally we consider the problem on the reduction of distributive object sets.展开更多
One view of finding a personalized solution of reduct in an information system is grounded on the viewpoint that attribute order can serve as a kind of semantic representation of user requirements. Thus the problem of...One view of finding a personalized solution of reduct in an information system is grounded on the viewpoint that attribute order can serve as a kind of semantic representation of user requirements. Thus the problem of finding personalized solutions can be transformed into computing the reduct on an attribute order. The second attribute theorem describes the relationship between the set of attribute orders and the set of reducts, and can be used to transform the problem of searching solutions to meet user requirements into the problem of modifying reduct based on a given attribute order. An algorithm is implied based on the second attribute theorem, with computation on the discernibility matrix. Its time complexity is O（n^2 × m） （n is the number of the objects and m the number of the attributes of an information system）. This paper presents another effective second attribute algorithm for facilitating the use of the second attribute theorem, with computation on the tree expression of an information system. The time complexity of the new algorithm is linear in n. This algorithm is proved to be equivalent to the algorithm on the discernibility matrix.展开更多
To extract and express the knowledge hidden in information systems, discernibility matrix and its extensions were introduced and applied successfully in many real life applications. Binary discernibility matrix, as a ...To extract and express the knowledge hidden in information systems, discernibility matrix and its extensions were introduced and applied successfully in many real life applications. Binary discernibility matrix, as a representative approach, has many interesting superior properties and has been rapidly developed to find intuitive and easy to understand knowledge. However, at present, the binary discernibility matrix is mainly adopted in the complete information system. It is a challenging topic how to achieve the attribute reduction by using binary discernibility matrix in incomplete information system. A form of generalized binary discernibility matrix is further developed for a number of representative extended rough set models that deal with incomplete information systems. Some useful properties and criteria are introduced for judging the attribute core and attribute relative reduction. Thereafter, a new algorithm is formulated which supports attribute core and attribute relative reduction based on the generalized binary discernibility matrix. This algorithm is not only suitable for consistent information systems but also inconsistent information systems. The feasibility of the proposed methods was demonstrated by worked examples and experimental analysis.展开更多
基金Anhui Provincial University Research Project(Project Number:2023AH051659)Tongling University Talent Research Initiation Fund Project(Project Number:2022tlxyrc31)+1 种基金Tongling University School-Level Scientific Research Project(Project Number:2021tlxytwh05)Tongling University Horizontal Project(Project Number:2023tlxyxdz237)。
文摘For neighborhood rough set attribute reduction algorithms based on dependency degree,a neighborhood computation method incorporating attribute weight values and a neighborhood rough set attribute reduction algorithm using discernment as the heuristic information was proposed.The reduction algorithm comprehensively considers the dependency degree and neighborhood granulation degree of attributes,allowing for a more accurate measurement of the importance degrees of attributes.Example analyses and experimental results demonstrate the feasibility and effectiveness of the algorithm.
基金supported partly by the Natural Science Foundation of Fujian Province,China(S0650031)the Science and Technology Foundation of Education Department of Fujian Province,China(JA05327)the Key Subject of Sanming University(ZDXK0604).
文摘By using two-directional S-rough sets, the concepts of （f, f）-interference generation and （f, f）- interference law generation of knowledge, F-interference generation and F-interference law generation of two-directional S-rough sets are proposed. Based on the concepts above, the relation theoreras between F-interference loss and F-interference degree, the relation theorems between F-interference loss law and F-interference degree law, the dis- cernibility theorems between F-interference and F-interference law are presented. At last, the recognition criterion of F-interference law and its application are given.
基金Projects(9140A0605,0409JB8102) supported by Weaponry Equipment Pre-Research Foundation of PLA Equipment Ministry of ChinaProject(2009JSJ11) supported by Pre-Research Foundation of PLA University of Science and Technology,China
文摘With development of web services technology, the number of existing services in the internet is growing day by day. In order to achieve automatic and accurate services classification which can be beneficial for service related tasks, a rough set theory based method for services classification was proposed. First, the services descriptions were preprocessed and represented as vectors. Elicited by the discernibility matrices based attribute reduction in rough set theory and taking into account the characteristic of decision table of services classification, a method based on continuous discernibility matrices was proposed for dimensionality reduction. And finally, services classification was processed automatically. Through the experiment, the proposed method for services classification achieves approving classification result in all five testing categories. The experiment result shows that the proposed method is accurate and could be used in practical web services classification.
基金Supported by the National Natural Science Foun-dation of China(60474022)
文摘A method for data classification will influence the efficiency of classification. Attributes reduction based on discernibility matrix and discernibility function in rough sets can use in data classification, so we put forward a method for data classification. Namely, firstly, we use discernibility matrix and discernibility function to delete superfluous attributes in formation system and get a necessary attribute set. Secondly, we delete superfluous attribute values and get decision rules. Finally, we classify data by means of decision rules. The experiments show that data classification using this method is simpler in the structure, and can improve the efficiency of classification.
基金supported by the Foundation and Frontier Technologies Research Plan Projects of Henan Province of China under Grant No. 102300410266
文摘Based on equivalence relation,the classical rough set theory is unable to deal with incomplete information systems.In this case,an extended rough set model based on valued tolerance relation and prior probability obtained from incomplete information systems is firstly founded.As a part of the model,the corresponding discernibility matrix and an attribute reduction of incomplete information system are then proposed.Finally,the extended rough set model and the proposed attribute reduction algorithm are verified under an incomplete information system.
基金Science and Technology Foundations of the Education Committee of Fujian Province of China (No.JA09232, No.JA08236)Science and Technology Projects of Sanming University, China (No. HX201007/Z)
文摘By employing function S-rough sets,the concepts of f-interference generation and separation of law,and the F-interference generation and separation of S-rough laws were proposed. Base on the concepts above,the F-interference relation theorems,the F-interference discernibility theorem,the dependent separation theorem by interfereence,and the dependent separation principle by interference were presented; finally the application was given. By employing F-interference dependence and separation of S-rough laws,the changes of characteristic of dynamic systemic regularities could be recognized.
文摘It is well known that most of information systems are based on tolerance relation instead of the classical equivalence relation because of various factors in real-world. To acquire brief decision rules from the information systems, lower approximation reduction is needed. In this paper, the lower approximation reduction is proposed in inconsistent information systems based on tolerance relation. Moreover, the properties are discussed. Furthermore, judgment theorem and discernibility matrix are obtained, from which an approach to lower reductions can be provided in the complicated information systems.
文摘Trochanteric bursitis is one of the most common causes of lateral hip pain in adults.The prevalence of unilateral trochanteric bursitis is 15.0%in women and 8.5%in men.Access to internet based information has increased dramatically and health related information is now one of the most popular searches in online activity,despite this the quality of information can vary.The objective of this paper is to examine the quality and readability of internet based information of trochanteric bursitis.Overall,we have found a high variability among not only the quality but also the readability of information published.Websites that appeared first on each search engine for trochanteric bursitis did not necessarily score better,demonstrating the importance of providing patients with high quality resources.Future articles should use more critical appraisal tools in order to provide the reader with more high quality and readable information.
文摘LINGNAN Village in Tonglu County, east China＇s Zhejiang Province. has seen bed and breakfast （B＆B） accommodations flourishing in recent years, with vil- lagers and newcomers alike taking advantage of this promising business. Zhu Zhenhua, from Zhejiang＇s capital city Hangzhou, moved to a village with his wife in 2008. They rented a courtyard property and spent about 300,000 yuan （$46,154） on its renovation. As tourists came to the village and asked whether they could pay to stay in the house, Zhu turned it into a B＆B business.
文摘In this paper, we present reduction algorithms based on the principle of Skowron's discernibility matrix - the ordered attributes method. The completeness of the algorithms for Pawlak reduct and the uniqueness for a given order of the attributes are proved. Since a discernibility matrix requires the size of the memory of U2, U is a universe of objects, it would be impossible to apply these algorithms directly to a massive object set. In order to solve the problem, a so-called quasi-discernibility matrix and two reduction algorithms are proposed. Although the proposed algorithms are incomplete for Pawlak reduct, their opimal paradigms ensure the completeness as long as they satisfy some conditions. Finally we consider the problem on the reduction of distributive object sets.
基金This work was supported by the National 973 Program of China(Grant No．2002CB3 1 2200)the National Natural Science Foundation of China(Grant No．60373038) the Natural Scientific Research Project ofthe Education Department ofShaanxi Province in China(Grant No．04JK131)．
基金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
基金Supported by the National Natural Science Foundation of China under Grant No. 60175023 and the National Basic Research 973 Program of China under Grant No. 2004CB318103
文摘One view of finding a personalized solution of reduct in an information system is grounded on the viewpoint that attribute order can serve as a kind of semantic representation of user requirements. Thus the problem of finding personalized solutions can be transformed into computing the reduct on an attribute order. The second attribute theorem describes the relationship between the set of attribute orders and the set of reducts, and can be used to transform the problem of searching solutions to meet user requirements into the problem of modifying reduct based on a given attribute order. An algorithm is implied based on the second attribute theorem, with computation on the discernibility matrix. Its time complexity is O（n^2 × m） （n is the number of the objects and m the number of the attributes of an information system）. This paper presents another effective second attribute algorithm for facilitating the use of the second attribute theorem, with computation on the tree expression of an information system. The time complexity of the new algorithm is linear in n. This algorithm is proved to be equivalent to the algorithm on the discernibility matrix.
基金supported by the National Natural Science Foundation of China (61403184, 61105082)the ‘1311 Talent Plan’ of Nanjing University of Posts and Telecommunications (NY2013)+3 种基金the ‘Qinglan’ Project of Jiangsu Province (QL2016)the Natural Science Foundation of Nanjing University of Posts and Telecommunications (215149)the Priority Academic Program Development of Jiangsu Higher Education Institutions, (PAPD)the Major Program of the Natural Science Foundation of Jiangsu Province Education Commission (17KJA120001)
文摘To extract and express the knowledge hidden in information systems, discernibility matrix and its extensions were introduced and applied successfully in many real life applications. Binary discernibility matrix, as a representative approach, has many interesting superior properties and has been rapidly developed to find intuitive and easy to understand knowledge. However, at present, the binary discernibility matrix is mainly adopted in the complete information system. It is a challenging topic how to achieve the attribute reduction by using binary discernibility matrix in incomplete information system. A form of generalized binary discernibility matrix is further developed for a number of representative extended rough set models that deal with incomplete information systems. Some useful properties and criteria are introduced for judging the attribute core and attribute relative reduction. Thereafter, a new algorithm is formulated which supports attribute core and attribute relative reduction based on the generalized binary discernibility matrix. This algorithm is not only suitable for consistent information systems but also inconsistent information systems. The feasibility of the proposed methods was demonstrated by worked examples and experimental analysis.
