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.

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

Occurrence matrix (used to compute minpts of DBSCAN) #26

Open
giusepperizzo opened this issue Dec 2, 2013 · 0 comments
Open

Occurrence matrix (used to compute minpts of DBSCAN) #26

giusepperizzo opened this issue Dec 2, 2013 · 0 comments
Assignees

Comments

@giusepperizzo
Copy link
Owner

Per each class area in the supervised task, compute the occurrence means per each category. This stage should be done before the frequency and density computation.

As applied to density count, we can think to apply the same independence assumption for computing pairs, triples, ... sets of 10 occurrences.

Worth thinking: E(#occurrence_c1), E(#occurrence_c2) > 1. This means that E1*E2 will return a value much greater. A great value of minpts will negatively affect the creation of clusters (basically all the points in the space will be labeled as noise).
We may switch to compute just the arithmetic mean when they are aggregated.

Anyway let's use the independence assumption and go ahead to E1*E2, ... .

@ghost ghost assigned jamfal Dec 2, 2013
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
None yet
Development

No branches or pull requests

2 participants