Incremental Detection for Frequent Sub-Graph Patterns Changing on Data Streams
碩士 === 國立臺灣師範大學 === 資訊教育學系 === 94 === Graph is a kind of structural data, which is applied to model the various relations among data in real world. Mining frequent sub-graph patterns, being equal to solve the problem of checking graph isomorphism, is a NP hard problem. Therefore, mining frequent sub...
Main Author: | 蔡明瑾 |
---|---|
Other Authors: | 柯佳伶 |
Format: | Others |
Language: | zh-TW |
Published: |
2006
|
Online Access: | http://ndltd.ncl.edu.tw/handle/01052596127875168457 |
Similar Items
-
Frequent Patterns Change Detection over Data Streams
by: Ching-Yi Lin, et al.
Published: (2007) -
Distributed Incremental Pattern Matching on Streaming Graphs
by: Kao, Jyun Sheng, et al.
Published: (2016) -
Detecting Incremental Frequent Subgraph Patterns in IoT Environments
by: Kyoungsoo Bok, et al.
Published: (2018-11-01) -
Incremental Mining of Frequent Subgraph Patterns
by: Tsui-Fen Yu, et al.
Published: (2005) -
Frequent Pattern Hiding in Incremental Database
by: Li-Hsiang Chiang, et al.
Published: (2010)