Skip to content

Multi-step predictions with TM #656

Open
@Thanh-Binh

Description

@Thanh-Binh

I think for higher prediction and robuster anomaly detection, we need something like a chain of 10 TMs for 10 steps prediction: TM0->TM1->TM2->...-->TM9, where the predicted cells of the previous TM (e.g. TM1) will be inputed into the next TM (e.g. TM2) and so on.
It can be realized by using an array of TM with fixed size, I say variant 1,
But it can be also by using only 2 TMs: TM0 and TMworker, where at every time instance, TMworker is cloned from TM0 and run multiple time (here 9 times) (I say variant 2)

As the 3rd variant, I think we can use SDRClassifier for all steps from 1 to 10. At each time instance, we have 10 concurrent suggestions of the predicted buckets (one at the current time and 9 from the last). The best bucket is a bucket with most score within 10 suggestions.

My questions:

  1. Which variant do you think better?
  2. Is the clone-algorithm time-consuming? How can we do it efficiently in C++?

Best thanks

Metadata

Metadata

Assignees

No one assigned

    Labels

    TMquestionFurther information is requestedresearchnew functionality of HTM theory, research idea

    Type

    No type

    Projects

    No projects

    Milestone

    No milestone

    Relationships

    None yet

    Development

    No branches or pull requests

    Issue actions