Abstract
A property graph in a NoSQL graph database engine provides an efficient way to manage data and knowledge due to its native graph-structure storage. A property graph is a labeled directed graph having nodes and relationships with a set of attributes or properties in form of (key:value) pairs. In this work, we aim at mining such graphs in order to extract frequent gradual patterns in form of the more/less A 1 ,..., more/less A n where A i are information from graph, should it be from nodes or from relationships. In order to retrieve more valuable patterns, we consider fuzzy gradual patterns in form of The more/less A 1 is F 1 ,...,the more/less A n is F n where A i are attributes retrieved from graph nodes or relationships and F i are fuzzy descriptions. For this purpose, we introduce definitions of such concepts, corresponding method for extracting patterns, and experiments that we have led on synthetic graphs using a graph generator. We show results in terms of time and memory consumption.
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.
