Search Results for "q learning algorithm" - Page 8
Sort By:
Showing 305 open source projects for "q learning algorithm"
View related business solutions-
$300 Free Credits for Your Google Cloud ProjectsLaunch your next project with $300 in free Google Cloud credits—no strings attached. Test, build, and deploy without risk. Use your credits across the entire Google Cloud platform to find what works best for your needs. After your credits are used, continue with always-free tier services. Only pay when you're ready to scale. Sign up in minutes and start exploring.
-
Stop vibe-debugging.AppSignal's MCP server hands Claude, Cursor, or Zed your real errors, traces, and the deploy that shipped them. AI writes the fix; you review the diff.
-
1
MatlabFunc
Matlab codes for feature learning
MatlabFunc is a collection of MATLAB functions developed by the ZJULearning group to support various tasks in computer vision, machine learning, and numerical computation. The repository brings together a wide range of utility scripts, algorithms, and implementations that serve as building blocks for research and development. These functions cover areas such as matrix operations, optimization, data processing, and visualization, making them broadly applicable across different research... -
2
JCSprout
Basic, concurrent algorithm
JCSprout is a curated learning path for Java engineers that mixes concise notes, diagrams, and runnable examples to cover core computer science and JVM topics. It walks readers through data structures and algorithms, networking fundamentals, Java concurrency, JVM memory model and GC, and common interview problem patterns. The repository emphasizes understanding over memorization, linking conceptual summaries with small code artifacts that can be compiled and profiled. It also highlights best... -
3
Clustering by Shared Subspaces
Grouping Points by Shared Subspaces for Effective Subspace Clustering
These functions implement a subspace clustering algorithm, proposed by Ye Zhu, Kai Ming Ting, and Mark J. Carman: "Grouping Points by Shared Subspaces for Effective Subspace Clustering", Published in Pattern Recognition Journal at https://doi.org/10.1016/j.patcog.2018.05.027 -
4
Universe Starter Agent
A starter agent that can solve a number of universe environments
The universe-starter-agent repository is an archived OpenAI codebase designed as a starter reinforcement-learning agent that can interact with and solve tasks in OpenAI’s Universe environment platform. Its purpose is to serve as a baseline or reference implementation so researchers or developers can see how to build agents that operate in real-time, visual environments (e.g., games, browser apps) via pixel observations and keyboard/mouse actions. -
MongoDB Atlas runs apps anywhereMongoDB Atlas gives you the freedom to build and run modern applications anywhere—across AWS, Azure, and Google Cloud. With global availability in over 115 regions, Atlas lets you deploy close to your users, meet compliance needs, and scale with confidence across any geography.
-
5
The Teachingbox uses advanced machine learning techniques to relieve developers from the programming of hand-crafted sophisticated behaviors of autonomous agents (such as robots, game players etc...) In the current status we have implemented a well founded reinforcement learning core in Java with many popular usecases, environments, policies and learners. Obtaining the teachingbox: FOR USERS: If you want to download the latest releases, please visit:...
-
6
TextTeaser
TextTeaser is an automatic summarization algorithm
textteaser is an automatic text summarization algorithm implemented in Python. It extracts the most important sentences from an article to generate concise summaries that retain the core meaning of the original text. The algorithm uses features such as sentence length, keyword frequency, and position within the document to determine which sentences are most relevant. By combining these features with a simple scoring mechanism, it produces summaries that are both readable and informative. ... -
7
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 categories in between, then the other points act as a barrier and the prototype will not find its optimum position during training. ... -
8
AI learning
AiLearning, data analysis plus machine learning practice
We actively respond to the Research Open Source Initiative (DOCX) . Open source today is not just open source, but datasets, models, tutorials, and experimental records. We are also exploring other categories of open source solutions and protocols. I hope you will understand this initiative, combine this initiative with your own interests, and do what you can. Everyone's tiny contributions, together, are the entire open source ecosystem. We are iBooker, a large open-source community,... -
9
Asedio
RTS game for learning Algorithm Design
-
Stop Storing Third-Party Tokens in Your DatabaseRolling your own OAuth token storage can be a security liability. Token Vault securely stores access and refresh tokens from federated providers and handles exchange and renewal automatically. Connected accounts, refresh exchange, and privileged worker flows included.
-
10
Machine-Learning-Flappy-Bird
Machine Learning for Flappy Bird using Neural Network
Machine-Learning-Flappy-Bird is an educational machine learning project that demonstrates how an artificial intelligence agent can learn to play the Flappy Bird game using neural networks and evolutionary algorithms. The system simulates a population of birds that each possess their own neural network, which acts as a decision-making controller during gameplay. -
11
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,... -
12
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. -
13
Machine Learning:Perceptron
Minimal version of the perceptron algorithm.Coded the simpler way.
A minimal version of the perceptron algorithm is implemented in C#. Coded for ease of understanding the referred to algorithm. Enter your info-press the learn button-then type in new info which the program will try and recognnise. There are some typos in the text displayed-but the code is correct. -
14
DMTK
Microsoft Distributed Machine Learning Toolkit
The Microsoft Distributed Machine Learning Toolkit (DMTK) is an open-source framework created to support scalable machine learning across distributed computing environments. Developed by Microsoft Research, the toolkit provides infrastructure and algorithms designed to train large models efficiently on clusters of machines rather than a single system. At its core is a parameter-server architecture called Multiverso, which manages model parameters and synchronizes updates across distributed... -
15
Bolt ML
10x faster matrix and vector operations
Bolt is an open-source research project focused on accelerating machine learning and data mining workloads through efficient vector compression and approximate computation techniques. The core idea behind Bolt is to compress large collections of dense numeric vectors and perform mathematical operations directly on the compressed representations instead of decompressing them first. This approach significantly reduces both memory usage and computational overhead when working with... -
16
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... -
17
node2vec
Learn continuous vector embeddings for nodes in a graph using biased R
The node2vec project provides an implementation of the node2vec algorithm, a scalable feature learning method for networks. The algorithm is designed to learn continuous vector representations of nodes in a graph by simulating biased random walks and applying skip-gram models from natural language processing. These embeddings capture community structure as well as structural equivalence, enabling machine learning on graphs for tasks such as classification, clustering, and link prediction. ... -
18
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. -
19
Random Bits Forest
RBF: a Strong Classifier/Regressor for Big Data
We present a classification and regression algorithm called Random Bits Forest (RBF). RBF integrates neural network (for depth), boosting (for wideness) and random forest (for accuracy). It first generates and selects ~10,000 small three-layer threshold random neural networks as basis by gradient boosting scheme. These binary basis are then feed into a modified random forest algorithm to obtain predictions. In conclusion, RBF is a novel framework that performs strongly especially on data... -
20
Algorithms in Python
Data Structures and Algorithms in Python
...Because it’s openly maintained, you can browse through issues, see test cases, and observe coding style in a “learning through code” fashion. It also serves as a playground where you can add problems, measure performance, and compare different algorithmic approaches. For anyone striving to move from “I know the syntax” to “I know how to use the right algorithm at the right time,” this repository is a practical asset. -
21
...PAVT can visualize six parsing algorithms, viz. predictive parsing, simple LR parsing, canonical LR parsing, look-ahead LR parsing, Earley parsing and CYK parsing. PAVT logically explains the process of parsing showing the calculations involved in each step. The output of PAVT has been structured to maximize the learning outcomes and contains important constructs like FIRST and FOLLOW sets, item sets, parsing table, parse tree and leftmost or rightmost derivation depending on the algorithm being visualized. For instructions to use, see readme.txt.
-
22
ingap-cdg
codon-based de Bruijn graph algorithm for gene construction
...However, these methods are of limited application due to highly fragmented transcripts and extensive assembly errors, which may lead to redundant or false CDS predictions. Here we present a novel algorithm, inGAP-CDG, for effective construction of full-length and non-redundant CDSs from unassembled transcriptomes. inGAP-CDG achieves this by combining a newly developed codon-based de bruijn graph to simplify the assembly process and a machine learning based approach to filter false positives. Compared with other methods, inGAP-CDG exhibits significantly increased predicted CDS length and robustness to sequencing errors and varied read length. -
23
go-best-practice
Trying to complete over 100 projects in various categories in golang
go-best-practice is essentially a Go book and code collection called “Go 实战开发” (“Go in Practice”), born from the idea of building over 100 practical projects in different categories using Go. It combines an ebook/zh directory with written chapters and a src directory that holds the corresponding source code, so readers can move seamlessly between theory and practice. The goal is to help developers go beyond basic syntax and actually build real applications, drawing inspiration from similar... -
24
-
25
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...
