Comparison of Performance for Intrusion Detection System Using Different Rules of Classification

Feature Selection Methods for Classification – a Comparison

“…[15] [16] [17] Let BA be a subset of attributes, the indiscernibility relation Ind(B) is defined as IND(B)={(x,y) /(x,y)UxU, a(x)=a(y), aB} where a(x) is the value of an attribute a of object x. x and y are said to be indiscernible with respect to a if a(x)=a(y). [16] For any concept X⊆ , the attribute subset P ⊆ , X could be approximated by the P-Upper and P-Lower approximation using the knowledge of P. The lower approximation of X is the set of objects of U that are surely in X ,where as the upper approximation of X is the set of objects of U that are possibly in X. The upper and Lower approximations are defined as follows P*(X) = { :…”