Search Results for "graphs"
Sort By:
Showing 21 open source projects for "graphs"
View related business solutions-
Veeam Data Platform v13.1 - Get Your Free TrialTry Veeam Data Platform today. Experience the unified platform that's secure by design, portable by default, and proven to recover clean, fast, and anywhere.
-
Build Agents and Models on One PlatformGemini Enterprise Agent Platform is Google Cloud's comprehensive platform for developers to build, scale, govern, and optimize agents and models. Choose from Google's most advanced models and third-party models like Anthropic's Claude Model Family.
-
1
CodeLocator
Android toolset that includes the Android SDK and Android Studio
...By giving a UI or structured navigation interface (depending on platform integration) over the project’s code and metadata, CodeLocator helps developers find where particular functions, classes or resources are used, and see their call graphs or dependency chains. This becomes particularly valuable in large-scale Android projects, legacy codebases, or when dealing with complicated modular architectures. -
2
UnBBayes
Framework & GUI for Bayes Nets and other probabilistic models.
UnBBayes is a probabilistic network framework written in Java. It has both a GUI and an API with inference, sampling, learning and evaluation. It supports Bayesian networks, influence diagrams, MSBN, OOBN, HBN, MEBN/PR-OWL, PRM, structure, parameter and incremental learning. Please, visit our wiki (https://sourceforge.net/p/unbbayes/wiki/Home/) for more information. Check out the license section (https://sourceforge.net/p/unbbayes/wiki/License/) for our licensing policy. -
3
AminePlatform
Amine is a Multi-Layer Platform for the dev. of Intelligent Systems
...Amine provides two languages: PROLOG+CG which extends PROLOG with CG and Amine modules, and SYNERGY which is a visual activation/propagation based language. CGs are considered by SYNERGY as activable/executable graphs. See for more detail: //amine-platform.sourceforge.net/ -
4
Java generic API for search algorithms on graphs implicitly given by tree node expansion operator
-
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.
-
5
Provides a GUI interface to grammatical structure and relations (as parsed by the Stanford Parser) of any text.Contains grammatical relation editor to modify, import, export grammatical relation definitions (tregex patterns and features).
-
6
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.
-
7
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. ... -
8
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.
-
9
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.
-
$300 Free Credits to Build on Google CloudPut your $300 in credit toward real workloads, then keep building with free monthly usage for 20+ products. No commitment and no charge until you upgrade.
-
10
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. ... -
11
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. -
12
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. -
13
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> -
14
...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.
-
15
Ms. Pac-Man Framework
Using reinforcement learning with relative input to train Ms. Pac-Man
This Java-application contains all required components to simulate a game of Ms. Pac-Man and let an agent learn intelligent playing behaviour using reinforcement learning and either Q-Learning or SARSA. The framework was developed by Luuk Bom and Ruud Henken, under supervision of Marco Wiering, Department of Artificial Intelligence, University of Groningen. It formed the basis of a bachelor's thesis titled "Using reinforcement learning with relative input to train Ms. Pac-Man", L.A.M. Bom (2012). -
16
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. -
17
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%. -
18
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.
-
19
-
20
Augmented Syntax Diagrams (ASD) provide a way to represent grammars of natural languages as directed graphs
-
21
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.
- Previous
- You're on page 1
- Next
