Improving the prediction of petroleum reservoir characterization with a stacked generalization ensemble model of support vector machines

The ensemble learning paradigm has proved to be relevant to solving most challenging industrial problems. Despite its successful application especially in the Bioinformatics, the petroleum industry has not benefited enough from the promises of this machine learning technology. The petroleum industry, with its persistent quest for high-performance predictive models, is in great need of this new learning methodology. A marginal improvement in the prediction indices of petroleum reservoir properties could have huge positive impact on the success of exploration, drilling and the overall reservoir management portfolio. Support vector machines (SVM) is one of the promising machine learning tools that have performed excellently well in most prediction problems. However, its performance is a function of the prudent choice of its tuning parameters most especially the regularization parameter, C. Reports have shown that this parameter has significant impact on the performance of SVM. Understandably, no specific value has been recommended for it. This paper proposes a stacked generalization ensemble model of SVM that incorporates different expert opinions on the optimal values of this parameter in the prediction of porosity and permeability of petroleum reservoirs using datasets from diverse geological formations. The performance of the proposed SVM ensemble was compared to that of conventional SVM technique, another SVM implemented with the bagging method, and Random Forest technique. The results showed that the proposed ensemble model, in most cases, outperformed the others with the highest correlation coefficient, and the lowest mean and absolute errors. The study indicated that there is a great potential for ensemble learning in petroleum reservoir characterization to improve the accuracy of reservoir properties predictions for more successful explorations and increased production of petroleum resources. The results also confirmed that ensemble models perform better than the conventional SVM implementation.     

数学归纳法的几个推广

将通常适用于自然数系的数学归纳法推广到了下有界整数集{n|n∈Z,n≥n0}与上有界整数集{n|n∈Z，n≤m0}及全体整数集Z。并证明了关于命题{P(m,n)}m,n∈z的二元数学归纳法。     

支持向量机推广能力估计方法比较

支持向量机是一种新的机器学习算法，与其它学习算法相比，它的最大优点是基于结构风险最小化原则，因而能够保证推广能力。推广能力估计是机器学习中的一个重要问题，是实现自适应调整、参数选择、模型选择的等方法的基础。本文详细比较当前较有影响的几种推广能力估计方法，指出了这些方法适应范围和优缺点，并结合各种方法的原理讨论了推广能力估计可能的发展方向。     

ERCM与数据库设计

本文介绍了一种实用的数据库设计方法，它以实体分析法为理论基础，通过对我们日常使用的表进行聚集和归类，完成数据库的逻辑设计，所设计的数据库满足ＢＮＯＦ范式。同时该方法可操作性较强，本文还介绍了自行设计的ＥＲＣＭ数据库辅助设计工具。     

Are Samples in Randomized Controlled Trials of Psychotherapy Representative of Community Outpatients? A New Methodology and Initial Findings.

To determine the extent to which published randomized controlled trials (RCTs) of psychotherapy can be generalized to a sample of community outpatients, the authors used a method of matching information obtained from outpatient charts to inclusion and exclusion criteria from published RCT studies. They found that 80% of the patients in their sample who had diagnoses represented in the RCT literature were judged eligible for at least 1 published RCT; however, 58% of the patients had primary diagnoses such as adjustment disorder or dysthymia, which were not represented in the existing psychotherapy outcome literature. The most common reasons that patients in their sample did not match with published RCTs for psychotherapy are listed, and the implications of these findings for research and practice are discussed. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Higher-Order and Modal Logic as a Framework for Explanation-Based Generalization

Certain tasks, such as formal program development and theorem proving, fundamentally rely upon the manipulation of higher-order objects such as functions and predicates. Computing tools intended to assist in performing these tasks are at present inadequate in both the amount of knowledge they contain (i.e., the level of support they provide) and in their ability to learn (i.e., their capacity to enhance that support over time). The application of a relevant machine learning technique—explanation-based generalization (EBG)—has thus far been limited to first-order problem representations. We extend EBG to generalize higher-order values, thereby enabling its application to higher-order problem encodings.Logic programming provides a uniform framework in which all aspects of explanation-based generalization and learning may be defined and carried out. First-order Horn logics (e.g., Prolog) are not, however, well suited to higher-order applications. Instead, we employ Prolog, a higher-order logic programming language, as our basic framework for realizing higher-order EBG. In order to capture the distinction between domain theory and training instance upon which EBG relies, we extend Prolog with the necessity operator of modal logic. We develop a meta-interpreter realizing EBG for the extended language, Prolog, and provide examples of higher-order EBG.     

一种基于随机GA的提高BP网络泛化能力的方法

LM-BP网络对其初始权值和阈值敏感,泛化能力不强,针对该缺点,采用遗传算法（GA）对其初始权阈值进行优化,在一定程度上能提高LM-BP网络的泛化能力。为进一步扩展GA初始种群的覆盖范围,进一步提高LM—BP网络的泛化能力,采用多次随机产生初始种群多次优化的方法。以伦河孝感段氟化物含量为实例,建立随机GA的LM—BP网络模型,对原始数据进行拟合及测试,结果表明该方法基本能100％拟合,测试误差不超过2．3％。经过对比实验,证明了该方法的有效性。     

Manifold Learning: Generalization Ability and Tangent Proximity

One of the ultimate goals of Manifold Learning (ML) is to reconstruct an unknown nonlinear low-dimensional Data Manifold (DM) embedded in a high-dimensional observation space from a given set of data points sampled from the manifold. We derive asymptotic expansion and local lower and upper bounds for the maximum reconstruction error in a small neighborhood of an arbitrary point. The expansion and bounds are defined in terms of the distance between tangent spaces to the original DM and the Reconstructed Manifold (RM) at the selected point and its reconstructed value, respectively. We propose an amplification of the ML, called Tangent Bundle ML, in which proximity is required not only between the DM and RM but also between their tangent spaces. We present a new geometrically motivated Grassman & Stiefel Eigenmaps algorithm that solves this problem and gives a new solution for the ML also.     

改进BP神经网络在木构古建筑中的寿命预测

标准的BP神经网络存在训练速度慢、容易陷入极小点、泛化能力低的特点。文中用附加动量项和改进学习速率相结合的方法对标准的BP神经网络进行了改进,并将其应用在木构古建筑的寿命预测中。仿真结果表明,和标准的BP神经网络相比,改进后的BP神经网络提高了泛化能力,能较准确地拟合训练值,避免了在确定计算参数过程中所产生的计算误差。     

时空双仿射微分不变量及骨架动作识别

目的 人体骨架的动态变化对于动作识别具有重要意义。从关节轨迹的角度出发,部分对动作类别判定具有价值的关节轨迹传达了最重要的信息。在同一动作的每次尝试中,相应关节的轨迹一般具有相似的基本形状,但其具体形式会受到一定的畸变影响。基于对畸变因素的分析,将人体运动中关节轨迹的常见变换建模为时空双仿射变换。方法 首先用一个统一的表达式以内外变换的形式将时空双仿射变换进行描述。基于变换前后轨迹曲线的微分关系推导设计了双仿射微分不变量,用于描述关节轨迹的局部属性。基于微分不变量和关节坐标在数据结构上的同构特点,提出了一种通道增强方法,使用微分不变量将输入数据沿通道维度扩展后,输入神经网络进行训练与评估,用于提高神经网络的泛化能力。结果 实验在两个大型动作识别数据集NTU（Nanyang Technological University）RGB+D（NTU 60）和NTU RGB+D 120（NTU 120）上与若干最新方法及两种基线方法进行比较,在两种实验设置（跨参与者识别与跨视角识别）中均取得了明显的改进结果。相比于使用原始数据的时空图神经卷积网络（spatio-temporal graph convolutional networks,ST-GCN）,在NTU 60数据集中,跨参与者与跨视角的识别准确率分别提高了1.9%和3.0%;在NTU 120数据集中,跨参与者与跨环境的识别准确率分别提高了5.6%和4.5%。同时对比于数据增强,基于不变特征的通道增强方法在两种实验设置下都能有明显改善,更为有效地提升了网络的泛化能力。结论 本文提出的不变特征与通道增强,直观有效地综合了传统特征和深度学习的优点,有效提高了骨架动作识别的准确性,改善了神经网络的泛化能力。