DMCA
Temporal analysis of semantic graphs using ASALSAN (2007)
| Venue: | SEVENTH IEEE INTERNATIONAL CONFERENCE ON DATA MINING |
| Citations: | 24 - 2 self |
BibTeX
@MISC{Bader07temporalanalysis,
author = {Brett W. Bader and Richard A. Harshman and Tamara G. Kolda},
title = {Temporal analysis of semantic graphs using ASALSAN },
year = {2007}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
ASALSAN is a new algorithm for computing three-way DEDICOM, which is a linear algebra model for analyzing intrinsically asymmetric relationships, such as trade among nations or the exchange of emails among individuals, that incorporates a third mode of the data, such as time. ASAL-SAN is unique because it enables computing the three-way DEDICOM model on large, sparse data. A nonnegative version of ASALSAN is described as well. When we apply these techniques to adjacency arrays arising from directed graphs with edges labeled by time, we obtain a smaller graph on latent semantic dimensions and gain additional information about their changing relationships over time. We demonstrate these techniques on international trade data and the Enron email corpus to uncover latent components and their transient behavior. The mixture of roles assigned to individuals by ASALSAN showed strong correspondence with known job classifications and revealed the patterns of communication between these roles. Changes in the communication pattern over time, e.g., between top executives and the legal department, were also apparent in the solutions.
Keyphrases
semantic graph three-way dedicom data mining temporal analysis seventh ieee international conference nonnegative version asymmetric relationship international trade data new algorithm labeled edge directed graph large-scale data known job classification third mode latent component latent dimension general case communication pattern two-way dedicom model approximation ara linear algebra model three-way dedicom model enron email corpus top executive changing relationship latent semantic dimension legal department square adjacency matrix sparse data transient behavior nonzero entry xij email communication strong correspondence additional information
