Skip to content
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.

Sign up for GitHub

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

Jump to bottom

Explore DAMP #606

Open
seanlaw opened this issue May 20, 2022 · 1 comment
Open

Explore DAMP #606

seanlaw opened this issue May 20, 2022 · 1 comment
Labels
notebook reproducer

Comments

@seanlaw
Copy link
Contributor

seanlaw commented May 20, 2022 •
edited
Loading

Preprint Here

Long Version

Here is the supporting website
@seanlaw seanlaw changed the title DAMP Explore DAMP May 21, 2022
@NimaSarajpoor NimaSarajpoor mentioned this issue May 29, 2022
Open
@seanlaw seanlaw mentioned this issue Jun 23, 2022
Closed
@seanlaw
Copy link
Contributor Author

seanlaw commented Jun 9, 2023

As pointed out previously by @NimaSarajpoor regarding a very important difference between motifs vs discords, the DAMP paper (see Section 5.1.1) states:

[For discords,] note that in general we may not need to find the nearest neighbor [for every subsequence], any neighbor whose distance is less than the Best-So-Far will disqualify the current subsequence from being the discord. This suggests an early abandoning scheme that we can optimize

@NimaSarajpoor NimaSarajpoor mentioned this issue Jun 11, 2023
Open
6 tasks
@NimaSarajpoor NimaSarajpoor mentioned this issue Oct 3, 2023
Open
@NimaSarajpoor NimaSarajpoor mentioned this issue Nov 20, 2023
Open
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
notebook reproducer
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@seanlaw