State Encoding of Hidden Markov Linear Prediction Models

1996 ◽  
Vol 29 (1) ◽  
pp. 5090-5095
Author(s):  
Vikram Krishnamurthy ◽  
H. Vincent Poor
1999 ◽  
Vol 1 (3) ◽  
pp. 153-157
Author(s):  
Vikram Krishnamurthy ◽  
H. Vincent Poor

Author(s):  
Oleksandr Zadorozhnyi ◽  
Gunthard Benecke ◽  
Stephan Mandt ◽  
Tobias Scheffer ◽  
Marius Kloft

2019 ◽  
Vol 59 (2) ◽  
pp. 874
Author(s):  
Irina Emelyanova ◽  
Chris Dyt ◽  
M. Ben Clennell ◽  
Jean-Baptiste Peyaud ◽  
Marina Pervukhina

Wireline log datasets complemented with core measurements and expert interpretation are vital for accurate reservoir characterisation. In many cases, effective use of this information for predicting rock properties requires application of advanced data analytics (DA) techniques. We developed non-linear prediction models by combining data- and knowledge-driven methods. These models were used for predicting total organic carbon and electro-facies from basic wireline logs. Four DA approaches were utilised: unsupervised, supervised, semi-supervised and expert rule based. The unsupervised approach implements ensemble clustering for detecting variations in sedimentary sequences of the subsurface. The supervised approach predicts rock properties from well logs by applying ensemble learning that requires core data measurements. The semi-supervised approach builds a decision tree for iterative clustering of well logs to locate a specific facies and uses criteria determined by a petrophysicist for making decisions at each tree node whether to continue or stop the partitioning. The expert rule based approach combines clustering techniques at individual wells with an expert’s methodology of interpreting facies to determine field-wide rock characterisation. Here we overview the developed models and their applications to log data from offshore and onshore Australian wells. We discuss the deep thinking–shallow learning versus shallow thinking–deep learning approaches in reservoir modelling and highlight the importance of close collaboration of data analysts with domain experts.


2008 ◽  
Vol 21 (17) ◽  
pp. 4384-4398 ◽  
Author(s):  
Michael K. Tippett ◽  
Timothy DelSole ◽  
Simon J. Mason ◽  
Anthony G. Barnston

Abstract There are a variety of multivariate statistical methods for analyzing the relations between two datasets. Two commonly used methods are canonical correlation analysis (CCA) and maximum covariance analysis (MCA), which find the projections of the data onto coupled patterns with maximum correlation and covariance, respectively. These projections are often used in linear prediction models. Redundancy analysis and principal predictor analysis construct projections that maximize the explained variance and the sum of squared correlations of regression models. This paper shows that the above pattern methods are equivalent to different diagonalizations of the regression between the two datasets. The different diagonalizations are computed using the singular value decomposition of the regression matrix developed using data that are suitably transformed for each method. This common framework for the pattern methods permits easy comparison of their properties. Principal component regression is shown to be a special case of CCA-based regression. A commonly used linear prediction model constructed from MCA patterns does not give a least squares estimate since correlations among MCA predictors are neglected. A variation, denoted least squares estimate (LSE)-MCA, is suggested that uses the same patterns but minimizes squared error. Since the different pattern methods correspond to diagonalizations of the same regression matrix, they all produce the same regression model when a complete set of patterns is used. Different prediction models are obtained when an incomplete set of patterns is used, with each method optimizing different properties of the regression. Some key points are illustrated in two idealized examples, and the methods are applied to statistical downscaling of rainfall over the northeast of Brazil.


2013 ◽  
Vol 21 (5) ◽  
pp. 618-628 ◽  
Author(s):  
Wiebe R. Pestman ◽  
Rolf H.H. Groenwold ◽  
Steven Teerenstra

2014 ◽  
Vol 2014 ◽  
pp. 1-9 ◽  
Author(s):  
Zhiyong Li ◽  
Hengyong Chen ◽  
Zhaoxin Xie ◽  
Chao Chen ◽  
Ahmed Sallam

Many real-world optimization problems involve objectives, constraints, and parameters which constantly change with time. Optimization in a changing environment is a challenging task, especially when multiple objectives are required to be optimized simultaneously. Nowadays the common way to solve dynamic multiobjective optimization problems (DMOPs) is to utilize history information to guide future search, but there is no common successful method to solve different DMOPs. In this paper, we define a kind of dynamic multiobjectives problem with translational Paretooptimal set (DMOP-TPS) and propose a new prediction model named ADLM for solving DMOP-TPS. We have tested and compared the proposed prediction model (ADLM) with three traditional prediction models on several classic DMOP-TPS test problems. The simulation results show that our proposed prediction model outperforms other prediction models for DMOP-TPS.


Sign in / Sign up

Export Citation Format

Share Document