-
Notifications
You must be signed in to change notification settings - Fork 0
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
Find the weights that maximize the distance between recovery not recovered group #13
Comments
For this we can try out a linear model with the three sum of the contrast matrix and then the weight and bias are found easily. We use the two class for the modelization. We can then visualize the points in three d space with the hyperplane made by the model. |
With attempt My (Yacine Mahdid) exchange with my collegue:
So the objectives of this index of consciousness is two-fold:
If we want to attain aim 1 or 2 we will need more than the number of timepoints we currently have (only I propose that we go with the following plan:
We are making the assumption that by using the full sum of the contrast matrix we will have separable state, but we can see that by eye that it is the case for the average so I am pretty confident we can get a robust classifier. |
Charlotte did her analysis with a similar setup, it wouldn't take too long to put something together. |
The for sure recovery group is composed of:
WSAS02,09,19 and 20
The for sure not recovered group is composed of : everyone but `WSAS10.
The text was updated successfully, but these errors were encountered: