JGRAM is a Java library for Graph-Mining. Graph-Mining is the task of recognizing and extracting interesting patterns from a database of graphs. Graph-Mining differs from data-mining in the sense that data-mining is only concerned with patterns in data values, while graphs are connected and structured-data, and the structure is as important as data-values themself.
Graph-Mining includes many techniques and sub-areas, where implementation of some of the most important algorithms will be provided in this library. The main sub-areas of graph-mining that are targeted in JGRAM are:
- Graph Matching
- Frequent Subgraph Mining
- Graph Clustering
- Graph Kernels
- Graph Learning
JGRAM is based on the Graphs library (a graph library in Java) and can process graph objects from that library, produced by any other program (such as PROGEX). JGRAM can also take graphs as input in several external formats; including:
This is an internal project by members of our lab from Amirkabir University of Technology, as a sub-project of the PhD thesis of Seyed Mohammad Ghaffarian. Seyed Mohammad Ghaffarian is the owner, designer, and main developer of JGRAM.
The development of JGRAM is done using the Netbeans IDE, with an Apache Maven project structure, under the terms of the LGPL-v3.0 license.
Surprisingly, searching the Internet for an open-source graph-mining library in a popular programming-language (such as Java or Python) which includes algorithms of the aforementioned areas (such as subgraph-mining and graph-clustering) had no results! Since graph-mining algorithms were a requirement for the experiments of my PhD thesis, I had no choice but to start creating a suitable graph-mining library by myself.
JGRAM IS STILL IN EARLY DEVELOPMENT STAGE and NOT SUITABLE TO BE USED IN ANY MANNER.
As soon as we publish a usable release, this section will be updated with proper instructions.