Extraction of Frequent Subgraph from Graph Database
Journal Title: International Journal of Research in Computer and Communication Technology - Year 2014, Vol 3, Issue 3
Abstract
Graphs are promising abstraction of complex structured and semi-structured data. Graph mining techniques extract, analyze and summarize significant and useful information from the graph databases. Finding frequent subgraph from graph database is an essence of graph mining. Sometimes the mined subgraphs are large in numbers, posing difficulty in selecting significant subgraph. Every frequent subgraph is not always significant from the application perspective. This paper proposes an innovative concept to extract significant subgraphs. Our method does this in two stages. In the first stage, frequent subgraphs are identified using frequency threshold (ϴ), which is an input parameter. In the second stage, feature vectors of subgraphs are generated to calculate its statistical significance. P-value is measure of statistical significance.
Authors and Affiliations
Sakshi S. Mandke, Sheetal S. Sonawane
Keywords
Related Articles
- EP ID EP27851
- DOI -
- Views 271
- Downloads 0
Optimize Energy Consumption with priority forwarder list in Wireless Sensor Networks
Opportunistic routing always useful to increase the network throughput by forwarding the packets to the nodes which are nearer to the destination node. These nodes are called as forwarder listed nodes during the tran...
Performance and analysis of NTRU and Advanced NTRU cryptosystems
Authentication and Confidentiality is the main goal of the public key cryptosystems deal when communication takes place between both the parties. The mostly used cryptographic methods are broadly classified as symmet...
A Survey on Channel Estimation Techniques in OFDM System
Orthogonal Frequency Division Multiplexing (OFDM) breaks the carrier in to sub carriers which are orthogonal to one- another, and hence called as orthogonal frequency division multiplexing. It is an extension of conv...
Automatic Membership Service For Large-Scale Dependable Storage Systems
Byzantine-fault-tolerant replication increases the reliability and availability of Internet services that store significant state and protect it in spite of attacks or software errors. Existing Byzantine-fault-toleran...
Low-Complexity Turbo Decoder Architecture for Energy-Efficient Wireless Sensor Networks
Turbo codes have recently been considered for energy-constrained wireless communication applications, mainly because of low transmission energy consumption. In this project, we decompose the low complexity turbo deco...