gApprox: Mining Frequent Approximate Patterns from a Massive Network
Recently, there arise a large number of graphs with massive sizes and complex structures in many new applications, such as biological networks, social networks, and the Web, demanding powerful data mining methods. Due to inherent noise or data diversity, it is crucial to address the issue of approxi...
Saved in:
Main Authors: | CHEN, Chen, YAN, Xifeng, ZHU, Feida, HAN, Jiawei |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2007
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/928 https://ink.library.smu.edu.sg/context/sis_research/article/1927/viewcontent/gApprox_2007.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
Mining Colossal Frequent Patterns by Core Pattern Fusion
by: ZHU, Feida, et al.
Published: (2007) -
Mining Top-K Large Structural Patterns in a Massive Network
by: ZHU, Feida, et al.
Published: (2011) -
Efficient Discovery of Frequent Approximate Sequential Patterns
by: ZHU, Feida, et al.
Published: (2007) -
gPrune: A Constraint Pushing Framework for Graph Pattern Mining
by: ZHU, Feida, et al.
Published: (2007) -
Mining Diversity on Networks
by: LIU, Lu, et al.
Published: (2010)