Efficient Matching and Merging for Top-K Graph Pattern Mining on the Cloud
碩士 === 國立臺灣大學 === 電機工程學研究所 === 101 === Mining large structural patterns in graph data is an important problem in data mining research area. It has been applied applied in many domains such as social media, bioinformatics, and chemical drugs. Due to the rapidly increasing large scale graph data sets...
Main Authors: | Kuan-Wei Lee, 李冠緯 |
---|---|
Other Authors: | Ming-Syan Cheng |
Format: | Others |
Language: | en_US |
Published: |
2012
|
Online Access: | http://ndltd.ncl.edu.tw/handle/444es6 |
Similar Items
-
An Efficient Method for Mining Top-<italic>K</italic> Closed Sequential Patterns
by: Thi-Thiet Pham, et al.
Published: (2020-01-01) -
Mining Frequent and Top-K High Utility Time Interval-based Event with Duration Patterns from Temporal Database
by: Kuan-YingChen, et al.
Published: (2014) -
Top-K Sequential Pattern Mining in the Data Stream
by: Hung-lin Jiang, et al.
Published: (2009) -
An Efficient Algorithm for Mining Top-K High Utility Itemsets
by: Shu-Wei Kang, et al.
Published: (2015) -
GRAPH PATTERN MATCHING, APPROXIMATE MATCHING AND DYNAMIC GRAPH INDEXING
by: Jin, Wei
Published: (2011)