Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

English (EN)·Polski (PL)·Yкраїнський (UK)
Przejdź do strony domowej biblioteki Centralna Biblioteka Wojskowa Link otwiera się w nowym oknie Logo biblioteki Prolib Integro - strona głównaCentralna Biblioteka Wojskowa

Wyszukujesz frazę "aggregation algorithms" wg kryterium: Temat

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-4 z 4
    Tytuł:
    Directed forests with application to algorithms related to Markov chains
    Autorzy:
    Pokarowski, Piotr
    Powiązania:
    https://bibliotekanauki.pl/articles/1338687.pdf
    Data publikacji:
    1999
    Wydawca:
    Polska Akademia Nauk. Instytut Matematyczny PAN
    Tematy:
    entrywise relative error
    directed forest
    Matrix Tree Theorem
    directed graph
    Simulated Annealing
    Markov chains
    Metropolis algorithm
    direct methods for linear systems
    nearly completely decomposable Markov chains
    aggregation algorithms
    nonhomogeneous Markov chains
    Markov Chain Tree Theorem
    Markov chain Monte Carlo algorithms
    Gibbs sampler
    Opis:
    This paper is devoted to computational problems related to Markov chains (MC) on a finite state space. We present formulas and bounds for characteristics of MCs using directed forest expansions given by the Matrix Tree Theorem. These results are applied to analysis of direct methods for solving systems of linear equations, aggregation algorithms for nearly completely decomposable MCs and the Markov chain Monte Carlo procedures.
    Źródło:
    Applicationes Mathematicae; 1999, 26, 4; 395-414
    1233-7234
    Pojawia się w:
    Applicationes Mathematicae
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Porównanie stabilności zagregowanych algorytmów taksonomicznych opartych na idei metody bagging
    Comparison of Stability of Cluster Ensembles based on Bagging Idea
    Autorzy:
    Rozmus, Dorota
    Powiązania:
    https://bibliotekanauki.pl/articles/587052.pdf
    Data publikacji:
    2013
    Wydawca:
    Uniwersytet Ekonomiczny w Katowicach
    Tematy:
    Agregacja modeli
    Algorytmy
    Metody taksonomiczne
    Aggregation models
    Algorithms
    Taxonomic methods
    Opis:
    Ensemble approach has been successfully applied in the context of supervised learning to increase the accuracy and stability of classification. One of the most popular method is bagging based on bootstrap samples. Recently, analogous techniques for cluster analysis have been suggested in order to increase classification accuracy, robustness and stability of the clustering solutions. Research has proved that, by combining a collection of different clusterings, an improved solution can be obtained. A desirable quality of the method is the stability of a clustering algorithm with respect to small perturbations of data (e.g., data subsampling or resampling, small variations in the feature values) or the parameters of the algorithm (e.g., random initialization). Here, we look at the stability of the ensemble and carry out an experimental study to compare stability of cluster ensembles based on bagging idea.
    Źródło:
    Studia Ekonomiczne; 2013, 133; 119-134
    2083-8611
    Pojawia się w:
    Studia Ekonomiczne
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Comparison of Algorithms for Decision Making Problems and Preservation of α-properties of Fuzzy Relations in Aggregation Process
    Autorzy:
    Bentkowska, U.
    Balicki, K.
    Powiązania:
    https://bibliotekanauki.pl/articles/950912.pdf
    Data publikacji:
    2016
    Wydawca:
    Sieć Badawcza Łukasiewicz - Przemysłowy Instytut Automatyki i Pomiarów
    Tematy:
    decision making algorithms
    fuzzy relations
    properties of fuzzy relations
    aggregation function
    Opis:
    In the paper the problem of preservation of properties of fuzzy relations during aggregation process is considered. It means that properties of fuzzy relations R1, … , R2 on a set X are compared with properties of the aggregated fuzzy relation RF = F(R1, … , R2), where R is a function of the type F ∶ [0, 1]n → [0, 1]. There are discussed α-properties (which may be called graded properties - to some grade R) as reflexivity, irreflexivity, symmetry, asymmetry, antisymmetry, connectedness and transitivity, where α ∈ [0, 1]. Fuzzy relations with a given graded property are analyzed (there may be diverse grades of the same property) and the obtained grade of the aggregated fuzzy relation is provided. There is also discussed the „converse” problem. Namely, relation RF = F(R1, … , Rn) is assumed to have a graded property and the properties of relations R1, … , Rn are examined (possibly with some assumptions on F). Presented here considerations have possible applications in decision making algorithms. This is why interpretation of the considered graded properties and possible potential in decision making is presented.
    Źródło:
    Journal of Automation Mobile Robotics and Intelligent Systems; 2016, 10, 2; 25-39
    1897-8649
    2080-2145
    Pojawia się w:
    Journal of Automation Mobile Robotics and Intelligent Systems
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Optimization of the process of restoring the continuity of the WDS based on the matrix and genetic algorithm approach
    Autorzy:
    Antonowicz, Ariel
    Urbaniak, Andrzej
    Powiązania:
    https://bibliotekanauki.pl/articles/2173692.pdf
    Data publikacji:
    2022
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    WNTR
    Water Network Tool for Resilience
    aggregation of failures
    water distribution system
    EPANET Solver
    Graph Searching Algorithms
    genetic algorithm
    optimization
    post-disaster events
    agregacja awarii
    system dystrybucji wody
    EPANET
    algorytm wyszukiwania grafów
    algorytm genetyczny
    optymalizacja
    wydarzenia po katastrofie
    Opis:
    The article discusses an example of the use of graph search algorithms with trace of water analysis and aggregation of failures in the occurrence of a large number of failures in the Water Supply System (WSS). In the event of a catastrophic situation, based on the Water Distribution System (WDS) network model, information about detected failures, the condition and location of valves, the number of repair teams, criticality analysis, the coefficient of prioritization of individual network elements, and selected objective function, the algorithm proposes the order of repairing the failures should be analyzed. The approach proposed by the authors of the article assumes the selection of the following objective function: minimizing the time of lack of access to drinking water (with or without prioritization) and minimizing failure repair time (with or without failure aggregation). The algorithm was tested on three different water networks (small, medium, and large numbers of nodes) and three different scenarios (different numbers of failures and valves in the water network) for each selected water network. The results were compared to a valve designation approach for closure using an adjacency matrix and a Strategic Valve Management Model (SVMM).
    Źródło:
    Bulletin of the Polish Academy of Sciences. Technical Sciences; 2022, 70, 4; art. no. e141594
    0239-7528
    Pojawia się w:
    Bulletin of the Polish Academy of Sciences. Technical Sciences
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
      Wyświetlanie 1-4 z 4

      Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies