Abstract
The task of detecting pattern or sub-graph in a large graph has applications in large areas such as biology, computer vision, computer-aided design, electronics, intelligence analysis, and social networks. So work on graph-based pattern detection has a wide range of research fields. Since the characteristics and application requirements of graph vary, graph-based detection is not the only problem, but it is a set of graph-related problems. This paper proposes a new approach for detection of sub-graph or pattern from a weighted graph with edge weight detection method using graph mining techniques. The edge detection method is proposed since most of the graphs are weighted one. Hence this paper proposes an algorithm named EdWePat for detection of patterns or sub-graphs with edge weight detection rather node value.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
