The SMH Algorithm : An Heuristic for Structural Matrix Computation in the Partial Least Square Path Modeling

Abstract

The Structural equations modeling with latent’s variables (SEMLV) are a class of statistical methods for modeling the relationships between unobservable concepts called latent variables. In this type of model, each latent variable is described by a number of observable variables called manifest variables. The most used version of this category of statistical methods is the partial least square path modeling (PLS Path Modeling). In PLS Path Modeling, the specification of the relashonships between the unobservable concepts, knows as structural relationships, is the most important thing to know for practical purposes. In general, this specification is obtained manually using a lower triangular binary matrix. To obtain this lower triangular matrix, the modeler must put the latent variables in a very precise order, otherwise the matrix obtained will not be triangular inferior. Indeed, the construction of such a matrix only reflects the links of cause and effect between the latent variables. Thus, with each ordering of the latent variables corresponds a precise matrix.The real problem is that, the more the number of studied concepts increases, the more the search for a good order in which it is necessary to put the latent variables to obtain a lower triangular matrix becomes more and more tedious. For five concepts, the modeler must test 5! = 120 possibilities. However, in practice, it is easy to study more than ten variables, so that the manual search for an adequate order to obtain a lower triangular matrix extremely difficult work for the modeler. In this article, we propose an heuristic way to make possible an automatic computation of the structural matrix in order to avoid the usual manual specifications and related subsequent errors.

Authors and Affiliations

Odilon Yapo M. Achiepo, Edoete Patrice Mensah, Edi Kouassi Hilaire

Keywords

Related Articles

Programming Technologies for the Development of Web-Based Platform for Digital Psychological Tools

The choice of the tools and programming technologies for information systems creation is relevant. For every projected system, it is necessary to define a number of criteria for development environment, used libraries an...

Encrypted With Fuzzy Compliment-Max-Product Matrix in Watermarking

Watermark is used to protect copyright and to authenticate images. In digital media, today’s world images are in electronic form available in the internet. For its protection and authentication invisible watermarking in...

Tagging Urdu Sentences from English POS Taggers

Being a global language, English has attracted a majority of researchers and academia to work on several Natural Language Processing (NLP) applications. The rest of the languages are not focused as much as English. Part-...

Improving Security of the Telemedicine System for the Rural People of Bangladesh

Telemedicine is a healthcare system where healthcare professionals have the capability to observe, diagnose, evaluate and treat the patient from a remote location and the patient have the ability to easily access the med...

Solving Word Tile Puzzle using Bee Colony Algorithm

In this paper, an attempt has been made to solve the word tile puzzle with the help of Bee Colony Algorithm, in order to find maximum number of words by moving a tile up, down, right or left. Bee Colony Algorithm is a ty...

Download PDF file
  • EP ID EP429243
  • DOI 10.14569/IJACSA.2018.091276
  • Views 110
  • Downloads 0

How To Cite

Odilon Yapo M. Achiepo, Edoete Patrice Mensah, Edi Kouassi Hilaire (2018). The SMH Algorithm : An Heuristic for Structural Matrix Computation in the Partial Least Square Path Modeling. International Journal of Advanced Computer Science & Applications, 9(12), 542-547. https://europub.co.uk./articles/-A-429243