Search Results for "q learning algorithm" - Page 6
Sort By:
Showing 200 open source projects for "q learning algorithm"
View related business solutions-
Our Free Plans just got better! | Auth0 by OktaYou 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 secuirty. Auth0 now, thank yourself later.
-
Top-Rated Free CRM SoftwareHubSpot is an AI-powered customer platform with all the software, integrations, and resources you need to connect your marketing, sales, and customer service. HubSpot's connected platform enables you to grow your business faster by focusing on what matters most: your customers.
-
1
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... -
2
HAWK - PDF Text Search Java Project
No more support for this project - TAKE A LOOK AT FALCONSEARCH
No more support for this project - TAKE A LOOK AT FALCONSEARCH "https://sourceforge.net/projects/falcontextsearch/" -
3
Java application for training and deploying text processing applications such as part-of-speech taggers, based on a re-implementation of Brill's algorithm in Java.
-
4
Teachmar
Program that helps learning foreign words and phrases
-
Bright Data - All in One Platform for Proxies and Web ScrapingBright Data offers the highest quality proxies with automated session management, IP rotation, and advanced web unlocking technology. Enjoy reliable, fast performance with easy integration, a user-friendly dashboard, and enterprise-grade scaling. Powered by ethically-sourced residential IPs for seamless web scraping.
-
5
NNBrain
A free, open source collection of neural network based AI agents.
NNBrain is a free and open source collection of artificial intelligence agents. These agents have applications in video games, research, business, and more. The included agents function in both discrete and continuous action and state spaces. -
6
Featurama is a library that implements various sequence-labeling algorithms. Currently Michael Collins' averaged perceptron algorithm is fully implemented.
-
7
Yadlr
Yadlr toolset for many-valued inference
Yadlr is a toolset for many-valued inference, both deductive and inductive. It features a fuzzy reasoner, using CLP(Q,R) to implement fuzzy algebra on top of a resolution-based back-end. It also features Prodlr, an ILP system targeted at learning Description Logics and threaded-variable theories, like DCGs. -
8
TexLexAn is an open source text analyser for Linux, able to estimate the readability and reading time, to classify and summarize texts. It has some learning abilities and accepts html, doc, pdf, ppt, odt and txt documents. Written in C and Python.
-
9
cCNN
A fast implementation of LeCun's convolutional neural network
Code of this library is partialy based on myCNN MATLAB class written by Nikolay Chemurin. -
Manage your IT department more effectivelyConnectWise PSA (formerly Manage) allows you to stop working in separate systems, and helps you build a more profitable business. No more duplicate data entries, inefficient employees, manual invoices, and the inability to accurately track client service issues. Get a behind the scenes look into the award-winning PSA that automates processes for each area of business: sales, help desk, support, finance, and HR.
-
10
LTS: Learning to Search
Discriminative subgraph mining by learning from search history
LTS (Learning to Search) is an implementation of an algorithm described in "LTS: Discriminative Subgraph Mining by Learning from Search History" in Data Engineering (ICDE), IEEE 27th International Conference, pages 207-218, 2011. The purpose of LTS is to find discriminative subgraphs, which are smaller graphs that are embedded in larger graphs that all share a certain trait. A discriminative subgraph can help to characterize a complex graph and can be used to classify new graphs with unknown... -
11
A base for programs. Includes algorythms for Q-learning and SOM's etc. too. Examples: Hamron: Simulates evolution, uses the 2D-renderer. DriveUnit: created for school, for a robotic arm, uses the 3D-renderer. Hlearn: http://www.sagenb.org/home/pub/8
-
12
AHANNS
AHANNS - Amateur Homemade Artificial Neural Network Simulator
AHANNS enables the user to create and train artificial neural networks. Training is carried out by an implementation of back propagation learning algorithm. See the documentation for details. This program is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. This program is distributed in the hope... -
13
OpenAIL
Open Artificial Intelligence Library
[Open Artificial Intelligence Library]. This library main goal is to provide a tool box to those who want to use algorithm such as neural network or genetics Algorithm and all algorithms that are commonly within the Artificial Intelligence field. -
14
Reactor Breeder
A Genetic Algorithm for Reactors in StarMade
This software uses a genetic algorithm to "evolve" reactor designs for Schema's space-simulation game, Star-Made (http://star-made.org/). One of the more unique aspects of the game is that ship power management is not as simple as filling a cube with power generation blocks. This mechanism leads to difficulties in getting maximal power generation out of such reactors. This program rectifies this issue by using a self-organizing variant of brute force search. Much of the search space... -
15
cerrla
The CERRLA algorithm, developed by Sam Sarjant
This project contains the files required to run the Cross-Entropy Relational Reinforcement Learning Agent (CERRLA) algorithm. Note that a copy of the JESS rules engine will also be required. -
16
Sentence Composer
Compose the writings semi-automatically
... algorithm" The prefix was "transductive learning" Learning algorithm. Transduction, or transductive inference, tries to predict new outputs on specific and fixed (test) cases from observed, specific (training) cases. The simplest realization for transductive inference is the method of k-nearest neighbors. Learning to learn learns its own inductive bias based on previous experience. ...AND SO ON.... Enjoy the program ! -
17
Averaged N-Dependence Estimators - AnDE
AnDE implements A1DE and A2DE
Averaged N-Dependence Estimators (A1DE and A2DE) achieves highly accurate classification by averaging over all of a small space of alternative naive-Bayes-like models that have weaker (and hence less detrimental) independence assumptions than naive Bayes. The resulting algorithm is computationally efficient while delivering highly accurate classification on many learning tasks. For more information, see, G. Webb, J. Boughton, Z. Wang (2005). Not So Naive Bayes: Aggregating One-Dependence... -
18
NeuralGas
Self-organized learning
A collection of algorithms based on the topology preserving Neural Gas algorithm for density estimation/quantization/clustering/self-organized learning. I moved this project to GitHub: https://github.com/sergioroa/neuralgas -
19
Averaged N-Dependence Estimators (A1DE and A2DE) achieves highly accurate classification by averaging over all of a small space of alternative naive-Bayes-like models that have weaker (and hence less detrimental) independence assumptions than naive Bayes. The resulting algorithm is computationally efficient while delivering highly accurate classification on many learning tasks. For more information, see, G. Webb, J. Boughton, Z. Wang (2005). Not So Naive Bayes: Aggregating One-Dependence...
-
20
CvHMM
Discrete Hidden Markov Models based on OpenCV
This project (CvHMM) is an implementation of discrete Hidden Markov Models (HMM) based on OpenCV. It is simple to understand and simple to use. The Zip file contains one header for the implementation and one main.cpp file for a demonstration of how it works. Hope it becomes useful for your projects. -
21
Machine Learning TicTacToe
TicTacToe with simple machine learning algorithm.
This is a free version of TicTacToe with little intellectual abilities. A very simple Machine Learning stuff. When I say "free", I mean "Free is like in Freedom". Even if Mr. Stallman prefers EMACS, this program was written on Vim. -
22
ListMLE
ListMLE tool and source: A listwise algorithm for learning to rank
An implementation of ListMLE in C++. A listwise algorithm for learning to rank using likelihood loss. Author: Ngo Xuan Bach, School of Information Science, Japan Advanced Institute of Science and Technology -
23
ListNet
ListNet tool and source: A listwise algorithm for learning to rank
An implementation of ListNet in C++. A listwise approach to learning to rank using entropy loss function. Author: Ngo Xuan Bach, School of Information Science, Japan Advanced Institute of Science and Technology -
24
CRFSharp
CRFSharp is a .NET(C#) implementation of Conditional Random Field
CRFSharp(aka CRF#) is a .NET(C#) implementation of Conditional Random Fields, an machine learning algorithm for learning from labeled sequences of examples. It is widely used in Natural Language Process (NLP) tasks, for example: word breaker, postagging, named entity recognized, query chunking and so on. CRF#'s mainly algorithm is the same as CRF++ written by Taku Kudo. It encodes model parameters by L-BFGS. Moreover, it has many significant improvement than CRF++, such as totally parallel... -
25
CRF is a Java implementation of Conditional Random Fields, an algorithm for learning from labeled sequences of examples. It also includes an implementation of Maximum Entropy learning.