-
Notifications
You must be signed in to change notification settings - Fork 4
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
incorrect implementation of pdac algorithm? #4
Comments
Hi @hadyelsahar, thanks for bringing this up! It is fixed in 418b5e6. The argument These differences from the implementation described in the paper slipped into a code update while I was doing some follow-up experiments where the classification threshold conditions (p > thr) were more important than the segment length ones (len < max). Empirically, the argument Let me know if you have any more questions. |
Yes alright this makes sense thanks a lot! While i tend to agree however, letting segments go to more than max_seg_length in the wild (not on the test sets you have here) yielded segments with > 100 secs (when max = 10secs) this caused some memory issues that cannot be anticipated. |
Ah yes I see, if it's applied in different domains you can also try to mitigate this by adjusting the thr parameter. |
Hello thanks for sharing your code!
I wanted to clarify the correctness of pdac recursive implementation as currently i receive segments that are > max_segment_length.
Mostly I think the issues are in lines: #L121-L123 and #L134-L135 in the implementation that should be deleted.
Could you please explain the need for those two clauses? , from empirical experiment and by matching with the algorithm in the paper they are not needed.
The text was updated successfully, but these errors were encountered: