Search Results for "graphs" - Page 4
Sort By:
Showing 103 open source projects for "graphs"
View related business solutions-
Ship Agents FasterGemini Enterprise Agent Platform lets you rapidly build, scale, govern and optimize production-ready agents grounded in your organization's data. The platform enables developers to build custom or pre-built agents for virtually any use case. New customers get $300 in free credits.
-
$300 Free Credits to Build on Google CloudStart your next project with $300 in free Google Cloud credit. Spin up VMs, run containers, query petabytes in BigQuery, or build agents with Gemini Enterprise Agent Platform. Once your credits are used, keep building with 20+ always-free tier products including Compute Engine, Cloud Storage, GKE, and Cloud Run functions. No commitment required—just sign up and start building.
-
1
distribution-is-all-you-need
The basic distribution probability Tutorial for Deep Learning Research
distribution-is-all-you-need is a Python-based probability tutorial aimed at deep learning researchers and students. It explains common discrete and continuous distributions through short scripts, formulas, descriptions, and plotted graphs. Covered topics include uniform, Bernoulli, binomial, categorical, multinomial, beta, Dirichlet, gamma, exponential, Gaussian, normal, chi-squared, and Student's t distributions. The material highlights relationships such as conjugate priors and special-case distributions. Examples connect probability functions with machine learning concepts including binary and multiclass cross-entropy. ... -
2
Zabbix-in-Telegram
Zabbix Notifications with graphs in Telegram
Zabbix Notifications with graphs in Telegram. -
3
TensorFlow Docs
TensorFlow latest official documentation Chinese version
...Contributors from technology companies, universities, and the open-source community collaborate to maintain and update the translations so they stay aligned with new TensorFlow releases. The documentation covers fundamental concepts such as tensors, computational graphs, model training, optimization, and neural network APIs, along with advanced topics including distributed training and production deployment. -
4
SG2Im
Code for "Image Generation from Scene Graphs", Johnson et al, CVPR 201
sg2im is a research codebase that learns to synthesize images from scene graphs—structured descriptions of objects and their relationships. Instead of conditioning on free-form text alone, it leverages graph structure to control layout and interactions, generating scenes that respect constraints like “person left of dog” or “cup on table.” The pipeline typically predicts object layouts (bounding boxes and masks) from the graph, then renders a realistic image conditioned on those layouts. ... -
Our Free Plans just got better! | Auth0You 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 security. Auth0 now, thank yourself later.
-
5
Scikit-plot
An intuitive library to add plotting functionality to scikit-learn
...That said, there are a number of visualizations that frequently pop up in machine learning. Scikit-plot is a humble attempt to provide aesthetically challenged programmers (such as myself) the opportunity to generate quick and beautiful graphs and plots with as little boilerplate as possible. -
6
When to use TensorFlowSharp
TensorFlow API for .NET languages
...The library focuses mainly on providing access to the low-level TensorFlow runtime rather than offering the high-level abstractions commonly available in Python libraries like Keras. This design allows applications written in C# or F# to execute machine learning graphs produced by Python workflows while maintaining compatibility with the TensorFlow runtime. -
7
Prolog+CG is a Java implementation of Prolog with extensions implementing a subset of the Conceptual Graph (CG) theory of John Sowa. CGs are first-class datatypes on a par with terms. Object oriented extensions are also included.
-
8
Edward
A probabilistic programming language in TensorFlow
...Edward fuses three fields, Bayesian statistics and machine learning, deep learning, and probabilistic programming. Edward is built on TensorFlow. It enables features such as computational graphs, distributed training, CPU/GPU integration, automatic differentiation, and visualization with TensorBoard. Expectation-Maximization, pseudo-marginal and ABC methods, and message passing algorithms. -
9
Seldon Server
Machine learning platform and recommendation engine on Kubernetes
...Scale with confidence and minimize risk through interpretable results and transparent model performance. Seldon Core focuses purely on deploying a wide range of ML models on Kubernetes, allowing complex runtime serving graphs to be managed in production. Seldon Core is a progression of the goals of the Seldon-Server project but also a more restricted focus to solving the final step in a machine learning project which is serving models in production. Seldon Server is a machine learning platform that helps your data science team deploy models into production. ... -
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.
-
10
Accord.NET Framework
Scientific computing, machine learning and computer vision for .NET
The Accord.NET Framework provides machine learning, mathematics, statistics, computer vision, computer audition, and several scientific computing related methods and techniques to .NET. The project is compatible with the .NET Framework. NET Standard, .NET Core, and Mono. -
11
An IDE for people interested in Machine Vision/Image Processing. Written in Java, using JAI. It allows users to view image data and also provides a drag and drop environment that users can create/execute graphs of JAI operators.
-
12
The JINSECT toolkit is a Java-based toolkit and library that supports and demonstrates the use of n-gram graphs within Natural Language Processing applications, ranging from summarization and summary evaluation to text classification and indexing.
-
13
Chordalysis
Log-linear analysis (data modelling) for high-dimensional data
...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. ... -
14
Graphical Grammar Studio
An user friendly grammar tool for natural language processing tasks
...Its purpose is for creating NLP tools like phrase chunkers, named entity finders, pronoun co-reference solvers etc. A grammar is represented by a state machine which can be visualized, edited and applied. A grammar is organized in graphs of nodes. Nodes are used for consuming words from the input, for executing jumps to other graphs in the grammar or for creating annotations etc. GGS has a unique feature: It allows the user to write JavaScript code to be executed for nodes of the grammar. This is useful for checking grammatical agreements but not only. The user can: declare variables (including complex js structures), check for boolean conditions, use variables in annotations etc. -
15
Quadriga
Quadruple Network Management System
...Quadriga can use standard graphs to map quadruples onto conventional semantic graphs that can be submitted to a triple store, and used for interactive websites and visualizations. -
16
Graphlet kernel framework
Calculates similarity between neighborhoods of two vertices in a graph
...The list of available similarity functions includes: cumulative random walk, standard random walk, standard graphlet kernel, edit distance graphlet kernel, label substitution graphlet kernel and edge indel graphlet kernel. The graphlet kernel framework can be used for vertex (node) classification in graphs, kernel-based clustering, or community detection. If you use this framework, please cite the following paper: Lugo-Martinez J, Radivojac P. Generalized graphlet kernels for probabilistic inference in sparse graphs. Network Science (2014) 2(2): 254-276. -
17
MSTParser
MSTParser is a non-projective dependency parser that searches for maxi
MSTParser is a non-projective dependency parser that searches for maximum spanning trees over directed graphs. Models of dependency structure are based on large-margin discriminative training methods. Projective parsing is also supported. mstparser 0.5.1 is now available via Maven Central. If you use Maven as your build tool, then you can add it as a dependency in your pom.xml file: <dependency> <groupId>net.sourceforge.mstparser</groupId> <artifactId>mstparser</artifactId> <version>0.5.1</version> </dependency> -
18
...It supports statistical modeling and data analysis along three main directions: (1) probabilistic graphical models (Bayesian networks, Markov random fields, dependency networks, hybrid random fields); (2) parametric, semiparametric, and nonparametric density estimation (Gaussian models, nonparanormal estimators, Parzen windows, Nadaraya-Watson estimator); (3) generative models for random networks (small-world, scale-free, exponential random graphs, Fiedler random fields), subgraph sampling algorithms (random walk, snowball, etc.), and spectral decomposition.
-
19
asdnetworks
Framework used to represents English grammars graphically
Augmented Syntax Diagrams (ASDs) provide a framework to represent grammars of natural languages as directed graphs -- that is, as networks of nodes and edges. Nodes represent instances (or usages) of words and phrase types in a language such as English. -
20
SweetOnionCCG2PTBConverter
A tool that converts CCGBank to PTB
Conversion between different grammar frameworks is of great importance to comparative performance analysis of the parsers developed on them. This tool can convert CCG derivations to PTB trees by using Max Entropy models as well as visualizing the tree graphs. The main technical innovation presented here is the effective conversion method which achieves a F score over 95%. -
21
PhiWeave is a machine learning library for structured prediction via factor graphs. It is part of an ongoing effort to implement and improve on the current state-of-the-art in inference and parameter estimation for graphical models.
-
22
CEGA is a highly extendable layout plugin for Cytoscape based on an Evolutionary Algorithm. In contrast to other layout algorithms, CEGA lets users decide which features are important for the visualization of their graphs.
-
23
Augmented Syntax Diagrams (ASD) provide a way to represent grammars of natural languages as directed graphs
-
24
IReNNS (Indipendent Recurrent Neural Network for Structures) is a recursive self-organizing neural network able to learn scalar functions on graphs. Derived from Cascade-Correlation. Developed by Antonino Trovato at Politecnico di Milano.
-
25
