Search

Introduction: Obstructive sleep apnea syndrome has become an important public health concern. Polysomnography is traditionally considered an established and effective diagnostic tool providing information on the severity of obstructive sleep apnea syndrome and the degree of sleep fragmentation. However, the numerous steps in the polysomnography test to diagnose obstructive sleep apnea syndrome are costly and time consuming. This study aimed to test the efficacy and clinical applicability of different machine learning methods based on demographic information and questionnaire data to predict obstructive sleep apnea syndrome severity. Materials and methods: We collected data about demographic characteristics, spirometry values, gas exchange (PaO2, PaCO2) and symptoms (Epworth Sleepiness Scale, snoring, etc.) of 313 patients with previous diagnosis of obstructive sleep apnea syndrome. After principal component analysis, we selected 19 variables which were used for further preprocessing and to eventually train seven types of classification models and five types of regression models to evaluate the prediction ability of obstructive sleep apnea syndrome severity, represented either by class or by apnea–hypopnea index. All models are trained with an increasing number of features and the results are validated through stratified 10-fold cross validation. Results: Comparative results show the superiority of support vector machine and random forest models for classification, while support vector machine and linear regression are better suited to predict apnea–hypopnea index. Also, a limited number of features are enough to achieve the maximum predictive accuracy. The best average classification accuracy on test sets is 44.7 percent, with the same average sensitivity (recall). In only 5.7 percent of cases, a severe obstructive sleep apnea syndrome (class 4) is misclassified as mild (class 2). Regression results show a minimum achieved root mean squared error of 22.17. Conclusion: The problem of predicting apnea–hypopnea index or severity classes for obstructive sleep apnea syndrome is very difficult when using only data collected prior to polysomnography test. The results achieved with the available data suggest the use of machine learning methods as tools for providing patients with a priority level for polysomnography test, but they still cannot be used for automated diagnosis. [ABSTRACT FROM AUTHOR]

We propose a method to extract and integrate fuzzy information granules from a populated OWL ontology. The purpose of this approach is to represent imprecise knowledge within an OWL ontology, as motivated by the fact that the Semantic Web is full of imprecise and uncertain information coming from perceptual data, incomplete data, data with errors, etc. In particular, we focus on Fuzzy Set Theory as a means for representing and processing information granules corresponding to imprecise concepts usually expressed by linguistic terms. The method applies to numerical data properties. The values of a property are first clustered to form a collection of fuzzy sets. Then, for each fuzzy set, the relative σ-count is computed and compared with a number of predefined fuzzy quantifiers, which are therefore used to define new assertions that are added to the original ontology. In this way, the extended ontology provides both a punctual view and a granular view of individuals w.r.t. the selected property. We use a real-world ontology concerning hotels and populated with data of the Italian city of Pisa, to illustrate the method and to test its implementation. We show that it is possible to extract granular properties that can be described in natural language and smoothly integrated in the original ontology by means of annotated assertions. [ABSTRACT FROM AUTHOR]

Background: When the reads obtained from high-throughput RNA sequencing are mapped against a reference database, a significant proportion of them - known as multireads - can map to more than one reference sequence. These multireads originate from gene duplications, repetitive regions or overlapping genes. Removing the multireads from the mapping results, in RNA-Seq analyses, causes an underestimation of the read counts, while estimating the real read count can lead to false positives during the detection of differentially expressed sequences. Results: We present an innovative approach to deal with multireads and evaluate differential expression events, entirely based on fuzzy set theory. Since multireads cause uncertainty in the estimation of read counts during gene expression computation, they can also influence the reliability of differential expression analysis results, by producing false positives. Our method manages the uncertainty in gene expression estimation by defining the fuzzy read counts and evaluates the possibility of a gene to be differentially expressed with three fuzzy concepts: over-expression, same-expression and under-expression. The output of the method is a list of differentially expressed genes enriched with information about the uncertainty of the results due to the multiread presence. We have tested the method on RNA-Seq data designed for case-control studies and we have compared the obtained results with other existing tools for read count estimation and differential expression analysis. Conclusions: The management of multireads with the use of fuzzy sets allows to obtain a list of differential expression events which takes in account the uncertainty in the results caused by the presence of multireads. Such additional information can be used by the biologists when they have to select the most relevant differential expression events to validate with laboratory assays. Our method can be used to compute reliable differential expression events and to highlight possible false positives in the lists of differentially expressed genes computed with other tools. [ABSTRACT FROM AUTHOR]

• A crowd flow detection method is proposed for video sequences shot by a drone. • The method is based on a fully-convolutional network that performs crowd clustering. • The detected centroids of crowd-dense areas are tracked in consecutive frames. • The method has been tested on the Crowd Counting datasets of the VisDrone challenge. Crowd analysis from drones has attracted increasing attention in recent times due to the ease of use and affordable cost of these devices. However, how this technology can provide a solution to crowd flow detection is still an unexplored research question. To this end, we propose a crowd flow detection method for video sequences shot by a drone. The method is based on a fully-convolutional network that learns to perform crowd clustering in order to detect the centroids of crowd-dense areas and track their movement in consecutive frames. The proposed method proved effective and efficient when tested on the Crowd Counting datasets of the VisDrone challenge, characterized by video sequences rather than still images. The encouraging results show that the proposed method could open up new ways of analyzing high-level crowd behavior from drones. [ABSTRACT FROM AUTHOR]

Data Mining, a central step in the broader overall process of Knowledge Discovery from Databases, concerns with discovering useful properties, called patterns, from data. Understandability is an essential — yet rarely tackled — feature that makes resulting patterns accessible by end users. In this paper we argue that the adoption of Fuzzy Logic for Data Mining can improve understandability of derived patterns. Indeed, Fuzzy Logic is able to represent concepts in a “human-centric” way. Hence, Data Mining methods based on Fuzzy Logic may potentially meet the so-called “Comprehensibility Postulate”, which characterizes the blurry notion of understandability. However, the mere adoption of Fuzzy Logic for Data Mining is not enough to achieve understandability. This paper describes and comments a number of issues that need to be addressed to provide for understandable patterns. A careful consideration of all such issues may end up in a systematic methodology to discover comprehensible knowledge from data. [ABSTRACT FROM AUTHOR]

A data stream classification method called DISSFCM (Dynamic Incremental Semi-Supervised FCM) is presented, which is based on an incremental semi-supervised fuzzy clustering algorithm. The method assumes that partially labeled data belonging to different classes are continuously available during time in form of chunks. Each chunk is processed by semi-supervised fuzzy clustering leading to a cluster-based classification model. The proposed DISSFCM is capable of dynamically adapting the number of clusters to data streams, by splitting low-quality clusters so as to improve classification quality. Experimental results on both synthetic and real-world data show the effectiveness of the proposed method in data stream classification. [ABSTRACT FROM AUTHOR]

We study the impact of fuzziness on the behavior of Fuzzy Rule-Based Classifiers (FRBCs) defined by trapezoidal fuzzy sets forming Strong Fuzzy Partitions. In particular, if an FRBC selects the class related to the rule with the highest activation (so-called Winner-Takes-All approach), then fuzziness, as quantified by the slope of the membership functions, has no impact in classifying data in regions of the input space where rules dominate. On the other hand, fuzziness affects the behaviour of the FRBC in regions where the confidence in classification is low. As a consequence, in the context of Explainable Artificial Intelligence, fuzziness is profitable in FRBCs only if classification is accompanied by an explanation of the confidence of the provided outputs. [ABSTRACT FROM AUTHOR]

The paper proposes a new Empirical Risk Functional as cost function for training neuro-fuzzy classifiers. This cost function, called Approximate Differentiable Empirical Risk Functional (ADERF), provides a differentiable approximation of the misclassification rate so that the Empirical Risk Minimization Principle formulated in Vapnik's Statistical Learning Theory can be applied. Also, based on the proposed ADERF, a learning algorithm is formulated. Experimental results on a number of benchmark classification tasks are provided and comparison to alternative approaches given. [ABSTRACT FROM AUTHOR]

Neuro-fuzzy networks have been successfully applied to extract knowledge from data in the form of fuzzy rules. However, one drawback with the neuro-fuzzy approach is that the fuzzy rules induced by the learning process are not necessarily understandable. The lack of readability is essentially due to the high dimensionality of the parameter space that leads to excessive flexibility in the modification of parameters during learning. In this paper, to obtain readable knowledge from data, we propose a new neuro-fuzzy model and its learning algorithm that works in a parameter space with reduced dimensionality. The dimensionality of the new parameter space is necessary and sufficient to generate human-understandable fuzzy rules, in the sense formally defined by a set of properties. The learning procedure is based on a gradient descent technique and the proposed model is general enough to be applied to other neuro-fuzzy architectures. Simulation studies on a benchmark and a real-life problem are carried out to embody the idea of the paper. [Copyright &y& Elsevier]

Recommender systems are systems capable of assisting users by quickly providing them with relevant resources according to their interests or preferences. The efficacy of a recommender system is strictly connected with the possibility of creating meaningful user profiles, including information about user preferences, interests, goals, usage data and interactive behavior. In particular, analysis of user preferences is important to predict user behaviors and make appropriate recommendations. In this paper, we present a fuzzy framework to represent, learn and update user profiles. The representation of a user profile is based on a structured model of user cognitive states, including a competence profile, a preference profile and an acquaintance profile. The strategy for deriving and updating profiles is to record the sequence of accessed resources by each user, and to update preference profiles accordingly, so as to suggest similar resources at next user accesses. The adaption of the preference profile is performed continuously, but in earlier stages it is more sensitive to updates (plastic phase) while in later stages it is less sensitive (stable phase) to allow resource recommendation. Simulation results are reported to show the effectiveness of the proposed approach. [ABSTRACT FROM AUTHOR]