Bi-pattern mining of attributed networks
Abstract Applying closed pattern mining to attributed two-mode networks requires two conditions. First, as in two-mode networks there are two kinds of vertices, each described with a proper attribute set, we have to consider patterns made of two components that we call bi-patterns. The occurrences o...
Main Authors: | Henry Soldano, Guillaume Santini, Dominique Bouthinon, Sophie Bary, Emmanuel Lazega |
---|---|
Format: | Article |
Language: | English |
Published: |
SpringerOpen
2019-06-01
|
Series: | Applied Network Science |
Subjects: | |
Online Access: | http://link.springer.com/article/10.1007/s41109-019-0144-1 |
Similar Items
-
MinerLSD: efficient mining of local patterns on attributed networks
by: Martin Atzmueller, et al.
Published: (2019-06-01) -
Grasping frequent subgraph mining for bioinformatics applications
by: Aida Mrzic, et al.
Published: (2018-09-01) -
RASMA: a reverse search algorithm for mining maximal frequent subgraphs
by: Saeed Salem, et al.
Published: (2021-03-01) -
A novel algorithm for finding top-k weighted overlapping densest connected subgraphs in dual networks
by: Riccardo Dondi, et al.
Published: (2021-06-01) -
Optimized and Frequent Subgraphs: How Are They Related?
by: Saif Ur Rehman, et al.
Published: (2018-01-01)