As a guest user you are not logged in or recognized by your IP address. You have
access to the Front Matter, Abstracts, Author Index, Subject Index and the full
text of Open Access publications.
We address the problem of finding patterns in an attributed graph. Our approach consists in extending the standard methodology of frequent closed pattern mining to the case in which the set of objects, in which are found the pattern supports, is the set of vertices of a graph, typically representing a social network. The core idea is then to define graph abstractions as subsets of the vertices satisfying some connectivity property within the corresponding induced subgraphs. Preliminary experiments illustrate the reduction in closed patterns we obtain as well as what kind of abstract knowledge is found via abstract implications rules.
This website uses cookies
We use cookies to provide you with the best possible experience. They also allow us to analyze user behavior in order to constantly improve the website for you. Info about the privacy policy of IOS Press.
This website uses cookies
We use cookies to provide you with the best possible experience. They also allow us to analyze user behavior in order to constantly improve the website for you. Info about the privacy policy of IOS Press.