✦ LIBER ✦

Generalizations of multisets and rough approximations

✍ Scribed by Sadaaki Miyamoto

Publisher: John Wiley and Sons
Year: 2004
Tongue: English
Weight: 109 KB
Volume: 19
Category: Article
ISSN: 0884-8173
DOI: 10.1002/int.20015

No coin nor oath required. For personal study only.

✦ Synopsis

Three classes of generalizations of multisets are reviewed. They are real-valued multisets, fuzzy number-valued multisets, and fuzzy multisets. A family of generalized multisets that includes these three classes is proposed. A generalized multiset in this family has a membership of a closed region on a plane for each object. Upper and lower approximations of the generalized multisets are defined whereby rough approximations of real-valued multisets, fuzzy numbervalued multisets, and fuzzy multisets are derived. Applications to fuzzy databases and information retrieval are suggested.

📜 SIMILAR VOLUMES

Total variation asymptotics for independ

Total variation asymptotics for independent process approximations of logarithmic multisets and selections

✍ Dudley Stark 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 259 KB

Many natural unlabeled combinatorial structures, such as random partitions of the integer n, or random monic polynomials over a finite field of degree n, or unlabeled mapping patterns on n points may be described as multisets. In the usual statistical language, a multiset is an unordered sample in w

Information granulation and rough set ap

Information granulation and rough set approximation

✍ Y. Y. Yao 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 128 KB

Information granulation and concept approximation are some of the fundamental issues of granular computing. Granulation of a universe involves grouping of similar elements into granules to form coarse-grained views of the universe. Approximation of concepts, represented by subsets of the universe, d

Multiset Permutations and Loopless Gener

Multiset Permutations and Loopless Generation of Ordered Trees with Specified Degree Sequence

✍ James F. Korsh; Paul LaFollette 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 131 KB

An ordered tree with specified degree sequence and n internal nodes has a i Ž . nodes of degree i, where a s 1 q Ý i y 1 a and n s Ý a . This paper presents the first loopless algorithm for generating all ordered trees with specified degree sequence. It uses a new version of the algorithm for gener

Multisets and the Combinatorics of Symme

Multisets and the Combinatorics of Symmetrical Functions

✍ M. Mendez 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 782 KB

A generalization of the gaussian approxi

A generalization of the gaussian approximation for the analysis of diffraction data from rough surfaces

📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 317 KB

On conjoint analysis by rough approximat

On conjoint analysis by rough approximations based on dominance relations

✍ Kazutomi Sugihara; Hiroaki Ishii; Hideo Tanaka 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 83 KB 👁 1 views

Conjoint analysis is a method for deriving the part-worth value of each factor from the total evaluations. This also can be applied to multicriteria ranking or choice problems. It is generally in conjoint analysis, assumed that the value function is predefined as the additive and transitive model. H