Support Computation for Mining Frequent Subgraphs in a Single Graph.
作者： Christian Borgelt , Mathias Fiedler
DOI:
关键词: Computation 、 Combinatorics 、 Discrete mathematics 、 Complement graph 、 Graph 、 Simplex graph 、 Computer science
摘要: Defining the support (or frequency) of a subgraph is trivial when database graphs given: it simply number in that contain subgraph. However, if input one large graph, surprisingly difficult to find an appropriate definition. In this paper we study core problem, namely overlapping embeddings subgraph, detail and suggest definition relies on non-existence equivalent ancestor order guarantee resulting anti-monotone. We prove property describe method compute defined way.
researchgate.net 参考文章(12)
George Karypis, Michihiro Kuramochi, Finding frequent patterns in a large sparse graph siam international conference on data mining. pp. 345- 356 ,(2004)
Paul Finn, Stephen Muggleton, David Page, Ashwin Srinivasan, None, Pharmacophore Discovery Using the Inductive Logic Programming System PROGOL Machine Learning. ,vol. 30, pp. 241- 270 ,(1998) , 10.1023/A:1007460424845
Siegfried Nijssen, Joost N. Kok, A quickstart in frequent structure mining can make a difference knowledge discovery and data mining. pp. 647- 652 ,(2004) , 10.1145/1014052.1014134
Stefan Kramer, Luc De Raedt, Christoph Helma, Molecular feature mining in HIV data knowledge discovery and data mining. pp. 136- 143 ,(2001) , 10.1145/502512.502533
D.J. Cook, L.B. Holder, Graph-based data mining IEEE Intelligent Systems & Their Applications. ,vol. 15, pp. 32- 41 ,(2000) , 10.1109/5254.850825
Xifeng Yan, Jiawei Han, CloseGraph: mining closed frequent graph patterns knowledge discovery and data mining. pp. 286- 295 ,(2003) , 10.1145/956750.956784
J. Huan, W. Wang, J. Prins, Efficient mining of frequent subgraphs in the presence of isomorphism international conference on data mining. pp. 549- 552 ,(2003) , 10.1109/ICDM.2003.1250974
C. Borgelt, M.R. Berthold, Mining molecular fragments: finding relevant substructures of molecules international conference on data mining. pp. 51- 58 ,(2002) , 10.1109/ICDM.2002.1183885
Christian Borgelt, Canonical Forms for Frequent Graph Mining GfKl. pp. 337- 349 ,(2007) , 10.1007/978-3-540-70981-7_38
M. Kuramochi, G. Karypis, Frequent subgraph discovery international conference on data mining. pp. 313- 320 ,(2001) , 10.1109/ICDM.2001.989534