You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
hi
we have talked about this in this issue : #78
if we run it we can see that the new algorithm is faster and its clear
because it is working without former data
i also added the usage and benchmarks in the end of examples/main.go which shows its working correct
later i will add the mathematical proof
Thanks
Thanks! Is there anywhere I can read more about this technique, is it usually referred to as Standard Deviation Union? I didn't find anything when searching for that.
We don't need to add timing logs in the example log, but will need to add some tests.
honestly im facing this problem in real project because we need to calculate SD in absence of former data
and i didnt find such a thing and also such a name
so i just named it by myself and also will upload the proof
we can change its name if its not proper
do you need the mathematical proof before merging it?
@montanaflynn
Hi im sorry for tagging you again
could you please take a look i think it would be useful to merge it
Thanks
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
hi
we have talked about this in this issue : #78
if we run it we can see that the new algorithm is faster and its clear
because it is working without former data
i also added the usage and benchmarks in the end of examples/main.go which shows its working correct
later i will add the mathematical proof
Thanks