Search Results for "genetic algorithm java"
Sort By:
Showing 200 open source projects for "genetic algorithm java"
View related business solutions-
Our Free Plans just got better! | Auth0You asked, we delivered! Auth0 is excited to expand our Free and Paid plans to include more options so you can focus on building, deploying, and scaling applications without having to worry about your security. Auth0 now, thank yourself later.
-
Cloud-based help desk software with ServoDeskWhat if You Could Automate 90% of Your Repetitive Tasks in Under 30 Days? At ServoDesk, we help businesses like yours automate operations with AI, allowing you to cut service times in half and increase productivity by 25% - without hiring more staff.
-
1
PyGAD
Source code of PyGAD, Python 3 library for building genetic algorithms
PyGAD is an open-source easy-to-use Python 3 library for building the genetic algorithm and optimizing machine learning algorithms. It supports Keras and PyTorch. PyGAD supports optimizing both single-objective and multi-objective problems. PyGAD supports different types of crossover, mutation, and parent selection. PyGAD allows different types of problems to be optimized using the genetic algorithm by customizing the fitness function. -
2
Smile
Statistical machine intelligence and learning engine
Smile is a fast and comprehensive machine learning engine. With advanced data structures and algorithms, Smile delivers the state-of-art performance. Compared to this third-party benchmark, Smile outperforms R, Python, Spark, H2O, xgboost significantly. Smile is a couple of times faster than the closest competitor. The memory usage is also very efficient. If we can train advanced machine learning models on a PC, why buy a cluster? Write applications quickly in Java, Scala, or any JVM... -
3
Alink
Alink is the Machine Learning algorithm platform based on Flink
Alink is Alibaba’s scalable machine learning algorithm platform built on Apache Flink, designed for batch and stream data processing. It provides a wide variety of ready-to-use ML algorithms for tasks like classification, regression, clustering, recommendation, and more. Written in Java and Scala, Alink is suitable for enterprise-grade big data applications where performance and scalability are crucial. -
4
Evolutionary Computation Framework
C++ framework for application of any type of evolutionary computation.
ECF is a framework intended for application of any type of evolutionary computation (GA/GP, DE, Clonalg, ES, PSO, ABC, GAn, local search...). It offers simplicity for the end-user (parameterless usage, tutorial) and customization for experienced EC practicioners. -
Run applications fast and securely in a fully managed environmentRun frontend and backend services, batch jobs, deploy websites and applications, and queue processing workloads without the need to manage infrastructure.
-
5
AcoPath for Java
Ant Colony Optimization algorithm for the shortest path problem.
The shortest path problem is solved by many methods. Heuristics offer lower complexity in expense of accuracy. There are many use cases where the lower accuracy is acceptable in return of lower consumption of computing resources. The basic idea of the Ant System is that virtual ants are exploited for finding paths with a specific property, e.g., short distance between physical nodes, in the same way nature guides physical ants. -
6
OpenDino
Open Source Java platform for Optimization, DoE, and Learning.
OpenDino is an open source Java platform for optimization, design of experiment and learning. It provides a graphical user interface (GUI) and a platform which simplifies integration of new algorithms as "Modules". Implemented Modules Evolutionary Algorithms: - CMA-ES - (1+1)-ES - Differential Evolution Deterministic optimization algorithm: - SIMPLEX Learning: - a simple Artificial Neural Net Optimization problems: - test functions - interface for executing other programs (solvers) - parallel execution of problems - distributed execution of problems via socket connection between computers Others: - data storage - data analyser and viewer -
7
The source code has been migrated and is now hosted on Github: https://github.com/jenetics/jenetics Jenetics is an advanced Genetic Algorithm, Evolutionary Algorithm and Genetic Programming library, respectively, written in modern day Java. It is designed with a clear separation of the several algorithm concepts, e. g. Gene, Chromosome, Genotype, Phenotype, Population and fitness Function. Jenetics allows you to minimize or maximize the given fitness function without tweaking it. ...
-
8
Venice is a stock market trading programme that supports portfolio management, charting, technical analysis, paper trading and genetic programming. Venice runs in a graphical user interface with online help and has full documentation.
-
9
Easy Machine Learning
Easy Machine Learning is a general-purpose dataflow-based system
Machine learning algorithms have become the key components in many big data applications. However, the full potential of machine learning is still far from being realized because using machine learning algorithms is hard, especially on distributed platforms such as Hadoop and Spark. The key barriers come from not only the implementation of the algorithms themselves but also the processing for applying them to real applications which often involve multiple steps and different algorithms. Our... -
Repair-CRMAll-In-One Solution with an Online Booking portal for automating scheduling & dispatching to ditch paperwork and improve the productivity of your technicians!
-
10
popt4jlib
Parallel Optimization Library for Java
popt4jlib is an open-source parallel optimization library for the Java programming language supporting both shared memory and distributed message passing models. Implements a number of meta-heuristic algorithms for Non-Linear Programming, including Genetic Algorithms, Differential Evolution, Evolutionary Algorithms, Simulated Annealing, Particle Swarm Optimization, Firefly Algorithm, Monte-Carlo Search, Local Search algorithms, Gradient-Descent-based algorithms, as well as some well-known network flow and other graph algorithms. ... -
11
The main purpose of CombiTagger is to read files generated by individual PoS taggers and use them to develop and evaluate combined taggers according to a given combination algorithm. http://aaai.org/ocs/index.php/FLAIRS/2009/paper/download/67/296
-
12
DGRLVQ
Dynamic Generalized Relevance Learning Vector Quantization
Some of the usual problems for Learning vector quantization (LVQ) based methods are that one cannot optimally guess about the number of prototypes required for initialization for multimodal data structures i.e.these algorithms are very sensitive to initialization of prototypes and one has to pre define the optimal number of prototypes before running the algorithm. If a prototype, for some reasons, is ‘outside’ the cluster which it should represent and if there are points of a different... -
13
Genetic Oversampling Weka Plugin
A Weka Plugin that uses a Genetic Algorithm for Data Oversampling
Weka genetic algorithm filter plugin to generate synthetic instances. This Weka Plugin implementation uses a Genetic Algorithm to create new synthetic instances to solve the imbalanced dataset problem. See my master thesis available for download, for further details. -
14
This application allow user to predict dissolution profile of solid dispersion systems based on algorithms like symbolic regression, deep neural networks, random forests or generalized boosted models. Those techniques can be combined to create expert system. Application was created as a part of project K/DSC/004290 subsidy for young researchers from Polish Ministry of Higher Education.
-
15
OWL Machine Learning
Machine learning algorithm using OWL
Feature construction and selection are two key factors in the field of Machine Learning (ML). Usually, these are very time-consuming and complex tasks because the features have to be manually crafted. The features are aggregated, combined or split to create features from raw data. This project makes use of ontologies to automatically generate features for the ML algorithms. The features are generated by combining the concepts and relationships that are already in the knowledge base,... -
16
jalicanto
Traveling Salesman Problem "window time based" aproximate solver
Time based Traveling salesman problem solver. Using iterated local search algorithm, implements xkick perturbation Programmed in Java. A class to use the TSP Suite(Thomas Weise, Raymond Chiong, J ¨org L¨assig, Ke Tang, Shigeyoshi Tsutsui, Wenxiang Chen, Zbigniew Michalewicz, Xin Yao, Benchmarking Optimization Algorithms: An Open Source Framework for the Traveling Salesman Problem. 2014.),is implemented. -
17
Swift AI
The Swift machine learning library
Swift AI is a high-performance deep learning library written entirely in Swift. We currently offer support for all Apple platforms, with Linux support coming soon. Swift AI includes a collection of common tools used for artificial intelligence and scientific applications. A flexible, fully-connected neural network with support for deep learning. Optimized specifically for Apple hardware, using advanced parallel processing techniques. We've created some example projects to demonstrate the... -
18
MicroGP
A multi-purpose extensible self-adaptive evolutionary algorithm
MicroGP (µGP, ugp) is a versatile optimizer able to outperform both human experts and conventional heuristics in finding the optimal solution of hard problems. It is an evolutionary algorithm since it mimics some principles of the Neo-Darwinian paradigm. ⚠️ A new version is available on https://github.com/squillero/microgp4 -
19
GUI Ant-Miner is a tool for extracting classification rules from data. It is an updated version of a data mining algorithm called Ant-Miner (Ant Colony-based Data Miner).
-
20
This paper represent a development and deployment and/or Implementation of Optical Character Recognition (OCR) to translate images of typewritten or handwritten characters into electronically editable format by preserving font properties. OCR can do this by applying pattern matching algorithm. The Recognized characters are stored in editable format. Thus OCR make the computer read the printed documents discarding noise. Keywords- Optical Character Recognition, Image convert to character,...
-
21
smartblob
tiny code, html webcam game or plug brain in each blob, java server
...I'm planning a huge multiplayer world, some blobs played by people holding a bendable loop game controller (tape a 1 meter cut of thick extension cord into a loop) in front of webcam and bend it to bend your blob on screen, and other blobs controlled by AI. This is a game for general AI research in a fun way people can do together. The physics and vision algorithm is half working in version 0.3.0. The gameplay is better experienced in 0.2 which is controlled with the mouse so you dont have enough freedom of movement compared to webcam. This small file contains its own source code including occamserver, a tiny general java server I built which I'll adjust to allow http streaming connections to stay open for faster ajax than a new web call each time. ... -
22
This project consists of various implementations of the Graphplan algorithm. At the moment we have two implementations of Graphplan: * Emplan - A C++ implementation for Linux, Windows and MacOS X * JavaGP - A Java implementation
-
23
Rootvole
a text parsing library that matches text with concepts.
For general processing of voice queries we developed a text parsing library named 'Rootvole' that can be used to match text with semantic concepts. The algorithm was implemented in Java and can be described as a form of a parsing expression grammar, where we generate the expressions to be detected beforehand by regular expressions and store them in a vocabulary. The central class is the parser class, which is instantiated as a series of vocabularies, simple text lists that describe tokens and synonyms, and value descriptors. ... -
24
serein
A Framework to Model Metaheuristics
-
25
GA-EoC
GeneticAlgorithm-based search for Heterogeneous Ensemble Combinations
...To enhance classification performances, we propose an ensemble of classifiers that combine the classification outputs of base classifiers using the simplest and largely used majority voting approach. Instead of creating the ensemble using all base classifiers, we have implemented a genetic algorithm (GA) to search for the best combination from heterogeneous base classifiers. The classification performances achieved by the proposed method method on the chosen datasets are promising.
