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ę "algorithm," wg kryterium: Temat

  Lista filtrów

Dostawca treści

Wyrównaj
Wyświetlanie 1-25 z 1769
Tytuł:
Multi-population-based algorithm with an exchange of training plans based on population evaluation
Autorzy:
Łapa, Krystian
Cpałka, Krzysztof
Kisiel-Dorohinicki, Marek
Paszkowski, Józef
Dębski, Maciej
Le, Van-Hung
Powiązania:
https://bibliotekanauki.pl/articles/2147148.pdf
Data publikacji:
2022
Wydawca:
Społeczna Akademia Nauk w Łodzi. Polskie Towarzystwo Sieci Neuronowych
Tematy:
population-based algorithm
multi-population algorithm
hybrid algorithm
island algorithm
subpopulation evaluation
training plan
Opis:
Population Based Algorithms (PBAs) are excellent search tools that allow searching space of parameters defined by problems under consideration. They are especially useful when it is difficult to define a differentiable evaluation criterion. This applies, for example, to problems that are a combination of continuous and discrete (combinatorial) problems. In such problems, it is often necessary to select a certain structure of the solution (e.g. a neural network or other systems with a structure usually selected by the trial and error method) and to determine the parameters of such structure. As PBAs have great application possibilities, the aim is to develop more and more effective search formulas used in them. An interesting approach is to use multiple populations and process them with separate PBAs (in a different way). In this paper, we propose a new multi-population-based algorithm with: (a) subpopulation evaluation and (b) replacement of the associated PBAs subpopulation formulas used for their processing. In the simulations, we used a set of typical CEC2013 benchmark functions. The obtained results confirm the validity of the proposed concept.
Źródło:
Journal of Artificial Intelligence and Soft Computing Research; 2022, 12, 4; 239--253
2083-2567
2449-6499
Pojawia się w:
Journal of Artificial Intelligence and Soft Computing Research
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Learning from heterogeneously distributed data sets using artificial neural networks and genetic algorithms
Autorzy:
Peteiro-Barral, D.
Guijarro-Berdiñas, B.
Pérez-Sánchez, B.
Powiązania:
https://bibliotekanauki.pl/articles/91888.pdf
Data publikacji:
2012
Wydawca:
Społeczna Akademia Nauk w Łodzi. Polskie Towarzystwo Sieci Neuronowych
Tematy:
artificial neural networks
genetic algorithm
Devonet algorithm
Opis:
It is a fact that traditional algorithms cannot look at a very large data set and plausibly find a good solution with reasonable requirements of computation (memory, time and communications). In this situation, distributed learning seems to be a promising line of research. It represents a natural manner for scaling up algorithms inasmuch as an increase of the amount of data can be compensated by an increase of the number of distributed locations in which the data is processed. Our contribution in this field is the algorithm Devonet, based on neural networks and genetic algorithms. It achieves fairly good performance but several limitations were reported in connection with its degradation in accuracy when working with heterogeneous data, i.e. the distribution of data is different among the locations. In this paper, we take into account this heterogeneity in order to propose several improvements of the algorithm, based on distributing the computation of the genetic algorithm. Results show a significative improvement of the performance of Devonet in terms of accuracy.
Źródło:
Journal of Artificial Intelligence and Soft Computing Research; 2012, 2, 1; 5-20
2083-2567
2449-6499
Pojawia się w:
Journal of Artificial Intelligence and Soft Computing Research
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On Some Aspects of Genetic and Evolutionary Methods for Optimization Purposes
Autorzy:
Woźniak, M.
Połap, D.
Powiązania:
https://bibliotekanauki.pl/articles/227353.pdf
Data publikacji:
2015
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
computational intelligence
genetic algorithm
heuristic algorithm
optimization
Opis:
In this paper, the idea of applying some hybrid genetic algorithms with gradient local search and evolutionary optimization techniques is formulated. For two different test functions the proposed versions of the algorithms have been examined. Research results are presented and discussed to show potential efficiency in optimization purposes.
Źródło:
International Journal of Electronics and Telecommunications; 2015, 61, 1; 7-16
2300-1933
Pojawia się w:
International Journal of Electronics and Telecommunications
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Parallel PBIL applied to power system controller design
Autorzy:
Folly, K.
Powiązania:
https://bibliotekanauki.pl/articles/91747.pdf
Data publikacji:
2013
Wydawca:
Społeczna Akademia Nauk w Łodzi. Polskie Towarzystwo Sieci Neuronowych
Tematy:
Population-Based Incremental Learning algorithm
PBIL algorithm
Opis:
Population-Based Incremental Learning (PBIL) algorithm is a combination of evolutionary optimization and competitive learning derived from artificial neural networks. PBIL has recently received increasing attention in various engineering fields due to its effectiveness, easy implementation and robustness. Despite these strengths, it was reported in the last few years that PBIL suffers from issues of loss of diversity in the population. To deal with this shortcoming, this paper uses parallel PBIL based on multi-population. In parallel PBIL, two populations are used where both probability vectors (PVs) are initialized to 0.5. It is believed that by introducing two populations, the diversity in the population can be increased and better results can be obtained. The approach is applied to power system controller design. Simulations results show that the parallel PBIL approach performs better than the standard PBIL and is as effective as another diversity increasing PBIL called adaptive PBIL.
Źródło:
Journal of Artificial Intelligence and Soft Computing Research; 2013, 3, 3; 215-223
2083-2567
2449-6499
Pojawia się w:
Journal of Artificial Intelligence and Soft Computing Research
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Teoria i metody algorytmu ewolucyjnego w uczeniu jednowarstwowej sieci neuronowej
Implementation of the Evolutionary Algorithm Theory and Methods in the Learning Process of One-Layer ANN
Autorzy:
Płaczek, Stanisław
Powiązania:
https://bibliotekanauki.pl/articles/509173.pdf
Data publikacji:
2016
Wydawca:
Akademia Finansów i Biznesu Vistula
Tematy:
algorytmy genetyczne
algorytmy ewolucyjne
sztuczne sieci neuronowe
algorytmy uczenia sieci
algorytmy selekcji
algorytmy krzyżowania
algorytmy mutacji
genetic algorithm
evolutionary algorithm
artificial neural network
learning algorithm
selection algorithm
crossover algorithm
mutation algorithm
Opis:
Rozwój teorii sztucznych sieci neuronowych, a także pojawienie się nowych, efektywnych narzędzi programistycznych (systemy wieloprocesorowe, programowanie wielowątkowe) umożliwia zastosowanie algorytmów genetycznych oraz ewolucyjnych do uczenia sztucznych sieci neuronowych (SSN). W literaturze dotyczącej zasad działania SSN podkreśla się ich atrakcyjne własności, takie jak: aproksymacja dowolnych nieliniowych odwzorowań, równolegle i rozproszone przetwarzanie, adaptacja i uczenie. Szczególnie równoległe i rozproszone przetwarzanie koresponduje ze strukturą algorytmu genetycznego i ewolucyjnego. Klasyczne algorytmy genetyczne operują na ciągach binarnych o stałej długości. Natomiast algorytmy ewolucyjne można interpretować jako uogólnienie algorytmów genetycznych. W algorytmach tych stosuje się zasady ewolucji i dziedziczenia oraz wykorzystuje się właściwą strukturę danych do reprezentacji chromosomów (liczby rzeczywiste, macierze, grafy). Definiuje się również inne operatory krzyżowania i mutacji. Tak więc struktura algorytmu ewolucyjnego jest prawie taka sama jak genetycznego. Różnice ukryte są na niższych poziomach przetwarzania – w strukturach danych. W artykule przedstawiono próbę implementacji algorytmu ewolucyjnego do uczenia jednowarstwowej sieci neuronowej. Sieć opisuje się w postaci macierzy połączeń między wektorami – wejściowym X oraz wyjściowym Y. Funkcja uczenia SSN zdefiniowana jest jako nieliniowa funkcja wag sieci oraz nieliniowej funkcji aktywacji minimalizującej błąd średniokwadratowy między wektorem wyjściowym Y a wektorem uczącym Z, dla całej paczki uczącej. Pojawienie się nieliniowości utrudnia zastosowanie algorytmu uczenia opartego na wstecznej propagacji błędu. Funkcja celu, oprócz minimum globalnego, może zawierać wiele minimów lokalnych, w których algorytm oparty na badaniu gradientu funkcji celu może się zatrzymać. Oczywiście stosuje się różne techniki i metody umożliwiające wyjście algorytmu z tego typu pułapek. Tym niemniej dla sprawdzenia poprawności otrzymanych wyników uruchamia się proces uczenia SSN dla różnych danych początkowych. W zaproponowanym algorytmie ewolucyjnym tworzy się zbiór osobników. Każdy z osobników przedstawia możliwe rozwiązanie zadania minimalizacji funkcji celu i jest reprezentowany przez macierzową strukturę danych. Każde rozwiązanie cząstkowe ocenia się na podstawie dopasowania funkcji celu, a następnie tworzy się nową populację (potomków) przez selekcję osobników o najlepszych dopasowaniach oraz dwa algorytmy krzyżowania i mutacji. W artykule omówiono zaproponowaną strukturę osobników, przyjęte algorytmy selekcji z ich wadami i zaletami oraz różne algorytmu krzyżowania i mutacji. Na wstępie zdefiniowano takie podstawowe pojęcia, jak gen, chromosom oraz najogólniejszą strukturę algorytmu ewolucyjnego. Artykuł ma charakter koncepcyjny.
The article proposes implementation of a modified version of genetic algorithms in neural networks, what in literature is known as “evolutionary algorithm” or “evolutionary programming”. An evolutionary algorithm is a probabilistic algorithm that works in a set of weight variability of neurons and seeks the optimal value solution within a population of individuals, avoiding the local maximum. For chromosomes, the real value variables and matrix structure are proposed. In the article, this decision is widely elaborated and discussed. In the original versions of genetic algorithms, all variables’ values are transformed into binary versions. The chromosomes bit sequences could include thousands of positions. It does not simplify the crossover and mutation operations. Processes could be very time-consuming and the algorithm convergence could also be slow. For a single-layer neural network matrix data structure is used. A particular emphasis is put on mutation and crossover algorithms. What is also important in both genetic and evolutionary algorithms is the selection process. The primary population, known as the parent population, is employed to build a new set of individuals using the selection process. These individuals are known as the children population. The selection algorithm should converge on the two very important issues: population diversity and selective pressure. Selective pressure can manifest in the overrepresentation of the best individuals in the new population. The area, in which the optimal solution is sought, is reduced too fast. Premature convergence is not desirable due to the high probability of achieving the local maximum. Reducing the selective pressure may result in increasing the time it takes to search for the solution.
Źródło:
Zeszyty Naukowe Uczelni Vistula; 2016, 49(4) Informatyka; 23-39
2353-2688
Pojawia się w:
Zeszyty Naukowe Uczelni Vistula
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Selection of the heat transfer coefficient using swarming algorithms
Autorzy:
Gawrońska, Elżbieta
Dyja, Robert
Zych, Maria
Domek, Grzegorz
Powiązania:
https://bibliotekanauki.pl/articles/2204686.pdf
Data publikacji:
2022
Wydawca:
Politechnika Białostocka. Oficyna Wydawnicza Politechniki Białostockiej
Tematy:
swarm algorithm
ABC algorithm
ACO algorithm
heat transfer coefficient
computer simulation
numerical modelling
Opis:
The article presents the use of swarming algorithms in selecting the heat transfer coefficient, taking into account the boundary condition of the IV types. Numerical calculations were made using the proprietary TalyFEM program and classic form of swarming algorithms. A function was also used for the calculations, which, during the calculation, determined the error of the approximate solution and was minimalised using a pair of individually employed algorithms, namely artificial bee colony (ABC) and ant colony optimisation (ACO). The tests were carried out to select the heat transfer coefficient from one range. Describing the geometry for a mesh of 408 fine elements with 214 nodes, the research carried out presents two squares (one on top of the other) separated by a heat transfer layer with a κ coefficient. A type III boundary condition was established on the right and left of both edges. The upper and lower edges were isolated, and a type IV boundary condition with imperfect contact was established between the squares. Calculations were made for ABC and ACO, respectively, for populations equal to 20, 40 and 60 individuals and 2, 6 and 12 iterations. In addition, in each case, 0%, 1%, 2% and 5% noise of the reference values were also considered. The obtained results are satisfactory and very close to the reference values of the κ parameter. The obtained results demonstrate the possibility of using artificial intelligence (AI) algorithms to reconstruct the IV type boundary condition value during heat conduction modelling.
Źródło:
Acta Mechanica et Automatica; 2022, 16, 4; 325--339
1898-4088
2300-5319
Pojawia się w:
Acta Mechanica et Automatica
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Community Clustering on Fraud Transactions Applied the Louvain-Coloring Algorithm
Autorzy:
Mardiansyah, Heru
Suwilo, Saib
Nababan, Erna Budiarti
Efendi, Syahril
Powiązania:
https://bibliotekanauki.pl/articles/27311927.pdf
Data publikacji:
2023
Wydawca:
Polska Akademia Nauk. Czasopisma i Monografie PAN
Tematy:
fraud Money Transfer
Louvain Coloring algorithm
Louvain Algorithm
Opis:
The contribution main from this research is modularity and better processing time in detecting community by using K-1 coloring. Testing performed on transaction datasets remittance on P2P platforms where the Louvain Coloring algorithm is better in comparison to Louvain Algorithm Data used is data transfer transactions made by customers on the P2P Online platform. The data is the User data that has information transfer transactions, Card data that has information card, IP data that has IP information, and Device data that has information device. Every user owns unique 128-bit identification, and other nodes representing card, device, and IP are assigned a random UUID. The Device node has the guide, and device properties. IP nodes only have property guide and node User has property fraud Money Transfer, guide, money Transfer Error Cancel Amount, first Charge back Date. Each node has a unique 128-bit guide, with the amount whole of as many as 789,856 nodes. Application technique K-1 staining on Louvain algorithm shows enhancement value modularity and better processing time for detecting community on the network large scale. Through a series of exercises and tests carried out in various scenarios, it shows that the experiments carried out in this paper, namely the Louvain Coloring algorithm, are more effective and efficient than the Louvain algorithm in scenario 1,3, and 5 meanwhile For Scenarios 2 and 4 Louvain Algorithm is better.
Źródło:
International Journal of Electronics and Telecommunications; 2023, 69, 3; 593-598
2300-1933
Pojawia się w:
International Journal of Electronics and Telecommunications
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Minig rules of concept drift using genetic algorithm
Autorzy:
Vivekanandan, P.
Nedunchezhian, R.
Powiązania:
https://bibliotekanauki.pl/articles/91705.pdf
Data publikacji:
2011
Wydawca:
Społeczna Akademia Nauk w Łodzi. Polskie Towarzystwo Sieci Neuronowych
Tematy:
genetic algorithm
CDR-tree algorithm
rules
data mining
Opis:
In a database the data concepts changes over time and this phenomenon is called as concept drift. Rules of concept drift describe how the concept changes and sometimes they are interesting and mining those rules becomes more important. CDR tree algorithm is currently used to identify the rules of concept drift. Building a CDR tree becomes a complex process when the domain values of the attributes get increased. Genetic Algorithms are traditionally used for data mining tasks. In this paper, a Genetic Algorithm based approach is proposed for mining the rules of concept drift, which makes the mining task simpler and accurate when compared with the CDR-tree algorithm.
Źródło:
Journal of Artificial Intelligence and Soft Computing Research; 2011, 1, 2; 135-145
2083-2567
2449-6499
Pojawia się w:
Journal of Artificial Intelligence and Soft Computing Research
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Implementing evolutionary algorithm into training single-layer artificial neural network in classification task
Autorzy:
Płaczek, S.
Powiązania:
https://bibliotekanauki.pl/articles/95001.pdf
Data publikacji:
2016
Wydawca:
Szkoła Główna Gospodarstwa Wiejskiego w Warszawie. Wydawnictwo Szkoły Głównej Gospodarstwa Wiejskiego w Warszawie
Tematy:
genetic algorithm
evolutionary algorithm
selection process
mutation
recombination
replacement
Opis:
The article proposes implementing a modified version of genetic algorithm in a neural network, what in literature is known as “evolutionary algorithm” or “evolutionary programming”. An Evolutionary Algorithm is a probabilistic algorithm that works in a set of weight variability of neurons and seeks the optimal value solution within a population of individuals, avoiding the local maximum. For chromosomes the real value variables and matrix structure are proposed to a single-layer neural network. Particular emphasis is put on mutation and crossover algorithms. What is also important in both genetic and evolutionary algorithms is the selection process. In the calculation example, the implementation of theoretical considerations to a classification task is demonstrated.
Źródło:
Information Systems in Management; 2016, 5, 3; 377-388
2084-5537
2544-1728
Pojawia się w:
Information Systems in Management
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Real-time interpolation of streaming data
Autorzy:
Dębski, Roman
Powiązania:
https://bibliotekanauki.pl/articles/1839246.pdf
Data publikacji:
2020
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
streaming algorithm
online algorithm
spline interpolation
cubic Hermite spline
Opis:
One of the key elements of the real-time C 1 -continuous cubic spline interpolation of streaming data is an estimator of the first derivative of the interpolated function that is more accurate than those based on finite difference schemas. Two such greedy look-ahead heuristic estimators, based on the calculus of variations (denoted as MinBE and MinAJ2), are formally defined (in closed form), along with the corresponding cubic splines that they generate. They are then comparatively evaluated in a series of numerical experiments involving different types of performance measures. The presented results show that the cubic Hermite splines generated by heuristic MinAJ2 significantly outperformed those that were based on finite difference schemas in terms of all of the tested performance measures (including convergence). The proposed approach is quite general. It can be directly applied to streams of univariate functional data like time-series. Multi-dimensional curves that are defined parametrically (after splitting) can be handled as well. The streaming character of the algorithm means that it can also be useful in processing data sets that are too large to fit in the memory (e.g., edge computing devices, embedded time-series databases).
Źródło:
Computer Science; 2020, 21 (4); 513-532
1508-2806
2300-7036
Pojawia się w:
Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Empirical Evaluation of Oclus and Genrandomclust Algorithms of Generating Cluster Structures
Autorzy:
Korzeniewski, Jerzy
Powiązania:
https://bibliotekanauki.pl/articles/973546.pdf
Data publikacji:
2014
Wydawca:
Główny Urząd Statystyczny
Tematy:
cluster analysis
cluster structure generation
OCLUS algorithm
genRandomClust algorithm
Opis:
The OCLUS algorithm and genRandomClust algorithm are newest proposals of generating multivariate cluster structures. Both methods have the capacity of controlling cluster overlap, but both do it quite differently. It seems that OCLUS method has much easier, intuitive interpretation. In order to verify this opinion a comparative assessment of both algorithms was carried out. For both methods multiple cluster structures were generated and each of them was grouped into the proper number of clusters using k-means. The groupings were assessed by means of divisions similarity index (modified Rand index) referring to the classification resulting from the generation. The comparison criterion is the behaviour of the overlap parameters of structures. The monotonicity of the overlap parameters with respect to the similarity index is assessed as well as the variability of the similarity index for the fixed value of overlap parameters. Moreover, particular attention is given to checking the existence of an overlap parameter limit for the classical grouping procedures as well as uniform nature of overlap control with respect to all clusters.
Źródło:
Statistics in Transition new series; 2014, 15, 3; 487-494
1234-7655
Pojawia się w:
Statistics in Transition new series
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Application of the Rasch model in categorical pedigree analysis using MCEM: I binary data
Autorzy:
Qian, G.
Huggins, R.
Loesch, D.
Powiązania:
https://bibliotekanauki.pl/articles/729756.pdf
Data publikacji:
2004
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
pedigree analysis
binary data
MCEM algorithm
Metropolis-Hastings algorithm
Opis:
An extension of the Rasch model with correlated latent variables is proposed to model correlated binary data within families. The latent variables have the classical correlation structure of Fisher (1918) and the model parameters thus have genetic interpretations. The proposed model is fitted to data using a hybrid of the Metropolis-Hastings algorithm and the MCEM modification of the EM-algorithm and is illustrated using genotype-phenotype data on a psychological subtest in families where some members are affected by the genetic disorder fragile X. In addition, hypothesis testing and model selection methods based on the Wald statistic are discussed.
Źródło:
Discussiones Mathematicae Probability and Statistics; 2004, 24, 2; 255-280
1509-9423
Pojawia się w:
Discussiones Mathematicae Probability and Statistics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Combinatorial Properties and Defragmentation Algorithms in WSW1 Switching Fabrics
Autorzy:
Rajewski, Remigiusz
Kabaciński, Wojciech
Al-Tameemi, Atyaf
Powiązania:
https://bibliotekanauki.pl/articles/227184.pdf
Data publikacji:
2020
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
elastic optical network
switching networks
rearrenging algorithm
defragmentation algorithm
Opis:
A spectrum defragmentation problem in elastic optical networks was considered under the assumption that all connections can be realized in switching nodes. But this assumption is true only when the switching fabric has appropriate combinatorial properties. In this paper, we consider a defragmentation problem in one architecture of wavelength-space-wavelength switching fabrics. First, we discuss the requirements for this switching fabric, below which defragmentation does not always end with success. Then, we propose defragmentation algorithms and evaluate them by simulation. The results show that proposed algorithms can increase the number of connections realized in the switching fabric and reduce the loss probability.
Źródło:
International Journal of Electronics and Telecommunications; 2020, 66, 1; 99-105
2300-1933
Pojawia się w:
International Journal of Electronics and Telecommunications
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Parallel MCNN (PMCNN) with application to prototype selection on large and streaming data
Autorzy:
Devi, V. S.
Meena, L.
Powiązania:
https://bibliotekanauki.pl/articles/91686.pdf
Data publikacji:
2017
Wydawca:
Społeczna Akademia Nauk w Łodzi. Polskie Towarzystwo Sieci Neuronowych
Tematy:
prototype selection
one-pass algorithm
streaming data
distributed algorithm
Opis:
The Modified Condensed Nearest Neighbour (MCNN) algorithm for prototype selection is order-independent, unlike the Condensed Nearest Neighbour (CNN) algorithm. Though MCNN gives better performance, the time requirement is much higher than for CNN. To mitigate this, we propose a distributed approach called Parallel MCNN (pMCNN) which cuts down the time drastically while maintaining good performance. We have proposed two incremental algorithms using MCNN to carry out prototype selection on large and streaming data. The results of these algorithms using MCNN and pMCNN have been compared with an existing algorithm for streaming data.
Źródło:
Journal of Artificial Intelligence and Soft Computing Research; 2017, 7, 3; 155-169
2083-2567
2449-6499
Pojawia się w:
Journal of Artificial Intelligence and Soft Computing Research
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
New Methods for Designing and Reduction of Neuro-Fuzzy Systems
Autorzy:
Cpałka, K.
Powiązania:
https://bibliotekanauki.pl/articles/108790.pdf
Data publikacji:
2010
Wydawca:
Społeczna Akademia Nauk w Łodzi
Tematy:
algorithm of best global eliminations
algorithm of best local eliminations
consecutive eliminations algorithm
consecutive mergings algorithm
interpretability
logical approach
neuro-fuzzy system
Opis:
In the paper, we propose novel methods for designing and reduction of neuro-fuzzy systems without the deterioration of their accuracy. The reduction and merging algorithms gradually eliminate inputs, rules, antecedents, and the number of discretization points of integrals in the center of area defuzzification method. Our algorithms have been tested using well known classification benchmark.
Źródło:
Journal of Applied Computer Science Methods; 2010, 2 No. 2; 113-126
1689-9636
Pojawia się w:
Journal of Applied Computer Science Methods
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A lower bound on the independence number of a graph in terms of degrees
Autorzy:
Harant, Jochen
Schiermeyer, Ingo
Powiązania:
https://bibliotekanauki.pl/articles/743603.pdf
Data publikacji:
2006
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
independence
stability
algorithm
Opis:
For a connected and non-complete graph, a new lower bound on its independence number is proved. It is shown that this bound is realizable by the well known efficient algorithm MIN.
Źródło:
Discussiones Mathematicae Graph Theory; 2006, 26, 3; 431-437
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Clustering large-scale data based on modified affinity propagation algorithm
Autorzy:
Serdah, A. M.
Ashour, W. M.
Powiązania:
https://bibliotekanauki.pl/articles/91694.pdf
Data publikacji:
2016
Wydawca:
Społeczna Akademia Nauk w Łodzi. Polskie Towarzystwo Sieci Neuronowych
Tematy:
clustering
clustering algorithm
data clustering algorithm
propagation algorithm
Affinity Propagation
AP
klasteryzacja
algorytm klastrowania
algorytm propagacji
Opis:
Traditional clustering algorithms are no longer suitable for use in data mining applications that make use of large-scale data. There have been many large-scale data clustering algorithms proposed in recent years, but most of them do not achieve clustering with high quality. Despite that Affinity Propagation (AP) is effective and accurate in normal data clustering, but it is not effective for large-scale data. This paper proposes two methods for large-scale data clustering that depend on a modified version of AP algorithm. The proposed methods are set to ensure both low time complexity and good accuracy of the clustering method. Firstly, a data set is divided into several subsets using one of two methods random fragmentation or K-means. Secondly, subsets are clustered into K clusters using K-Affinity Propagation (KAP) algorithm to select local cluster exemplars in each subset. Thirdly, the inverse weighted clustering algorithm is performed on all local cluster exemplars to select well-suited global exemplars of the whole data set. Finally, all the data points are clustered by the similarity between all global exemplars and each data point. Results show that the proposed clustering method can significantly reduce the clustering time and produce better clustering result in a way that is more effective and accurate than AP, KAP, and HAP algorithms.
Źródło:
Journal of Artificial Intelligence and Soft Computing Research; 2016, 6, 1; 23-33
2083-2567
2449-6499
Pojawia się w:
Journal of Artificial Intelligence and Soft Computing Research
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Performance investigation and element optimization of 2D array transducer using Bat Algorithm
Autorzy:
Tantawy, Dina Mohamed
Eladawy, Mohamed
Hassan, Mohamed Alimaher
Mubarak, Roaa
Powiązania:
https://bibliotekanauki.pl/articles/140685.pdf
Data publikacji:
2020
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
2D ultrasound arrays
Binary Bat Algorithm
Genetic Algorithm
Optimization
Opis:
One of the least expensive and safest diagnostic modalities routinely used is ultrasound imaging. An attractive development in this field is a two-dimensional (2D) matrix probe with three-dimensional (3D) imaging. The main problems to implement this probe come from a large number of elements they need to use. When the number of elements is reduced the side lobes arising from the transducer change along with the grating lobes that are linked to the periodic disposition of the elements. The grating lobes are reduced by placing the elements without any consideration of the grid. In this study, the Binary Bat Algorithm (BBA) is used to optimize the number of active elements in order to lower the side lobe level. The results are compared to other optimization methods to validate the proposed algorithm.
Źródło:
Archives of Electrical Engineering; 2020, 69, 3; 561-579
1427-4221
2300-2506
Pojawia się w:
Archives of Electrical Engineering
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Multilevel inverter with optimal THD through the firefly algorithm
Autorzy:
El Mehdi Belkacem, R.
Benzid, R.
Bouguechal, N.
Powiązania:
https://bibliotekanauki.pl/articles/141495.pdf
Data publikacji:
2017
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
firefly algorithm (FFA)
genetic algorithm (GA)
inverter
multilevel
optimized THD
Opis:
Reduction of the Total Harmonic Distortion (THD) in multilevel inverters requires resolution of complex nonlinear transcendental equations; in this paper we propose a combination of one of the best existing optimized hardware structures with the recent firefly algorithm, which was used to optimize the THD, through finding the best switching angles and guaranteeing the minimization of harmonics within a user defined bandwidth. The obtained THD through the simulation of the thirteen-level symmetric inverter has been reduced down to 5% (FFT of 60 harmonics). In order to validate the simulation results, a thirteen-level symmetric inverter prototype has been made, and practically experimented and tested with different loads. Consequently, the measured THD with resistive load was 4.7% on a bandwidth of 3 kHz. The main advantage of the achieved work is the reduction of the THD.
Źródło:
Archives of Electrical Engineering; 2017, 66, 1; 141-154
1427-4221
2300-2506
Pojawia się w:
Archives of Electrical Engineering
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Quantum Factorization of Integers 21 and 91 using Shor’s Algorithm
Autorzy:
Ardhyamath, Poornima
Naghabhushana, N. M.
Ujjinimatad, Rohitha
Powiązania:
https://bibliotekanauki.pl/articles/1070857.pdf
Data publikacji:
2019
Wydawca:
Przedsiębiorstwo Wydawnictw Naukowych Darwin / Scientific Publishing House DARWIN
Tematy:
Euclidean Algorithm
Factorization
GCD
Quantum Fourier Transform
Shor’s Algorithm
Opis:
In this paper we focused on the factorization of integer in detail using well known Shor’s algorithm and its quantum part realization. The algorithm finds prime factors any integer more efficiently than any known classical algorithm. It is based on prior knowledge of the answer to the factorization problem. Algorithm includes finding gcd using polynomial time Euclidean algorithm, determination of unknown period from quantum computer and continued fraction expansion approach. Factorization of two integers 21 and 91 are shown in this paper with all steps. Quantum part of the factorization described mathematically.
Źródło:
World Scientific News; 2019, 123; 102-113
2392-2192
Pojawia się w:
World Scientific News
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Znaczenie algorytmu dydaktycznego w projektowaniu multimedialnych programów dydaktycznych
The importance of the algorithm in the design of multimedia teaching programs
Autorzy:
LIB, Waldemar
Powiązania:
https://bibliotekanauki.pl/articles/456222.pdf
Data publikacji:
2010
Wydawca:
Uniwersytet Rzeszowski
Tematy:
algorytm
algorytm dydaktyczny
multimedialny program
algorithm
didactic algorithm
multimedia program
Opis:
Komputerowe programy prezentacyjne oraz łatwe w obsłudze edytory języków programowania stworzyły nauczycielom nieograniczone moŜliwości projektowania i wykonywania własnych opracowań metodycznych opartych na technologiach informatycznych i informacyjnych. Jak wielkie znaczenie cywilizacyjne wywarło upowszechnienie się hiperteksu wyjaśnia szerzej W. Furmanek w opracowaniu Cywilizacyjne i osobowe znaczenie hipertekstu [2008]. W artykule poruszana jest problematyka związana z projektowaniem multimedialnych programów dydaktycznych. To na etapie projektowania podejmowane są decyzje dotyczące struktury programu dydaktycznego, sposobu prezentowania treści kształcenia, ich układu metodycznego, doboru mediów słuŜących do przekazywania i sprawdzania nowo nabytych wiadomości. Często konsekwencją ustalenia struktury multimedialnego programu dydaktycznego i zastosowania określonych mediów jest wybór technologii informatycznych słuŜących do jego realizacji.
Presentation computer programs and easy to use word processors for programming language have offered teachers inexhaustible possibilities of designing and performing their own methodological studies based on information technology. W. Furmanek broadly explains the civilisation significance of popularising a hypertext in the study Civilisation and personal significance of hypertext (2008). The article presents the issues connected with designing multimedia didactic programmes. During the designing stage, there are decisions taken on the structure of a didactic programme, the way of presenting its educational contents, their methodological layout as well as the adjustment of media needed to pass and check newly acquired knowledge. In most cases, the creation of the structure of a multimedia didactic programme and application of specific media relies on the selection of information technologies that allow for its implementation.
Źródło:
Edukacja-Technika-Informatyka; 2012, 3, 2; 173-181
2080-9069
Pojawia się w:
Edukacja-Technika-Informatyka
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Methods for imputation of missing values and their influence on the results of segmentation research
Metody uzupełniania braków danych i ich wpływ na wyniki badań segmentacyjnych.
Autorzy:
Gąsior, Marcin
Skowron, Łukasz
Powiązania:
https://bibliotekanauki.pl/articles/425241.pdf
Data publikacji:
2016
Wydawca:
Wydawnictwo Uniwersytetu Ekonomicznego we Wrocławiu
Tematy:
missing values
cluster analysis
k-means algorithm
k-medoids algorithm
Opis:
The lack of answers is a common problem in all types of research, especially in the field of social sciences. Hence a number of solutions were developed, including the analysis of complete cases or imputations that supplement the missing value with a value calculated according to different algorithms. This paper evaluates the influence of the adopted method for the supplementation of missing answers regarding the result of segmentation conducted with the use of cluster analysis. In order to achieve this we used a set of data from an actual consumer research in which the cases with missing values were deleted or supplemented with the use of various methods. Cluster analyses were then performed on those sets of data, both with the assumption of ordinal and ratio level of measurement, and then the grouping quality, as expressed by different indicators, was evaluated. This research proved the advantage of imputation over the analysis of complete cases, it also proved the validity of using more complex approaches than the simple supplementation with an average or median value.
Źródło:
Econometrics. Ekonometria. Advances in Applied Data Analytics; 2016, 4 (54); 61-71
1507-3866
Pojawia się w:
Econometrics. Ekonometria. Advances in Applied Data Analytics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Nash-lambda algorithm with applications in safety and reliability
Autorzy:
Cui, Y.
Guo, R.
Powiązania:
https://bibliotekanauki.pl/articles/2069567.pdf
Data publikacji:
2011
Wydawca:
Uniwersytet Morski w Gdyni. Polskie Towarzystwo Bezpieczeństwa i Niezawodności
Tematy:
lambda algorithm
Nash equilibrium
genetic algorithm
safety
reliability
terrorist threa
Opis:
In this paper, a new algorithm, named as Nash-lambda algorithm by merging Nash equilibrium solution and the lambda algorithm, is proposed. The lambda algorithm, a new global optimization algorithm, is created by imitating ancient Chinese human body system model, which has already demonstrated its simplicity in searching scheme, codes and efficiency in computation comparing to the genetic algorithm. The noncorporative game environments determine the optimization problems which are different from those of the traditional safety and reliability optimizations because of the engagement of the Nash equilibrium for seeking the best strategy. The lambda algorithm serves the searching the Nash equilibrium solution efficiently. In other worlds, the Nash-lambda algorithm is just developed to address the optimization problems of the multiple objective functions representing non-corporative players’ interests.
Źródło:
Journal of Polish Safety and Reliability Association; 2011, 2, 1; 51--58
2084-5316
Pojawia się w:
Journal of Polish Safety and Reliability Association
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Lambda algorithm and maximum likelihood estimation
Autorzy:
Cui, Y.
Guo, R.
Guo, D.
Powiązania:
https://bibliotekanauki.pl/articles/2069616.pdf
Data publikacji:
2011
Wydawca:
Uniwersytet Morski w Gdyni. Polskie Towarzystwo Bezpieczeństwa i Niezawodności
Tematy:
lambda algorithm
genetic algorithm
reliability
repairable system
likelihood-lambda procedure
Opis:
In this paper, a new global optimization algorithm by imitating ancient Chinese human body system model, named as lambda algorithm, is introduced. The lambda algorithm utilizes five-element multi-segment string to represent the n-dimensional Euclidean point and hence the string based operation rules for expansion, comparison and sorting candidate strings. The algorithm enjoys the simplest mathematical operations but generates highest searching speed and accuracy. We furthermore explore to merge the lambda algorithm with maximum likelihood procedure for creating a non-derivative scheme – likelihood- lambda procedure. A illustrative example is given.
Źródło:
Journal of Polish Safety and Reliability Association; 2011, 2, 1; 59--72
2084-5316
Pojawia się w:
Journal of Polish Safety and Reliability Association
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Parallel constructing of the shortest coverings of large Boolean matrices
Autorzy:
Novikov, S.
Powiązania:
https://bibliotekanauki.pl/articles/92853.pdf
Data publikacji:
2016
Wydawca:
Uniwersytet Przyrodniczo-Humanistyczny w Siedlcach
Tematy:
Boolean matrix
shortest covering
decomposition
sequential algorithm
parallel algorithm
cluster
Opis:
The paper presents two options of the parallel algorithm for finding the shortest covering of a large Boolean matrix, where the decomposition of the initial matrix into matrices of smaller sizes is based on the partitioning of rows. The parallel algorithm COVMB contains sequential algorithms for partitioning of initial m × n Boolean matrix on submatrices, building special matrices, summering of the shortest coverings of special Boolean matrices with smaller sizes as well as the sequential algorithm SECNOP for finding the shortest coverings of smaller Boolean matrices.
Źródło:
Studia Informatica : systems and information technology; 2016, 1-2(20); 27-37
1731-2264
Pojawia się w:
Studia Informatica : systems and information technology
Dostawca treści:
Biblioteka Nauki
Artykuł
Wyświetlanie 1-25 z 1769

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