Graph Mining Algorithm: Difference between revisions

From GM-RKB
Jump to navigation Jump to search
m (Text replacement - " ↵" to " ")
m (Text replacement - "]]↵↵----↵" to "]]. ---- ")
 
Line 32: Line 32:
=== 1995 ===
=== 1995 ===
* ([[Blum & Furst, 1995]]) ⇒ [[Avrim L. Blum]], and Merrick L. Furst. ([[1995]]). “[http://www.cs.cmu.edu/~avrim/Papers/graphplan.pdf Fast Planning Through Planning Graph Analysis].” In: Proceedings of the 14th International Joint Conference on AI ([[IJCAI 1995]]). [http://dx.doi.org/10.1016/S0004-3702(96)00047-1 doi:10.1016/S0004-3702(96)00047-1]
* ([[Blum & Furst, 1995]]) ⇒ [[Avrim L. Blum]], and Merrick L. Furst. ([[1995]]). “[http://www.cs.cmu.edu/~avrim/Papers/graphplan.pdf Fast Planning Through Planning Graph Analysis].” In: Proceedings of the 14th International Joint Conference on AI ([[IJCAI 1995]]). [http://dx.doi.org/10.1016/S0004-3702(96)00047-1 doi:10.1016/S0004-3702(96)00047-1]
** [[Planning Graph]]
** [[Planning Graph]].


----
----

Latest revision as of 03:51, 8 May 2024

A graph mining algorithm is a relational mining algorithm that can be implemented by a graph mining system to solve a graph mining task.



References

2012

2005

1995