An Approach to Modeling Domain-Wide Information, based on Limited Points’ Data – Part I

John Charlery; Chris D. Smith

doi:doi:10.11648/j.ajsea.20130202.12

| Peer-Reviewed

An Approach to Modeling Domain-Wide Information, based on Limited Points’ Data – Part I

John Charlery, Chris D. Smith

Published in American Journal of Software Engineering and Applications (Volume 2, Issue 2)

Published: 2 April 2013

Views: Downloads:

Download PDF

Share This Article

Twitter
Linked In
Facebook

Abstract

Predicting values at data points in a specified region when only a few values are known is a perennial problem and many approaches have been developed in response. Interpolation schemes provide some success and are the most widely used among the approaches. However, none of those schemes incorporates historical aspects in their formulae. This study presents an approach to interpolation, which utilizes the historical relationships existing between the data points in a region of interest. By combining the historical relationships with the interpolation equations, an algorithm for making predictions over an entire domain area, where data is known only for some random parts of that area, is presented. A performance analysis of the algorithm indicates that even when provided with less than ten percent of the domain’s data, the algorithm outperforms the other popular interpolation algorithms when more than fifty percent of the domain’s data is provided to them.

Published in	American Journal of Software Engineering and Applications (Volume 2, Issue 2)
DOI	10.11648/j.ajsea.20130202.12
Page(s)	32-39
Creative Commons	This is an Open Access article, distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution and reproduction in any medium or format, provided the original work is properly cited.
Copyright	Copyright © The Author(s), 2013. Published by Science Publishing Group

Keywords

Data Modeling, Interpolation, Data Prediction, Sparse Data Analysis

References

[1]	N. I. Fisher, T. Lewis, B. J. J. Embleton, Statistical Analysis of Spherical Data, Cambridge University Press, 1987.
[2]	D. Dorsel, T. La Breche, Kriging. , January 2009.
[3]	R. V. Jesus, Kriging: An Accompanied Example in IDRISI, GIS Centrum, University of Lund for Oresund, Summer University, 2003.
[4]	M.L. Stein, Interpolation of Spatial Data: Some Theory for Kriging, Springer, New York, 1999.
[5]	W.C.M. Van Beers, J. P.C. Kleijnen, Kriging Interpolation in Simulation : A Survey, in: R .G. Ingalls, M. D. Rossetti, J. S. Smith, and B. A. Peters (Eds.), Proceedings of the 2004 Winter Simulation Conference,Washington, DC, 2004, pp. 113-121.
[6]	D. T. Lee, B.J. Schachter, Two Algorithms for Constructing a Delaunay Triangulation. International Journal of Computer and information Sciences, Vol. 9, 1980, pp. 219-242.
[7]	P-J. Laurent, Wavelets, Images, and Surface Fitting, in: A. Le Mehaute (Ed.), A.K Peters Ltd., 1994.
[8]	W. H. F. Smith, P. Wessel, Gridding with Continuous Curvature Splines in Tension, Geophysics, 55, 1990.
[9]	D. Shepard, A two-dimensional interpolation function for irregularly spaced data. Proceedings of the 23rd ACM National Conference (128), 1968, pp.517-524.
[10]	R. Sierra, Rigid Registration. , May 2009.
[11]	J. Parag, Class Presentation. , May 2009.
[12]	D. Kleinbaum, L. Kupper, K. Muller, Applied Regression Analysis and other Multivariable Method, Duxbury Press, 1987.
[13]	Wasson J. Statistics in Educational Research - An Internet Based Course. , April 2009.
[14]	J. Deacon, Correlation, and regression analysis for curve fitting. , January 2009.
[15]	R.J. Rummel, Understanding Correlation. , December 2009.
[16]	E. Yudkowsky, An Intuitive Explanation of Bayesian Reasoning, , May 2009.
[17]	P. E. Gill, W. Murray, Algorithms for the solution of the nonlinear least-squares problem. SIAM Journal of Numeral Analysis, 15 [5], 1978, pp. 977-992.
[18]	W. R. Greco, M. T. Hakala. Evaluation of methods for estimating the dissociation constant of tight binding enzyme inhibitors, Journal of Biological Chemistry, (254), 1979, pp.12104-12109.
[19]	D. F. Symancyk, Visualizing Gaussian Elimination, , May 2006.

Cite This Article

Plain Text BibTeX RIS

APA Style

John Charlery, Chris D. Smith. (2013). An Approach to Modeling Domain-Wide Information, based on Limited Points’ Data – Part I. American Journal of Software Engineering and Applications, 2(2), 32-39. https://doi.org/10.11648/j.ajsea.20130202.12

Copy | Download

ACS Style

John Charlery; Chris D. Smith. An Approach to Modeling Domain-Wide Information, based on Limited Points’ Data – Part I. Am. J. Softw. Eng. Appl. 2013, 2(2), 32-39. doi: 10.11648/j.ajsea.20130202.12

Copy | Download

AMA Style

John Charlery, Chris D. Smith. An Approach to Modeling Domain-Wide Information, based on Limited Points’ Data – Part I. Am J Softw Eng Appl. 2013;2(2):32-39. doi: 10.11648/j.ajsea.20130202.12

Copy | Download

@article{10.11648/j.ajsea.20130202.12,
  author = {John Charlery and Chris D. Smith},
  title = {An Approach to Modeling Domain-Wide Information, based on Limited Points’ Data – Part I},
  journal = {American Journal of Software Engineering and Applications},
  volume = {2},
  number = {2},
  pages = {32-39},
  doi = {10.11648/j.ajsea.20130202.12},
  url = {https://doi.org/10.11648/j.ajsea.20130202.12},
  eprint = {https://article.sciencepublishinggroup.com/pdf/10.11648.j.ajsea.20130202.12},
  abstract = {Predicting values at data points in a specified region when only a few values are known is a perennial problem and many approaches have been developed in response. Interpolation schemes provide some success and are the most widely used among the approaches. However, none of those schemes incorporates historical aspects in their formulae. This study presents an approach to interpolation, which utilizes the historical relationships existing between the data points in a region of interest. By combining the historical relationships with the interpolation equations, an algorithm for making predictions over an entire domain area, where data is known only for some random parts of that area, is presented. A performance analysis of the algorithm indicates that even when provided with less than ten percent of the domain’s data, the algorithm outperforms the other popular interpolation algorithms when more than fifty percent of the domain’s data is provided to them.},
 year = {2013}
}

Copy | Download

TY  - JOUR
T1  - An Approach to Modeling Domain-Wide Information, based on Limited Points’ Data – Part I
AU  - John Charlery
AU  - Chris D. Smith
Y1  - 2013/04/02
PY  - 2013
N1  - https://doi.org/10.11648/j.ajsea.20130202.12
DO  - 10.11648/j.ajsea.20130202.12
T2  - American Journal of Software Engineering and Applications
JF  - American Journal of Software Engineering and Applications
JO  - American Journal of Software Engineering and Applications
SP  - 32
EP  - 39
PB  - Science Publishing Group
SN  - 2327-249X
UR  - https://doi.org/10.11648/j.ajsea.20130202.12
AB  - Predicting values at data points in a specified region when only a few values are known is a perennial problem and many approaches have been developed in response. Interpolation schemes provide some success and are the most widely used among the approaches. However, none of those schemes incorporates historical aspects in their formulae. This study presents an approach to interpolation, which utilizes the historical relationships existing between the data points in a region of interest. By combining the historical relationships with the interpolation equations, an algorithm for making predictions over an entire domain area, where data is known only for some random parts of that area, is presented. A performance analysis of the algorithm indicates that even when provided with less than ten percent of the domain’s data, the algorithm outperforms the other popular interpolation algorithms when more than fifty percent of the domain’s data is provided to them.
VL  - 2
IS  - 2
ER  -

Copy | Download

Author Information

John Charlery

Dept. of Computer Science, Mathematics & Physics, Faculty of Science and Technology, University of the West Indies, Cave Hill Campus, Bridgetown, Barbados BB11000
Chris D. Smith

Dept. of Computer Science, Mathematics & Physics, Faculty of Science and Technology, University of the West Indies, Cave Hill Campus, Bridgetown, Barbados BB11000

Download PDF

Sections

Plain Text BibTeX RIS

APA Style

John Charlery, Chris D. Smith. (2013). An Approach to Modeling Domain-Wide Information, based on Limited Points’ Data – Part I. American Journal of Software Engineering and Applications, 2(2), 32-39. https://doi.org/10.11648/j.ajsea.20130202.12

Copy | Download

ACS Style

John Charlery; Chris D. Smith. An Approach to Modeling Domain-Wide Information, based on Limited Points’ Data – Part I. Am. J. Softw. Eng. Appl. 2013, 2(2), 32-39. doi: 10.11648/j.ajsea.20130202.12

Copy | Download

AMA Style

John Charlery, Chris D. Smith. An Approach to Modeling Domain-Wide Information, based on Limited Points’ Data – Part I. Am J Softw Eng Appl. 2013;2(2):32-39. doi: 10.11648/j.ajsea.20130202.12

Copy | Download

@article{10.11648/j.ajsea.20130202.12,
  author = {John Charlery and Chris D. Smith},
  title = {An Approach to Modeling Domain-Wide Information, based on Limited Points’ Data – Part I},
  journal = {American Journal of Software Engineering and Applications},
  volume = {2},
  number = {2},
  pages = {32-39},
  doi = {10.11648/j.ajsea.20130202.12},
  url = {https://doi.org/10.11648/j.ajsea.20130202.12},
  eprint = {https://article.sciencepublishinggroup.com/pdf/10.11648.j.ajsea.20130202.12},
  abstract = {Predicting values at data points in a specified region when only a few values are known is a perennial problem and many approaches have been developed in response. Interpolation schemes provide some success and are the most widely used among the approaches. However, none of those schemes incorporates historical aspects in their formulae. This study presents an approach to interpolation, which utilizes the historical relationships existing between the data points in a region of interest. By combining the historical relationships with the interpolation equations, an algorithm for making predictions over an entire domain area, where data is known only for some random parts of that area, is presented. A performance analysis of the algorithm indicates that even when provided with less than ten percent of the domain’s data, the algorithm outperforms the other popular interpolation algorithms when more than fifty percent of the domain’s data is provided to them.},
 year = {2013}
}

Copy | Download

TY  - JOUR
T1  - An Approach to Modeling Domain-Wide Information, based on Limited Points’ Data – Part I
AU  - John Charlery
AU  - Chris D. Smith
Y1  - 2013/04/02
PY  - 2013
N1  - https://doi.org/10.11648/j.ajsea.20130202.12
DO  - 10.11648/j.ajsea.20130202.12
T2  - American Journal of Software Engineering and Applications
JF  - American Journal of Software Engineering and Applications
JO  - American Journal of Software Engineering and Applications
SP  - 32
EP  - 39
PB  - Science Publishing Group
SN  - 2327-249X
UR  - https://doi.org/10.11648/j.ajsea.20130202.12
AB  - Predicting values at data points in a specified region when only a few values are known is a perennial problem and many approaches have been developed in response. Interpolation schemes provide some success and are the most widely used among the approaches. However, none of those schemes incorporates historical aspects in their formulae. This study presents an approach to interpolation, which utilizes the historical relationships existing between the data points in a region of interest. By combining the historical relationships with the interpolation equations, an algorithm for making predictions over an entire domain area, where data is known only for some random parts of that area, is presented. A performance analysis of the algorithm indicates that even when provided with less than ten percent of the domain’s data, the algorithm outperforms the other popular interpolation algorithms when more than fifty percent of the domain’s data is provided to them.
VL  - 2
IS  - 2
ER  -

Copy | Download