International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems

This paper applies a ridge estimation approach in an existing partial logistic regression model with exact predictors, intuitionistic fuzzy responses, intuitionistic fuzzy coefficients and intuitionistic fuzzy smooth function to improve an existing intuitionistic fuzzy partial logistic regression model in the presence of multicollinearity. For this purpose, ridge methodology is also involved to estimate the parametric intuitionistic fuzzy coefficients and nonparametric intuitionistic fuzzy smooth function. Some common goodness-of-fit criteria are also used to examine the performance of the proposed regression model. The potential application of the proposed method are illustrated and compared with the intuitionistic partial logistic regression model through two numerical examples. The results clearly indicate the proposed ridge method is quite efficient in model’s performances when there is multicollinearity among the predictors.

Trade-off problems concentrate on balancing the main parameters of a project as completion time, total cost and quality of activities. In this study, the problem of project time-cost-quality trade-off is formulated and solved from a new standpoint. For this purpose, completion time and crash cost of project are illustrated as fuzzy goals, also the dependency of implementing time of each activity and its execution-quality is described by a fuzzy number. The overall quality of the project execution is defined as the minimum execution-quality of the project activities that should be maximized. Based on some real assumptions, a three-objective programming problem associated with the time-cost-quality trade-off problem is formulated; then with the aim of identifying a fair and appropriate trade-off, the research problem is reformulated as a single objective linear programming by utilizing a fuzzy decision-making methodology. Generating a final preferred solution, rather than a set of Pareto optimal solutions, and having a reasonable interpretation are two most important advantages of the proposed approach. To explain the practical performance of the proposed models and approach, a time-cost-quality trade-off problem for a project with real data is solved and analyzed.

The problem of belief change is considered as a major issue in managing the dynamics of an information system. It consists in modifying an uncertainty distribution, representing agents’ beliefs, in the light of a new information. In this paper, we focus on the so-called multiple iterated belief revision or C-revision, proposed for conditioning or revising uncertain distributions under uncertain inputs. Uncertainty distributions are represented in terms of ordinal conditional functions. We will use prioritized or weighted knowledge bases as a compact representation of uncertainty distributions. The input information leading to a revision of an uncertainty distribution is also represented by a set of consistent weighted formulas. This paper shows that C-revision, defined at a semantic level using ordinal conditional functions, has a very natural representation using weighted knowledge bases. We propose simple syntactic methods for revising weighted knowledge bases, that are semantically meaningful in the frameworks of possibility theory and ordinal conditional functions. In particular, we show that the space complexity of the proposed syntactic C-revision is linear with respect to the size of initial weighted knowledge bases.

Interval type-2 fuzzy sets provide us with additional degrees of freedom to represent the uncertainty and the fuzziness of the real word than traditional type-1 fuzzy sets. Interval type-2 fuzzy numbers ranking has an important role in the decision making analysis. In this paper, the probatilistic mean value and variance of interval type-2 fuzzy numbers are proposed based on the Mellin transform for type-1 fuzzy numbers. The interval type-2 fuzzy number with the higher mean is ranked higher. If the mean values are equal the one with the smaller variance is judged higher rank. On this basis, some new distance measures and possibility degree formula are proposed to comparing interval type-2 fuzzy numbers based on their Mellin mean value and variance. Some benchmarking numerical examples are given, and some interpretation issues are explained.

This paper discusses the resolution of max-Archimedean bipolar fuzzy relation equations. In the literature, many methods have been proposed based on 0-1 integer programming problem or reduction methods for the optimization with bipolar fuzzy relation equations. A new concept based on the idea of covering and the notions of leading, non-leading variables are introduced in the present paper for finding the solutions of max-Archimedean bipolar fuzzy relation equations. It is shown that the problem of finding the complete solution set of the system of max-Archimedean bipolar fuzzy relation equations is equivalent to solving a covering problem and the solutions of such equations correspond to irredundant coverings of the covering problem. The proposed method is illustrated with some examples.

Kernel methods are a class of algorithms for pattern analysis to robust them to noise, overlaps, outliers and also unequal sized clusters. In this paper, kernel-based fuzzy c-means (KFCM) method is extended to apply KFCM on any crisp and non-crisp input numbers only in a single structure. The proposed vectorized KFCM (VKFM) algorithm maps the input (crisp or non-crisp) features to crisp ones and applies the KFCM (with prototypes in feature space) on them. Finally the resulted crisp prototypes in the mapped space are influenced by an inverse mapping to obtain the prototypes’ (centers’) parameters in the input features space. The performance of the proposed method has been compared with the conventional FCM and KFCM and other new methods, to show its effectiveness in clustering of gene expression data and segmentation of land-cover using satellite images. Simulation results show good accuracy of proposed method in compare to other methods.

Within the field of supervised classification, the naïve Bayes (NB) classifier is a very simple and fast classification method that obtains good results, being even comparable with much more complex models. It has been proved that the NB model is strongly dependent on the estimation of conditional probabilities. In the literature, it had been shown that the classical and Laplace estimations of probabilities have some drawbacks and it was proposed a NB model that takes into account the a priori probabilities in order to estimate the conditional probabilities, which was called m-probability-estimation. With a very scarce experimentation, this approximation based on m-probability-estimation demonstrated to provide better results than NB with classical and Laplace estimations of probabilities. In this research, a new naïve Bayes variation is proposed, which is based on the m-probability-estimation version and takes into account imprecise probabilities in order to calculate the a priori probabilities. An exhaustive experimental research is carried out, with a large number of data sets and different levels of class noise. From this experimentation, we can conclude that the proposed NB model and the m-probability-estimation approach provide better results than NB with classical and Laplace estimation of probabilities. It will be also shown that the proposed NB implies an improvement over the m-probability-estimation model, especially when there is some class noise.

Social media represent a rich source of information, such as critiques, feedback, and other opinions posted online by Internet users. Such information is typically a good reflection of users’ sentiments and attitudes towards various services, topics, or products. Sentiment analysis has become an increasingly important natural language processing (NLP) task to help users make sense of what is happening in the Internet blogosphere and it can be useful for companies as well as public organizations. However, most existing sentiment analysis techniques are only able to analyze data at the aggregate level, merely providing a binary classification (positive vs. negative), and are not able to generate finer characterizations of sentiments as well as emotions involved. This paper describes a new opinion analysis scheme, i.e., a multi-level fine-scaled sentiment sensing with ambivalence handling. The ambivalence handler is presented in detail along with the strength-level tune parameters for analyzing the strength and the fine-scale of both positive or negative sentiments. It is capable of drilling deeper into text in order to reveal multi-level fine-scaled sentiments as well as different types of emotions.

Please send your abstracts (or copies of papers that you want to see reviewed here) to vladik@utep.edu, or by regular mail to Vladik Kreinovich, Department of Computer Science, University of Texas at El Paso, El Paso, TX 79968, USA.