نتایج جستجو برای: rough set theory
تعداد نتایج: 1361424 فیلتر نتایج به سال:
اساس نظریه مجموعه های ناهموار، بدین صورت است که برای هر زیرمجموعه از یک مجموعه کلی، با استفاده از یک رابه هم ارزی، یک زوج مرتب از مجموعه ها را معرفی می کند. هر موفه را به ترتیب، تقریب پایینی و بالایی می نامند. تقریب پایین از یک زیرمجموعه،اجتماع تمام عناصری از مجموعه ی کلی است که کلاس هم ارزی مربوط به آن عنصر، در زیرمجموعه ی مورد نظر قرار گیرد و همچنین، تقریب بالا از آن زیرمجموعه، اجتماع تمام عن...
The aim of this paper is to introduce and study set- valued homomorphism on lattices and T-rough lattice with respect to a sublattice. This paper deals with T-rough set approach on the lattice theory. The result of this study contributes to, T-rough fuzzy set and approximation theory and proved in several papers. Keywords: approximation space; lattice; prime ideal; rough ideal; T-rough set; set...
decision support systems (dsss) are prevalent information systems for decision making in many competitive business environments. in a dss, decision making process is intimately related to some factors which determine the quality of information systems and their related products. traditional approaches to data analysis usually cannot be implemented in sophisticated companies, where managers need...
decision support systems (dsss) are prevalent information systems for decision making in many competitive business environments. in a dss, decision making process is intimately related to some factors which determine the quality of information systems and their related products. traditional approaches to data analysis usually cannot be implemented in sophisticated companies, where managers nee...
the aim of this paper is to introduce and study set- valued homomorphism on lattices and t-rough lattice with respect to a sublattice. this paper deals with t-rough set approach on the lattice theory. the result of this study contributes to, t-rough fuzzy set and approximation theory and proved in several papers. keywords: approximation space; lattice; prime ideal; rough ideal; t-rough set; set...
Classical structure of rough set theory was first formulated by Z. Pawlak in [6]. The foundation of its object classification is an equivalence binary relation and equivalence classes. The upper and lower approximation operations are two core notions in rough set theory. They can also be seenas a closure operator and an interior operator of the topology induced by an equivalence relation on a u...
location selection is one of the most important activities in establishment of bank branches. choosing a suitable location have a direct impact on the performance of banks and also facilitating the achievement of other objectives. there are a lot of influential factors on the location selection which are complicated and therefore the traditional methods cannot be used. so we need to have a suit...
Designing a system with an emphasis on minimal human intervention helps users to explore information quickly. Adverting to methods of analyzing large data is compulsory as well. Hence, utilizing power of the data mining process to identify patterns and models become more essential from aspect of relationship between the various elements in the database and discover hidden knowledge. Therefore, ...
Rough data envelopment analysis (RDEA) evaluates the performance of the decision making units (DMUs) under rough uncertainty assumption. In this paper, new discussion regarding RDEA is extended. The RSBM model is proposed by integrating SBM model and rough set theory. The process of reaching solution is presented and this model is applied to efficiency evaluation of the DMUs with uncertain ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید