a trading strategy based on Elliott Wave Theory - page 139
You are missing trading opportunities:
- Free trading apps
- Over 8,000 signals for copying
- Economic news for exploring financial markets
Registration
Log in
You agree to website policy and terms of use
If you do not have an account, please register
solandr, your persistence continues to bear fruit, kudos.
It got interesting. At any rate, I realised that the gaps in my education need to be filled.
However, I have not found any of Ivakhnenko's books in electronic form.
Could you please share the links.
Literature: http://www.gmdh.net/articles/index.html. Here the books are in whole files. You can get parts of them on the spider.
Thanks, very interesting site.
And these two books don't seem to exist in electronic form at all.
Ivakhnenko A.G., Yurachkovsky Y.P. Modelling complex systems by experimental data. - Moscow: Radio and Communications, 1987
Ivakhnenko A. G. Modelling of complex systems: an information approach. - K.: Naukova Dumka, 1987, 136 p.
PS: Edited the code on 23.09.2006
Pronounced superiority - http://www.investo.ru/forum/viewtopic.php?t=127490
ATRLevels - http://forexsystems.ru/phpBB/viewtopic.php?p=3960&highlight=atr#3960
However I can understand (read) Russian so no need to answer me in English.
My question is: What do you think about combinatorial graph pattern recognition?
Actually chart is a graph and maybe the best way to analyse market data is to use algorithm for combinatorial graph! This is site for graph algorithms:http://jgaa.info/
I think this is a very valuable point!!! Maybe it makes sense to normalize the price spread, for example by the average price for the last month or two and then calculate the normalized value of the spread for a series of bars. I will try to improve the indicator in the nearest future according to this principle.
I've searched for a definition of a "combinatorial graph". At http://www.math.lsa.umich.edu/mmss/coursesONLINE/graph/graph1/graph1.doc it is defined like this:
In this situation, the word graph is short for graph of a function. This kind of graph can be precisely defined to be a set of ordered pairs
...
The kind of graphs that we will study are sometimes called combinatorial graphs to distinguish them from the graphs described above. Combinatorial graphs can sometimes be represented pictorially as networks of dots (called vertices) connected by lines (called edges)
Doesn't this definition mean that for our case we can say that: "combinatorial graph" is a non-pattern?