I'd like to contribute under the topic graphs by adding new algorithm "FP-graphminer", an implementation of a research paper.
It is a Frequent Pattern Graph Mining algorithm, that compactly represents a set of network graphs as a Frequent Pattern Graph (or FP-Graph).
This graph can be used to efficiently mine frequent subgraphs including maximal frequent subgraphs and maximum common subgraphs.
Sample Application: clustering the customers based on the items purchased.
I'd like to contribute under the topic graphs by adding new algorithm "FP-graphminer", an implementation of a research paper.
It is a Frequent Pattern Graph Mining algorithm, that compactly represents a set of network graphs as a Frequent Pattern Graph (or FP-Graph).
This graph can be used to efficiently mine frequent subgraphs including maximal frequent subgraphs and maximum common subgraphs.
Sample Application: clustering the customers based on the items purchased.