Domination and Information Boundedness Principle for Aggregation

نویسنده

  • Michal Sabo
چکیده

The information boundedness principle for rule based inference process requires that the knowledge obtained as a result of a rule should not have more information than that contained in the consequent of this rule. We formulate the information boundedness principle for aggregation and show that it can be expressed using the notion of dominance. We also investigate conditions under which this principle holds and give some open problems.

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

ثبت نام

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

منابع مشابه

Uniform Boundedness Principle for operators on hypervector spaces

The aim of this paper is to prove the Uniform Boundedness Principle and Banach-Steinhaus Theorem for anti linear operators and hence strong linear operators on Banach hypervector spaces. Also we prove the continuity of the product operation in such spaces.

متن کامل

THE UNIFORM BOUNDEDNESS PRINCIPLE IN FUZZIFYING TOPOLOGICAL LINEAR SPACES

The main purpose of this study is to discuss the uniform boundednessprinciple in fuzzifying topological linear spaces. At first theconcepts of uniformly boundedness principle and fuzzy equicontinuousfamily of linear operators are proposed, then the relations betweenfuzzy equicontinuous and uniformly bounded are studied, and with thehelp of net convergence, the characterization of fuzzyequiconti...

متن کامل

Total domination in cubic Knodel graphs

A subset D of vertices of a graph G is a dominating set if for each u ∈ V (G) \ D, u is adjacent to somevertex v ∈ D. The domination number, γ(G) ofG, is the minimum cardinality of a dominating set of G. A setD ⊆ V (G) is a total dominating set if for eachu ∈ V (G), u is adjacent to some vertex v ∈ D. Thetotal domination number, γt (G) of G, is theminimum cardinality of a total dominating set o...

متن کامل

Information boundedness principle in fuzzy inference process

The information boundedness principle requires that the knowledge obtained as a result of an inference process should not have more information than that contained in the consequent of the rule. From this point of view relevancy transformation operators as a generalization of implications are investigated.

متن کامل

Domination of Aggregation Operators and Preservation of Transitivity

Aggregation processes are fundamental in any discipline where the fusion of information is of vital interest. For aggregating binary fuzzy relations such as equivalence relations or fuzzy orderings, the question arises which aggregation operators preserve specific properties of the underlying relations, e.g. T -transitivity. It will be shown that preservation of T -transitivity is closely relat...

متن کامل

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


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

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

ثبت نام

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

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007