miller.4314 Posted February 17, 2015 Posted February 17, 2015 I need help with a problem in my CS420 Data Mining course. The question asks to use the Relief Algorithm for feature selection. The algorithm is as follows: W(Ai)new = W(Ai)old – (diff(X[Ai], H[Ai])2 + diff(X[Ai], M[Ai])2)/m where W(Ai) is the quality score for all feature Ai, X is a randomly selected sample, H is nearest Hit, M is nearest Miss, and m is the number of randomly selected training samples. Any help with this problem would be greatly appreciated. Thanks!
Recommended Posts
Create an account or sign in to comment
You need to be a member in order to leave a comment
Create an account
Sign up for a new account in our community. It's easy!
Register a new accountSign in
Already have an account? Sign in here.
Sign In Now