MAX-FLMin: An Approach for Mining Maximal Frequent Links and Generating Semantical Structures from Social Networks
暂无分享,去创建一个
[1] Maximino Aldana-Gonzalez,et al. Linked: The New Science of Networks , 2003 .
[2] Jan Komorowski,et al. Principles of Data Mining and Knowledge Discovery , 2001, Lecture Notes in Computer Science.
[3] Lise Getoor,et al. Link mining: a survey , 2005, SKDD.
[4] Madhav V. Marathe,et al. EpiSimdemics: an efficient algorithm for simulating the spread of infectious disease over large realistic social networks , 2008, HiPC 2008.
[5] Sharon L. Milgram,et al. The Small World Problem , 1967 .
[6] Joost N. Kok,et al. The Gaston Tool for Frequent Subgraph Mining , 2005, GraBaTs.
[7] Jiawei Han,et al. gSpan: graph-based substructure pattern mining , 2002, 2002 IEEE International Conference on Data Mining, 2002. Proceedings..
[8] George Karypis,et al. Finding Frequent Patterns in a Large Sparse Graph* , 2005, Data Mining and Knowledge Discovery.
[9] Jiawei Han,et al. Mining Graph Patterns , 2014, Frequent Pattern Mining.
[10] Ramakrishnan Srikant,et al. Fast Algorithms for Mining Association Rules in Large Databases , 1994, VLDB.
[11] Takashi Washio,et al. An Apriori-Based Algorithm for Mining Frequent Substructures from Graph Data , 2000, PKDD.
[12] George Karypis,et al. Frequent subgraph discovery , 2001, Proceedings 2001 IEEE International Conference on Data Mining.