Search Results for "graph" - Page 5
Sort By:
Showing 136 open source projects for "graph"
View related business solutions-
Atera all-in-one platform IT management software with AI agentsAtera’s AI agents don’t just assist, they act. From detection to resolution, they handle incidents and requests instantly, taking your IT management from automated to autonomous.
-
Retool your internal operationsBuild internal software that meets enterprise security standards without waiting on engineering resources. Retool connects to your databases, APIs, and data sources while maintaining the permissions and controls you need. Create custom dashboards, admin tools, and workflows from natural language prompts—all deployed in your cloud with security baked in. Stop duct-taping operations together, start building in Retool.
-
1
SLING
A natural language frame semantics parser
...We do not yet have a full system that can extract facts from arbitrary text, but we have built a number of the subsystems needed for such a system. The SLING frame store is our basic framework for building and manipulating frame semantic graph structures. The Wiki flow pipeline can take a raw dump of Wikidata and convert this into one big frame graph. -
2
Easy Machine Learning
Easy Machine Learning is a general-purpose dataflow-based system
...Our platform Easy Machine Learning presents a general-purpose dataflow-based system for easing the process of applying machine learning algorithms to real-world tasks. In the system, a learning task is formulated as a directed acyclic graph (DAG) in which each node represents an operation (e.g. a machine learning algorithm), and each edge represents the flow of the data from one node to its descendants. -
3
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.
-
4
popt4jlib
Parallel Optimization Library for Java
...Implements a number of meta-heuristic algorithms for Non-Linear Programming, including Genetic Algorithms, Differential Evolution, Evolutionary Algorithms, Simulated Annealing, Particle Swarm Optimization, Firefly Algorithm, Monte-Carlo Search, Local Search algorithms, Gradient-Descent-based algorithms, as well as some well-known network flow and other graph algorithms. A fast parallel implementation of the network simplex method, and some full-fledged parallel/distributed MIP solvers will be added in the next version. In general, emphasis is given in improving the efficiency of the algorithms in shared-memory models via java threads, since multi-core machines are so wide-spread today. -
Grafana: The open and composable observability platformGrafana is the open source analytics & monitoring solution for every database.
-
5
PyTorch Book
PyTorch tutorials and fun projects including neural talk
This is the corresponding code for the book "The Deep Learning Framework PyTorch: Getting Started and Practical", but it can also be used as a standalone PyTorch Getting Started Guide and Tutorial. The current version of the code is based on pytorch 1.0.1, if you want to use an older version please git checkout v0.4or git checkout v0.3. Legacy code has better python2/python3 compatibility, CPU/GPU compatibility test. The new version of the code has not been fully tested, it has been tested... -
6
Tangent
Source-to-source debuggable derivatives in pure Python
Existing libraries implement automatic differentiation by tracing a program's execution (at runtime, like PyTorch) or by staging out a dynamic data-flow graph and then differentiating the graph (ahead-of-time, like TensorFlow). In contrast, Tangent performs ahead-of-time autodiff on the Python source code itself, and produces Python source code as its output. Tangent fills a unique location in the space of machine learning tools. As a result, you can finally read your automatic derivative code just like the rest of your program. ... -
7
The Cogitant library is a set of C++ classes enabling to easily build applications based on the Conceptual Graph model.
-
8
This project aims to develop and share fast frequent subgraph mining and graph learning algorithms. Currently we release the frequent subgraph mining package FFSM and later we will include new functions for graph regression and classification package
-
9
graphnet
AI project using a graph technique on written text.
Experiments using a data sequencing technique on English language sentences. -
A Fit-for-Purpose Stakeholder Management Software SolutionOur Stakeholder Engagement Software gives you the tools you need to build more effective engagement plans, improve relationships with stakeholders and align processes with industry best practices. It provides a single platform for managing all stakeholder engagement activities with additional modules to strengthen all areas of environment, social and governance. The Stakeholder Engagement module centralizes all stakeholder data and keeps it right at your fingertips to simplify day-to-day tasks.
-
10
Chordalysis
Log-linear analysis (data modelling) for high-dimensional data
...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. ... -
11
Java implementation of Fuzzy Cognitive Maps (FCM). Implementation aims to be: small (and fast), simple to use, flexible enough to be used as a basis for other projects / libraries.
-
12
cosd_java
A Tool for Searching and Demonstrating Code Structure
CoSD is a tool for searching and demonstrating code structure based on graph database. Since some commercial code is involved in the industrial version of CoSD , we just give out a baseline version of it. We also provide a quick demo for this baseline version. To use CoSD, please read the file readme.txt at first. -
13
Agent.GUI
The Project moved to github https://github.com/EnFlexIT/AgentWorkbench
The project has moved to github https://github.com/EnFlexIT/AgentWorkbench Agent.GUI is a simulation framework and toolkit based on the JADE framework. It provides functionalities for time aspects, agent-environment interaction, visualization and load balancing, Furthermore, the included application focuses the usability for end users. -
14
The MaxParser is written in c++ and can parse with first, second, third and fourth order projective Graph-based Dependency parsing algorithm. The project is the new version of the project "Max-MSTParser". If you want to use this software for research, please reference this web address in your papers
-
15
Graphlet kernel framework
Calculates similarity between neighborhoods of two vertices in a graph
This software package provides a framework for calculating similarity between neighborhoods rooted at two vertices of interest in a labeled graph (undirected or directed). 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. ... -
16
This project develops a simple, fast and easy to use Python graph library using NumPy, Scipy and PySparse.
-
17
IsaPlanner is a collection of reasoning tools: a proof planner for Isabelle, implementing a Rippling based inductive theorem prover; theory synthesis tools for Isabelle; an open-graph based tool for reasoning about quantum information (quantomatic);
-
18
...Calvo (2012) “Using Information Extraction to Generate Trigger Question for Academic Writing Support”, 11th International Conference on Intelligent Tutoring Systems, Crete, Springer LNCS 7315, p.360-369. 2.Ming Liu, Rafael A. Calvo, Anindito Aditomo and Luiz Augusto Pizzato (2012), “Using Wikipedia and Conceptual Graph Structures to Generate Questions for Academic Writing Support”, IEEE Transactions on Learning Technologies, vol. 5, no. 3, pp. 251-263.
-
19
Asteroid
A CBLS Engine in SCALA, NOW part of OscaR
Asteroid has been merged with Scampi, to give rise to OScar. Follow us on https://bitbucket.org/oscarlib/oscar/wiki/Home Asteroid offers a powerful framework for developing constraint-based local search solution to combinatorial problems. This technique provides good scalability to real-world problems. It includes a library of standard constraints and invariants to declaratively define the problem you want to solve, and it also provides powerful search mechanisms. -
20
NaruGo is game AI project. Current targets are GO board game and Texas Holdem poker. It investigates Genetic programming to build game AI logic. Also EA/GP simulations for TSP, Graph layout and Prisoners Dilemma problem.
-
21
The E* algorithm is a path planner for (mobile) robotics. Unlike A*, which constrains movements to graph edges, it produces smooth trajectories by interpolating between edges. Like D*, it supports dynamic replanning after local path cost changes.
-
22
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.
-
23
Wikipedia Concept Association Map (WCAM) is new approach for textual knowledge representation and understanding. All concepts and associations are stored in a graph database for better performance and easy distribution.
-
24
Game Toolbox is a C# assembly designed to facilitate the creation of games and game prototypes. It contains no graphics code, does not depend on XNA, and is Mono-compatible. It provides implementations of A*, GOAP, a genetic algorithm, and more.
-
25
Multi-Partite Community Detection - community detection (aka graph clustering) in k-partite k-uniform hypergraphs
