Salem, Saeed; Alokshiya, Mohammed; Hasan, Mohammad Al Published March 16, 2021 Abstract Background Given a collection of coexpression networks over a set of genes, identifying subnetworks that appear frequently is an important research problem known as mining frequent subgraphs. Maximal frequent subgraphs are a representative set of frequent subgraphs; A frequent subgraph is maximal if…
Featured
Efficiently mining rich subgraphs from vertex-attributed graphs
Riyad Hakim, Saeed Salem Abstract With the rapid collection of large network data such as biological networks and social networks, it has become very important to develop efficient techniques for network analysis. In many domains, additional attribute data can be associated with entities and relationships in the network, where the network data represents relationships among…