Random inverse packet information and its acquisition

Xiuqing Yu; Fengsheng Xu

doi:10.2478/amns.2020.2.00042

Abstract

Packet sets and inverse packet sets are two kinds of novel mathematical tools to analyze dynamic information systems. With advances in inverse packet sets, random inverse packet information is proposed by introducing random characteristics into inverse packet sets. Hence, random inverse packet information has dynamic and random characteristics, and is an extended form of inverse packet sets. Furthermore, random feature, dynamic feature, and identification relation about the random inverse packet information are discussed. Finally, based on the above theory, an instance is used to illustrate the applications of intelligent acquisition of investment information.

Keywords:: inverse packet set; random inverse packet information; random and dynamic characteristics; F18996

1 Introduction

With regard to finite common set theory with static feature, research on some dynamic systems often faced problems because change always exists. It became necessary to construct a new kind of set model with dynamic characteristics. Hence, Refs. [1,2,3,4] proposed two types of dynamic set models-packet sets and inverse packet sets (IPSs), by replacing “static” with “dynamic” to improve the finite common set. These dynamic set models provide a better theory foundation for dealing with dynamic applied systems. Later, the mathematical characteristics of the new sets such as quantitative characteristics, algebraic characteristics, geometrical characteristics, genetic characteristics, random characteristics, and theory applications are discussed by more and more scholars [4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22]. Especially, literatures [5,6,7,8,9,10,11,12,13,14,15,16,17] developed the latter model by taking information instead of sets to obtain the inverse packet information (IPI) model and provide some applications for information fusion–separation, hidden information discovery, intelligent data digging, and big decomposition–fusion acquisition. However current research on random inverse packet information (RIPI) is rare. Hence, we consider the probabilities of information element migration in IPI and present some concepts about the RIPI and their structures. Furthermore, the random feature, dynamic characteristics, and identification relations on RIPI are discussed and applied to intelligent acquisition–separation of investment information.

Convention: (x) = {x₁, x₂, ···, x_s} ⊂ U is a nonempty finite ordinary information and α ⊂ V is its nonempty attribute set; F,F̅ are information transition function families in which f ∈ F, f̅ ∈ F̅ are transition functions, whose detailed characteristics and occurrence probabilities can be found in Hao et al. [23]. The occurrence probabilities of two events ${x_{i} | w_{i} \bar{\in} (x), f (w_{i}) = x_{i} \in (x)}$ , ${x | x \in (x), \bar{f} (x) = w \bar{\in} (x)}$ are simply written as p_F(f) and p_F̅(f̅) in order.

2 RIPI and its construction

The theory model of IPSs [3, 4] with the inner IPS X̅^F and exterior IPS X̅^F̅ combined, has the following dynamic characteristics: given a finite common element set X = {x₁, x₂, ..., x_r} with α = {α₁,α₂,...,α_r′}. I. If some added attributes are transferred by f to α and to get α^F such that α ⊆ α^F, then some extra elements are accordingly removed to X to generate a new element set called inner IPS X̅^F, X ⊆ X̅^F. II. If some attributes are transferred by f̅ from α to generate α^F̅ such that α^F̅ ⊆ α, then some elements in X are accordingly deleted to generate a new element set called exterior IPS X̅^F̅, X̅^F̅ ⊆ X. III. If it happens in the same time that some extra attributes are moved into α and some other attributes in α are migrated out, that is, α becomes α^F, and meanwhile α does α^F̅, α^F̅ ⊆ α ⊆ α^F, then X becomes an IPS(X̅^F, X̅^F̅), which fulfills X̅^F̅ ⊆ X ⊆ X̅^F and has dynamic characteristics. All of the IPSs generated by setX constitute a set family called the IPS family ${(X_{i}^{\bar{F}}, X_{j}^{F}) | i \in I, j \in J}$ [3]. Especially, if the above process occurs continuously, X would dynamically generate a linked IPS $({\bar{X}}_{1}^{F} {\bar{X}}_{1}^{\bar{F}}), ({\bar{X}}_{2}^{F} {\bar{X}}_{2}^{\bar{F}}), ..., ({\bar{X}}_{s}^{F} {\bar{X}}_{s}^{\bar{F}})$ , which has the relation ${\bar{X}}_{i}^{F} \subseteq {\bar{X}}_{i + 1}^{F}$ and ${\bar{X}}_{i + 1}^{\bar{F}} \subseteq {\bar{X}}_{i}^{\bar{F}}$ , i = 1, 2, ..., s. Let us treat the sets X̅^F̅, X, X̅^F as information indicated orderly by (x̅)^F,(x), and (x̅)^F̅. Then we obtain IPI((x̅)^F, (x̅)^F̅) with all the characteristics of IPS [18,19,20,21,22].

For inner IPI (x̅)^F, the dynamic process is shown by adding information elements under the condition that some attributes are migrated into α, as ∃w_i ∉ (x), f(w_i) = x_i ∈ (x), where (x̅)^F indicates (x) ∪ {x_i | w_i ∉ (x), f(w_i) = x_i ∈ (x)}. For exterior IPI (x̅)^F̅, the dynamic process is done by some elements in (x) migrated out under the condition that some attributes in α are removed out, as ∃x_i ∈ (x), f̅(x_i) = w_i ∉ (x), where (x̅)^F̅ indicates (x) − {x_i ∈ (x)|f̅(x_i) = w_i ∉ (x)}. Obviously, all of the inner IPI and exterior IPI generated by (x) can, respectively, form an inner IPI family and an exterior IPI family expressed as ${(\bar{x})_{i}^{F} | i \in I}$ , ${(\bar{x})_{j}^{F} | j \in J}$ . Certainly, all of the IPI generated by(x) can also form an IPI family as $Φ (x) = {((\bar{x})_{i}^{F}, (\bar{x})_{j}^{F}) | i \in I, j \in J}$ . Considering ${x_{i} | u_{i} \bar{\in} (x), f (u_{i}) = x_{i} \in (x)}$ as an event, ${(\bar{x})}_{i}^{F}$ is obtained in the case of the event occurrence probability equal to 1, namely, (x̅)^F is obtained with the fact that ${x_{i} | u_{i} \bar{\in} (x), f (u_{i}) = x_{i} \in (x)}$ is bound to happen. As we know, it is stochastic that w_i ∉ (x) is transferred in(x) by f. The same goes for exterior IPI and IPI [23].

Definition 1

is called random inner IPI generated by (x) depending on information element migration probability σ, generally written as random inner IPI, such that

{(\bar{x})}^{_{F σ}} = (\bar{x})^{F} \cup {(\bar{x})}_{σ}^{+},

(1)

{(\bar{x})}_{σ}^{+}

is called the added random information with

{(\bar{x})}_{σ}^{+} = {x | w \bar{\in} (x), p ({f (w) = x \in (x)}) \in [σ, 1]}

(2)

on condition that α^F fulfills

α^{F} = α \cup {α^{'} | δ \in V, δ \bar{\in} α, f (δ) = α^{'} \in α}

(3)

where σ ∈ (0, 1) and α^F are also thought to be the attribute sets of (x̅)^Fσ.

Definition 2

(x̅)^F̅σ is called the random exterior IPI obtained by (x) depending on information element migration probability σ, briefly written as random exterior IPI, such that

{(\bar{x})}^{\bar{F} σ} = (\bar{x})^{\bar{F}} - {x | x \in (x), p ({\bar{f} (x) = w \bar{\in} (x)}) \in [σ, 1)},

(4)

{(\bar{x})}_{σ}^{-}

is called deleted random information with

{(\bar{x})}_{σ}^{-} = {x | x \in (x), p ({\bar{f} (x) = w \bar{\in} (x)}) \in [σ, 1]}

(5)

on condition that α^F̅ fulfills

α^{\bar{F}} = α - {α_{i} | α_{i} \in α, \bar{f} (α_{i}) = δ_{i} \bar{\in} α}

(6)

where the nonempty attribute set α^F̅ of (x̅)^F̅ is also that of (x̅)^F̅σ ≠ ∅ and σ ∈ (0, 1).

Definition 3

The information pair formed by the random inner IPI and the random exterior IPI generated by (x) is called a random IPI generated by (x) depending on information element migration probability σ, also called RIPI as

((\bar{x})^{F σ}, (\bar{x})^{\bar{F} σ})

(7)

where (α^F, α^F̅) is also the attribute set of ((x̅)^Fσ, (x̅)^F̅σ).

Considering Definitions 1–3 and the above assumption, it is easily noted that Formulas (1) and (4) can, respectively, be represented with other forms as the following:

{(\bar{x})}^{_{F σ}} = (\bar{x}) \cup {(\bar{x})}_{σ}^{+} = (x) \cup {x | w \bar{\in} (x), p_{F} (f) \in [σ, 1]}

(8)

{(\bar{x})}^{\bar{F} ρ} = (x) - {(\bar{x})}_{σ}^{-} = (x) - {x | x \in (x), p_{\bar{F}} (\bar{f}) \in [σ, 1]}

(9)

Formulas (8) and (9) show RIPI to be as one information pair generated by not only the corresponding IPI, but also the ordinary information (x), as shown in Fig. 1.

All of the RIPI generated by information (x) constitute an RIPI family as

R Φ (x) = {((\bar{x})_{i}^{F σ}, (\bar{x})_{j}^{\bar{F} σ}) | σ \in (0, 1), i \in I, j \in J} .

(10)

According to Definitions 1–3, Propositions 1–4 are simply derived as follows.

Proposition 1

Let p_F(f) ≡ 0 for ∀f ∈ F, then (x̅)^F, (x̅)^Fσ are not indentified expressed as UNI((x̅)^F, (x̅)^Fσ).

Proposition 2

Let p_F̅(f̅) ≡ 0 for ∀f̅ ∈ F̅, then UNI((x̅)^F̅, (x̅)^F̅σ).

Proposition 3

Let p_F̅(f̅) = p_F(f) ≡ 0 for ∀f̅ ∈ F̅ and ∀f ∈ F, then UNI(((x̅)^F, (x̅)^F̅), ((x̅)^Fσ, (x̅)^F̅σ)).

Proposition 4

For ∀σ ∈ (0, 1), there is UNI(Φ(x), RΦ(x)).

Propositions 1–4 state that RIPI ((x̅)^Fσ, (x̅)^F̅σ) is the extension of ((x̅)^F, (x̅)^F̅), and ((x̅)^F, (x̅)^F̅) is the particular case of ((x̅)^Fσ, (x̅)^F̅σ). Under certain conditions, RIPI could restore to homologous IPI, and to information (x).

Theorem 1

(Relation theorem between RIPI and IPI) Assume ((x̅)^Fσ, (x̅)^F̅σ) ∈ RΦ(x) and ((x̅)^F, (x̅)^F̅) ∈ Φ(x), then for ∀σ ∈ (0, 1) we have

((\bar{x})^{F σ}, (\bar{x})^{\bar{F} σ})

(11)

where Formula (11) represents the relation of Fig. 1.

Proof

The assumption condition and Formulas (1) and (4) guarantee that (x̅)^F ⊆ (x̅)^Fσ and (x̅)^F̅σ ⊆ (x̅)^F̅ are fulfilled. According to the definition of IPI derived by common information (x) in Refs [3, 4, and 18], we can obtain (x̅)^F̅ ⊆ (x̅)^F. Hence, we get Formula (11) by set hereditary property.

Theorem 2

(Generation theorem of RIPI) Assume that (α^F, α^F̅) is the attribute sets of RIPI ((x̅)^Fσ, (x̅)^F̅σ). There exists the nonempty pair (Δα, ∇α) ≠ ∅ such that α^F − (α ∪ Δα) = ∅ and α^F̅ − (α − ∇α) = ∅, where (Δα, ∇α) ≠ ∅ is equal to Δα ≠ ∅ and ∇α ≠ ∅.

Proof

Let ((x̅)^Fσ, (x̅)^F̅σ) be different from (x), namely, (x̅)^Fσ = (x̅)^F̅σ = (x) fails the Theorem 2 condition, then there exists one working between (x̅)^Fρ ≠ (x) and (x̅)^F̅ρ ≠ (x) at least. Let us assume that (x̅)^Fσ ≠ (x), the generating process of random inner IPI (x̅)^Fρ depending on its attribute set α^F points out that α^F meets α ⊂ α^F. Assuming Δα = α^F − α, we obtained Δα ≠ ∅ and α^F − (α ∪ Δα) = ∅ according to Definition 1. In the same way, it is proved that there exists ∇α ≠ ∅ such that α^F̅ − (α − ∇α) = ∅.

3 RIPI characteristics

Supplementing some additional attributes into α, some information elements would be migrated into information (x) depending on certain probability in succession and form a chain of random inner IPI showing the following dynamic process:

{(\bar{x})}_{1}^{F σ} \subseteq {(\bar{x})}_{2}^{F σ} \subseteq ... \subseteq {(\bar{x})}_{s}^{F σ}

(12)

Deleting some attributes out from α continuously, some information elements in (x) are migrated successively, depending on certain probability and form a chain of random exterior IPI showing the dynamic process as follows:

{(\bar{x})}_{s}^{\bar{F} σ} \subseteq {(\bar{x})}_{s - 1}^{\bar{F} σ} \subseteq ... \subseteq {(\bar{x})}_{1}^{\bar{F} σ}

(13)

If the above change processes take place at the same time, we obtain a chain of the RIPI implying the dynamic process as

((\bar{x})_{i}^{F σ}, (\bar{x})_{i}^{\bar{F} σ})

(14)

According to Formulas (12)–(14), we get the dynamic characteristics depending on the attribute sets indicated by Theorems 3–5.

Theorem 3

(Depending attribute theorem of RIPI) Let ${(\bar{x})}_{i}^{F ρ}$ , $(\bar{x})_{j}^{F ρ}$ be the random inner IPI and $α_{i}^{F}$ , $α_{j}^{F}$ expressing their attribute sets in order. Then ${(\bar{x})}_{i}^{F σ} \subseteq {(\bar{x})}_{j}^{F σ} iff α_{i}^{F} \subseteq α_{j}^{F}$ .

Theorem 4

(Depending attribute theorem of RIPI) Let ${(\bar{x})}_{i}^{\bar{F} ρ}$ , $(\bar{x})_{j}^{\bar{F} ρ}$ be random exterior IPI and $α_{i}^{F}$ , $α_{j}^{F}$ expressing their attribute sets in order. Then ${(\bar{x})}_{j}^{\bar{F} σ} \subseteq {(\bar{x})}_{i}^{\bar{F} σ} iff α_{j}^{\bar{F}} \subseteq α_{i}^{\bar{F}}$ .

Theorem 5

(Depending attribute theorem of RIPI) Let $((\bar{x})_{i}^{F σ}, (\bar{x})_{i}^{\bar{F} σ})$ , $((\bar{x})_{j}^{F σ}, (\bar{x})_{j}^{\bar{F} σ}) \in R Φ (x)$ and $(α_{i}^{F}, α_{i}^{\bar{F}})$ , $(α_{j}^{F}, α_{j}^{\bar{F}})$ be their attribute sets, respectively. Then $({(\bar{x})}_{i}^{F σ}, {(\bar{x})}_{i}^{\bar{F} σ}) \begin{matrix} \subseteq \\ \supset \end{matrix} ({(\bar{x})}_{j}^{F σ}, {(\bar{x})}_{j}^{\bar{F} σ}) iff (α_{i}^{F}, α_{i}^{\bar{F}}) \begin{matrix} \subseteq \\ \supset \end{matrix} (α_{j}^{F}, α_{j}^{\bar{F}})$ .

Inference 1 Let card(V − α) = t. Then information (x) can generate t! dynamic chains of RIPI.

Inference 2 Let card(α) = m. Then information (x) can generate m! dynamic chains of random exterior IPI.

Inference 3 Let card(α) = m and card(V − α) = t. Then information (x) can generate t! × m! dynamic chains of RIPI.

According to the dynamic characteristics of RIPI, the measurement of dynamic change degree is proposed in Definitions 4–6.

Definition 4

Let (x̅)^Fσ be a random inner IPI derived by (x). Then call the real number γ(x̅)^Fσ to be F−measure degree of (x̅)^Fσ relative to (x) as

γ {(\bar{x})}^{F σ} = ∥ x^{(F σ)} - x^{(0)} ∥ / ∥ x^{(0)} ∥

(15)

where (x) = {x₁,x₂,..x_s},(x)^Fσ = {x₁,x₂,..x_s,x_s₊₁,...,x_s_+t}; the sequence of information value is expressed as

\begin{matrix} x_{i} = (x_{i 1}, x_{i 2}, ..., x_{im}), i = 1, 2, ..., s + t, x_{ik} \in [0, 1], and \\ x^{(0)} = (\sum_{i = 1}^{s} x_{i 1}, \sum_{i = 1}^{s} x_{i 2}, ..., \sum_{i = 1}^{s} x_{im}), \\ x^{(F σ)} = (\sum_{i = 1}^{s + t} x_{i 1}, \sum_{i = 1}^{s + t} x_{i 2}, ..., \sum_{i = 1}^{s + t} x_{im}), \\ ∥ x^{(F σ)} - x^{(0)} ∥ = [\sum_{k = 1}^{m} {(\sum_{i = 1}^{s + t} x_{ik} - \sum_{i = 1}^{s} x_{ik})}^{ρ}]^{1 / ρ},, \\ ∥ x^{(0)} ∥ = [\sum_{k = 1}^{m} {(\sum_{i = 1}^{s} x_{ik})}^{ρ}]^{1 / ρ}, k = 1, 2, ..., m, ρ \in Z^{+} . \end{matrix}

Definition 5

Let (x̅)^F̅σ be a random exterior IPI derived by (x). Then call γ(x̅)^F̅σF̅ − measure degree of (x̅)^F̅σ relative to (x) as

γ {(\bar{x})}^{\bar{F} σ} = ∥ x^{(0)} - x^{(\bar{F} σ)} ∥ / ∥ x^{(0)} ∥

(16)

where (x) = {x₁,x₂,..x_s},(x)^F̅σ = {x₁,x₂,..x_s−_p}, 0 ≤ p < s, p ∈ Z⁺; x⁽⁰⁾ and ‖ x⁽⁰⁾ ‖ are the same as Definition 4, and the sequence of information value is written as

\begin{matrix} x_{i} = (x_{i 1}, x_{i 2}, ..., x_{im}), x_{ik} \in [0, 1], i = 1, 2, ..., s, and \\ x^{(\bar{F} σ)} = (\sum_{i = 1}^{s - p} x_{i 1}, \sum_{i = 1}^{s - p} x_{i 2}, ..., \sum_{i = 1}^{s - p} x_{im}), \\ ∥ x^{(0)} - x^{(\bar{F} σ)} ∥ = [\sum_{k = 1}^{m} {(\sum_{i = 1}^{s} x_{ik} - \sum_{i = 1}^{s - p} x_{ik})}^{ρ}]^{1 / ρ} . \end{matrix}

Definition 6

Let ((x̅)^Fσ, (x̅)^F̅σ) be an RIPI generated by (x). Then call the real number pair composed by Formulas (15) and (16) to be (F, F̅)−measure degree of ((x̅)^Fσ, (x̅)^F̅σ) relative to (x), and

(γ {(\bar{x})}^{F σ}, γ {(\bar{x})}^{\bar{F} σ})

(17)

Because ((x̅)^F,(x̅)^F̅) is a special case of ((x̅)^Fσ, (x̅)^F̅σ), (γ(x̅)^F, γ(x̅)^F̅) is chosen to express (F, F̅)− measure degree of ((x̅)^F,(x̅)^F̅) when UNI((x̅)^F, (x̅)^Fσ), UNI((x̅)^F̅, (x̅)^F̅σ) in Definitions 4 and 5.

Formula (15) notes the change measurement between (x̅)^F_p and (x) caused by attribute supplementing set Δα; the same goes for Formulas (16) and (17). Thus Propositions 5–7 can be obtained.

Proposition 5

Given F − measure degree γ(x̅)^Fσ, γ(x̅)^Fσ ≠ 0 iff IDE((x̅)^Fσ, (x)) or IDE(α^F,α).

Proposition 6

Given F̅ − measure degree γ(x̅)^F̅σ, γ(x̅)^F̅σ ≠ 0 iff IDE((x̅)^F̅σ, (x)) or IDE(α^F̅, α).

Proposition 7

Given(F, F̅)−measure degree (γ(x̅)^Fσ, γ(x̅)^F̅σ), (γ(x̅)^Fσ, γ(x̅)^F̅σ) ≠ 0 iff IDE(((x̅)^Fσ, (x̅)^F̅σ),(x)) or IDE((α^F, α^F̅),α).

Theorem 5

Let(x̅)_i^Fσ, (x̅)_j^Fσbe random inner IPI. Then (x̅)_i^Fσ ⊆ (x̅)_j^Fσiff γ_i(x)^Fσ ≤ γ_j(x)^Fσ.

Proof

Considering (x̅)_j^Fσ = {x₁,x₂,x₃,...,x_q} and (x̅)_j^Fσ = {x₁,x₂,x₃,...,x_q,x_q+1,...x_q+t}, (x̅)_i^Fσ ⊆ (x̅)_j^Fσ implies that (x̅)_j^Fσ is a sub-information of (x̅)_i^Fσ, so

\sum_{i = 1}^{q} x_{ik} \leq \sum_{i = 1}^{q + t} x_{ik}, k = 1, 2, ..., m

iff

γ_{i} {(\bar{x})}^{F σ} = ∥ x_{i}^{(F σ)} - x^{(0)} ∥ / ∥ x^{(0)} ∥ \leq γ_{j} {(\bar{x})}^{F σ} = ∥ x_{j}^{(F σ)} - x^{(0)} ∥ / ∥ x^{(0)} ∥ .

Accordingly, we have the following result.

Theorem 6

Suppose that (x̅)_i^F̅σ and (x̅)_j^F̅σ are random exterior IPI. Then (x̅)_i^F̅σ ≤ (x̅)_j^F̅σ iff γ_i(x)^F̅σ ≤ γ_j(x)^F̅σ.

Inference 4 Suppose ((x̅)_i^Fσ, (x̅)_i^F̅σ), ((x̅)_j^Fσ, (x̅)_j^F̅σ) are RIPI.

({(\bar{x})}_{i}^{F σ}, {(\bar{x})}_{i}^{\bar{F} σ}) \begin{matrix} \subseteq \\ \supset \end{matrix} ({(\bar{x})}_{j}^{F σ}, {(\bar{x})}_{j}^{\bar{F} σ}) iff (γ_{i} {(\bar{x})}^{F σ}, γ_{i} {(\bar{x})}^{\bar{F} σ}) \begin{matrix} \leq \\ > \end{matrix} (γ_{j} {(\bar{x})}^{F σ}, γ_{j} {(\bar{x})}^{\bar{F} σ})

where

(γ_{i} {(\bar{x})}^{F σ}, γ_{i} {(\bar{x})}^{\bar{F} σ}) \begin{matrix} \leq \\ > \end{matrix} (γ_{j} {(\bar{x})}^{F σ}, γ_{j} {(\bar{x})}^{\bar{F} σ})

implies that γ_i(x̅)^Fσ ≤ γ_j(x̅)^Fσ and γ_i(x̅)^F̅σ ≥ γ_j(x̅)^F̅σ.

4 Applications of RIPI model in intelligent acquisition–separation of investment information

For convenience, call x⁽⁰⁾ the information value and x^(Fσ) the inner IPI value in Definition 4; call x^(F̅ρ) the exterior IPI value based on which Definition 7 is given.

Definition 7

Call

if α \Rightarrow α^{F}, then x^{(0)} \Rightarrow x^{(F σ)}

(18)

an inner RIPI reasoning in which α ⇒ α^F,x⁽⁰⁾ ⇒ x^(Fσ) are equivalent to α ⊆ α^F,x⁽⁰⁾ ⊆ x^(Fσ), respectively; call

if α \Rightarrow α^{\bar{F}}, then x^{(\bar{F} σ)} \Rightarrow x^{(0)}

(19)

an exterior RIPI reasoning in which α^F̅ ⇒ α and x^(F̅σ) ⇒ x⁽⁰⁾ are equivalent so that α^F̅, x^(F̅σ) are subsets of α,x⁽⁰⁾, respectively.

Proposition 8

If $α_{i}^{F} \Rightarrow α_{i + 1}^{F}$ , then $γ {(\bar{x})}_{i}^{F σ} \leq γ {(\bar{x})}_{i + 1}^{F σ}$ in which the attribute sets of ${(\bar{x})}_{i}^{F}$ , $(\bar{x})_{i + 1}^{F}$ are $α_{i}^{F}$ , $α_{i + 1}^{F}$ , respectively, and they satisfy $α_{i + 1}^{F} = α_{i}^{F} \cup {α^{'} | δ \in V, δ \notin α, f (δ) = α^{'} \in α}$ , δ ∉ α, f (δ) = α′ ∈ α}.

Proposition 9

If $α_{i + 1}^{\bar{F}} \Rightarrow α_{i}^{\bar{F}}$ , then $γ {(\bar{x})}_{i + 1}^{\bar{F} σ} \leq γ {(\bar{x})}_{i}^{\bar{F} σ}$ in which the attribute sets of ${(\bar{x})}_{i}^{\bar{F}}$ , $(\bar{x})_{i + 1}^{\bar{F}}$ are $α_{i}^{\bar{F}}$ , $α_{i + 1}^{\bar{F}}$ , respectively, and they satisfy $α_{i + 1}^{\bar{F}} = α_{i}^{F} - {α_{k} | α_{k} \in α, \bar{f} (α_{k}) = δ_{k} \notin α}$ .

Assumption

For simplicity, this section only proposes the applications of random inner IPI in intelligent separation–acquisition of investment information. Suppose that W is a group company that produces petroleum and chemical products W = {W₁,W₂,W₃,W₄,W₅}, where W_i ∈ W, i = 1,2,3,4,5 are subsidiary corporations of W. α = {α₁,α₂,α₃,α₄,α₅,α₆} is the attribute set of W (product market characteristics of W). Information form of W is (x) = {x₁,x₂,x₃,x₄,x₅}. Due to trade secret, the group company and its subsidiary corporations and attributes (market characteristics) are expressed as W,W_i, and α₁,α₂,α₃,α₄,α₅,α₆, respectively. x⁽⁰⁾,

x_{i}^{(0)}

are profit discrete value distributions of W,W_i from January to June in 2019 as

\begin{matrix} x^{(0)} = (x_{1}^{(0)}, x_{2}^{(0)}, x_{3}^{(0)}, x_{4}^{(0)}), \\ x_{i}^{(0)} = (x_{i 1}^{(0)}, x_{i 2}^{(0)}, x_{i 3}^{(0)}, ..., x_{i 6}^{(0)}), i = 1, 2, 3, 4 . \end{matrix}

Values in x⁽⁰⁾,

x_{i}^{(0)}

are derived from dealing with the real profit value, and the results do not influence the analysis of the case. The profit discrete distributions x⁽⁰⁾,

x_{i}^{(0)}

of W,W_i are listed in Table 1.

Table 1

The profit discrete distributions x⁽⁰⁾, $x_{i}^{(0)}$ of W,W_i,i = 1,2,3,4 from June to December in 2019

k	1	2	3	4	5	6
$x_{1 k}^{(0)}$	0.51	0.30	0.52	0.22	0.50	0.44
$x_{2 k}^{(0)}$	0.21	0.28	0.45	0.36	0.66	0.53
$x_{3 k}^{(0)}$	0.43	0.29	0.60	0.40	0.28	0.24
$x_{4 k}^{(0)}$	0.19	0.35	0.48	0.66	0.67	0.26

By profit discrete distribution in Table 1, the profit information value of W is

\begin{matrix} x^{(0)} = (x_{1}^{(0)}, x_{2}^{(0)}, x_{3}^{(0)}, x_{4}^{(0)}) = (\sum_{i = 1}^{4} x_{i 1}^{(0)}, \sum_{i = 1}^{4} x_{i 2}^{(0)}, \sum_{i = 1}^{4} x_{i 3}^{(0)}, \sum_{i = 1}^{4} x_{i 4}^{(0)}, \sum_{i = 1}^{4} x_{i 5}^{(0)}, \sum_{i = 1}^{4} x_{i 6}^{(0)}) \\ = (1.34, 1.22, 2.05, 1.64, 2.11, 1.47) . \end{matrix}

A global disease COVID-19 broke out during preliminary stage in 2020 and caused a series of economic changes such as some manufacturing industry profits reduced in different probabilities. In contrast, products relating to protective apparatus, therapeutic apparatus, their appurtenance, and so on, have great market potential and earn better profit in big probabilities. This random dynamic change suited the RIPI model in this paper. For simplicity, this section only considers the latter.

Suppose that α₇ = outbreakofCOVID − 19 and the attribute set of (x) is α = {α₁,α₂,α₃,α₄,α₅,α₆}, then α^F is derived through transferring α₇ into α as

\begin{matrix} α^{F} = {α_{1}, α_{2}, α_{3}, α_{4}, α_{5}, α_{6}} \cup {α_{7}} \\ = {α_{1}, α_{2}, α_{3}, α_{4}, α_{5}, α_{6}, α_{7}} . \end{matrix}

(20)

Under the condition, sub-companies W₆,W₇,W₈,

W_{9} \bar{\in} W

(specific products of W₅,W₆,W₇,W₈ omit) would bring much profit differently with probabilities 1,0.8,0.75,0.67 after overall consideration. If probability ρ = 0.8 is chosen, then W₅,W₆ turn into W to form W^F^0.8 whose information is (x)^Fσ = {x₁,x₂,x₃,...,x₆},

\begin{matrix} x^{(F 0.8)} = (x_{1}^{(F 0.8)}, x_{2}^{(F 0.8)}, x_{3}^{(F 0.8)}, x_{4}^{(F 0.8)}, x_{5}^{(F 0.8)}, x_{6}^{(F 0.8)}), \\ x_{i}^{(F 0.8)} = (x_{i 1}^{(F 0.8)}, x_{i 2}^{(F 0.8)}, x_{i 3}^{(F 0.8)}, x_{i 4}^{(F 0.8)}, x_{i 5}^{(F 0.8)}, x_{i 6}^{(F 0.8)}), i = 1, 2, 3, 4, 5, 6 . \end{matrix}

(21)

The detailed profit discrete distribution of W^F^0.8 is shown in Table 2.

Table 2

The profit discrete distributions x^(F0.8), $x_{i}^{(F 0.8)}$ of group company W^F0.8 and sub-company W_i,i = 1,2,3,4,5,6 from January to June in 2020

k	1	2	3	4	5	6
$x_{1 k}^{(F ρ)}$	0.51	0.30	0.52	0.22	0.50	0.44
$x_{2 k}^{(F ρ)}$	0.21	0.28	0.45	0.36	0.66	0.53
$x_{3 k}^{(F ρ)}$	0.43	0.28	0.60	0.40	0.28	0.24
$x_{4 k}^{(F ρ)}$	0.19	0.35	0.48	0.66	0.67	0.26
$x_{5 k}^{(F ρ)}$	0.61	0.60	0.72	0.69	0.65	0.70
$x_{6 k}^{(F ρ)}$	0.71	0.69	0.82	0.72	0.66	0.69

By profit discrete distribution in Table 2, the profit information value of W^F^0.8 is

\begin{matrix} x^{(F 0.8)} = (x_{1}^{(F 0.8)}, x_{2}^{(F 0.8)}, x_{3}^{(F 0.8)}, x_{4}^{(F 0.8)}, x_{5}^{(F 0.8)}, x_{6}^{(F 0.8)}) \\ = (\sum_{i = 1}^{6} x_{i 1}^{(F 0.8)}, \sum_{i = 1}^{6} x_{i 2}^{(F 0.8)}, \sum_{i = 1}^{6} x_{i 3}^{(F 0.8)}, \sum_{i = 1}^{6} x_{i 4}^{(F 0.8)}, \sum_{i = 1}^{6} x_{i 5}^{(F 0.8)}, \sum_{i = 1}^{6} x_{i 6}^{(F 0.8)}) \end{matrix}

= (2.66, 2.51, 3.59, 3.05, 3.42, 2.86), (22)

γ {(x)}^{F 0.8} = ∥ x^{(F 0.8)} - x^{(0)} ∥ / ∥ x^{(0)} ∥ = 0.857,

(22)

Analysis on intelligent acquisition of RIPI(x)^Fρ

On the condition that α^F is generated by supplementing attributes α₇ into α, one can obtain the random inner inverse packet information (x)^F0.8 = {x₁,x₂,x₃,...,x₆} based on information (x) = {x₁,x₂,x₃,x₄} through using Definition 1 and fulfill Formula (18).

x^(F0.8) is intelligently separated out and acquired. If α₇ does not occur, x^(F0.8) would never have been gained, or (x)^Fσ would never have been known depending on the probability 0.8. The example simply tells us that the following:

When α and α^F satisfy α ⊆ α^F, information (x)^Fσ is intelligently discovered randomly out of information (x) by using the random inner inverse packet information generation model. While W₅,W₆ are found out of W due to (x)^Fσ.
When α₇ is thought to be a chance attribute and it invades the attribute se tα. Random inner IPI (x)^Fσ is generated by (x) in Definition 1.
When the chance attributes α₇ invades α, the profit discrete distribution data x⁽⁰⁾ of group company is turned to x^(Fσ), which makes the profit of W increase. This conclusion has been proved in the financial statement published by W.
Formula (23) means that W₅,W₆ will bring the extra profit 85.7% with a probability of 0.8 or greater.

5 Discussion

In Refs. [3, 4], dynamic feature was brought into common set X and proposed the structure of IPS. Based on IPS, IPI, and its applications in resolving practical problems with dynamic characteristics and heredity are discussed in [8,13,17,20, and 21]. The randomness of element transfer is considered in this paper according to the dynamic characteristics of IPI [23]. By integrating the possibility knowledge into IPI, this paper proposes the concepts and structures of RIPI and their applications. RIPI theory enriches IPI and enlarges its application category. It also provides a new theory tool for studying the information system.

Acknowledgment

The authors acknowledge the National Statistical Science Research Project (Grant No: 2018LY14).

References

[1]↑
Kaiquan Shi. P-sets [J]. Journal of Shandong University (Natural Science), 2008, 43(11):78–84(in Chinese).
[2]↑
Kaiquan Shi. Big data structure-logic characteristics and big data law[J]. Journal of Shandong University (Natural Science), 2019, 54(2):1–29 (in Chinese).
[3]↑
Kaiquan Shi. Inverse P-set[J]. Journal of Shandong University: Natural Science 2012, 47(1):98–103 (in Chinese).
[4]↑
Hualong Guo, Baohui Chen, Jihua Tang. Inverse P-sets and intelligent fusion mining-discovery of information [J]. Journal of Shandong University (Natural Science), 2013, 13(8):97–103 (in Chinese).
[5]↑
Xiumei Hao, Xiuqing Jiang. Structure characteristics on probability rough information matrix[J]. Fuzzy Systems and Mathematics, 2017, 31(3):153–158 (in Chinese).
[6]↑
Kaiquan Shi. P-information law intelligent fusion and soft information image intelligent generation[J]. Journal of Shandong University (Natural Science), 2014, 49(4):1–17 (in Chinese).
[7]↑
Xiaochao Li. An algebraic model of P-set [J]. Journal of Shangqiu Normal University, 2020, 36(3):1–5 (in Chinese).
[8]↑
Kaiquan Shi. P-sets, inverse P-sets and the intelligent fusion-filter identification of information [J]. Computer Science, 2012, 39(4):1–13 (in Chinese).
[9]↑
Jiqin Liu, Haiyue Zhang. Information P-dependence and P-dependence mining-sieving[J]. Computer Science, 2018, 45 (7): 202–206 (in Chinese).
[10]↑
Ling Zhang, Jihua Tang, Kaiquan Shi. The fusion of internal P-information and its feature of attribute conjunction[J]. Journal of Shandong University (Natural Science), 2014, 49(2): 93–97 (in Chinese).
[11]↑
Xiumei Hao, Ningning Li. Quantitative characteristics and applications of P-information hidden mining [J]. 2019, 54(9): 9–14 (in Chinese).
[12]↑
Fengsheng Xu, Xiuqing Yu, Lihua Zhang. Intelligent fusion of information and reasoning generation of its P-augmented matrix [J]. Journal of Shandong University (Natural Science), 2019, 54(9):9–14 (in Chinese).
[13]↑
Hongkang Lin, Chengxian Fan. The dual form P-reasoning and identification of unknown attribute [J]. International Journal of Digital Content Technology and its Applications, 2012, 6(1):121–131.
- Crossref
- Export Citation
[14]↑
Fengsheng Xu, Xiuqing Yu. Surplus-loss value theorems of attribute cardinal numbers and inner-exterior separation of information laws[J]. Journal of Shandong University (Natural Science), 2017, 52(4):87–92 (in Chinese).
[15]↑
Xiumei Hao, Tongtong Ren. F̅-ladder knowledge and F̅-hiding knowledge discovery [C]//Proceedings of the 2015 International Conference on Fuzzy Systems and Knowledge Discovery. Zhangjiajie: IEEE, 2015:1010–1016.
[16]↑
Kaiquan Shi. Function P-sets [J]. International Journal of Machine Learning and Cybernetics, 2011, 2(4): 281–288.
- Crossref
- Export Citation
[17]↑
Weiting Huang, Baoya Wei. Iterative intelligent camouflage and reduction of innernal inverse P-information [J]. Journal of Huaihai Institute of Technology(Natural Science), 2016, 25(3):26–29 (in Chinese).
[18]↑
Ling Zhang, Jihua Tang, Kaiquan Shi. The fusion of innernal P-information and its feature of attribute conjunction[J]. Journal of Shandong University (Natural Science), 2014, 49(2): 93–97.
[19]↑
Limei Yan. Inverse P-reasoning and Discovery, reasoning-search for unknown information [J]. Computer Science, 2012, 33(8)6:268–272 (in Chinese).
[20]↑
Ling Zhang, Xue Fang Ren. The relationship between abnormal information system and inverse P-augmented matrices[J]. Journal of Shandong University (Natural Science), 2019, 54(9):15–21 (in Chinese).
[21]↑
Kaiquan Shi, Jihua Tang, Ling Zhang. Intelligent fusion of inverse packet information and recessive transmission of informations intelligent hiding[J]. Systems Engineering and Electronics, 2015, 37(3): 599–605 (in Chinese).
[22]↑
Fengsheng Xu, Xiuqing Yu, Kaiquan Shi. Embedding-camouflage of inverse P-information and its separation-discovery by inverse P-reasoning[J]. Computer Science, 2013, 40(8): 200–203 (in Chinese).
[23]↑
Xiumei Hao, Huifang Guo, Xiuqing Jiang. Multi-attributes risk investment decision making based on dynamic probability rough sets [C]//Proceedings of the 2017 International Conference on Natural Computation?Fuzzy Systems and Knowledge Discovery, Guilin: IEEE, 2017: 2419–242.

If the inline PDF is not rendering correctly, you can download the PDF file here.

ProCite

RefWorks

Reference Manager

BibTeX

Zotero

EndNote

Article information

Received:: 2020-07-22

Accepted:: 2020-08-14

Published Online:: 2020-11-05

Citation Information:: Applied Mathematics and Nonlinear Sciences, Volume 5, Issue 2, Pages 357–366, eISSN 2444-8656, DOI: https://doi.org/10.2478/amns.2020.2.00042.

Random inverse packet information and its acquisition

Abstract

1 Introduction

2 RIPI and its construction

3 RIPI characteristics

4 Applications of RIPI model in intelligent acquisition–separation of investment information

Analysis on intelligent acquisition of RIPI(x)^Fρ

5 Discussion

References

Article information

Journal + Issues

Applied Mathematics and Nonlinear Sciences

Search

	All Time	Past Year	Past 30 Days
Full Text	16	16	11
PDF	7	7	4

Random inverse packet information and its acquisition

Abstract

1 Introduction

2 RIPI and its construction

3 RIPI characteristics

4 Applications of RIPI model in intelligent acquisition–separation of investment information

Analysis on intelligent acquisition of RIPI(x)Fρ

5 Discussion

References

Article information

Journal + Issues

Applied Mathematics and Nonlinear Sciences

Journal Information

Search

Sections

Figures

Analysis on intelligent acquisition of RIPI(x)^Fρ