Open Source Linux Machine Learning Software - Page 3
Sort By:
Machine Learning Software for Linux
View 57 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.
-
Gemini 3 and 200+ AI Models on One PlatformBuild generative AI apps with Vertex AI. Switch between models without switching platforms.
-
1
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.
-
2
Botnet Detectors Comparer
Compares botnet detection methods
Compares botnet detection methods by computing the error metrics by reading the labels on a NetFlow file. The original NetFlow should have a new column for the ground-truth label, and a new column with the prediction label for each botnet detection method. This program computes all the error metrics (TPR, TNR, FPR, FNR, Precision, Accuracy, ErrorRate, FMeasure1, FMeasure2, FMeasure0.5) and output the comparison results. It also ouputs a png plot. The program can compare in a flow-by-flow basis, or it can apply our new botnet detection error metrics, that is time-based, detects IP addresses instead of flows and it is weighted to favor sooner detections. See the paper for more details. -
3
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. Currently, when training corpus, compared with CRF++, CRF# can make full use of multi-core CPUs and only uses very low memory, and memory grow is very smoothly and slowly while amount of training corpus, tags increase. with multi-threads process, CRF# is more suitable for large data and tags training than CRF++ now. For example, in machine with 64GB, CRF# encodes model with more than 4.5 hundred million features quickly. -
4
CUTLASS
CUDA Templates for Linear Algebra Subroutines
CUTLASS is a collection of CUDA C++ template abstractions for implementing high-performance matrix-multiplication (GEMM) and related computations at all levels and scales within CUDA. It incorporates strategies for hierarchical decomposition and data movement similar to those used to implement cuBLAS and cuDNN. CUTLASS decomposes these "moving parts" into reusable, modular software components abstracted by C++ template classes. These thread-wide, warp-wide, block-wide, and device-wide primitives can be specialized and tuned via custom tiling sizes, data types, and other algorithmic policy. The resulting flexibility simplifies their use as building blocks within custom kernels and applications. To support a wide variety of applications, CUTLASS provides extensive support for mixed-precision computations, providing specialized data-movement and multiply-accumulate abstractions for half-precision floating point (FP16), BFloat16 (BF16), Tensor Float 32 (TF32), etc. -
$300 in Free Credit Towards Top Cloud ServicesStart your project in minutes. After credits run out, 20+ products include free monthly usage. Only pay when you're ready to scale.
-
5
Chordalysis
Log-linear analysis (data modelling) for high-dimensional data
===== Project moved to https://github.com/fpetitjean/Chordalysis ===== Log-linear analysis is the statistical method used to capture multi-way relationships between variables. However, due to its exponential nature, previous approaches did not allow scale-up to more than a dozen variables. We present here Chordalysis, a log-linear analysis method for big data. Chordalysis exploits recent discoveries in graph theory by representing complex models as compositions of triangular structures, also known as chordal graphs. Chordalysis makes it possible to discover the structure of datasets with thousands of variables on a standard desktop computer. Associated papers at ICDM 2013, ICDM 2014 and SDM 2015 can be found at http://www.francois-petitjean.com/Research/ YourKit is supporting Chordalysis open source project with its full-featured Java Profiler. YourKit is the creator of innovative and intelligent tools for profiling Java and .NET applications. http://www.yourkit.com -
6
Cinefile
A category-based approach to exploring film data.
Cinefile is a prototype of a category-based method of database exploration. It allows the user to identify abstract categories of films by providing examples of category members, learns to classify films as belonging or not belonging to those categories, and provides a graphical interface for exploring and comparing categories. Cinefile is designed to work with data retrieved from the Internet Movie Database (imdb.com). This data is used for classification and is the subject of the category-based analysis. Cinefile was developed by the University of Mary Washington's Computer Science department (http://cas.umw.edu/computerscience). -
7
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, Physical Review E, 74(3):036104, 2006. [3] B. Ball et al, An efficient and principled method for detecting communities in networks, 2011. The suite is based upon the fast community algorithm implemented by Aaron Clauset <aaron@cs.unm.edu>, Chris Moore, Mark Newman, and the R IGraph library Copyright (C) 2007 Gabor Csardi <csardi@rmki.kfki.hu>. It also makes of the classes available from Numerical Recipies 3rd Edition W. Press, S. Teukolsky, W. Vetterling, B. Flanne -
8
Conscious Artificial Intelligence
It's possible for machines to become self-aware.
This project is a quest for conscious artificial intelligence. A number of prototypes will be developed as the project progresses. This project has 2 subprojects: Object Pascal based CAI NEURAL API - https://github.com/joaopauloschuler/neural-api Python based K-CAI NEURAL API - https://github.com/joaopauloschuler/k-neural-api A video from the first prototype has been made: http://www.youtube.com/watch?v=qH-IQgYy9zg Above video shows a popperian agent collecting mining ore from 3 mining sites and bringing to the base. At the time the agent is born, it doesn't know how to walk nor it knows that it feels pleasure by mining. He has tact only (blind agent). The video shows learning, planning, executing and plan optimization. -
9
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. -
Full-stack observability with actually useful AI | Grafana CloudBuilt on open standards like Prometheus and OpenTelemetry, Grafana Cloud includes Kubernetes Monitoring, Application Observability, Incident Response, plus the AI-powered Grafana Assistant. Get started with our generous free tier today.
-
10
DHAC distribution
DHAC distribution version
DHAC distribution -
11
Delayed Response Network
Neural network based on signal delays.
An artificial neural network, currently specialized to save a specific bit pattern, mainly by changing the signal propagation delays in links. More features, variables and algorithms will be added in time. -
12
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 densities that would otherwise impossible had the same algorithm been applied to the unscaled dataset. Reference: Zhu, Y., Ting, K. M., & Carman, M. J. (2016). Density-ratio based clustering for discovering clusters with varying densities. Pattern Recognition. http://www.sciencedirect.com/science/article/pii/S0031320316301571 -
13
DocCO
Non-disjoint groupping of Documents based on word sequence approach
This is a GUI for learning non disjoint groups of documents based on Weka machine learning framework. It offers the possibility to make non disjoint clustering of documents using both vectorial and sequential representation (word sequence approach based on WSK kernel). All data format supported by WEKA could be used in DocCO. Data could be loaded from files, from databases or from specified URL. All the preprocessing techniques implemented in WEKA could be used before performing the learning. -
14
Drug Extraction
Drug name extraction
Drug name recognition and normalisation/grounding to DrugBank ids and standard names. Package provides 2 taggers: 1. DrugTagger - CRF-based with DrugBank presence feature (see feature set for details). 2. DrugnameGazetteer - gazetteer/dictionary-based. Dictionary created from DrugBank.ca database. Both taggers include grounding/normalisation to DrugBank ids and standard names. Feature set: Word, Word-1, Word+1, Word-1_Word, Word_Word+1, DrugBankPresence, POS DrugBankPresence feature indicates the presence of the drug name in the DrugBank. Using CONLL-Evaluation: processed 32065 tokens with 3656 phrases; found: 3251 phrases; correct: 2786. accuracy: 95.25%; precision: 85.70%; recall: 76.20%; FB1: 80.67 Using GATE Corpus Benchmark: Strict: P: 0.65 R: 0.73 F1: 0.69 Lenient: P: 0.74 R: 0.84 F1: 0.78 The details of how to reproduce evaluation, see README. To use standalone version for tagging download DrugExtractionStandalone.tar.gz from Files. -
15
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. The Demo 6 version of eLCS is most similar to the UCS algorithm. Each version only includes the minimum code needed to perform the functions they were designed for. This way users can start by examining the simplest version of the code and progress forward. This code is intended to be used as an educational tool, or as algorithmic code building blocks. -
16
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 to address problems in epidemiological data mining to identify complex patterns relating predictive attributes in noisy datasets to disease phenotypes of interest. ExSTraCS combines a number of recent advancements into a single algorithmic platform. It can flexibly handle (1) discrete or continuous attributes, (2) missing data, (3) balanced or imbalanced datasets, and (4) binary or many classes. A complete users guide for ExSTraCS is included. Coded in Python 2.7. -
17
FPF_predict
Fine Particle Fraction (FPF) predictor
Application implements models described by classical mathematical equation for in vitro deposition prediction based on characteristics of formulation and assay conditions. This work was funded by Poland-Singapore bilateral cooperation project no 2/3/POL-SIN/2012. Published article: https://www.dovepress.com/empirical-modeling-of-the-fine-particle-fraction-fornbspcarrier-based--peer-reviewed-fulltext-article-IJN -
18
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. -
19
Faum
Fast Autonomous Unsupervised Multidimiensional Classification
This is the proof-of-concept implementation of the FAUM Clustering method. This implementation was used to perform the published results and is now released in the hope that it will be useful. -
20
Feating constructs a classification ensemble comprising a set of local models. It is effective at reducing the error of both stable and unstable learners, including SVM. For details see the paper at http://dx.doi.org/10.1007/s10994-010-5224-5.
-
21
FineSplice
Enhanced splice junction detection and estimation from RNA-Seq data
FineSplice is a Python wrapper to TopHat2 geared towards a reliable identification of expressed exon junctions from RNA-Seq data, at enhanced detection precision with small loss in sensitivity. Following alignment with TopHat2 using known transcript annotations, FineSplice takes as input the resulting BAM file and outputs a confident set of expressed splice junctions with the corresponding read counts. Potential false positives arising from spurious alignments are filtered out via a semi-supervised anomaly detection strategy based on logistic regression. Multiple mapping reads with a unique location after filtering are rescued and reallocated to the most reliable candidate location. FineSplice requires Python 2.x (>= 2.6) with the following modules installed: pysam (http://code.google.com/p/pysam/) and scikit-learn (http://scikit-learn.org/). For further details check out our publication: Nucl. Acids Res. (2014) doi: 10.1093/nar/gku166 -
22
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-of-the-art minutiae-based system when the performance requirement of the application system does not demand a very low false acceptance rate. Finally, we show that the matching performance can be improved by combining the decisions of the matchers based on complementary (minutiae-based and filter-based) fingerprint information. Index Terms: Biometrics, FingerCode, fingerprints, flow pattern, Gabor filters, matching, texture, verification. -
23
A graphical MatLab framework for estimating the parameters of, modeling and simulating static and dynamic linear and polynomial systems in the errors-in-variables context with the intent of comparing various estimation strategies.
-
24
A system that shall predict good days and locations for cross country free flying such as paragliding by comparing current weather predictions with statistics about past weather predictions and flights from online contests.
-
25
Fuzzy Ecospace Modelling
FEM allows users to create fuzzy functional groups for use in ecology.
Fuzzy Ecospace Modelling (FEM) is an R-based program for quantifying and comparing functional disparity, using a fuzzy set theory-based machine learning approach. FEM clusters n-dimensional matrices of functional traits (ecospace matrices – here called the Training Matrix) into functional groups and converts them into fuzzy functional groups using fuzzy discriminant analysis (Lin and Chen 2004 – see main text for more information). Following this, FEM classifies the functional entities from a second matrix (the Test Matrix) into the groups made using the Training Matrix, generating fuzzy membership values for each unit in the Test Matrix. These values are real numbers from 0 to 1, representing increasing degrees of “truth” regarding an organism’s membership in the fuzzy set (see main text). A value of 0 represents non-membership in the fuzzy set, and a value of 1 represents total membership in the fuzzy set. Values in between represent degrees of niche overlap.
