arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1705.09866physics.geo-phcs.SIphysics.data-anstat.ML
收藏

三维离散裂隙网络图表示的机器学习

Machine learning for graph-based representations of three-dimensional discrete fracture networks

Manuel Valera, Zhengyang Guo, Priscilla Kelly, Sean Matz, Vito Adrian Cantu, Allon G. Percus, Jeffrey D. Hyman, Gowri Srinivasan, Hari S. Viswanathan

摘要:

结构和拓扑信息在模拟地下裂隙岩石的流动和输运过程中起着关键作用。离散裂缝网络(DFN)计算套件,如dfnWorks的设计,以模拟流动和运输在这样的多孔介质。流动和运输计算表明,存在一个小的骨干裂缝,其中大多数流动和运输发生。将流动的裂缝网络限制到该主干提供了网络的有效尺寸的显著减小。然而,确定减少所需的粒子跟踪模拟是计算密集型的。这种方法对于大型系统或裂缝网络的鲁棒不确定性量化可能是不切实际的,其中需要数千次正演模拟来约束系统行为。在本文中,我们开发了另一种网络约简方法,通过结合图论和机器学习方法来表征DFNs中的传输。我们考虑一个图形表示,节点表示骨折和边缘表示它们的交叉点。使用随机森林和支持向量机,我们快速识别一个子网络,捕捉流模式的完整的DFN,主要是基于节点的中心特征的图形。我们的监督学习技术训练在dfnWorks发现的粒子跟踪骨干路径上进行,但与这些模拟相比,运行时间可以忽略不计。我们发现,我们的预测可以将网络减少到原始大小的约20%,同时仍然生成与原始网络一致的突破曲线。

英文摘要:

Structural and topological information play a key role in modeling flow and transport through fractured rock in the subsurface. Discrete fracture network (DFN) computational suites such as dfnWorks are designed to simulate flow and transport in such porous media. Flow and transport calculations reveal that a small backbone of fractures exists, where most flow and transport occurs. Restricting the flowing fracture network to this backbone provides a significant reduction in the network's effective size. However, the particle tracking simulations needed to determine the reduction are computationally intensive. Such methods may be impractical for large systems or for robust uncertainty quantification of fracture networks, where thousands of forward simulations are needed to bound system behavior. In this paper, we develop an alternative network reduction approach to characterizing transport in DFNs, by combining graph theoretical and machine learning methods. We consider a graph representation where nodes signify fractures and edges denote their intersections. Using random forest and support vector machines, we rapidly identify a subnetwork that captures the flow patterns of the full DFN, based primarily on node centrality features in the graph. Our supervised learning techniques train on particle-tracking backbone paths found by dfnWorks, but run in negligible time compared to those simulations. We find that our predictions can reduce the network to approximately 20% of its original size, while still generating breakthrough curves consistent with those of the original network.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑