Elliptic entropy of uncertain set and its applications
نویسندگان
چکیده
Entropy is commonly used as a way to measure the uncertainty of random variables. In uncertain set theory, a concept of entropy for uncertain sets has been defined by using logarithm. However, such an entropy fails to measure the uncertain degree of some uncertain sets. This paper aims at proposing a concept of elliptic entropy for uncertain sets, and investigating its properties such as translation invariance and positive linearity. It also provides some formulas for calculating the elliptic entropy via inverse membership functions. Additionally, elliptic relative entropy for uncertain sets is presented as a measure of the difference between two membership functions, and some applications are considered in portfolio selection and clustering.
منابع مشابه
Some local fixed point results under $C$-class functions with applications to coupled elliptic systems
The main objective of the paper is to state newly fixed point theorems for set-valued mappings in the framework of 0-complete partial metric spaces which speak about a location of a fixed point with respect to an initial value of the set-valued mapping by using some $C$-class functions. The results proved herein generalize, modify and unify some recent results of the existing literature. As an ...
متن کاملSine entropy of uncertain set and its applications
Entropy is used as a quantitative measurement of the information deficiency. In uncertain set theory, logarithm entropy for uncertain set has been proposed. However, it fails to measure the degree of uncertainty associated with some uncertain sets. Thus this paper will propose sine entropy for uncertain set as a supplement, and investigate its properties such as translation invariance and posit...
متن کاملElliptic entropy of uncertain random variables
Entropies of uncertain random variables are introduced to provide some kinds of quantitative measurement of the uncertainty. In chance theory, a concept of entropy for uncertain random variables has been defined by using logarithm. However, such an entropy fails to measure the uncertain degree of some uncertain random variables. For solving this problem, this paper firstly define the elliptic e...
متن کاملMining Frequent Patterns in Uncertain and Relational Data Streams using the Landmark Windows
Todays, in many modern applications, we search for frequent and repeating patterns in the analyzed data sets. In this search, we look for patterns that frequently appear in data set and mark them as frequent patterns to enable users to make decisions based on these discoveries. Most algorithms presented in the context of data stream mining and frequent pattern detection, work either on uncertai...
متن کاملEfficient elliptic curve cryptosystems
Elliptic curve cryptosystems (ECC) are new generations of public key cryptosystems that have a smaller key size for the same level of security. The exponentiation on elliptic curve is the most important operation in ECC, so when the ECC is put into practice, the major problem is how to enhance the speed of the exponentiation. It is thus of great interest to develop algorithms for exponentiation...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Int. J. Intell. Syst.
دوره 33 شماره
صفحات -
تاریخ انتشار 2018