Trend motif: A graph mining approach for analysis of dynamic complex networks

Proceedings - IEEE International Conference on Data Mining, ICDM

Volumn , Issue , 2007, Pages 541-546

  Jin, Ruoming ^a   McCallen, Scott ^a   Almaas, Eivind ^b  

^a KENT STATE UNIVERSITY   (United States)

^b LAWRENCE LIVERMORE NATIONAL LABORATORY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPLEX NETWORKS; COMPLEX SYSTEMS; DYNAMIC RULES; EDGE WEIGHTS; EMPIRICAL DATASETS; EXPERIMENTAL VALIDATIONS; GLOBAL DYNAMICS; GRAPH MINING; INTERNATIONAL CONFERENCES; MINING ALGORITHMS; NETWORK TOPOLOGIES; PROTEIN INTERACTION NETWORKS; REAL-WORLD APPLICATIONS; SCIENTIFIC DISCIPLINES; STOCK MARKETS; SUB GRAPHS; TIME-SERIES; TIME-SERIES DATA; WORLD TRADE;

ADMINISTRATIVE DATA PROCESSING; COMMERCE; DATA MINING; DECISION SUPPORT SYSTEMS; DYNAMIC ANALYSIS; DYNAMICS; ELECTRIC NETWORK TOPOLOGY; INFORMATION MANAGEMENT; INTERNATIONAL TRADE; MINING; RANGE FINDING; SEARCH ENGINES; TIME SERIES ANALYSIS; TOPOLOGY;

CHLORINE COMPOUNDS;

EID: 49749134293     PISSN: 15504786     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDM.2007.92     Document Type: Conference Paper

References (14)

1. Rakesh Agrawal and Ramakrishnan Srikant. Fast algorithms for mining association rules in large databases. In Proceedings of the 20th International Conference on Very Large Data Bases, 1994.
2. Lars Backstrom, Daniel P. Huttenlocher, Jon M. Kleinberg, and Xiangyang Lan. Group formation in large social networks: membership, growth, and evolution. In KDD, pages 44-54, 2006.
3. Reinhard Diestel. Graph Theory. Springer-Verlag, 2000.
4. Kristian S. Gleditsch. Expanded trade and gdp data,. J. Conf. Res., 46:712-724, 2002.
5. Akihiro Inokuchi, Takashi Washio, and Hiroshi Motoda. Complete mining of frequent patterns from graphs: Mining graph data. Mach. Learn., 50(3):321-354, 2003.
6. Ruoming Jin, Scott McCallen, and Eivind Almaas. Trend motif: A graph mining approach for analysis of dynamic complex networks. Technical Report TR-KSU-CS-2007-05, Kent State University, 2007.
7. Michihiro Kuramochi and George Karypis. Frequent subgraph discovery. In ICDM '01: Proceedings of the 2001 IEEE International Conference on Data Mining, pages 313-320, 2001.
8. Michihiro Kuramochi and George Karypis. Finding frequent patterns in a large sparse graph. In SDM, 2004.
9. Jure Leskovec, Jon M. Kleinberg, and Christos Faloutsos. Graphs over time: densification laws, shrinking diameters and possible explanations. In KDD, pages 177-187, 2005.
10. R. Milo, S. Shen-Orr, S. Itzkovitz, N. Kashtan, D. Chklovskii, and U. Alon. Network motifs: Simple building blocks of complex networks. Science, 298(5594):824827, October 2002.
11. Ron Milo, Shalev Itzkovitz, Nadav Kashtan, Reuven Levitt, Shai Shen-Orr, Inbal Ayzenshtat, Michal Sheffer, and Uri Alon. Superfamilies of evolved and designed networks. Science, 303:1538 - 1542, 2004.
12. Gergely Palla, Albert-Laszlo Barabasi, and Tamas Vicsek. Quantifying social group evolution. Nature, 446(7136):664-667, April 2007.
13. F. Schreiber and H. Schwbbermeyer. Towards motif detection in networks: frequency concepts and flexible search. In Proc. Intl. Wsh. Network Tools and Applications in Biology (NETTAB'04), pages 91-102., 2004.
14. Paul T. Spellman, Gavin Sherlock, Michael Q. Zhang, Vishwanath R. Iyer, Kirk Anders, Michael B. Eisen, Patrick O. Brown, David Botstein, and Bruce Futcher. Comprehensive identification of cell cycle-regulated genes of the yeast saccharomyces cerevisiae by microarray hybridization. Mol. Biol. Cell, 9:3273-3297.