Scheduled System Maintenance:
On Monday, April 27th, IEEE Xplore will undergo scheduled maintenance from 1:00 PM - 3:00 PM ET (17:00 - 19:00 UTC). No interruption in service is anticipated.
By Topic

Conjunction Graph-Based Frequent-Sets Fast Discovering Algorithm

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

The purchase and pricing options are temporarily unavailable. Please try again later.
1 Author(s)
Liu Bo ; Coll. of Educ. Inf. & Technol., South China Normal Univ., Guangzhou

Existing algorithms that mine graph datasets to discover patterns corresponding to frequently occurring sub-graphs can operate efficiently on graphs that are sparse, contain a large number of relatively small connected components, have vertices with low and bounded degrees, and contain well-labeled vertices and edges. However, for graphs those do not share these characteristics, these algorithms become highly unintelligent. In this paper, we present a novel algorithm conjunction graph-based frequent fast discovering(CGFD) for mining complete frequent itemsets. This algorithm is referred to as the CGFD algorithm from hereon. In this algorithm, we employ the graph-based pruning to produce frequent patterns. Experimental data show that the CGFD algorithm outperforms that algorithm TM.

Published in:

Intelligent Information Technology Application, 2008. IITA '08. Second International Symposium on  (Volume:3 )

Date of Conference:

20-22 Dec. 2008