FP-GraphMiner-A Fast Frequent Pattern Mining Algorithm for Network Graphs (Q2865059): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
(4 intermediate revisions by 3 users not shown) | |||
Property / describes a project that uses | |||
Property / describes a project that uses: gSpan / rank | |||
Normal rank | |||
Property / describes a project that uses | |||
Property / describes a project that uses: ANF / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.7155/jgaa.00247 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1973815317 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 22:24, 19 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | FP-GraphMiner-A Fast Frequent Pattern Mining Algorithm for Network Graphs |
scientific article |
Statements
FP-GraphMiner-A Fast Frequent Pattern Mining Algorithm for Network Graphs (English)
0 references
28 November 2013
0 references
frequent pattern mining
0 references
frequent subgraph
0 references
graph database
0 references
graph mining
0 references
maximal frequent subgraph
0 references
maximum common subgraph
0 references