Search Results for "q learning algorithm" - Page 3
Sort By:
Showing 98 open source projects for "q learning algorithm"
View related business solutions-
SKUDONET ADC, operates at the application layer, efficiently distributing network load and application load across multiple servers. This not only enhances the performance of your application but also ensures that your web servers can handle more traffic seamlessly.
-
AlertBot monitors your website's full functionality around the clock so you can focus your time on more important things.
-
1
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 usage... -
2
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. -
3
nunn
This is an implementation of a machine learning library in C++17
nunn is a collection of ML algorithms and related examples written in modern C++17. -
4
-
Google Cloud is a cloud-based service that allows you to create anything from simple websites to complex applications for businesses of all sizes.
-
5
Density-ratio based clustering
Discovering clusters with varying densities
This site provides the source code of two approaches for density-ratio based clustering, used for discovering clusters with varying densities. One approach is to modify a density-based clustering algorithm to do density-ratio based clustering by using its density estimator to compute density-ratio. The other approach involves rescaling the given dataset only. An existing density-based clustering algorithm, which is applied to the rescaled dataset, can find all clusters with varying... -
6
Community Detection Modularity Suite
Suite of community detection algorithms based on Modularity
- MixtureModel_v1r1: overlapping community algorithm [3], which includes novel partition density and fuzzy modularity metrics. - OpenMP versions of algorithms in [1] are available to download. - Main suite containing three community detection algorithms based on the Modularity measure containing: Geodesic and Random Walk edge Betweenness [1] and Spectral Modularity [2]. Collaborator: Theologos Kotsos. [1] M. Newman & M. Girvan, Physical Review, E 69 (026113), 2004. [2] M. Newman... -
7
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. -
8
Adaptive Difficulty Chinese Chess
A Chinese chess game including an adaptive computer opponent.
This project is an application of POSM algorithm on Chinese chess computer player. A computer player is implemented, which will adapt to the its opponent by adjusting its playing strength accordingly. -
9
GI-ICA
Matlab implementation of GI-ICA and PEGI
This is a matlab implementation of the GI-ICA algorithm for ICA in the presence of an additive Gaussian noise. The algorithm is discussed in the paper "Fast Algorithms for Gaussian Noise Invariant Independent Component Analysis" by James Voss, Luis Rademacher, and Mikhail Belkin. -
SafetyIQ is revolutionizing the way businesses approach safety. As a leading provider of comprehensive workplace safety software, we cater to four key areas: Mobile Worker Safety, EHS (Environment, Health, and Safety), Fatigue Management, and Training. Our platform is designed to safeguard your workers, no matter their location or task, ensuring all-around safety compliance. Unlike most safety software providers that only react to incidents or implement proactive measures, SafetyIQ introduces a third pillar to safety management - predictive analytics. We transform the untapped wealth of safety data within your organization into actionable insights to inform safety strategies, mitigating risks even before they aris
-
10
ExSTraCS
Extended Supervised Tracking and Classifying System
This advanced machine learning algorithm is a Michigan-style learning classifier system (LCS) developed to specialize in classification, prediction, data mining, and knowledge discovery tasks. Michigan-style LCS algorithms constitute a unique class of algorithms that distribute learned patterns over a collaborative population of of individually interpretable IF:THEN rules, allowing them to flexibly and effectively describe complex and diverse problem spaces. ExSTraCS was primarily developed... -
11
DE-HEoC
DE-based Weight Optimisation for Heterogeneous Ensemble
We propose the use of Differential Evolution algorithm for the weight adjustment of base classifiers used in weighted voting heterogeneous ensemble of classifier. Average Matthews Correlation Coefficient (MCC) score, calculated over 10-fold cross-validation, has been used as the measure of quality of an ensemble. DE/rand/1/bin algorithm has been utilised to maximize the average MCC score calculated using 10-fold cross-validation on training dataset. The voting weights of base classifiers... -
12
LightSpMV
lightweight GPU-based sparse matrix-vector multiplication (SpMV)
LightSpMV is a novel CUDA-compatible sparse matrix-vector multiplication (SpMv) algorithm using the standard compressed sparse row (CSR) storage format. We have evaluated LightSpMV using various sparse matrices and further compared it to the CSR-based SpMV subprograms in the state-of-the-art CUSP and cuSPARSE. Performance evaluation reveals that on a single Tesla K40c GPU, LightSpMV is superior to both CUSP and cuSPARSE, with a speedup of up to 2.60 and 2.63 over CUSP, and up to 1.93 and 1.79... -
13
JAABA
The Janelia Automated Animal Behavior Annotator
... detectors that can then be used to automatically classify the behaviors of animals in large data sets with high throughput. JAABA combines an intuitive graphical user interface, a fast and powerful machine learning algorithm, and visualizations of the classifier into an interactive, usable system for creating automatic behavior detectors. Documentation is available at: http://jaaba.sourceforge.net/ -
14
Unsupervised Random Forest
On-line Unsupervised Random Forest
This tool uses Random Forest and PAM to cluster observations and to calculate the dissimilarity between observations. It supports on-line prediction of new observations (no need to retrain); and supports datasets that contain both continuous (e.g. CPU load) and categorical (e.g. VM instance type) features. In particular, we use an unsupervised formulation of the Random Forest algorithm to calculate similarities and provide them as input to a clustering algorithm. For the sake of efficiency... -
15
ConvNetJS
Deep learning in Javascript to train convolutional neural networks
... and train Convolutional Networks that process images, and experimental Reinforcement Learning modules, based on Deep Q Learning. The library allows you to formulate and solve Neural Networks in Javascript. If you would like to add features to the library, you will have to change the code in src/ and then compile the library into the build/ directory. The compilation script simply concatenates files in src/ and then minifies the result. -
16
Fingerprint Recognition System
Fingerprint Recognition System 5.3 - Matlab source code
The proposed filter-based algorithm uses a bank of Gabor filters to capture both local and global details in a fingerprint as a compact fixed length FingerCode. The fingerprint matching is based on the Euclidean distance between the two corresponding FingerCodes and hence is extremely fast. We are able to achieve a verification accuracy which is only marginally inferior to the best results of minutiae-based algorithms published in the open literature. Our system performs better than a state... -
17
Face Recognition System
Face Recognition System Matlab source code
Research on automatic face recognition in images has rapidly developed into several inter-related lines, and this research has both lead to and been driven by a disparate and expanding set of commercial applications. The large number of research activities is evident in the growing number of scientific communications published on subjects related to face processing and recognition. Index Terms: face, recognition, eigenfaces, eigenvalues, eigenvectors, Karhunen-Loeve algorithm. -
18
Intelligent Keyword Miner
Intelligent SEO keyword miner and predicing tool
..., you can choose to reset or train it further. Programs that have similar idea are: Google AdWords, SERPWoo's Keyword Finder, Wordpot, and others. Difference is, this program is intelligent and it accepts your input data and then predicts keywords based on your likes or dislikes. As the main engine, it uses the SMOReg algorithm to analyze and map the keyword frequencies of your data. This can be a great SEO tool to help increase the traffic of any website featuring a product. -
19
MODLEM
rule-based, WEKA compatible, Machine Learning algorithm
This project is a WEKA (Waikato Environment for Knowledge Analysis) compatible implementation of MODLEM - a Machine Learning algorithm which induces minimum set of rules. These rules can be adopted as a classifier (in terms of ML). It is a sequential covering algorithm, which was invented to cope with numeric data without discretization. Actually the nominal and numeric attributes are treated in the same way: attribute's space is being searched to find the best rule condition during rule... -
20
LWPR
Locally Weighted Projection Regression (LWPR)
Locally Weighted Projection Regression (LWPR) is a fully incremental, online algorithm for non-linear function approximation in high dimensional spaces, capable of handling redundant and irrelevant input dimensions. At its core, it uses locally linear models, spanned by a small number of univariate regressions in selected directions in input space. A locally weighted variant of Partial Least Squares (PLS) is employed for doing the dimensionality reduction. Please cite: [1] Sethu Vijayakumar... -
21
ArabicDiacritizer
An automatic restoration of Arabic diacritic marks
This is a software of Arabic diacritical marks restoration. It is based mainly on deep architectures using deep neural network. The algorithm generates diacritized text with determined end case. The algorithm is described in detail in: Ilyes Rebai, and Yassine BenAyed 'Text-to-speech synthesis system with Arabic diacritic recognition system', Computer Speech & Language, 2015. We appreciate it very much if you can cite our related work. ************** Installation... -
22
A2y
Automated Algorithm Synthesis
-
23
EducationalLCS
eLCS - Educational Learning Classifier System
Educational Learning Classifier System (eLCS) is a set of learning classifier system (LCS) educational demos designed to introduce students or researchers to the basics of a modern Michigan-style LCS algorithm. This eLCS package includes 5 different implementations of a basic LCS algorithm, as part of a 6 stage set of demos that will be paired with the first introductory LCS textbook. Each eLCS implementations (from demo 2 up to demo 6) progressively add major components of the entire LCS... -
24
StabLe
An algorithm for learning stable graphical models from data
Stable Graphical Model Learning (StabLe) is an algorithm for learning the structure and parameters of stable graphical (SG) models from data. Stable random variables are motivated by the central limit theorem for densities with (potentially) unbounded variance and can be thought of as natural generalizations of the Gaussian distribution to skewed and heavy-tailed phenomenon. SG models are multi-variate stable distributions that represent Bayesian networks whose edges encode linear... -
25
ProximityForest
Efficient Approximate Nearest Neighbors for General Metric Spaces
A proximity forest is a data structure that allows for efficient computation of approximate nearest neighbors of arbitrary data elements in a metric space. See: O'Hara and Draper, "Are You Using the Right Approximate Nearest Neighbor Algorithm?", WACV 2013 (best student paper award). One application of a ProximityForest is given in the following CVPR publication: Stephen O'Hara and Bruce A. Draper, "Scalable Action Recognition with a Subspace Forest," IEEE Conference on Computer Vision...