# Patent

## Title
Model for reconstructing a causation process from time varying data describing an event and for predicting the evolution dynamics of the event

## Abstract

A method of reconstructing a causation process from time varying data describing an event, the data consisting in a certain number of entities each having a position in a space, and each of the entities being characterized by at least a quantity or value relatively to at least one feature and in the quantity or value relatively to at least one of the features of the entities at least at two different times or at each time instant of a sequence of time instants;

    
    
        the method describing the higher likelihood transition of all entities i, j from the time n to the time n+1 as a function of the position coordinate of the entity I and of the entity j and the quantity of the at least one feature of the entity I and of the entity j at the time n and at the time n+1:

Mi,j[n,n+1]=ψ(xi,yi,qi[n],qi[n+1],xj,yj,qj[n],qj[n+1]).

        the function determining the strength of the connection between each entity i at time n and each other entity j at time n+1;
        the method determining the source causing changes in quantity of the entity j from the time n to the time n+1 as the entity i for which the strength of connection is a maximum.
    
    


The invention relates also to a method of predicting the evolution dynamics of an event or process starting from the information about the causation process obtained from the above function.

## Background
FIELD OF THE INVENTION
The invention relates to a method for reconstructing a causation process from time varying data describing an event and for predicting the evolution dynamics of the event.
Particularly the invention relates to models for an event or process to be described by entities, which can be represented as points in a space and which are characterized by at least one feature represented by a time varying, measurable quantity or value.
According to a further specific application of the invention, the event or process is described by entities which can be represented by points in a two dimensional space, such as a map, each entity being characterized by at least one feature having a value or quantity that is time varying.
BACKGROUND OF THE INVENTION
Typical events or processes are the events or processes occurring in a geophysical territory, the territory being described by a two or three dimensional geometrical map, the entities being points representing places in the map.
The reconstruction of a causation process from time varying data describing an event or process and for predicting the evolution dynamics of the event or process has a great technical importance in may technical fields. Practically, if considering a control logic of a system or a plant, several parameters can be measured at different locations and at different times.
A certain condition of operation of such a system can be analyzed relating to the causation processes which have brought to the condition by means of a method according to the present invention. Furthermore, a prediction of the evolutionary dynamics based on the entities and on the time varying quantities measured for one or more features of the entity may allow the evaluation of the future evolutions of the system and taking necessary measures in order to influence this evolution either positively or negatively.
In artificial intelligence systems, as robotized devices or the like, the possibility that systems or robotized devices can carry out cognitive processes on measured or else acquired or inputted data has also a very relevant importance for enhancing the capabilities of such systems or devices. The machine operating with artificial intelligence will be able to determine the causation process and predict further developments of a real scenario starting from the measured positions of a given number of entities on a map which represents the real world scenario and on the quantities measured for each entity for one or more features of the entities at different times. The information so determined can be used for allowing the system or device to take decisions on the data (entities and time varying quantities related to each one of the entity) and to execute actions or start processes in response to the scenario represented by the entities and the related quantities.
This kind of technology enhances the power of artificial intelligence in evaluating events or processes and in taking decisions about actions or operations to be carried out basing on the evaluation of data acquired by measuring physical or chemical parameters of a certain environment, which can be represented in a two dimensional map as entities having time varying quantities or values of one or more features of the entities.
Events or processes but also devices, plants or control systems can be described by physical and/or chemical parameters. These parameters relate to the condition of the event, of the process or of the device, of the plant or the control system and/or to the functional or evolution steps which will be carried out as a response to certain status conditions. Thus, it is clear that a space can be constructed representing the event, the process or the device, the plant, the control system in relation to certain status or functional parameters. The status or functional behavior or the evolution of the event or the process can be so described by means of a topographic representation.
Similarly considering a device or a plant or a control system, these have a two or three dimensional structure which can be described by functional or constructive schemes, in which single operative units or organs are represented and their connections, so that the behavior of the system, of the device or of the plant can be represented by the changes in the status or functional parameters of the single operative units or organs. The plant, the device or system has already a topographic structure relating to the positions of the operative units which could serve as a space for representing the system. Here the entities are the operative units or organs and the quantities related to one or more features of each entity are the numerical values of one or more parameters describing the operative condition of a certain entity.
In alternative to the above, the space to be used is a space defined by a certain number of status or functional parameters of a certain number of operative organs or units, in which a point in this space represents a status condition or a functional condition at a certain time of a certain operative unit or organ. When the status or functional conditions changes in time the point representing the status and/or functional condition of a certain operative unit or organ changes its place in the space.
Consider for example a system, in which the status condition of each organ or unit provided in the system is defined by a P, V and T (Pressure, Volume, Temperature) parameters. A map of the system can be constructed, in which each unit or organ has a certain fixed position and the status or functional condition of each unit or organ is described by the measured values at certain different time instants of the physical parameters P, V and T. The present invention aims to giving an objective answer to the questions: which change in the operative condition of which entity has influenced which other entity and in which way relative to its operative condition, and furthermore, knowing the history of the operative condition of each entity up to a certain time, how will the system develop in future times and how will develop the operative conditions of the operative units of the system.
If the system has a great number of operative organs or units, it is a very high burden to answer to the above questions.
SUMMARY OF THE INVENTION
The object of the present invention is to provide a method of reconstructing a causation process from time varying data describing an event and of predicting the evolution dynamics of the event.
The above aim is achieved with a method of reconstructing a causation process from time varying data describing an event,
the data consisting in a certain number of entities each having a position in a space, and each of the entities being characterized by at least a quantity or value relatively to at least one feature and in the quantity or value relatively to at least one of the features of the entities at least at two different times or at each time instant of a sequence of time instants;
the method describing the higher likelihood transition of all entities i, j from the time n to the time n+1 as a function of the position coordinate of the entity I and of the entity j and the quantity of the at least one feature of the entity I and of the entity j at the time n and at the time n+1:

Mi,j[n,n+1]=ψ(xi,yi,qi[n],qi[n+1],xj,yj,qj[n],qj[n+1]).

the function determining the strength of the connection between each entity i at time n and each other entity j at time n+1;
the method determining the source causing changes in quantity of the entity j from the time n to the time n+1 as the entity i for which the strength of connection is a maximum.
According to a further feature, the method is applied for each step from a time n to a time n+1 of the value of at least one quantity determined at each time instant of a sequence of time instants.
According to still a further improvement for each time step from time n to time n+1, a data matrix is generated in which each element is the strength of the connection of each entity i at time n to each entity j at time n+1.
According to a further improvement, from a data matrix of the strength of the connections a data matrix of the presence of a directed link is generated in which each element represents the presence value 1 or absence value 0 of a connection between en entity I at time n and an entity j at time n+1 and in which the value 0 or 1 is given by determining the maximum strength among the strength of connection of each one of the entities i and one entity j.
More precisely, the strength of the connection between a so called source entity i at time n and a destination or target entity j at time n+1 is determined according to the following function:




  
    
      S
      
        i
        ,
        j
      
      
        [
        
          n
          ,
          
            n
            +
            1
          
        
        ]
      
    
    =
    
      
        q
        i
        
          [
          n
          ]
        
      
      ·
      
        q
        j
        
          [
          
            n
            +
            1
          
          ]
        
      
      ·
      
        e
        
          -
          
            
              d
              
                i
                ,
                j
              
            
            α
          
        
      
      ·
      
        
          1
          +
          
            (
            
              
                q
                i
                
                  [
                  
                    n
                    +
                    1
                  
                  ]
                
              
              -
              
                q
                i
                
                  [
                  n
                  ]
                
              
            
            )
          
        
        
          1
          +
          
            (
            
              
                q
                j
                
                  [
                  
                    n
                    +
                    1
                  
                  ]
                
              
              -
              
                q
                j
                
                  [
                  n
                  ]
                
              
            
            )
          
        
      
    
  
  ;
  
    q
    ∈
    
      [
      
        0
        ,
        1
      
      ]
    
  




where:

    
    
        qi[n], qi[n+1] are respectively the quantity in source place (entity i) at time n and the quantity inn source place (entity i) at time n+1;
        qj[n], qj[n+1] are respectively the quantity in destination place (entity j) at time n and the quantity in destination place (entity j) at time n+1;
        di,j is the distance between the source (entity i) and the destination (entity j) in the space or map;
        α is a tuned parameter connected to distance; and
        Si,j[n,n+1] is the strength of directed connection between source (entity i) at time n and destination (entity j) at time n+1.
    
    


A matrix of the strength of connection can be constructed from the data of the strength of connection obtained from equation Si,j[n,n+1].
The selection of the strongest connection for determining which source entity i has caused the changes in the quantity of the destination entity j in the time step from time n to time n+1 is determined as follows from

Si,j[n,n+1]

SWin,j[n,n+1]=ArgMax{Si,j[n,n+1]}

where:

    
    
        ArgMax is the maximum of the argument of the function Si,j[n,n+1] and SWin,j[n,n+1] determines this maximum among the strength of connection of the source entities i for each different destination entity j. The entity I for which the strength of connection Si,j[n,n+1] is maximum to a certain entity j is considered as the entity by which the event at entity j determining the changes in the value of the quantity at entity j from time n to time n+1 has been caused.
    
    


From SWin,j[n,n+1] a numerical value of presence/absence of a directed link between a source entity I at time n and a destination entity j at time n+1 can be determined by the following equations:




  
    {
    
      
        
          
            
              C
              
                i
                ,
                j
              
              
                [
                
                  n
                  ,
                  
                    n
                    +
                    1
                  
                
                ]
              
            
            =
            1
          
        
        
          
            
              i
              =
              Win
            
            ;
          
        
      
      
        
          
            
              C
              
                i
                ,
                j
              
              
                [
                
                  n
                  ,
                  
                    n
                    +
                    1
                  
                
                ]
              
            
            =
            0
          
        
        
          
            
              i
              ≠
              Win
            
            ;
          
        
      
    
    }
  
  .




The definition Win relates to the ith entity for which the equation SWin,j[n,n+1]=ArgMax{Si,j[n,n+1]} is valid.
Ci,j[n,n+1] is defined as the function indicating the presence of a link between a source entity I at time n and a destination entity j at time n+1.
Similarly to the strength of the connections, for the presence of the links a matrix can be generated from the values Ci,j[n,n+1] which matrix has values 1 for the elements I, j for which the entity i satisfying the equation SWin,j[n,n+1]=ArgMax{Si,j[n,n+1]} for a destination entity j and zero values for all the entities i for which the equation is not true.
According to still a further improvement, the results of the above equations, which are limited to the discrete entities i, j provided in the database and have a certain position in a map, can be extended to the entire map by determining out of the values Si,j[n,n+1] a scalar field.
This scalar field defines the potential influence on the process or event of each place (entity) overall the global surface of the map.
In a two dimensional map, where each entity has a position defined by a pair of coordinates (x, y) the equation




  
    I
    
      i
      
        x
        ,
        y
      
    
    
      [
      
        n
        ,
        
          n
          +
          1
        
      
      ]
    
  
  =
  
    
      ∑
      j
      M
    
    ⁢
    
      S
      
        i
        ,
        j
      
      
        [
        
          n
          ,
          
            n
            +
            1
          
        
        ]
      
    
  




defines the potential influence of the i-th entity overall the global surface of the map, and the equation





  
    CI
    
      i
      
        x
        ,
        y
      
    
  
  =
  
    
      ∑
      n
      N
    
    ⁢
    
      
        ∑
        j
        M
      
      ⁢
      
        S
        
          i
          ,
          j
        
        
          [
          n
          ]
        
      
    
  




defines the cumulative potential Influence of the i-th assigned entity overall the global surface, where:

    
    
        M is the number of the assigned entities; and
        N is the number of time steps (Delta times) of the sequence of time instants from the first to the last time instant of the sequence.
    
    


The potentiality (U) of each point of the surface to influence the other point of the surface of the map and to be influenced is determined by the following equation:




  
    U
    
      k
      
        x
        ,
        y
      
    
    
      [
      
        n
        ,
        
          n
          +
          1
        
      
      ]
    
  
  =
  
    
      
        ∑
        i
      
      M
    
    ⁢
    
      
        e
        
          -
          
            
              D
              ⁡
              
                (
                
                  
                    E
                    
                      i
                      
                        x
                        ,
                        y
                      
                    
                  
                  ,
                  
                    P
                    
                      k
                      
                        x
                        ,
                        y
                      
                    
                  
                
                )
              
            
            α
          
        
      
      ·
      
        I
        
          i
          
            x
            ,
            y
          
        
        
          [
          
            n
            ,
            
              n
              +
              1
            
          
          ]
        
      
    
  




where:

    
    
        D(.) is the distance of a generic k-th point P from the i-th entity (E) in the map;
        M is the number of entities E;
        Eix,y is the i-th entity E with the coordinate x, y in the map; and
        Pkx,y is the k-th point P in the map with the coordinate x, y in the map.
    
    


According to a further feature, the present method may be applied for predicting the evolution dynamics of the event or process starting from the information about the causation process.
In this case the method for predicting the evolution dynamics of the event or process comprises the following steps:
providing data which data consist in a certain number of entities each one having a position in a space, and each one of the entities being characterized by at least a quantity or value relatively to at least one feature,
the data comprising for each of the entity i, j and for at least one of the features the quantity or value qi at different time instants n of a sequence of time instants comprising N time steps;
determining for each step from one time instant n to the following time instant n+1 in the sequence of time instants the matrix of the strength of connections Si,j[n,n+1] from a source entity i at time n to a destination entity j at time n+1 and the connection matrix Ci,j[n,n+1], i.e. the matrix of absence or presence of a link between a source entity i at time n and a destination entity j at time n+1;
generating a new dataset by joining the data of the connection matrix Ci,j[n,n+1] of all the N time steps of the sequence of time instants;
training a predictive algorithm with at least part of the data of the new dataset; and
determining the quality of the entities as source entities i at a first time instant at which the quality or value of the at least one feature is known for destination entities j at a following future time instant by feeding the known data at the first time instant to the trained predictive algorithm.
Using a more strength mathematical formalism the above can be expressed as follows:
the new dataset is generated by joining an rewriting the connection matrices Ci,j[n,n+1] with a moving windows, where each connection vector x of each place P of the entity at the time n points out to the connection vector x of the same place P at time n+1:




  new
  ⁢
  
    
  
  ⁢
  Dataset
  ⁢
  
    :
  
  ⁢
  
    
  
  ⁢
  
    
      {
      
        
          {
          
            
              
                x
                →
              
              n
              p
            
            ,
            
              
                x
                →
              
              
                n
                +
                1
              
              p
            
          
          }
        
        
          n
          =
          0
        
        
          N
          -
          1
        
      
      }
    
    
      p
      =
      1
    
    P
  




where:

    
    
        P is the number of places where the entities are
        N is the number of time steps
        According to a particular embodiment the predictive algorithm is a Artificial Neural Network ANN with the following model:

x(n)→x(n+1)=f(x(n),w*)+ε

where:

        w* is the weight matrix of the trained Artificial Neural Network, which approximate the optimal parameters to model the global temporal process obtained by the known connection matrices Ci,j[n,n+1] so defining the local laws of the process itself
    
    


According to an improvement a special way to use the new dataset for training and testing the predictive algorithm, i.e. the artificial neural network is chosen which consist in the fact that,
for training set and testing set each record is composed by P+1 input variables consisting in:
the connectivity values (1/0) of each place from the time (n) to the time (n+1) according to the corresponding connection matrix Ci,j[n,n+1], and
the connectivity values (1/0) of each place from the time (n+1) to the time (n+2) according to the corresponding connection matrix Ci,j[n+1,n+2],
while none of the sets has the same input vector but a different target vector.



BRIEF DESCRIPTION OF THE DRAWINGS
FIG. 1 is a table illustrating the data of a database of a first example of problem to which the method of the present invention can be applied for reconstructing a causation process from the time varying data describing a unknown process dynamics and for predicting the evolution dynamics of the event.
FIG. 2 illustrates a second example to which the present method is applied in a table containing the numerical data as in FIG. 1.
FIG. 3 illustrates the map in which the entities of the data of FIG. 2 are drawn as points.
FIG. 4 illustrates the tables relatively to the strength of connections Si,j[n,n+1] between the entities and the presence of connections Ci,j[n,n+1] for the data of FIG. 2 calculated according to the present method and for the two time steps for which the quantities data are provided in table of FIG. 2.
FIGS. 5 and 6 illustrates a possible way of representing the causation process as tables of numerical data and connections between entities respectively for the first and for the second time steps, i.e. from instant zero to 1 and from instant 1 to 2.
FIGS. 7 and 8 illustrate respectively the table of the presence absence of connection for the first time step and the graphic representation of the connection in the map with entities as arrows connecting the entities between which a connection is present.
FIGS. 9 and 10 illustrate respectively the table of the presence absence of connection for the second time step and the graphic representation of the connection in the map with entities as arrows connecting the entities between which a connection is present.
FIG. 11 illustrates the table of the starting data, the taw o table of connections for the time steps 1 and 2 and the graphic representation in which the graphic representations of the step 1 and step 2 according to FIGS. 8 and 10 are overlapped.
FIG. 12 illustrates the scalar field representation of the causation process for the time step 1.
FIG. 13 illustrates the scalar field representation of the causation process for the time step 2.
FIG. 14 illustrates the scalar field representation of the causation process for the time step 1 and 2 joined together.
FIG. 15 shows the table of data for a further database of entities and time varying quantities of the entities at five different time defining four time steps.
FIG. 16 illustrates the tables relating to the strength of connection among the entities and the tables relating to the presence absence of connection among the entities at each one of the four time steps provided in the data represented by the table of FIG. 15.
FIG. 17 illustrates for each time step, separately, the causation process table and the relative graphical representation.
FIG. 18 is a table representing the new database obtained by the joining of the four table s of connection according to FIG. 16 and an example of distribution of the records of the database for carrying out an experiment comprising training, tuning blind testing and predicting with a predictive algorithm, specifically an artificial neural network, which prediction should determine the unknown evolution of the process or event starting from the knowledge of the quantity data for the entities at a number of preceding time step.
FIG. 19 is a table comparing the results of the estimation carried out by the predictive algorithm with the real data on presence/absence of connection for the places considered and the time step considered for prediction in the experiment according to FIG. 18.
FIG. 20 is a table of the sensitivity, specificity and accuracy value of the prediction.
FIGS. 21 and 22 show graphically respectively the real dynamics of the time step subjected to prediction in the experiment and the one obtained by the estimation by means of the artificial neural network.
FIG. 23 is a map relating to the diffusion of a disease which is the Deng fewer epidemics in Brazil.
FIG. 24 illustrates the table of data from which the graphic representation of FIG. 23 has been generated.
FIG. 25 illustrates the map of the different points representing the different location with the geographical coordinates of the table of FIG. 24.
FIG. 26 illustrates the graphical representations of the causation process for six following time steps relatively to the data of FIG. 24.
FIG. 27 illustrates the six graphical representations of FIG. 26 overlapped.
FIG. 28 illustrates a table of the comparison of the results of the causation process reconstruction according to the present method in relation to the known real causation process of the Deng fever epidemics.
FIGS. 29, 30 and 31 illustrate respectively the results of the prediction by an artificial neural network of the connections and thus the development of the causation roves for three following time steps the first two of which are the fifth and sixth time steps for which the data is known from the Table 24 and the last one of which is a time step for which no data is provided in table of FIG. 24.



DETAILED DESCRIPTION OF THE INVENTION
Referring to FIG. 1, the illustrated table is a scheme of the structure of typical data for which the present method can be used for reconstructing a causation process and for predicting future evolution.
The present example is limited to a two dimensional case but the process may be also extended to a three dimensional or n dimensional case.
The structure of the data comprises entities having stable positions in a map. This means constant coordinates in time.
Each entity is further characterized by a feature which changes in time and can be represented by a quantity such as a numerical value. The data of the quantity is provided at least for two, generally for a certain number of time instants of a sequence of time instants.
Starting from the knowledge of this kind of data the question to which the method according to the present invention gives an answer is how to reconstruct the global causation process.
This causation process can be defined also as the information about which entity provided in the data at a certain time (n) influences which other of the entities at the time (n+1) causing the variation of the quantity observed. Furthermore is also relevant to determine the strength of the influence.
As it will be seen in the following description, the further improvement step of the method according to the present invention is also to determine the invariants of the causation process and thus be able to predict which of the entities at a certain time (n) will influence which other entities at the time (n+1) in a blind way, i.e. without knowing the data at the time (n+1).
The method according to the present invention is explained in the following according to different examples.
Example I
Example 1 is based on the data reported in the table of FIG. 2. The entities are in the form of five places (place 1 to place 5) for which the coordinate are known in a two dimensional map. For each of the places a quantity corresponding to a certain feature related to the places and representing a certain process or event is provided in numerical value form and for three different time instants of sequence of time instants. The time instants are defined as time n=0, time n=1 and time n=2. The places are placed in a map illustrated in FIG. 3 and the position of the places in the map is determined by using their coordinates.
Starting from the data of FIG. 2, the causation process is then reconstructed by considering each time step separately: the first time steps from time n=0 to time n=1 and the second time step from time n=1 and time n=2.
For both time steps the strength of the connection between each place 1 to 5 versus each other of the places 1 to 5 is determined by means of the following equation:




  
    
      S
      
        i
        ,
        j
      
      
        [
        
          n
          ,
          
            n
            +
            1
          
        
        ]
      
    
    =
    
      
        q
        i
        
          [
          n
          ]
        
      
      ·
      
        q
        j
        
          [
          
            n
            +
            1
          
          ]
        
      
      ·
      
        e
        
          -
          
            
              d
              
                i
                ,
                j
              
            
            α
          
        
      
      ·
      
        
          1
          +
          
            (
            
              
                q
                i
                
                  [
                  
                    n
                    +
                    1
                  
                  ]
                
              
              -
              
                q
                i
                
                  [
                  n
                  ]
                
              
            
            )
          
        
        
          1
          +
          
            (
            
              
                q
                j
                
                  [
                  
                    n
                    +
                    1
                  
                  ]
                
              
              -
              
                q
                j
                
                  [
                  n
                  ]
                
              
            
            )
          
        
      
    
  
  ;
  
    q
    ∈
    
      [
      
        0
        ,
        1
      
      ]
    
  




where:

    
    
        qi[n], qi[n+1] are respectively the quantity in source place (entity i) at time n and the quantity inn source place (entity i) at time n+1;
        qj[n], qj[n+1] are respectively the quantity in destination place (entity j) at time n and the quantity in destination place (entity j) at time n+1;
        di,j is the distance between the source (entity i) and the destination (entity j) in the space or map;
        α is a tuned parameter connected to distance; and
        Si,j[n,n+1] is the strength of directed connection between source (entity i) at time n and destination (entity j) at time n+1.
    
    


A matrix of the strength of connection can be constructed from the data of the strength of connection obtained from equation Si,j[n,n+1].
In FIG. 4 the flux of the reconstruction process is illustrated starting from the data of FIG. 2 and for both the time steps defined above. The first line of tables below the starting data represents the matrix of the strength of connections between the places considered at source entities at time n (rows) and the places considered as destinations at time n+1 (columns).
Once the data is available, for each time step and for each place as source entity the maximum strength value is determined and this is taken as an indication that a direct link is present for the place representing the source entity and the place representing the destination entity for which the strength of connection is a maximum.
These steps are carried out applying to the data of FIG. 2 and for each time step the following steps:

SWin,j[n,n+1]=ArgMax{Si,j[n,n+1]}

where:

    
    
        ArgMax is the maximum of the argument of the function Si,j[n,n+1] and SWin,j[n,n+1] determines this maximum among the strength of connection of the source entities i for each different destination entity j.
    
    


The entity I for which the strength of connection Si,j[n,n+1] is maximum to a certain entity j is considered as the entity by which the event at entity j determining the changes in the value of the quantity at entity j from time n to time n+1 has been caused.
From SWin,j[n,n+1] a numerical value of presence/absence of a directed link between a source entity I at time n and a destination entity j at time n+1 can be determined by the following equations:




  
    {
    
      
        
          
            
              C
              
                i
                ,
                j
              
              
                [
                
                  n
                  ,
                  
                    n
                    +
                    1
                  
                
                ]
              
            
            =
            1
          
        
        
          
            
              i
              =
              Win
            
            ;
          
        
      
      
        
          
            
              C
              
                i
                ,
                j
              
              
                [
                
                  n
                  ,
                  
                    n
                    +
                    1
                  
                
                ]
              
            
            =
            0
          
        
        
          
            
              i
              ≠
              Win
            
            ;
          
        
      
    
    }
  
  .




The definition Win relates to the ith entity for which the equation SWin,j[n,n+1]=ArgMax{Si,j[n,n+1]} is valid.
Ci,j[n,n+1] is defined as the function indicating the presence of a link between a source entity I at time n and a destination entity j at time n+1.
Similarly to the strength of the connections, the presence of the links a matrix can be generated from the values Ci,j[n,n+1], which matrix has values 1 for the elements I, j for which the entity i satisfying the equation SWin,j[n,n+1]=ArgMax{Si,j[n,n+1]} for a destination entity j zero values for all the entities i for which the equation is not true.
In the above indicated equations the term entity corresponds in the present example to the places 1 to 5.
The matrix of connections for the two time steps is reported in FIG. 4 in the last line. As it appears clearly for each place 1 to 5 considered as a source entity the maximum values of the strength of connection SWin,j[n,n+1] are determined so that the matrix of connection is formed by “0” or “1” indicating respectively absence and presence of a direct link between the place considered as a source entity and the place considered as the destination entity.
From the matrix of connections it appears that in the first time step from time instant n=0 to time instant n=1, the source entity Place 4 has caused a variation of the quality at the destination entities Place 3 and Place 5 and the source entity Place 5 has caused a variation of the quality for the destination entity Place 4. All the other places are not involved in the causation process of the evolution of the event in the time step 1.
In the second time step from n=1 to n=2, the connection matrix indicates as source entity place3 which has caused a variation of the quality at the destination entities place1, place4 and place5 and place4 which has caused a variation of the quality for the destination entity place2.
In FIGS. 5 and 6 the results are represented as a first transfer step from a status 1 at time n=0 to a status 2 at time n=1 and as a second transfer step from a status 2 at time n=1 to a status 3 at time n=2.
The tables indicate the time step to which the data refer. In the left column there is indicated the source entity, in the following column the direction and in the third column the destination entity on which the source entity has a direct link, i.e. has cause the variation in the monitored quantity from tine n to time n+1. The last right column indicates the strength of the connection between the source and the destination entity.
So if considering the table of FIG. 5, the source entity place 3 at time n=0 has caused the variation of the quantity at the value of time n=1 of the destination entity Place 3, similarly the source entity Place 5 has caused the variation of the quantity at the value of time n=1 of the destination entity Place 4, which Place 4 is as the same time source entity influencing the quantity at time n+1 of the destination entity Place 5. The strength of the influence for each couple of source and destination entity is given in the right column as a numerical parameter.
In the table of FIG. 6, the results are that in the second time step, the source entity Place 3 at time n=1 has caused the variation of the quantity at the value of time n=2 of the destination entity Place 1, similarly the source entity Place 4 has caused the variation of the quantity at the value of time n=2 of the destination entity Place 2. The source entity Place 3 has also influenced the quantity at time n=2 of the destination entities Place 4 and Place 5.
The right column indicates the strength of the influence for each couple of source and destination entity.
FIG. 7 represents the matrix of connection among the 5 places as source entities and the five places as destination entities at the first time step from time n=0 to time n=1. FIG. 8 is a graphic representation of the connection matrix with vectors connecting the source entities and the corresponding destination entities for which a direct link is present according to connection matrix of FIG. 7. Since for the two entities Place 4 and 5 the situation is that they are alternatively source and destination entities of each other, there is only a line for which the arrow changes direction depending on the source entity considered.
FIG. 9 represents the matrix of connection among the five places as source entities and the five places as destination entities at the first time step from time n=1 to time n=2.
FIG. 10 is a graphic representation of the connection matrix with vectors connecting the source entities and the corresponding destination entities for which a direct link is present according to connection matrix of FIG. 9.
In FIG. 11, on the left hand side there are shown the table of the data, i.e. the entities and the corresponding quantities at the time n=0, n=1 and n=2, the connection matrix for the first time step from time n=0 to n=1 and the connection matrix for the second time step from tine n=1 to n=2.
The right hand graphic representation corresponds to the graphic representations of FIGS. 8 and 10 overlapped one on the other.
Starting from the data of the computed strength of connection between the source entities and the destination entities at a time step and to the corresponding connection matrix, it is possible to extend the reconstruction of the causation process over the entire plane by determining scalar field.
The scalar field represents the potential influence on the process or event of each place (entity) overall the global surface of the map.
The following formalism is used to determine the scalar field in a map, which field represents the potentiality (U) of each point of the surface of the map to influence the other points of the surface of the map and to be influenced.
In a two dimensional map, where each entity has a position defined by a pair of coordinates (x, y) the equation




  
    I
    
      i
      
        x
        ,
        y
      
    
    
      [
      
        n
        ,
        
          n
          +
          1
        
      
      ]
    
  
  =
  
    
      
        ∑
        j
      
      M
    
    ⁢
    
      S
      
        i
        ,
        j
      
      
        [
        
          n
          ,
          
            n
            +
            1
          
        
        ]
      
    
  




defines the potential influence of the i-th entity overall the global surface of the map, and the equation





  
    CI
    
      i
      
        x
        ,
        y
      
    
  
  =
  
    
      
        ∑
        n
      
      N
    
    ⁢
    
      
        
          ∑
          j
        
        M
      
      ⁢
      
        S
        
          i
          ,
          j
        
        
          [
          n
          ]
        
      
    
  




defines the cumulative potential Influence of the i-th entity over the entire global surface, where:

    
    
        M is the number of the assigned entities, and
        N is the number of time steps (Delta times) of the sequence of time instants from the first to the last time instant of the sequence.
    
    


The potentiality (U) of each point of the surface to influence the other point of the surface of the map and to be influenced can be determined using the following equation:




  
    U
    
      k
      
        x
        ,
        y
      
    
    
      [
      
        n
        ,
        
          n
          +
          1
        
      
      ]
    
  
  =
  
    
      ∑
      i
      M
    
    ⁢
    
      
        e
        
          -
          
            
              D
              ⁡
              
                (
                
                  
                    E
                    
                      i
                      
                        x
                        ,
                        y
                      
                    
                  
                  ,
                  
                    P
                    
                      k
                      
                        x
                        ,
                        y
                      
                    
                  
                
                )
              
            
            α
          
        
      
      ·
      
        I
        
          i
          
            x
            ,
            y
          
        
        
          [
          
            n
            ,
            
              n
              +
              1
            
          
          ]
        
      
    
  




where:

    
    
        D(.) is the distance of a generic k-th point P from the i-th entity (E) in the map;
        M is the number of entities E;
        Eix,y is the i-th entity E with the coordinate x, y in the map; and
        Pkx,y is the k-th point P in the map with the coordinate x, y in the map.
    
    


Applying the above equations to the data set of the above described example and represented in the table of FIG. 2, the scalar field computed is represented in the FIGS. 12 to 14.
FIG. 12 represents graphically the scalar field for the first time step from time n=0 to n=1 and FIG. 13 represents graphically the scalar field for the second time step from time n=1 to n=2.
In FIG. 14 the scalar field is illustrated resulting from overlapping the scalar fields of the first and of the second time steps represented in FIGS. 12 and 13.
A further improvement of the method according to the present invention allows to use the output data consisting in the connection matrices for the different time steps for predicting which are the invariants of the process in order to render possible to predict which entities at a certain time (n) will influence which other entities at the time (n+1) without knowing the quantities for the entities at the time (n+1).
FIG. 15 shows a table of the dataset which will be used for carrying out an example of the prediction method steps. This data set is the original dataset used for the previous example and shown in the table of FIG. 2 which is further expanded by adding the quantity for each of the places 1 to 5 for further time instants n=3 and n=4. The sequence of time instants for which the value of the quantity is given is now four time steps.
In relation the dataset of FIG. 15 it has to be noticed that the number of records are few in relation to the records which are too many. The prediction of real/integer number (approximation function) is much harder than to perform a pattern recognition task (classification). For the above reasons, from a statistical viewpoint the dataset is not ideal for building a predictive model from the step of a previous time (n) to a following time (n+1) and the conditions make the prediction model impossible to built up, especially using artificial neural networks.
In order to overcome the above difficulties the present method provides the step of using the connection matrices Ci,j[n,n+1] for each time step from time n to time n+1 for generating a new dataset which allows the construction of a predictive model.
The new dataset is generated by the steps of joining and rewriting the data of the connection matrices computed for all of the time steps or for a certain number of time steps with a moving window where each connections vector of each entity Place 1 to Place 5 at the time (n) points out to the connection vector of the same entity (Place 1 to Place 5) at the time (n+1).
These steps may be expressed in a more precise formalism by the following definitions:




  New
  ⁢
  
    
  
  ⁢
  Dataset
  ⁢
  
    :
  
  ⁢
  
    
  
  ⁢
  
    
      {
      
        
          {
          
            
              
                x
                →
              
              n
              p
            
            ,
            
              
                x
                →
              
              
                n
                +
                1
              
              p
            
          
          }
        
        
          n
          =
          0
        
        
          N
          -
          1
        
      
      }
    
    
      p
      =
      1
    
    P
  




where:

    
    
        P is the number of places where the entities are; and
        N is the number of time steps
    
    


According to a particular embodiment the predictive algorithm is an Artificial Neural Network ANN with the following model:

x(n)→x(n+1)=f(x(n),w*)+ε

where:

    
    
        w* the weight matrix of the trained Artificial Neural Network, which approximates the optimal parameters to model the global temporal process obtained by the known connection matrices Ci,j[n,n+1] so defining the local laws of the process itself.
    
    


Applying the above steps to the dataset of FIG. 15 as illustrated in FIG. 16, the reconstruction steps of the causation process provide four matrices, one for each time step and each matrix being a 5×5 matrix in which the strength of the connections for the source entities (place 1 to Place 5) at step(n) to the destination entities (place 1 to Place 5) at step (n+1) are given and a set of further four connection matrices defining the possible oriented link between the source entities (pace 1 to Place 5) from step (n) to step (n+1).
FIG. 17 illustrates the results of the causation process for each step (1 to 4) defined as trans 0-1, trans 1-2, trans 2-3 trans 3-4 in a table and in the graphic form as already shown in the previous example of FIGS. 2 to 10.
Applying the joining and rewriting process of the connection matrices for obtaining the new database described above to the connection matrices determined for each time step of the present example, the new dataset obtained is illustrated in FIG. 18.
On the left hand side the braces indicates the part of the records of the dataset which are used for carrying out training, testing of an artificial neural network and a prediction experiment.
With tuning the records are indicated which are used for training an blind testing the trained artificial neural network. The last five records relating to the source entities Place 1 and Place 5 at step n=3 (fourth step) are the records on which the prediction algorithm is used for determining at time (n+1), the connection matrix relating to this time step.
For the Training set and for the Testing set, each record is composed by P+1 input variables:

    
    
        1. The connectivity (1/0) of each place from the time (n) to the time (n+1), according to the TDM Output;
        2. An identification number for each place (an integer). and P target variables:
        3. The connectivity (1/0) of each place from the time (n+1) to the time (n+2), according to the TDM Output.
    
    


The best condition for the Training and for the Testing set is a situation where none of the patterns has the same input vector but a different target vector. When this situation occurs, the patterns with these features are not trainable or testable. A solution can be to augment the memory window, if the amount of data allows this coding, until every ambiguity disappears. In the other cases, the ANNs will treat these situations as “noise”.
In the present example there are some cases of ambiguity, but the data are too few for an augmented Coding.
The training set is composed of 10 patterns: 6 input and 5 target each one;
The testing set is composed of 5 patterns, with the same input-target structure.
An artificial neural network, particularly a so called Sine Net according to document U.S. Pat. No. 7,788,196 is used for training. Its weights are tested in blind way (the ANN will see only the input vector of the 5 patterns) using the testing set. The artificial neural network prediction capability is measured in an experiment in terms of:

    
    
        1. Sensitivity=Number of real connections correctly predicted,
        2. Specificity=Number of real non connections correctly predicted,
        3. Accuracy=Number of correct predictions.
    
    


The artificial neural network, consequently, will generate 25 (5×5) independent estimations (predictions).
After 43989 epochs the Sine Net artificial neural network, with 24 hidden units, has terminated its training, with no further possibility to reduce its learning error (RMSE=0.21505214).
FIG. 19 illustrates the results of the prediction for each place by comparing the real known connection matrix with the predicted/estimated one by the artificial neural network.
As it is indicated, the light grey areas indicate the results which are missing connection relating to the real known data while the dark grey area the false connection relatively to the real known data.
The table of FIG. 20 indicates the performances of the artificial neural network in terms of sensitivity, specificity and accuracy. As it appears the sensitivity is 60.00%, the specificity is 90.00%, and the accuracy is 84.00%.
FIGS. 21 and 22 illustrate the graphical representations respectively of the known real dynamics and of the dynamics predicted with the artificial neural network.
In FIGS. 23 to 29 the application of the method according to the present invention to a real case is described.
FIG. 23 illustrates the geographical map of the diffusion of the Dengue fever epidemics in Brazil. The map represents a geographical area and the different grey shades of the regions in which the geographical area is subdivided indicate different numbers of infected individuals.
The map has been constructed as a graphical representation of the dataset of table of FIG. 24. This table contains the data about the Dengue fever in seven months in 54 regions. To each of the 54 regions defined by their geographical coordinates the number of new subjects infected at each time step is indicated for six following time steps from time n=0 to n=6, where n is a natural number.
FIG. 25 illustrates a two dimensional map with the points placed correspondingly to the coordinates of the 54 regions in the dataset of FIG. 24.
Using the method according to the present invention by applying the steps for determining the strength of the matrix of connections and out of the values of the strength of connections, the matrix of connection indicates the link between different regions, for each one of predetermined six time steps.
FIG. 26 illustrates the graphical representations of the connection matrix determined for each of the time steps 1 to 6. The connection matrices of each time step and their graphical representation constructed as in the previous examples described above give information on the causation process of the epidemic diffusion by indicating which place influences which other place at each temporal step provided.
FIG. 27 represents the six graphical representations of FIG. 26 in overlapped condition, while table of FIG. 28 indicates the performances of the method.
FIGS. 29 to 31 are the results of the prediction steps applied to the present example of the Dengue epidemics.
FIG. 29 shows the performance of the artificial neural network trained with the new dataset constructed from the six connection matrices of FIG. 26 according to the above described generic steps in the process of blind testing. The artificial neural network is trained with the data of the connection matrices of the first four time steps, while blind testing is executed with the data of the fifth step.
In FIG. 30 the table of the performances of the blind testing step of the artificial neural network and the graphical representation of the connection matrix predicted during blind testing are shown. In this case training is carried out by using the data of the connection matrices of five time steps, while blind testing is carried out for the sixth time step.
FIG. 31 is similar to FIGS. 29 and 30. Here the performances and the graphic representation of the prediction are illustrated obtained by blind testing for the data of the seventh time step an artificial neural network trained with the data of the connection matrices of the first six time steps.
All the predicted results have received confirmation by the real data.
The models and methods described herein may be performed on an electronic device such as a computer system having a memory and a processor, and may produce displays on a computer screen or other electronic device that provide graphical representations and enable a user to assess, store or print images, data, or other information.
In addition, instructions and/or data may be stored on a memory and may be accessed through a processor or other electronic device to perform the method and develop and implement the model described herein.

## Claims

1. A method of reconstructing a causation process from time varying data describing an event,
wherein the data consist in a certain number of entities each one having a position in a space, and each one of the entities is characterized by at least a quantity or value relatively to at least one feature and in the quantity or value relatively to at least one of the features of the entities at least at two different times or at each time instant of a sequence of time instants;
the method describing the higher likelihood transition of all entities i, j from the time n to the time n+1 as a function of the position coordinate of the entity I and of the entity j and the quantity of the at least one feature of the entity I and of the entity j at the time n and at the time n+1:


Mi,j[n,n+1]=ψ(xi,yi,qi[n],qi[n+1],xj,yj,qj[n],qj[n+1]).


the function determining the strength of the connection between each entity i at time n and each other entity j at time n+1; and
the method determining the source causing changes in quantity of the entity j from the time n to the time n+1 as the entity i for which the strength of connection is a maximum.

2. The method according to claim 1, in which the method steps are applied for each step from a time n to a time n+1 of the value of at least one quantity determined at each time instant of a sequence of time instants.

3. The method according to claim 1, in which for each time step from time n to time n+1, a data matrix is generated in which each element is the strength of the connection of each entity i at time n to each entity j at time n+1.

4. The method according to claim 3, in which, from a data matrix of the strength of the connections, a data matrix of the presence of a directed link is generated, in which each element represents the presence value 1 or absence value 0 of a connection between en entity I at time n and an entity j at time n+1, and in which the value 0 or 1 is given by determining the maximum strength among the strength of connection of each one of the entities i and one entity j.

5. The method according to claim 3, in which the strength of the connection between a so called source entity i at time n and a destination or target entity j at time n+1 is determined according to the following function:




  
    
      S
      
        i
        ,
        j
      
      
        [
        
          n
          ,
          
            n
            +
            1
          
        
        ]
      
    
    =
    
      
        q
        i
        
          [
          n
          ]
        
      
      ·
      
        q
        j
        
          [
          
            n
            +
            1
          
          ]
        
      
      ·
      
        e
        
          -
          
            
              d
              
                i
                ,
                j
              
            
            α
          
        
      
      ·
      
        
          1
          +
          
            (
            
              
                q
                i
                
                  [
                  
                    n
                    +
                    1
                  
                  ]
                
              
              -
              
                q
                i
                
                  [
                  n
                  ]
                
              
            
            )
          
        
        
          1
          +
          
            (
            
              
                q
                j
                
                  [
                  
                    n
                    +
                    1
                  
                  ]
                
              
              -
              
                q
                j
                
                  [
                  n
                  ]
                
              
            
            )
          
        
      
    
  
  ;
  
    q
    ∈
    
      [
      
        0
        ,
        1
      
      ]
    
  




where:
qi[n], qi[n+1] are respectively the quantity in source place (entity i) at time n and the quantity inn source place (entity i) at time n+1;
qj[n], qj[n+1] are respectively the quantity in destination place (entity j) at time n and the quantity in destination place (entity j) at time n+1;
di,j is the distance between the source (entity i) and the destination (entity j) in the space or map;
α is a tuned parameter connected to distance; and
Si,j[n,n+1] is the strength of directed connection between source (entity i) at time n and destination (entity j) at time n+1.

6. The method according to claim 5, in which a matrix of the strength of connection can be constructed from the data of the strength of connection obtained from equation Si,j[n,n+1].

7. The method according to claim 5, in which the selection of the strongest connection for determining which source entity i has caused the changes in the quantity of the destination entity j in the time step from time n to time n+1 is determined as follows from:


Si,j[n,n+1]



SWin,j[n,n+1]=ArgMax{Si,j[n,n+1]}

where:
ArgMax is the maximum of the argument of the function Si,j[n,n+1] and SWin,j[n,n+1] determines this maximum among the strength of connection of the source entities i for each different destination entity j; and
the entity i for which the strength of connection Si,j[n,n+1] is maximum to a certain entity j is considered as the entity by which the event at entity j determining the changes in the value of the quantity at entity j from time n to time n+1 has been caused.

8. The method according to claim 7, in which from SWin,j[n,n+1] a numerical value of presence/absence of a directed link between a source entity i at time n and a destination entity j at time n+1 can be determined by the following equations:




  
    {
    
      
        
          
            
              C
              
                i
                ,
                j
              
              
                [
                
                  n
                  ,
                  
                    n
                    +
                    1
                  
                
                ]
              
            
            =
            1
          
        
        
          
            
              i
              =
              Win
            
            ;
          
        
      
      
        
          
            
              C
              
                i
                ,
                j
              
              
                [
                
                  n
                  ,
                  
                    n
                    +
                    1
                  
                
                ]
              
            
            =
            0
          
        
        
          
            
              i
              ≠
              Win
            
            ;
          
        
      
    
    }
  
  .



where:
the definition Win relates to the ith entity for which the equation SWin,j[n,n+1]=ArgMax{Si,j[n,n+1]} is valid; and
Ci,j[n,n+1] is defined as the function indicating the presence of a link between a source entity I at time n and a destination entity j at time n+1.

9. The method according to claim 8, in which a matrix is generated from the values Ci,j[n,n+1], which matrix has values 1 for the elements I, j for which the entity i satisfying the equation SWin,j[n,n+1]=ArgMax{Si,j[n,n+1]} for a destination entity j and zero values for all the entities i for which the equation is not true.

10. The method according to claim 5, in which the results of the equation


Mi,j[n,n+1]=ψ(xi,yi,qi[n],qi[n+1],xj,yj,qj[n],qj[n+1]).


are extended to the entire map by determining out of the values Si,j[n,n+1] a scalar field.

11. The method according to claim 10, in which the scalar field is given by the potentiality (U) of each point of the surface to influence the other point of the surface of the map and to be influenced is determined by the following equation:




  
    U
    
      k
      
        x
        ,
        y
      
    
    
      [
      
        n
        ,
        
          n
          +
          1
        
      
      ]
    
  
  =
  
    
      
        ∑
        i
      
      M
    
    ⁢
    
      
        e
        
          -
          
            
              D
              (
              
                E
                
                  
                    i
                    
                      x
                      ,
                      y
                    
                  
                  ⁢
                  
                    
                  
                  ,
                  
                    P
                    
                      k
                      
                        x
                        ,
                        y
                      
                    
                  
                
              
              )
            
            α
          
        
      
      ·
      
        I
        
          i
          
            
              x
              ,
              y
            
            ⁢
            
              
            
          
        
        
          [
          
            n
            ,
            
              n
              +
              1
            
          
          ]
        
      
    
  



where
D(.) is the distance of a generic k-th point P from the i-th entity (E) in the map;
M is the number of entities E;
Eix,y is the i-th entity E with the coordinate x, y in the map;
Pkx,y is the k-th point P in the map with the coordinate x, y in the map; and





  
    I
    
      i
      
        x
        ,
        y
      
    
    
      [
      
        n
        ,
        
          n
          +
          1
        
      
      ]
    
  
  =
  
    
      
        ∑
        j
      
      M
    
    ⁢
    
      
        S
        
          i
          ,
          j
        
        
          [
          
            n
            ,
            
              n
              +
              1
            
          
          ]
        
      
      .

12. A method of predicting the evolution dynamics of an event or process starting from the information about the causation process which comprises the following steps:
providing data which data consist in a certain number of entities each one having a position in a space, and each one of the entities being characterized by at least a quantity or value relatively to at least one feature,
the data comprising for each of the entity i, j and for at least one of the features the quantity or value qi at different time instants n of a sequence of time instants comprising N time steps;
determining for each step from one time instant n to the following time instant n+1 in the sequence of time instants the matrix of the strength of connections Si,j[n,n+1] from a source entity i at time n to a destination entity j at time n+1 and the connection matrix Ci,j[n,n+1], i.e. the matrix of absence or presence of a link between a source entity i at time n and a destination entity j at time n+1;
where:





  
    
      S
      
        i
        ,
        j
      
      
        [
        
          n
          ,
          
            n
            +
            1
          
        
        ]
      
    
    =
    
      
        q
        i
        
          [
          n
          ]
        
      
      ·
      
        q
        j
        
          [
          
            n
            +
            1
          
          ]
        
      
      ·
      
        e
        
          -
          
            
              d
              
                i
                ,
                j
              
            
            α
          
        
      
      ·
      
        
          1
          +
          
            (
            
              
                q
                i
                
                  [
                  
                    n
                    +
                    1
                  
                  ]
                
              
              -
              
                q
                i
                
                  [
                  n
                  ]
                
              
            
            )
          
        
        
          1
          +
          
            (
            
              
                q
                j
                
                  [
                  
                    n
                    +
                    1
                  
                  ]
                
              
              -
              
                q
                j
                
                  [
                  n
                  ]
                
              
            
            )
          
        
      
    
  
  ;
  
    q
    ∈
    
      [
      
        0
        ,
        1
      
      ]
    
  



and where
qi[n], qi[n+1] are respectively the quantity in source place (entity i) at time n and the quantity inn source place (entity i) at time n+1;
qj[n], qj[n+1] are respectively the quantity in destination place (entity j) at time n and the quantity in destination place (entity j) at time n+1;
di,j is the distance between the source (entity i) and the destination (entity j) in the space or map;
α is a tuned parameter connected to distance;
Si,j[n,n+1] is the strength of directed connection between source (entity i) at time n and destination (entity j) at time n+1;
and where the elements of the connection matrix Ci,j[n,n+1] for each time step is determined from the strength of connections Si,j[n,n+1] for each time step according to the following steps
from equation SWin,j[n,n+1]=ArgMax{Si,j[n,n+1]} a numerical value of presence/absence of a directed link between a source entity i at time n and a destination entity j at time n+1 is determined by the following equations:





  
    {
    
      
        
          
            
              C
              
                i
                ,
                j
              
              
                [
                
                  n
                  ,
                  
                    n
                    +
                    1
                  
                
                ]
              
            
            =
            1
          
        
        
          
            
              i
              =
              Win
            
            ;
          
        
      
      
        
          
            
              C
              
                i
                ,
                j
              
              
                [
                
                  n
                  ,
                  
                    n
                    +
                    1
                  
                
                ]
              
            
            =
            0
          
        
        
          
            
              i
              ≠
              Win
            
            ;
          
        
      
    
    }
  
  .



generating a new dataset by joining the data of the connection matrix Ci,j[n,n+1] of all the N time steps of the sequence of time instants;
training a predictive algorithm with at least part of the data of the new dataset; and
determining the quality of the entities as source entities i at a first time instant at which the quality or value of the at least one feature is known for destination entities j at a following future time instant by feeding the known data at the first time instant to the trained predictive algorithm.

13. The method according to claim 12, in which the new dataset is generated by joining an rewriting the connection matrices Ci,j[n,n+1] with a moving windows where each connection vector x of each place P of the entity at the time n points out to the connection vector x of the same place P at time n+1




  New
  ⁢
  
    
  
  ⁢
  Datasset
  ⁢
  
    :
  
  ⁢
  
    
  
  ⁢
  
    
      {
      
        
          {
          
            
              
                x
                →
              
              n
              p
            
            ,
            
              
                x
                →
              
              
                n
                +
                1
              
              p
            
          
          }
        
        
          n
          =
          0
        
        
          N
          -
          1
        
      
      }
    
    
      p
      =
      1
    
    P
  



where:
P is the number of places where the entities are; and
N is the number of time steps.

14. The method according to claim 12, in which the predictive algorithm is a Artificial Neural Network ANN with the following model:


x(n)→x(n+1)=f(x(n),w*)+ε

Where:
w* is the weight matrix of the trained Artificial Neural Network which approximates the optimal parameters to model the global temporal process obtained by the known connection matrices Ci,j[n,n+1] so defining the local laws of the process itself.

15. The method according to claim 14, in which for the training set and the testing set of the artificial neural network each record of the training and testing set from the new database is composed by P+1 input variables consisting in:
the connectivity values (1/0) of each entity from the time (n) to the time (n+1) according to the corresponding connection matrix Ci,j[n,n+1], and
the connectivity values (1/0) of each entity from the time (n+1) to the time (n+2) according to the corresponding connection matrix Ci,j[n+1,n+2],
while none of the sets has the same input vector but a different target vector.