Abstract
We propose a heuristic for assessing the strength of changes that can be observed in a sequence of cooccurrence graphs from one graph to the next one. We represent every graph by its bandwidth-minimized adjacency matrix. The permutation that describes this minimization is applied to the matrices of the respective following graph. We use a repair count measure to assess the quality of the approximation that is then used to determine whether time frames shall be merged.
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., Imielinski, T., Swami, A.N.: Mining Association Rules between Sets of Items in Large Databases. In: Buneman, P., Jajodia, S. (eds.) Proc. ACM SIGMOD Int. Conf. on Management of Data, Washington, D.C, May 26-28, pp. 207–216. ACM Press, New York (1993)
Borgelt, C., Steinbrecher, M., Kruse, R.: Graphical Models — Methods for Data Analysis and Mining, 2nd edn. Wiley Series in Computational Statistics. John Wiley & Sons, United Kingdom (2009)
Steinbrecher, M., Rügheimer, F., Kruse, R.: Application of Graphical Models in the Automotive Industry. In: Prokhorov, D. (ed.) Computational Intelligence in Automotive Applications. Studies in Computational Intelligence, vol. 132, pp. 79–88. Springer, Berlin (2008)
Steinbrecher, M., Kruse, R.: Fuzzy Descriptions to Identify Temporal Substructure Changes of Cooccurrence Graphs. In: Conf. International Fuzzy Systems Association (IFSA), Lisbon, Portugal (to appear, 2009)
Steinbrecher, M., Kruse, R.: Identifying Temporal Trajectories of Association Rules with Fuzzy Descriptions. In: Proc. Conf. North American Fuzzy Information Processing Society (NAFIPS 2008), New York, USA, May 2008, pp. 1–6 (2008)
Cuthill, E., McKee, J.: Reducing the bandwidth of sparse symmetric matrices. In: Proc. of the 24th National Conference of the Association for Computing Machinery (ACM), 1122 Ave. of the Americas, New York, N.Y, pp. 147–172 (1969)
Bringmann, B., Nijssen, S.: What Is Frequent in a Single Graph? In: Washio, T., Suzuki, E., Ting, K.M., Inokuchi, A. (eds.) PAKDD 2008. LNCS (LNAI), vol. 5012, pp. 858–863. Springer, Heidelberg (2008)
Bollobás, B.: The Evolution of Random Graphs — the Giant Component. In: Random Graphs, 2nd edn., pp. 130–159. Cambridge Univ. Press, Cambridge (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Steinbrecher, M., Kruse, R. (2009). Assessing the Strength of Structural Changes in Cooccurrence Graphs. In: Mertsching, B., Hund, M., Aziz, Z. (eds) KI 2009: Advances in Artificial Intelligence. KI 2009. Lecture Notes in Computer Science(), vol 5803. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04617-9_60
Download citation
DOI: https://doi.org/10.1007/978-3-642-04617-9_60
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-04616-2
Online ISBN: 978-3-642-04617-9
eBook Packages: Computer ScienceComputer Science (R0)