2009 FlowNetFlowBasedApproachFo: Difference between revisions
m (Text replacement - "iors]]" to "ior]]s") |
m (Text replacement - "ions]] " to "ion]]s ") |
||
Line 10: | Line 10: | ||
=== Abstract === | === Abstract === | ||
[[Biological Network|Biological networks]] having [[Complex Graph|complex connectivity]] have been widely studied recently.</s> By characterizing their [[Inherent Structure|inherent]] and [[Structural Behavior|structural behavior]]s in a [[Topology|topological]] perspective, these [[Empirical Study|studies]] have attempted to [[Knowledge Discovery Task|discover hidden knowledge]] in the [[Biological Network|system]]s.</s> However, even though various [[algorithm]]s with [[graph-theoretical modeling]] have provided fundamentals in the [[Network Analysis Task|network analysis]], the availability of [[Practical Algorithm|practical approaches]] to [[Efficient Algorithm|efficiently]] handle the [[Complex Graph|complexity]] has been limited.</s> [[In this paper, we]] present a novel [[Flow-based Algorithm|flow-based approach]], called [[flowNet|flowNet Algorithm]], to efficiently analyze [[Large Dataset|large-sized]], [[Complex Network|complex networks]].</s> [[Our approach]] is based on the [[functional influence model|Functional Influence Model]] that [[Quantification Task|quantifies]] the [[Influence Measure|influence]] of a [[Biological Component|biological component]] on another.</s> [[We]] introduce a [[Dynamic Algorithm|dynamic]] [[Flow Algorithm|flow]] [[Simulation Algorithm|simulation algorithm]] to generate a [[Flow Pattern|flow pattern]] which is a unique [[PropertyOf Relation|characteristic]] for each [[Component|component]].</s> The [[Pattern Set|set of patterns]] can be used in [[Identification Task|identifying]] [[Functional Module|functional module]]s (i.e., [[Clustering Task|clustering]]).</s> The proposed [[Flow Simulation Algorithm|flow simulation algorithm]] runs very efficiently in [[Sparse Graph|sparse networks]].</s> Since [[our approach]] uses a [[Weighted Graph|weighted network]] as an [[Task Input|Input]], [[we]] also discuss [[Supervised Learning Algorithm|supervised]] and [[Unsupervised Algorithm|unsupervised]] [[weighting schemes]] for [[Unweighted Graph|unweighted]] [[Biological Network|biological networks]].</s> As [[Experiment Outcome|experimental results]] in [[Real-World Application|real | [[Biological Network|Biological networks]] having [[Complex Graph|complex connectivity]] have been widely studied recently.</s> By characterizing their [[Inherent Structure|inherent]] and [[Structural Behavior|structural behavior]]s in a [[Topology|topological]] perspective, these [[Empirical Study|studies]] have attempted to [[Knowledge Discovery Task|discover hidden knowledge]] in the [[Biological Network|system]]s.</s> However, even though various [[algorithm]]s with [[graph-theoretical modeling]] have provided fundamentals in the [[Network Analysis Task|network analysis]], the availability of [[Practical Algorithm|practical approaches]] to [[Efficient Algorithm|efficiently]] handle the [[Complex Graph|complexity]] has been limited.</s> [[In this paper, we]] present a novel [[Flow-based Algorithm|flow-based approach]], called [[flowNet|flowNet Algorithm]], to efficiently analyze [[Large Dataset|large-sized]], [[Complex Network|complex networks]].</s> [[Our approach]] is based on the [[functional influence model|Functional Influence Model]] that [[Quantification Task|quantifies]] the [[Influence Measure|influence]] of a [[Biological Component|biological component]] on another.</s> [[We]] introduce a [[Dynamic Algorithm|dynamic]] [[Flow Algorithm|flow]] [[Simulation Algorithm|simulation algorithm]] to generate a [[Flow Pattern|flow pattern]] which is a unique [[PropertyOf Relation|characteristic]] for each [[Component|component]].</s> The [[Pattern Set|set of patterns]] can be used in [[Identification Task|identifying]] [[Functional Module|functional module]]s (i.e., [[Clustering Task|clustering]]).</s> The proposed [[Flow Simulation Algorithm|flow simulation algorithm]] runs very efficiently in [[Sparse Graph|sparse networks]].</s> Since [[our approach]] uses a [[Weighted Graph|weighted network]] as an [[Task Input|Input]], [[we]] also discuss [[Supervised Learning Algorithm|supervised]] and [[Unsupervised Algorithm|unsupervised]] [[weighting schemes]] for [[Unweighted Graph|unweighted]] [[Biological Network|biological networks]].</s> As [[Experiment Outcome|experimental results]] in [[Real-World Application|real application]]s to the [[Yeast|yeast]] [[Protein Interaction Network|protein interaction network]], [[we]] demonstrate that our [[Proposed Algorithm|approach]] outperforms [[Baseline Algorithm|previous]] [[Graph Clustering Algorithm|graph clustering methods]] with respect to [[Accuracy Metric|accuracy]].</s> | ||
---- | ---- |
Latest revision as of 07:25, 22 August 2024
- (Cho et al., 2009) ⇒ Young-Rae Cho, Lei Shi, and Aidong Zhang. (2009). “flowNet: Flow-based Approach for Efficient Analysis of Complex Biological Networks.” In: Proceedings of the Ninth IEEE International Conference on Data Mining (ICDM 2009). doi:10.1109/ICDM.2009.39
Subject Headings:
Notes
Cited by
Quotes
Abstract
Biological networks having complex connectivity have been widely studied recently. By characterizing their inherent and structural behaviors in a topological perspective, these studies have attempted to discover hidden knowledge in the systems. However, even though various algorithms with graph-theoretical modeling have provided fundamentals in the network analysis, the availability of practical approaches to efficiently handle the complexity has been limited. In this paper, we present a novel flow-based approach, called flowNet Algorithm, to efficiently analyze large-sized, complex networks. Our approach is based on the Functional Influence Model that quantifies the influence of a biological component on another. We introduce a dynamic flow simulation algorithm to generate a flow pattern which is a unique characteristic for each component. The set of patterns can be used in identifying functional modules (i.e., clustering). The proposed flow simulation algorithm runs very efficiently in sparse networks. Since our approach uses a weighted network as an Input, we also discuss supervised and unsupervised weighting schemes for unweighted biological networks. As experimental results in real applications to the yeast protein interaction network, we demonstrate that our approach outperforms previous graph clustering methods with respect to accuracy.
,
Author | volume | Date Value | title | type | journal | titleUrl | doi | note | year | |
---|---|---|---|---|---|---|---|---|---|---|
2009 FlowNetFlowBasedApproachFo | Lei Shi Young-Rae Cho Aidong Zhang | flowNet: Flow-based Approach for Efficient Analysis of Complex Biological Networks | ICDM 2009 Proceedings | 10.1109/ICDM.2009.39 | 2009 |