Abstract
The standard, transactional setting of pattern mining assumes that data is subdivided in transactions; the aim is to find patterns that can be mapped onto at least a minimum number of transactions. However, this setting can be hard to apply when the aim is to find graph patterns in databases consisting of large graphs. For instance, the web, or any social network, is a single large graph that one may not wish to split into small parts. The focus in network analysis is on finding structural regularities or anomalies in one network, rather than finding structural regularities common to a set of them. This requires us to revise the definition of key concepts in pattern mining, such as support, in the single-graph setting. Our contribution is a support measure that we prove to be computationally less expensive and often closer to intuition than other measures proposed. Further we prove several properties between these measures and experimentally validate the efficiency of our measure.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Agrawal, R., Mannila, H., Srikant, R., Toivonen, H., Verkamo, A.I.: Fast discovery of association rules. In: Advances in Knowledge Discovery and Data Mining, pp. 307–328. AAAI/MIT Press (1996)
Bringmann, B., Nijssen, S.: What is frequent in a single graph? In: International Workshop on Mining and Learning with Graphs (MLG) (2007)
Busygin, S.: A new trust region technique for the maximum weight clique problem. Discrete Applied Mathematics 154, 2080–2096 (2006)
Chen, C., Yan, X., Zhu, F., Han, J.: gApprox: Mining frequent approximate patterns from a massive network. In: Perner, P. (ed.) ICDM 2007. LNCS (LNAI), vol. 4597, Springer, Heidelberg (2007)
Fiedler, M., Borgelt, C.: Support computation for mining frequent subgraphs in a single graph. In: International Workshop on Mining and Learning with Graphs (MLG) (2007)
Holder, L.B., Cook, D.J., Djoko, S.: Substucture discovery in the SUBDUE system. In: KDD Workshop, pp. 169–180 (1994)
Kuramochi, M., Karypis, G.: Finding frequent patterns in a large sparse graph. Data Min. Knowl. Discov. 11(3), 243–271 (2005)
Motzkin, T.S., Straus, E.G.: Maxima for graphs and a new proof of a theorem of Turan. Canadian Journal of Mathematics 17(4), 533–540 (1965)
Sevon, P., Eronen, L., Hintsanen, P., Kulovesi, K., Toivonen, H.: Link discovery in graphs derived from biological databases. In: Data Integration in the Life Sciences, vol. 4075 (2006)
Yan, X., Han, J.: gSpan: Graph-based substructure pattern mining. In: ICDM, pp. 721–724 (2002)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bringmann, B., Nijssen, S. (2008). What Is Frequent in a Single Graph?. In: Washio, T., Suzuki, E., Ting, K.M., Inokuchi, A. (eds) Advances in Knowledge Discovery and Data Mining. PAKDD 2008. Lecture Notes in Computer Science(), vol 5012. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-68125-0_84
Download citation
DOI: https://doi.org/10.1007/978-3-540-68125-0_84
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-68124-3
Online ISBN: 978-3-540-68125-0
eBook Packages: Computer ScienceComputer Science (R0)