Please use this identifier to cite or link to this item:
Title: Efficient mining of frequent rooted continuous directed subgraphs
Authors: Sreenivasa, G.J.
Ananthanarayana, V.S.
Issue Date: 2006
Citation: Proceedings - 2006 14th International Conference on Advanced Computing and Communications, ADCOM 2006, 2006, Vol., , pp.553-558
Abstract: Mining frequent rooted continuous directed (RCD) subgraphs is very useful in Web usage mining domain. We formulate the problem of mining RCD subgraphs in a database of rooted labeled continuous directed graphs. We propose a novel approach of merging like RCD subgraphs. This approach builds a Pattern Super Graph (PSG) structure. This PSG is a compact structure and ideal for extracting frequent patterns in the form of RCD subgraphs. The PSG based mine avoids costly, repeated database scans and there is no generation of candidates. Results obtained are appreciating the approach proposed. � 2006 IEEE.
Appears in Collections:2. Conference Papers

Files in This Item:
File Description SizeFormat 
7921.pdf267.48 kBAdobe PDFThumbnail

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.