Jump to content

Computer Science: Data Mining Help

Featured Replies

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(A­i)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!

Archived

This topic is now archived and is closed to further replies.

Important Information

We have placed cookies on your device to help make this website better. You can adjust your cookie settings, otherwise we'll assume you're okay to continue.

Configure browser push notifications

Chrome (Android)
  1. Tap the lock icon next to the address bar.
  2. Tap Permissions → Notifications.
  3. Adjust your preference.
Chrome (Desktop)
  1. Click the padlock icon in the address bar.
  2. Select Site settings.
  3. Find Notifications and adjust your preference.