Please use this identifier to cite or link to this item:
|Title:||A partition-based approach to graph mining|
|Authors:||Wang, B. |
|Citation:||Wang, B.,Hsu, W.,Lee, M.L.,Sheng, C. (2006). A partition-based approach to graph mining. Proceedings - International Conference on Data Engineering 2006 : 74-. ScholarBank@NUS Repository. https://doi.org/10.1109/ICDE.2006.7|
|Abstract:||Existing graph mining algorithms typically assume that databases are relatively static and can fit into the main memory. Mining of subgraphs in a dynamic environment is currently beyond the scope of these algorithms. To bridge this gap, we first introduce a partition-based approach called PartMiner for mining graphs. The PartMiner algorithm finds the frequent subgraphs by dividing the database into smaller and more manageable units, mining frequent subgraphs on these smaller units and finally combining the results of these units to losslessly recover the complete set of subgraphs in the database. Next, we extend PartMiner to handle updates in the dynamic environment. Experimental results indicate that PartMiner is effective and scalable in finding frequent subgraphs, and outperforms existing algorithms in the presence of updates. © 2006 IEEE.|
|Source Title:||Proceedings - International Conference on Data Engineering|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Jan 16, 2019
checked on Jan 13, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.