Generalized Cauchy distribution (GCD)-based score functions for a fast and flexible subband decomposition ICA

Author(s):  
Marko Kanadi ◽  
Muhammad Tahir Akhtar ◽  
Wataru Mitsuhashi
2010 ◽  
Vol 30 (9) ◽  
pp. 2444-2448
Author(s):  
Ke-ji WANG ◽  
Zhi-wei KANG ◽  
Xin-huan LIU ◽  
Bu-zhen CHEN

Symmetry ◽  
2021 ◽  
Vol 13 (7) ◽  
pp. 1114
Author(s):  
Guillermo Martínez-Flórez ◽  
Roger Tovar-Falón ◽  
María Martínez-Guerra

This paper introduces a new family of distributions for modelling censored multimodal data. The model extends the widely known tobit model by introducing two parameters that control the shape and the asymmetry of the distribution. Basic properties of this new family of distributions are studied in detail and a model for censored positive data is also studied. The problem of estimating parameters is addressed by considering the maximum likelihood method. The score functions and the elements of the observed information matrix are given. Finally, three applications to real data sets are reported to illustrate the developed methodology.


Entropy ◽  
2020 ◽  
Vol 23 (1) ◽  
pp. 56
Author(s):  
Haoyu Niu ◽  
Jiamin Wei ◽  
YangQuan Chen

Stochastic Configuration Network (SCN) has a powerful capability for regression and classification analysis. Traditionally, it is quite challenging to correctly determine an appropriate architecture for a neural network so that the trained model can achieve excellent performance for both learning and generalization. Compared with the known randomized learning algorithms for single hidden layer feed-forward neural networks, such as Randomized Radial Basis Function (RBF) Networks and Random Vector Functional-link (RVFL), the SCN randomly assigns the input weights and biases of the hidden nodes in a supervisory mechanism. Since the parameters in the hidden layers are randomly generated in uniform distribution, hypothetically, there is optimal randomness. Heavy-tailed distribution has shown optimal randomness in an unknown environment for finding some targets. Therefore, in this research, the authors used heavy-tailed distributions to randomly initialize weights and biases to see if the new SCN models can achieve better performance than the original SCN. Heavy-tailed distributions, such as Lévy distribution, Cauchy distribution, and Weibull distribution, have been used. Since some mixed distributions show heavy-tailed properties, the mixed Gaussian and Laplace distributions were also studied in this research work. Experimental results showed improved performance for SCN with heavy-tailed distributions. For the regression model, SCN-Lévy, SCN-Mixture, SCN-Cauchy, and SCN-Weibull used less hidden nodes to achieve similar performance with SCN. For the classification model, SCN-Mixture, SCN-Lévy, and SCN-Cauchy have higher test accuracy of 91.5%, 91.7% and 92.4%, respectively. Both are higher than the test accuracy of the original SCN.


2021 ◽  
Vol 48 (3) ◽  
pp. 91-96
Author(s):  
Shigeo Shioda

The consensus achieved in the consensus-forming algorithm is not generally a constant but rather a random variable, even if the initial opinions are the same. In the present paper, we investigate the statistical properties of the consensus in a broadcasting-based consensus-forming algorithm. We focus on two extreme cases: consensus forming by two agents and consensus forming by an infinite number of agents. In the two-agent case, we derive several properties of the distribution function of the consensus. In the infinite-numberof- agents case, we show that if the initial opinions follow a stable distribution, then the consensus also follows a stable distribution. In addition, we derive a closed-form expression of the probability density function of the consensus when the initial opinions follow a Gaussian distribution, a Cauchy distribution, or a L´evy distribution.


2021 ◽  
pp. 1-12
Author(s):  
Muhammad Naeem ◽  
Muhammad Ali Khan ◽  
Saleem Abdullah ◽  
Muhammad Qiyas ◽  
Saifullah Khan

Probabilistic hesitant fuzzy Set (PHFs) is the most powerful and comprehensive idea to support more complexity than developed fuzzy set (FS) frameworks. In this paper, it can explain a novel, improved TOPSIS-based method for multi-criteria group decision-making (MCGDM) problem through the Probabilistic hesitant fuzzy environment, in which the weights of both experts and criteria are completely unknown. Firstly, we discuss the concept of PHFs, score functions and the basic operating laws of PHFs. In fact, to compute the unknown weight information, the generalized distance measure for PHFs was defined based on the Probabilistic hesitant fuzzy entropy measure. Second, MCGDM will be presented with the PHF information-based decision-making process.


Mathematics ◽  
2019 ◽  
Vol 7 (2) ◽  
pp. 166 ◽  
Author(s):  
Feng Feng ◽  
Meiqi Liang ◽  
Hamido Fujita ◽  
Ronald Yager ◽  
Xiaoyan Liu

Intuitionistic fuzzy multiple attribute decision making deals with the issue of ranking alternatives based on the decision information quantified in terms of intuitionistic fuzzy values. Lexicographic orders can serve as efficient and indispensable tools for comparing intuitionistic fuzzy values. This paper introduces a number of lexicographic orders by means of several measures such as the membership, non-membership, score, accuracy and expectation score functions. Some equivalent characterizations and illustrative examples are provided, from which the relationships among these lexicographic orders are ascertained. We also propose three different compatible properties of preorders with respect to the algebraic sum and scalar product operations of intuitionistic fuzzy values, and apply them to the investigation of compatible properties of various lexicographic orders. In addition, a benchmark problem regarding risk investment is further explored to give a comparative analysis of different lexicographic orders and highlight the practical value of the obtained results for solving real-world decision-making problems.


2021 ◽  
pp. 1-22
Author(s):  
Riaz Ali ◽  
Saleem Abdullah ◽  
Shakoor Muhammad ◽  
Muhammad Naeem ◽  
Ronnason Chinram

Due to the indeterminacy and uncertainty of the decision-makers (DM) in the complex decision making problems of daily life, evaluation and aggregation of the information usually becomes a complicated task. In literature many theories and fuzzy sets (FS) are presented for the evaluation of these decision tasks, but most of these theories and fuzzy sets have failed to explain the uncertainty and vagueness in the decision making issues. Therefore, we use complex intuitionistic fuzzy set (CIFS) instead of fuzzy set and intuitionistic fuzzy set (IFS). A new type of aggregation operation is also developed by the use of complex intuitionistic fuzzy numbers (CIFNs), their accuracy and the score functions are also discussed in detail. Moreover, we utilized the Maclaurin symmetric mean (MSM) operator, which have the ability to capture the relationship among multi-input arguments, as a result, CIF Maclarurin symmetric mean (CIFMSM) operator and CIF dual Maclaurin symmetric mean (CIFDMSM) operator are presented and their characteristics are discussed in detail. On the basis of these operators, a MAGDM method is presented for the solution of group decision making problems. Finally, the validation of the propounded approach is proved by evaluating a numerical example, and by the comparison with the previously researched results.


Sign in / Sign up

Export Citation Format

Share Document