In most rule-induction algorithms, the only operator used against nominal attributes is the equality operator =. In this paper, we first propose the use of the inequality operator, , in addition to the equality operator, to increase the expressiveness of induced rules. Then, we present a new method, Binary Coding, which can be used along with an arbitrary rule-induction algorithm to make use of...

In most rule-induction algorithms, the only operator used against nominal attributes is the equality operator =. In this paper, we first propose the use of the inequality operator, , in addition to the equality operator, to increase the expressiveness of induced rules. Then, we present a new method, Binary Coding, which can be used along with an arbitrary rule-induction algorithm to make use of...

The Meda inequality for rearrangements of the convolution operator on the Heisenberg group Hn is proved. By using the Meda inequality, an O’Neil-type inequality for the convolution is obtained. As applications of these results, some sufficient and necessary conditions for the boundedness of the fractional maximal operator MΩ,α and fractional integral operator IΩ,α with rough kernels in the spac...

by the method of weight coefficients and techniques of real analysis, ahardy-hilbert-type inequality with a general homogeneous kernel and a bestpossible constant factor is given. the equivalent forms, the operatorexpressions with the norm, the reverses and some particular examples are alsoconsidered.