Implement Frequent Subgraph Mining

neo4j-contrib / neo4j-graph-algorithms

Efficient Graph Algorithms for Neo4j

https://github.com/neo4j/graph-data-science/

GNU General Public License v3.0

771 stars 194 forks source link

Implement Frequent Subgraph Mining #487

Open jexp opened 6 years ago

jexp commented 6 years ago

Identify recurring graph pattern structures

We can take some ideas from ParseMIS Their HPGraph has similarities to our Graph interface, and then we should be able to transfer the algorithms used.

graphadvantage commented 6 years ago

would be good for fraud detection - eg the canonical subgraph pattern, and then prob scored variation from the canonical pattern for all detected subgraphs

MarcianoAvihay commented 6 years ago

Hi , is anyone actively working on this ?

mneedham commented 6 years ago

@MarcianoAvihay noone is working on this one at the moment. If you wanted to have a go at it and create a PR we'd be happy to review/accept it.