Ordinal Sum-Sets

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Rough sets and ordinal reducts

Rough set theory has been successfully applied in selecting attributes to improve the effectiveness in deriving decision trees/rules for decisions and classification problems. When decisions involve ordinal classes, the rough set reduction process should try to preserve the order relation generated by the decision classes. Previous works on rough sets when applied to ordinal decision systems st...

متن کامل

On permutation sum sets

A permutation sum (resp. difference) set on a group G is a set F of bijections from G to G such that fg (resp. f−1g) is again a bijection for all f, g ∈ F (resp. f, g ∈ F with f 6= g ∈ S), where (fg)(x) := f(x)g(x) for all x ∈ G, etc. The maximum size d(G) of a permutation difference set has been well studied, with many connections drawn between such sets and combinatorial objects such as famil...

متن کامل

Sum-Free Sets and Related Sets

A set A of integers is sum-free if A\(A+A) = ;. Cameron conjectured that the number of sum-free sets A f1; : : : ; Ng is O(2 N=2). As a step towards this conjecture, we prove that the number of sets A f1

متن کامل

Ordinal operations on graph representations of sets

Editorial Board Marat Arslanov, Kazan John T. Baldwin, Chicago, IL Douglas S. Bridges, Canterbury Armin Hemmerling, Greifswald Ramon Jansana, Barcelona Carl G. Jockusch, Urbana, IL Alexander Kechris, Pasadena, CA Ulrich Kohlenbach, Darmstadt H. Dugald Macpherson, Leeds Johann Makowsky, Haifa Andrzej Rosłanowski, Omaha, NE Jörg Rothe, Düsseldorf Wilfried Sieg, Pittsburgh, PA Stephen G. Simpson, ...

متن کامل

Ordinal Classification Using Partially Ordered Feature Sets

This paper presents a method to solve an ordinal classification problem where the objects are described with a set of partially ordered features. To construct an ordinal classification model we aggregate partial orders of features by weighting the incidence matrices of partial order graphs. To describe set of possible solutions we use partial order cones corresponding to the incidence matrices ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the American Mathematical Society

سال: 1972

ISSN: 0002-9939

DOI: 10.2307/2038479