The Data Mining Forum
This forum is about data mining
, data science
and big data
: algorithms, source code, datasets, implementations, optimizations, etc. You are welcome to post call for papers, data mining job ads, link to source code of data mining algorithms or anything else related to data mining. The forum is hosted by P. Fournier-Viger
. No registration is required to use this forum!
Re: Extend TKG for mining a single large graph?
Date: April 13, 2020 07:36AM
yes i think it is do-able.
There are some subgraph mining algorithms for mining patterns in a single graph that are similar to TKG. You could check such papers:
Bringmann, B. and Nijssen, S., 2008, May. What is frequent in a single graph?. In Pacific-Asia Conference on Knowledge Discovery and Data Mining (pp. 858-863). Springer, Berlin, Heidelberg.
Fiedler, M. and Borgelt, C., 2007, August. Support Computation for Mining Frequent Subgraphs in a Single Graph. In MLG.
Fiedler, M. and Borgelt, C., 2007, October. Subgraph support in a single large graph. In Seventh IEEE International Conference on Data Mining Workshops (ICDMW 2007) (pp. 399-404). IEEE.
Basically, you need to change a little bit how to count the support to deal with a single graph.