Supergraph based periodic pattern mining in dynamic social networks

详细信息    查看全文

• 作者：Sajal Halder^a ; ^c ; ^{sajal@cse.jnu.ac.bd} ; ^{sajal@bsmrstu.edu.bd} ; ^{sajal_csedu01@yahoo.com} ; Md. Samiullah^b ; ^{samiullah@cse.univdhaka.edu} ; Young-Koo Lee ; ^c ; ^{yklee@khu.ac.kr}
• 关键词：Periodic patterns mining ; Dynamic social networks ; Supergraph
• 刊名：Expert Systems with Applications
• 出版年：2017
• 出版时间：15 April 2017
• 年：2017
• 卷：72
• 期：Complete
• 页码：430-442
• 全文大小：3059 K
• 卷排序：72

文摘

We propose supergraph based single pass periodic pattern mining technique. This technique is polynomial unlike most graph mining problems. It is time consuming process because it stores all entities only once. Each time one sub-patterns calculation is needed that way it is memory efficient. It can predict human nature and attitude that are significant in various applications.