Motif Mining in Weighted Networks

@article{Choobdar2012MotifMI,
  title={Motif Mining in Weighted Networks},
  author={Sarvenaz Choobdar and P. Ribeiro and Fernando M A Silva},
  journal={2012 IEEE 12th International Conference on Data Mining Workshops},
  year={2012},
  pages={210-217}
}
Unexpectedly frequent subgraphs, known as motifs, can help in characterizing the structure of complex networks. Most of the existing methods for finding motifs are designed for unweighted networks, where only the existence of connection between nodes is considered, and not their strength or capacity. However, in many real world networks, edges contain more information than just simple node connectivity. In this paper, we propose a new method to incorporate edge weight information in motif… Expand
Discovering weighted motifs in gene co-expression networks
TLDR
This paper proposes a mining method capable of extracting information from weighted gene co-expression networks and uses the Kolmogorov-Smirnov test to calculate the significance score of the subgraph, avoiding the time consuming generation of random networks to determine statistic significance. Expand
Random walk patterns to identify weighted motifs
TLDR
This work proposed a novel methodology based on a random walker and a fixed maximum number of steps to study weighted motifs of limited size and found that identified similarities enable the classifications of systems according to functioning mechanisms associated with specific configurations. Expand
A Survey on Subgraph Counting: Concepts, Algorithms and Applications to Network Motifs and Graphlets
TLDR
This survey aims to provide a comprehensive overview of the existing methods for subgraph counting, identifying and describing the main conceptual approaches, giving insight on their advantages and limitations, and providing pointers to existing implementations. Expand
Motifs in weighted networks and their Hirsch subgraphs
TLDR
Network indicators derived from motifs are introduced and based on the notion of a motif’s h-index the motif's Hirsch subgraph is constructed, which is a new characteristic structure in weighted networks. Expand
A Survey on Subgraph Counting
TLDR
This survey aims to provide a comprehensive overview of the existing methods for subgraph counting, identifying and describing the main conceptual approaches, giving insight on their advantages and limitations, and providing pointers to existing implementations. Expand
Community Detection Using Attribute Homogenous Motif
TLDR
This work proposes a novel method for community detection based on a newly designed higher-order feature termed Attribute Homogenous Motif (AHMotif), which integrates both node attributes and higher- order structure of the network in a seamless way. Expand
On the Characterization and Comparison of Complex Networks
TLDR
The main goal in this thesis is to provide graph mining techniques geared towards a dynamic setting and capable of discovering core similarities and differences between multiple networks, and to develop new methods for characterization and comparison of networks at two different granularity levels: nodes and subgraphs. Expand
An novel frequent probability pattern mining algorithm based on circuit simulation method in uncertain biological networks
TLDR
A novel method for detecting frequent probability patterns based on circuit simulation in the uncertain biological networks and two-step hierarchical clustering method is used to cluster subgraphs, and discover frequent probabilities patterns from the clusters. Expand
Extending the Applicability of Graphlets to Directed Networks
TLDR
This work extends the applicability of graphlets to directed networks by considering their edge direction, thus providing a powerful basis for the analysis of directed biological networks and compared the tool to other state-of-the art methods and verified it is the fastest general tool for graphlet counting. Expand
Rand-FaSE: fast approximate subgraph census
TLDR
This paper provides an approximate algorithm for subgraph counting that uses an unbiased sampling estimator for the number of subgraphs of each type, allowing an user to trade some accuracy for even faster execution times, and believes FaSE and Rand-FaSE pave the way for faster network-centric census algorithms. Expand
...
1
2
...

References

SHOWING 1-10 OF 31 REFERENCES
Kavosh: a new algorithm for finding network motifs
TLDR
A new algorithm, Kavosh, for finding k-size network motifs with less memory and CPU time in comparison to other existing algorithms, based on counting all k- size sub-graphs of a given graph (directed or undirected). Expand
Characterizing Motifs in Weighted Complex Networks
The local structure of unweighted complex networks can be characterized by the occurrence frequencies of subgraphs in the network. Frequently occurring subgraphs, motifs, have been related to theExpand
g-tries: an efficient data structure for discovering network motifs
TLDR
The results show that indeed, g-tries are a feasible, adequate and very efficient data structure for network motifs discovery, clearly outperforming previous algorithms and data structures. Expand
Efficient Detection of Network Motifs
  • S. Wernicke
  • Computer Science, Medicine
  • IEEE/ACM Transactions on Computational Biology and Bioinformatics
  • 2006
TLDR
Experiments on a testbed of biological networks show the new algorithms to be orders of magnitude faster than previous approaches, allowing for the detection of larger motifs in bigger networks than previously possible and thus facilitating deeper insight into the field. Expand
Network Motif Discovery Using Subgraph Enumeration and Symmetry-Breaking
TLDR
A novel algorithm for discovering large network motifs that achieves these goals, based on a novel symmetry-breaking technique, which eliminates repeated isomorphism testing, leading to an exponential speed-up over previous methods. Expand
Assessing the Exceptionality of Network Motifs
TLDR
This work proposes a statistical and analytical method which does not require any simulation to identify exceptional motifs in a given network and approximate the motif count distribution by a compound Poisson distribution whose parameters are derived from the mean and variance of the count. Expand
Finding Frequent Patterns in a Large Sparse Graph*
TLDR
These algorithms use three different methods for determining the number of edge-disjoint embeddings of a subgraph and employ novel algorithms for candidate generation and frequency counting, which allow them to operate on datasets with different characteristics and to quickly prune unpromising subgraphs. Expand
Strategies for Network Motifs Discovery
TLDR
A review and runtime comparison of current motif detection algorithms in the field and categorize the algorithms outlining the main differences and advantages of each strategy to allow a fair and objective efficiency comparison using a set of benchmark networks. Expand
An efficient algorithm for detecting frequent subgraphs in biological networks
TLDR
An innovative new algorithm for detecting frequently occurring patterns and modules in biological networks is presented, using an innovative graph simplification technique, which is ideally suited to biological networks. Expand
Efficient mining of frequent subgraphs in the presence of isomorphism
TLDR
This work proposes a novel frequent subgraph mining algorithm: FFSM, which employs a vertical search scheme within an algebraic graph framework it has developed to reduce the number of redundant candidates proposed. Expand
...
1
2
3
4
...