2,751 research outputs found

    Functional Dynamics I : Articulation Process

    Full text link
    The articulation process of dynamical networks is studied with a functional map, a minimal model for the dynamic change of relationships through iteration. The model is a dynamical system of a function ff, not of variables, having a self-reference term fff \circ f, introduced by recalling that operation in a biological system is often applied to itself, as is typically seen in rules in the natural language or genes. Starting from an inarticulate network, two types of fixed points are formed as an invariant structure with iterations. The function is folded with time, until it has finite or infinite piecewise-flat segments of fixed points, regarded as articulation. For an initial logistic map, attracted functions are classified into step, folded step, fractal, and random phases, according to the degree of folding. Oscillatory dynamics are also found, where function values are mapped to several fixed points periodically. The significance of our results to prototype categorization in language is discussed.Comment: 48 pages, 15 figeres (5 gif files

    Methods for fast and reliable clustering

    Get PDF

    Fuzzy-Rough Nearest Neighbour Classification and Prediction

    Get PDF
    AbstractNearest neighbour (NN) approaches are inspired by the way humans make decisions, comparing a test object to previously encountered samples. In this paper, we propose an NN algorithm that uses the lower and upper approximations from fuzzy-rough set theory in order to classify test objects, or predict their decision value. It is shown experimentally that our method outperforms other NN approaches (classical, fuzzy and fuzzy-rough ones) and that it is competitive with leading classification and prediction methods. Moreover, we show that the robustness of our methods against noise can be enhanced effectively by invoking the approximations of the Vaguely Quantified Rough Set (VQRS) model, which emulates the linguistic quantifiers “some” and “most” from natural language

    Equalization of nonlinear time-varying channels using type-2 fuzzy adaptive filters

    Get PDF
    Abstract-This paper presents a new kind of adaptive filter: type-2 fuzzy adaptive filter (FAF); one that is realized using an unnormalized type-2 Takagi-Sugeno-Kang (TSK) fuzzy logic system (FLS). We apply this filter to equalization of a nonlinear time-varying channel and demonstrate that it can implement the Bayesian equalizer for such a channel, has a simple structure, and provides fast inference. A clustering method is used to adaptively design the parameters of the FAF. Two structures are used for the equalizer: transversal equalizer (TE) and decision feedback equalizer (DFE). A new decision tree structure is used to implement the decision feedback equalizer, in which each leaf of the tree is a type-2 FAF. This DFE vastly reduces computational complexity as compared to a TE. Simulation results show that equalizers based on type-2 FAFs perform much better than nearest neighbor classifiers (NNC) or equalizers based on type-1 FAFs. Index Terms-Channel equalization, decision feedback equalizer, decision tree, interval type-2 TSK fuzzy logic systems, timevarying channels, type-2 fuzzy adaptive filters

    A hybrid recommendation approach for a tourism system

    Get PDF
    Many current e-commerce systems provide personalization when their content is shown to users. In this sense, recommender systems make personalized suggestions and provide information of items available in the system. Nowadays, there is a vast amount of methods, including data mining techniques that can be employed for personalization in recommender systems. However, these methods are still quite vulnerable to some limitations and shortcomings related to recommender environment. In order to deal with some of them, in this work we implement a recommendation methodology in a recommender system for tourism, where classification based on association is applied. Classification based on association methods, also named associative classification methods, consist of an alternative data mining technique, which combines concepts from classification and association in order to allow association rules to be employed in a prediction context. The proposed methodology was evaluated in some case studies, where we could verify that it is able to shorten limitations presented in recommender systems and to enhance recommendation quality

    Prediction of Banks Financial Distress

    Get PDF
    In this research we conduct a comprehensive review on the existing literature of prediction techniques that have been used to assist on prediction of the bank distress. We categorized the review results on the groups depending on the prediction techniques method, our categorization started by firstly using time factors of the founded literature, so we mark the literature founded in the period (1990-2010) as history of prediction techniques, and after this period until 2013 as recent prediction techniques and then presented the strengths and weaknesses of both. We came out by the fact that there was no specific type fit with all bank distress issue although we found that intelligent hybrid techniques considered the most candidates methods in term of accuracy and reputatio
    corecore