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

  Lista filtrów

Dostawca treści

Wyrównaj
Wyświetlanie 1-15 z 1381
Tytuł:
The idea of using the A* algorithm for route planning an unmanned vehicle “Edredon”
Autorzy:
Naus, K.
Wąż, M.
Powiązania:
https://bibliotekanauki.pl/articles/359690.pdf
Data publikacji:
2013
Wydawca:
Akademia Morska w Szczecinie. Wydawnictwo AMSz
Tematy:
A* algorithm
navigation system
route planning
electronic chart
vehicle „Edredon”
Opis:
This article presents the concept of algorithm A* functioning in a navigation system equipped with electronic navigational chart for autonomous planning the shortest and safest route crossing an offshore unmanned vehicle “Edredon”. The first part describes the general technical architecture and functionality of the vehicle's navigation system. In the second part shows in detail the modules of the system responsible for the planning of the road and how to implement them in the A* algorithm. The third part describes the proper operation of testing whether the A* algorithm in the navigation system, while the task of planning the route of the autonomous vehicle. Final part is a discussion of the results obtained from tests carried out in order to evaluate the applicability of the A* algorithm for route planning in autonomous navigation systems.
Źródło:
Zeszyty Naukowe Akademii Morskiej w Szczecinie; 2013, 36 (108) z. 2; 143-147
1733-8670
2392-0378
Pojawia się w:
Zeszyty Naukowe Akademii Morskiej w Szczecinie
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
An Application of Probabilistic Grammars to Efficient Machne Translation
Autorzy:
Skórzewski, Paweł
Powiązania:
https://bibliotekanauki.pl/articles/1037598.pdf
Data publikacji:
2010-09-15
Wydawca:
Uniwersytet im. Adama Mickiewicza w Poznaniu
Tematy:
a* algorithm
machine translation
natural language parsing
pcfg
probabilistic grammars
Opis:
In this paper we present one of the algorithms used to parse probabilistic context-free grammars: the A* parsing algorithm, which is based on the A* graph search method. We show an example of application of the algorithm in an existing machine translation system. The existing CYK-based parser used in the Translatica system was modified by applying the A* parsing algorithm in order to examine the possibilities of improving its performance. This paper presents the results of applying the A* algorithm with different heuristic functions and their impact on the performance of the parser.
Źródło:
Investigationes Linguisticae; 2010, 21; 90-98
1426-188X
1733-1757
Pojawia się w:
Investigationes Linguisticae
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Artificial intelligence in solving collision problem in restricted area
Autorzy:
Mąka, M.
Dramski, M.
Powiązania:
https://bibliotekanauki.pl/articles/359349.pdf
Data publikacji:
2013
Wydawca:
Akademia Morska w Szczecinie. Wydawnictwo AMSz
Tematy:
shortest path
safe route
restricted area
trapezoidal grid
area discretization
simplified ant algorithm
A* algorithm
Opis:
This paper presents one of the approaches to solve the collision problem in restricted area for two moving objects using artificial intelligence (SACO algorithm). Although AI should be used only when the classic methods fail, a simple comparison between them is very interesting. As we know the main task of navigation is to conduct safely an object from the point of departure to destination. This problem does not seem easy, especially if we consider the movement in restricted areas such narrow passages, ports etc.
Źródło:
Zeszyty Naukowe Akademii Morskiej w Szczecinie; 2013, 36 (108) z. 2; 118-122
1733-8670
2392-0378
Pojawia się w:
Zeszyty Naukowe Akademii Morskiej w Szczecinie
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Dynamic Key Generation During a Communication Instance Over GSM
Autorzy:
Zalaket, J.
Challita, K.
Powiązania:
https://bibliotekanauki.pl/articles/108666.pdf
Data publikacji:
2013
Wydawca:
Społeczna Akademia Nauk w Łodzi
Tematy:
mobile communication
encryption
GSM
A5 algorithm
Opis:
Mobile phone may become the protagonist of the new electronic technology. If we compare it with that of other technologies, the infiltration rate of mobile phones in the world is extremely high, both in cities than rural communities of the most of the countries. According to estimates made by the International Telecommunication Union the access to mobile networks is growing much faster than the access to Internet. This emergence has led many companies to allow new activities which were previously running strictly over the Internet to run over the mobile network such as the electronic payment. These circumstances make the security of mobile communication a priority to preserve the authentication, confidentiality and integrity of data sent between subscribers and mobile network. In this paper, we propose a dynamic key generation for the A5 GSM encryption algorithm to enforce the security and protect the transferred data. Our algorithm can be implemented over any GSM generation GSM/3G/4G.
Źródło:
Journal of Applied Computer Science Methods; 2013, 5 No. 1; 47-57
1689-9636
Pojawia się w:
Journal of Applied Computer Science Methods
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Task allocation algorithms for maximizing reliability of heterogeneous distributed computing systems
Autorzy:
Mahmood, A.
Powiązania:
https://bibliotekanauki.pl/articles/205582.pdf
Data publikacji:
2001
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
heurystyka
niezawodność
obliczenie zdecentralizowane
przetwarzanie rozproszone
A* algorithm
branch-and-bound
distributed computing
heuristics
reliability
task allocation
Opis:
The rapid progress of microprocessor and communication technologies has made the distributed computing system economically attractive for many computer applications. One of the first problems encountered in the operation of a distributed system is the problem of allocating the tasks among the processing nodes. The task allocation problem is known to be computationally intractable for large task sets. In this paper, we consider the task allocation problem with the goal of maximizing reliability of heterogeneous distributed systems. After presenting a quantitative task allocation model, we present a least-cost branch-and-bound algorithm to find optimal task allocations. We also present two heuristic algorithms to obtain suboptimal allocations for realistic size large problems in a reasonable amount of computational time. Simulation was used to study the performance of the proposed algorithms for a large number of problems. Also, performance of the proposed algorithms has been compared with a well-known heuristics available in the literature.
Źródło:
Control and Cybernetics; 2001, 30, 1; 115-130
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Minimal Decision Rules Based on the Apriori Algorithm
Autorzy:
Fernandez, M. C.
Menasalvas, E.
Marban, O.
Pena, J. M.
Millan, S.
Powiązania:
https://bibliotekanauki.pl/articles/908364.pdf
Data publikacji:
2001
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
baza danych
algorytmy
rough sets
rough dependencies
association rules
a priori algorithm
minimal decision rules
Opis:
Based on rough set theory many algorithms for rules extraction from data have been proposed. Decision rules can be obtained directly from a database. Some condition values may be unnecessary in a decision rule produced directly from the database. Such values can then be eliminated to create a more comprehensible (minimal) rule. Most of the algorithms that have been proposed to calculate minimal rules are based on rough set theory or machine learning. In our approach, in a post-processing stage, we apply the Apriori algorithm to reduce the decision rules obtained through rough sets. The set of dependencies thus obtained will help us discover irrelevant attribute values.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2001, 11, 3; 691-704
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Method for location of an external dump in surface mining using the A-star algorithm
Metoda lokalizacji zwałowiska zewnętrznego w górnictwie odkrywkowym z wykorzystaniem algorytmu A-star
Autorzy:
Zajączkowski, M.
Kasztelewicz, Z.
Sikora, M.
Powiązania:
https://bibliotekanauki.pl/articles/219312.pdf
Data publikacji:
2014
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
górnictwo odkrywkowe
zwałowisko zewnętrzne
wkop udostępniający
teoria grafów
algorytm A-star
surface mining
dump
excavation site
graph theory
A-star algorithm
Opis:
The construction of a surface mine always involves the necessity of accessing deposits through the removal of the residual overburden above. In the beginning phase of exploitation, the masses of overburden are located outside the perimeters of the excavation site, on the external dump, until the moment of internal dumping. In the case of lignite surface mines, these dumps can cover a ground surface of several dozen to a few thousand hectares. This results from a high concentration of lignite extraction, counted in millions of Mg per year, and the relatively large depth of its residual deposits. Determining the best place for the location of an external dump requires a detailed analysis of existing options, followed by a choice of the most favorable one. This article, using the case study of an open-cast lignite mine, presents the selection method for an external dump location based on graph theory and the A-star algorithm. This algorithm, based on the spatial distribution of individual intersections on the graph, seeks specified graph states, continually expanding them with additional elementary fields until the required surface area for the external dump - defined by the lowest value of the occupied site - is achieved. To do this, it is necessary to accurately identify the factors affecting the choice of dump location. On such a basis, it is then possible to specify the target function, which reflects the individual costs of dump construction on a given site. This is discussed further in chapter 3. The area of potential dump location has been divided into elementary fields, each represented by a corresponding geometrical locus. Ascribed to this locus, in addition to its geodesic coordinates, are the appropriate attributes reflecting the degree of development of its elementary field. These tasks can be carried out automatically thanks to the integration of the method with the system of geospatial data management for the given area. The collection of loci, together with geodesic coordinates, constitutes the points on the graph used during exploration. This is done using the A-star algorithm, which uses a heuristic function, allowing it to identify the optimal solution; therefore, the collection of elementary fields, which occupy the potential construction area of a dump, characterized by the lowest value representing the cost of occupation and dumping of overburden in the area. The precision of the boundary, generated by the algorithm, is dependent on the established size of the elementary field, and should be refined each time by the designer of the surface mine. This article presents the application of the above method of dump location using the example of “Tomisławice,” a lignite surface mine owned by PAK KWB Konin S. A. The method made it possible to identify the most favorable dump location on the northeast side of the initial pit, within 2 kilometers of its surrounding area (discussed further in chapter 3). This method is universal in nature and, after certain modifications, can be implemented for other surface mines as well.
Budowa kopalni odkrywkowej wiąże się zawsze z koniecznością udostępnienia złoża poprzez zdjęcie zalegającego nad nim nadkładu. W początkowej fazie eksploatacji masy nadkładowe lokalizowane są poza granicami wyrobiska odkrywkowego na zwałowisku zewnętrznym, aż do momentu przejścia do zwałowania wewnętrznego. W przypadku kopalń odkrywkowych węgla brunatnego zwałowiska te osiągają powierzchnię od kilkudziesięciu do nawet kilku tysięcy hektarów. Spowodowane jest to dużą koncentracją wydobycia węgla brunatnego liczoną w milionach Mg na rok oraz stosunkowo dużą głębokością zalegania tych złóż. W celu wyboru najkorzystniejszej jego lokalizacji powinno się przeprowadzić szczegółową analizę alternatywnych wariantów, a następnie wybrać wariant najkorzystniejszy. W artykule przedstawiono metodę wyboru lokalizacji zwałowiska zewnętrznego na przykładzie wieloodkrywkowej kopalni węgla brunatnego opartą na teorii grafów i algorytmie A-star. Algorytm ten na podstawie przestrzennego rozmieszczenia poszczególnych węzłów w grafie przeszukuje określone stany grafu, rozbudowując je o kolejne pola elementarne, aż do uzyskania wymaganej wielkości powierzchni przeznaczonej pod budowę zwałowiska zewnętrznego charakteryzującej się przy tym najmniejszą wartością zajętego terenu. Aby to osiągnąć konieczne jest dokładne zidentyfikowanie czynników mających wpływ na wybór lokalizacji zwałowiska zewnętrznego. Na ich podstawie można określić funkcję celu odzwierciedlającą wielkość poszczególnych kosztów budowy zwałowiska zewnętrznego na danym terenie, co zostało szczegółowo opisane w rozdziale 3. Obszar potencjalnej lokalizacji zwałowiska zewnętrznego podzielono na pola elementarne, którego reprezentantem jest centrodia. Centroidzie tej, oprócz jej współrzędnych geodezyjnych, przypisano odpowiednie atrybuty odzwierciedlające stopień zagospodarowania jej pola elementarnego. Czynności te mogła zostać przeprowadzone automatycznie dzięki zintegrowaniu opracowanej metody z systemem zarządzania danymi geoprzestrzennymi o terenie. Zbiór centroid wraz z jej współrzędnymi geodezyjnymi i przydzielonymi atrybutami stanowił wierzchołki grafu do przeszukiwania, którego użyto algorytmu A-star. Algorytm ten wykorzystuje funkcję heurystyczną, dzięki której jest w stanie za każdym razem wskazywać optymalne rozwiązanie, a więc taki zbiór pól elementarnych, których zajęcie pod budowę zwałowiska zewnętrznego będzie charakteryzowało się najmniejszą wartością reprezentującą koszty zajęcia i zwałowania mas nadkładowych na tym obszarze. Dokładność przebiegu granicy wygenerowanej przez algorytm uzależniona jest od przyjętej wielkości pola elementarnego i za każdym razem powinna być ona uszczegółowiona przez projektanta kopalni odkrywkowej. W artykule przedstawiono zastosowanie powyższej metody lokalizacji zwałowiska zewnętrznego na przykładzie kopalni odkrywkowej węgla brunatnego „Tomisławice” należącej do PAK KWB Konin S.A. Dzięki niej możliwe było wskazanie najkorzystniejszej lokalizacji zwałowiska po północno-wschodniej stronie wkopu udostępniającego i oddalonego od niego o ok. 2 km, co zostało opisane w rozdziale 3. Opracowana metoda ma charakter uniwersalny i po pewnych modyfikacjach może być zaimplementowana także dla kopalń odkrywkowych innych kopalin.
Źródło:
Archives of Mining Sciences; 2014, 59, 3; 721-730
0860-7001
Pojawia się w:
Archives of Mining Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Algorithm CFP-SFPwith parallel processing
Autorzy:
Kujawiak, M.
Powiązania:
https://bibliotekanauki.pl/articles/92930.pdf
Data publikacji:
2008
Wydawca:
Uniwersytet Przyrodniczo-Humanistyczny w Siedlcach
Tematy:
association rules
data mining
web logs
a priori
a priori TID
a priori hybrid algorithm
FP-Tree
Opis:
Existing algorithms for finding association rules do not implement parallel processing. This paper proposes CFP-SFP (Creating Frequent Patterns with Set from Frequent Patterns) algorithm with parallel processing. The research involves running CEP-SEP algorithm with one thread and a dozen or so threads that are executed simultaneously. The research was conducted on a computer with one processor and dual-core processor.
Źródło:
Studia Informatica : systems and information technology; 2008, 1(10); 87-93
1731-2264
Pojawia się w:
Studia Informatica : systems and information technology
Dostawca treści:
Biblioteka Nauki
Artykuł
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ł:
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ł
Wyświetlanie 1-15 z 1381

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