Core Data Analysis: Summarization, Correlation, and Visualization by Boris Mirkin

Author:Boris Mirkin
Language: eng
Format: epub, pdf
ISBN: 9783030002718
Publisher: Springer International Publishing

Given a finite set I of N elements, a collection of its subsets R  =  {R1, R2, …, Rp} is referred to as a partition if the subsets Rs are all non-empty, non-overlapping, and cover the entire set I, so that each i ∈ I belongs to a unique subset Rs, 1 ≤ s ≤ p. The subsets are called the parts of the partition R. A partition is said to be ordered if there is a linear order relation of precedence between its parts, Rs < Rt, that is transitive, anti-reflexive and complete. If the order coincides with the natural order between indices 1, 2, …, p, we use parentheses to denote this, viz. R  =  (R1, R2, …, Rp). In Decision Theory, an ordered partition is referred to as a ranking.

Each ordered partition R  =  (R1, R2, …, Rp) generates a binary preference relation

Download

Copyright Disclaimer:
This site does not store any files on its server. We only index and link to content provided by other sites. Please contact the content providers to delete copyright contents if any and email us, we'll remove relevant links or contents immediately.