A Review on Information Accessing Systems Based on Fuzzy Linguistic Modelling

This paper presents a survey of some fuzzy linguistic information access systems. The review shows information retrieval systems, filtering systems, recommender systems, and web quality evaluation tools, which are based on tools of fuzzy linguistic modelling. The fuzzy linguistic modelling allows us to represent and manage the subjectivity, vagueness and imprecision that is intrinsic and characteristic of the processes of information searching, and, in such a way, the developed systems allow users the access to quality information in a flexible and user-adapted way.European Union (EU) TIN2007-61079 PET2007-0460Ministry of Public Works 90/07Excellence Andalusian Project TIC529

Symbolic Approximate Reasoning Within Unbalanced Multi-sets: Application to Autism Diagnosis

International audienceIn most daily activities, humans often use imprecise information derived from appreciation instead of exact measurements to make decisions. Multisets allow the representation of imperfect information in a Knowledge-Based System (KBS), in the multivalued logic context. New facts are deduced using approximate reasoning. In the literature, dealing with imperfect information relies on an implicit assumption: the distribution of terms is uniform on a scale ranging from 0 to 1. Nevertheless, in some cases, a sub-domain of this scale may be more informative and may include more terms. In this work, we focus on approximate reasoning within these sets, known as unbalanced sets, in the context of multi-valued logic. We introduce an approach based on the Generalized Modus Ponens (GMP) model using Generalized Symbolic Modifiers (GSM). The proposed model is implemented in a tool for autism diagnosis by means of unbalanced severity degrees of the Childhood Autism Rating Scale (CARS). We obtain satisfying results on the distinction between autistic and not autistic child compared to psychiatrists diagnosis

Dynamic adaptation of user profiles in recommender systems

In a period of time in which the content available through the Internet increases exponentially and is more easily accessible every day, techniques for aiding the selection and extraction of important and personalised information are of vital importance. Recommender Systems (RS) appear as a tool to help the user in a decision making process by evaluating a set of objects or alternatives and aiding the user at choosing which one/s of them suits better his/her interests or preferences. Those preferences need to be accurate enough to produce adequate recommendations and should be updated if the user changes his/her likes or if they are incorrect or incomplete. In this work an adequate model for managing user preferences in a multi-attribute (numerical and categorical) environment is presented to aid at providing recommendations in those kinds of contexts. The evaluation process of the recommender system designed is supported by a new aggregation operator (Unbalanced LOWA) that enables the combination of the information that defines an alternative into a single value, which then is used to rank the whole set of alternatives. After the recommendation has been made, learning processes have been designed to evaluate the user interaction with the system to find out, in a dynamic and unsupervised way, if the user profile in which the recommendation process relies on needs to be updated with new preferences. The work detailed in this document also includes extensive evaluation and testing of all the elements that take part in the recommendation and learning processes

Contour Based 3D Biological Image Reconstruction and Partial Retrieval

Image segmentation is one of the most difficult tasks in image processing. Segmentation algorithms are generally based on searching a region where pixels share similar gray level intensity and satisfy a set of defined criteria. However, the segmented region cannot be used directly for partial image retrieval. In this dissertation, a Contour Based Image Structure (CBIS) model is introduced. In this model, images are divided into several objects defined by their bounding contours. The bounding contour structure allows individual object extraction, and partial object matching and retrieval from a standard CBIS image structure. The CBIS model allows the representation of 3D objects by their bounding contours which is suitable for parallel implementation particularly when extracting contour features and matching them for 3D images require heavy computations. This computational burden becomes worse for images with high resolution and large contour density. In this essence we designed two parallel algorithms; Contour Parallelization Algorithm (CPA) and Partial Retrieval Parallelization Algorithm (PRPA). Both algorithms have considerably improved the performance of CBIS for both contour shape matching as well as partial image retrieval. To improve the effectiveness of CBIS in segmenting images with inhomogeneous backgrounds we used the phase congruency invariant features of Fourier transform components to highlight boundaries of objects prior to extracting their contours. The contour matching process has also been improved by constructing a fuzzy contour matching system that allows unbiased matching decisions. Further improvements have been achieved through the use of a contour tailored Fourier descriptor to make translation and rotation invariance. It is proved to be suitable for general contour shape matching where translation, rotation, and scaling invariance are required. For those images which are hard to be classified by object contours such as bacterial images, we define a multi-level cosine transform to extract their texture features for image classification. The low frequency Discrete Cosine Transform coefficients and Zenike moments derived from images are trained by Support Vector Machine (SVM) to generate multiple classifiers

Overall Performance Evaluation of Tubular Scraper Conveyors Using a TOPSIS-Based Multiattribute Decision-Making Method

Properly evaluating the overall performance of tubular scraper conveyors (TSCs) can increase their overall efficiency and reduce economic investments, but such methods have rarely been studied. This study evaluated the overall performance of TSCs based on the technique for order of preference by similarity to ideal solution (TOPSIS). Three conveyors of the same type produced in the same factory were investigated. Their scraper space, material filling coefficient, and vibration coefficient of the traction components were evaluated. A mathematical model of the multiattribute decision matrix was constructed; a weighted judgment matrix was obtained using the DELPHI method. The linguistic positive-ideal solution (LPIS), the linguistic negative-ideal solution (LNIS), and the distance from each solution to the LPIS and the LNIS, that is, the approximation degrees, were calculated. The optimal solution was determined by ordering the approximation degrees for each solution. The TOPSIS-based results were compared with the measurement results provided by the manufacturer. The ordering result based on the three evaluated parameters was highly consistent with the result provided by the manufacturer. The TOPSIS-based method serves as a suitable evaluation tool for the overall performance of TSCs. It facilitates the optimal deployment of TSCs for industrial purposes

Novel Application of Neutrosophic Logic in Classifiers Evaluated under Region-Based Image Categorization System

Neutrosophic logic is a relatively new logic that is a generalization of fuzzy logic. In this dissertation, for the first time, neutrosophic logic is applied to the field of classifiers where a support vector machine (SVM) is adopted as the example to validate the feasibility and effectiveness of neutrosophic logic. The proposed neutrosophic set is integrated into a reformulated SVM, and the performance of the achieved classifier N-SVM is evaluated under an image categorization system. Image categorization is an important yet challenging research topic in computer vision. In this dissertation, images are first segmented by a hierarchical two-stage self organizing map (HSOM), using color and texture features. A novel approach is proposed to select the training samples of HSOM based on homogeneity properties. A diverse density support vector machine (DD-SVM) framework that extends the multiple-instance learning (MIL) technique is then applied to the image categorization problem by viewing an image as a bag of instances corresponding to the regions obtained from the image segmentation. Using the instance prototype, every bag is mapped to a point in the new bag space, and the categorization is transformed to a classification problem. Then, the proposed N-SVM based on the neutrosophic set is used as the classifier in the new bag space. N-SVM treats samples differently according to the weighting function, and it helps reduce the effects of outliers. Experimental results on a COREL dataset of 1000 general purpose images and a Caltech 101 dataset of 9000 images demonstrate the validity and effectiveness of the proposed method

Classifying sequences by the optimized dissimilarity space embedding approach: a case study on the solubility analysis of the E. coli proteome

We evaluate a version of the recently-proposed classification system named Optimized Dissimilarity Space Embedding (ODSE) that operates in the input space of sequences of generic objects. The ODSE system has been originally presented as a classification system for patterns represented as labeled graphs. However, since ODSE is founded on the dissimilarity space representation of the input data, the classifier can be easily adapted to any input domain where it is possible to define a meaningful dissimilarity measure. Here we demonstrate the effectiveness of the ODSE classifier for sequences by considering an application dealing with the recognition of the solubility degree of the Escherichia coli proteome. Solubility, or analogously aggregation propensity, is an important property of protein molecules, which is intimately related to the mechanisms underlying the chemico-physical process of folding. Each protein of our dataset is initially associated with a solubility degree and it is represented as a sequence of symbols, denoting the 20 amino acid residues. The herein obtained computational results, which we stress that have been achieved with no context-dependent tuning of the ODSE system, confirm the validity and generality of the ODSE-based approach for structured data classification.Comment: 10 pages, 49 reference

The generalized dice similarity measures for multiple attribute decision making with hesitant fuzzy linguistic information

In this paper, we shall present some novel Dice similarity measures of hesitant fuzzy linguistic term sets and the generalized Dice similarity measures of hesitant fuzzy linguistic term sets and indicate that the Dice similarity measures and asymmetric measures (projection measures) are the special cases of the generalized Dice similarity measures in some parameter values. Then, we propose the generalized Dice similarity measures-based multiple attribute decision making models with hesitant fuzzy linguistic term sets. Finally, a practical example concerning the evaluation of the quality of movies is given to illustrate the applicability and advantage of the proposed generalized Dice similarity measure