Mining Top-K Large Structural Patterns in a Massive Network
With ever-growing popularity of social networks, web and bio-networks, mining large frequent patterns from a single huge network has become increasingly important. Yet the existing pattern mining methods cannot offer the efficiency desirable for large pattern discovery. We propose Spider- Mine, a novel...
Saved in:
Main Authors: | ZHU, Feida, QU, Qiang, LO, David, YAN, Xifeng, HAN, Jiawei, YU, Philip S. |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2011
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/1394 https://ink.library.smu.edu.sg/context/sis_research/article/2393/viewcontent/p807_zhu.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
gApprox: Mining Frequent Approximate Patterns from a Massive Network
by: CHEN, Chen, et al.
Published: (2007) -
Top-K Aggregation Queries over Large Networks
by: Yan, Xifeng, et al.
Published: (2010) -
Mining Colossal Frequent Patterns by Core Pattern Fusion
by: ZHU, Feida, et al.
Published: (2007) -
InfoNetOLAP: OLAP and Mining of Information Networks
by: CHEN, CHEN, et al.
Published: (2010) -
Mining Diversity on Networks
by: LIU, Lu, et al.
Published: (2010)