DocumentCode
1910749
Title
Finding What Changes for Two Graphs Constructed from Different Time Intervals
Author
Li, Aixiang ; Haraguchi, Makoto ; Okubo, Yoshiaki ; Tomita, Etsuji
Author_Institution
Grad. Sch. of Inf. Sci. Technol., Hokkaido Univ., Sapporo, Japan
fYear
2012
fDate
20-22 Sept. 2012
Firstpage
48
Lastpage
53
Abstract
Many kinds of graph data including social networks are increasing nowadays. In such a graph, the relationships between vertices are changing day by day. We need to have a data mining method able to extract significant patterns informing us about what changes. From this viewpoint, we propose in this paper an algorithm for change detection over two graphs constructed from two time intervals, based on a notion of modularity and a branch-and-bound search method for changes.
Keywords
data mining; graph theory; social networking (online); tree searching; branch-and-bound search method; data mining; graph data; social networks; time intervals; Change detection algorithms; Correlation; Data mining; Educational institutions; Electronic mail; Joining processes; Twitter; branch-and-bound algorithm; change detection; difference of modularity; graph;
fLanguage
English
Publisher
ieee
Conference_Titel
Advanced Applied Informatics (IIAIAAI), 2012 IIAI International Conference on
Conference_Location
Fukuoka
Print_ISBN
978-1-4673-2719-0
Type
conf
DOI
10.1109/IIAI-AAI.2012.19
Filename
6337156
Link To Document