Assessing the strength of structural changes in cooccurrence graphs

Authors:
Matthias Steinbrecher;Rudolf Kruse
Affiliations:
Department of Knowledge Processing and Language Engineering, Otto-von-Guericke University of Magdeburg, Magdeburg, Germany;Department of Knowledge Processing and Language Engineering, Otto-von-Guericke University of Magdeburg, Magdeburg, Germany
Venue:
KI'09 Proceedings of the 32nd annual German conference on Advances in artificial intelligence
Year:
2009

Citing 4
Cited 0

Mining association rules between sets of items in large databases

SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Graphical Models: Methods for Data Analysis and Mining

Graphical Models: Methods for Data Analysis and Mining
Reducing the bandwidth of sparse symmetric matrices

ACM '69 Proceedings of the 1969 24th national conference
What is frequent in a single graph?

PAKDD'08 Proceedings of the 12th Pacific-Asia conference on Advances in knowledge discovery and data mining

Quantified Score

Hi-index	0.00

Visualization

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.