Search Results for "algorithm" - Page 5
Sort By:
Showing 124 open source projects for "algorithm"
View related business solutions-
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.
-
Fully Managed MySQL, PostgreSQL, and SQL ServerCloud SQL handles your database ops end to end, so you can focus on your app.
-
1
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 algorithm in order to illustrate how work, how they are coded, and what impact they have on how an LCS algorithm runs. ... -
2
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 dependencies amongst random variables. ... -
3
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 and Pattern Recognition, 2012. This source code is provided without warranty and is available under the GPL license. ... -
4
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.
-
$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.
-
5
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. -
6
Clever Algorithms
Clever Algorithms: Nature-Inspired Programming Recipes
...Example implementations and worked problems show how to encode solutions, define fitness, and balance exploration with exploitation. The emphasis is on pragmatism—enough theory to understand why an algorithm works, and enough detail to get it running in your environment. It’s a useful starting point for students and practitioners who want to prototype, benchmark, or hybridize algorithms without digging through scattered academic papers. -
7
DiffGen
Differentially-private algorithm based on Generalization
...All the existing solutions that ensure epsilon-differential privacy handle the problem of disclosing relational and set-valued data in a privacy preserving manner separately. We developed an algorithm that considers both relational and set-valued data in differentially private disclosure of healthcare data. -
8
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. -
9
Pronac MediaMonkey Extension
Recommends music based upon your current taste.
...Play the first song from the Now Playing list, it'll recommend you next songs from the same list. NOTE: MAKE SURE THAT SONG SHUFFLE IS TURNED OFF WHILE USING PRONAC. Based upon K-Nearest Neighbor Machine Learning Algorithm, K-Fold Cross Validation and EchoNest for audio features. -
Train ML Models With SQL You Already KnowBuild and deploy ML models using familiar SQL. Automate data prep with built-in Gemini. Query 1 TB and store 10 GB free monthly.
-
10
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 encoding, optimizing memory usage and so on. ... -
11
Stanford Machine Learning Course
machine learning course programming exercise
...The repository covers a broad set of topics such as linear regression, logistic regression, neural networks, clustering, support vector machines, and recommender systems. Each folder corresponds to a specific algorithm or concept, making it easy for learners to navigate and practice. The exercises serve as practical, hands-on reinforcement of theoretical concepts taught in the course. This collection is valuable for students and practitioners who want to strengthen their skills in machine learning through coding exercises. -
12
BIL++ is a set of standalone C++ packages for data processing in Bioinformatics (Graph mining, Bayesian networks, Genetic algorithm, Discretization, Gene expression data analysis, Hypothesis testing).
-
13
Leark is a Data Mining library developed in C#.NET. It contains several methods for ranking web documents described with a set of normalized features, and a feature selection algorithm. The methods are based on perceptron and clustering.
-
14
This project applies an interpretation of a k-NN algorithm to a library of GPS commuter data for speed prediction. The overall goal is to lay the foundation for a power management protocol for use in electric vehicles with hybrid energy storage.
-
15
BorderFlow implements a general-purpose graph clustering algorithm. It maximizes the inner to outer flow ratio from the border of each cluster to the rest of the graph.
-
16
Optex Analyzer is a software to analyze and compare algorithms to solve approximately optimization problems. It has a GUI that allows select a set of input files containing raw algorithm results. The analysis is shown with tables and charts.
-
17
weka outlier is an implementation of outlier detection algorithms for WEKA. CODB (Class Outliers: Distance-Based) Algorithm is the first algorithm developed using WEKA framework.
-
18
Maui is a multi-purpose automatic topic indexing algorithm. Given a document, Maui automatically identifies its topics. Depending on the task topics are tags, keywords, keyphrases, vocabulary terms, descriptors or Wikipedia titles.
-
19
Very basic cellular automaton implementation in C#. Based upon the "Togetherness" algorithm described at http://www.hermetic.ch/pca/tg.htm.
-
20
This is implementation of parallel genetic algorithm with "ring" insular topology. Algorithm provides a dynamic choice of genetic operators in the evolution of. The library supports the 26 genetic operators. This is cross-platform GA written in С++.
-
21
Linear Time Invariant (LTI) system identification using particle swarm optimization (PSO) algorithm. Creators : Vahid Kiani, Hadi Sadoghi Yazdi
-
22
This is C++ application code that implements Gene Expression Programming, or GEP - a form of genetic algorithm.
-
23
TrimGA is a lightweight genetic algorithm library written in pure Java 6.0 that can be quickly applied to most optimization problems.
-
24
