Motif discovery algorithms in static and temporal networks: A survey

A Jazayeri, CC Yang - Journal of Complex Networks, 2020 - academic.oup.com
Motifs are the fundamental components of complex systems. The topological structure of
networks representing complex systems and the frequency and distribution of motifs in these …

[图书][B] Algorithms on trees and graphs

G Valiente - 2002 - Springer
The notion of graph which is most useful in computer science is that of a directed graph or
just a graph. A graph is a combinatorial structure consisting of a finite nonempty set of …

Graphminesuite: Enabling high-performance and programmable graph mining algorithms with set algebra

M Besta, Z Vonarburg-Shmaria, Y Schaffner… - arXiv preprint arXiv …, 2021 - arxiv.org
We propose GraphMineSuite (GMS): the first benchmarking suite for graph mining that
facilitates evaluating and constructing high-performance graph mining algorithms. First …

Identifying influential nodes in complex networks based on local neighbor contribution

J Dai, B Wang, J Sheng, Z Sun, FR Khawaja… - IEEE …, 2019 - ieeexplore.ieee.org
The identification of influential nodes in complex networks has been widely used to
suppress rumor dissemination and control the spread of epidemics and diseases. However …

Sparsecore: stream isa and processor specialization for sparse computation

G Rao, J Chen, J Yik, X Qian - Proceedings of the 27th ACM International …, 2022 - dl.acm.org
Computation on sparse data is becoming increasingly important for many applications.
Recent sparse computation accelerators are designed for specific algorithm/application …

Topic model for graph mining

J Xuan, J Lu, G Zhang, X Luo - IEEE transactions on …, 2015 - ieeexplore.ieee.org
Graph mining has been a popular research area because of its numerous application
scenarios. Many unstructured and structured data can be represented as graphs, such as …

Clustered low rank approximation of graphs in information science applications

B Savas, IS Dhillon - Proceedings of the 2011 SIAM International …, 2011 - SIAM
In this paper we present a fast and accurate procedure called clustered low rank matrix
approximation for massive graphs. The procedure involves a fast clustering of the graph and …

Frequent subgraph mining algorithms in static and temporal graph-transaction settings: A survey

A Jazayeri, CC Yang - IEEE Transactions on Big Data, 2021 - ieeexplore.ieee.org
Networks are known as perfect tools for modeling various types of systems. In the literature
of network mining, frequent subgraph mining is considered as the essence of mining …

Graph support measures and flows

N Vanetik - Social Network Analysis and Mining, 2022 - Springer
Graph databases have gained popularity in recent years because many data use graphs as
easy and intuitive representations. The task of Graph Mining focuses on identifying …

[HTML][HTML] An unsupervised disease module identification technique in biological networks using novel quality metric based on connectivity, conductance and modularity

R Mall, E Ullah, K Kunji, M Ceccarelli… - …, 2018 - f1000research.com
Disease processes are usually driven by several genes interacting in molecular modules or
pathways leading to the disease. The identification of such modules in gene or protein …