Back to Search
Start Over
Discovering frequent induced subgraphs from directed networks.
- Source :
-
Intelligent Data Analysis . 2018, Vol. 22 Issue 6, p1279-1296. 18p. - Publication Year :
- 2018
-
Abstract
- Directed networks find many applications in computer science, social science and biomedicine, among others. In this paper we propose a new graph mining algorithm that is capable of locating all frequent induced subgraphs in a given set of directed networks. We present an incremental coding scheme for representing the canonical form of a graph, study its properties, and develop new techniques for pattern generation suitable for directed networks. We prove that our algorithm is complete, meaning that no qualified pattern is missed by the algorithm. Furthermore, our algorithm is correct in the sense that all patterns found by the algorithm are frequent induced subgraphs in the given networks. Experimental results based on synthetic data and gene regulatory networks show the good performance of our algorithm, and its application in network inference. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 1088467X
- Volume :
- 22
- Issue :
- 6
- Database :
- Academic Search Index
- Journal :
- Intelligent Data Analysis
- Publication Type :
- Academic Journal
- Accession number :
- 133629129
- Full Text :
- https://doi.org/10.3233/IDA-173681