A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is
In this paper, we study the problem of temporal motif mining for the temporal network. ... INDEX TERMS Temporal network, temporal motif (TM), time first search (TFS), TFS code, TM-Miner. 49778 2169-3536 ... For above challenges, we design an algorithm called temporal motif miner (TM-Miner) to mine temporal motifs. First, we formulate the problem of mining temporal motifs in the large temporal graph. ...doi:10.1109/access.2019.2911181 fatcat:emvqhwlzzva67ncrhel66uajxa
In this paper, we present MODIT (MOtif DIscovery in Temporal Networks), an algorithm for counting motifs of any size in temporal networks, inspired by a very recent algorithm for subgraph isomorphism in ... Experiments show that for big motifs (more than 3 nodes and 3 edges) MODIT can efficiently retrieve them in reasonable time (up to few hours) in many networks of medium and large size and outperforms state-of-the ... TM-miner: TFS-based algorithm for mining temporal motifs in large temporal network. ...doi:10.3389/fdata.2021.806014 pmid:35281988 pmcid:PMC8905430 fatcat:i2y5faw5nbgzhpzdwbngh6oqhi