Abstract
FUZZY INFORMATION AND ENGINEERING 2018, VOL. 10, NO. 1, 19–30 https://doi.org/10.1080/16168658.2018.1509518 Peizhuang Wang and Yanke Bao College of Intelligence Engineering and Math, Liaoning University of Technical, Fuxin, People’s Republic of China ABSTRACT ARTICLE HISTORY Received 12 January 2018 Professor L. A. Zadeh is a special inspiring leader in cybernetics and Revised 12 March 2018 machine intelligence. As a tribute to his pioneer work in fuzzy sets Accepted 21 April 2018 theory, this paper follows his treatment in fuzzy membership func- tions and operations and introduces the factors space theory which KEYWORDS further explains the relationships between them. The factors space Fuzzy sets; artiﬁcial theory calculates the membership degree of a human concept by intelligence; probability; factors space; falling shadow first surveying the sampling interval statistics around a concept, and theory then introducing the vision of ‘falling shadow’ to convert the cover- ing probability of a random interval in the power set of the concept MATHEMATICS SUBJECT domain to membership degree. This paper introduces the factorial CLASSIFICATION probability and transfers typical probability density to typical falling 90C05 membership curves. Based on this idea, a subjective scoring system used on fuzzy evaluation and decision-making is suggested. Facing the question on the selection of fuzzy operations, the paper indicates that the source is in the joint distribution of random sets and a selec- tion proposition is given. Factors space opens a new frontier for the developments of fuzzy sets theory. 1. Introduction In 1965, Professor L.A. Zadeh puts forward the theory of fuzzy sets [1]. Classic set theory can only express precise concepts, which encounters a serious limitation in practical application as it is not flexible enough to simulate how the human brain reasons and makes decisions. In order to change this situation, the fuzzy concept must be mathematically represented by a new sets theory. As a cybernetic expert, Zadeh was a trailblazer in the development of machine intelligence from mathematics, and after two short years when his monumental paper was published, the field explored and the fuzzy articles increased exponentially each year, spreading to all fields of computer applications. Concept is a unit of thinking; the fuzzy concept is constantly used by a human being in our daily living. Fuzzy sets theory makes the computer accessible to the people, which builds a bridge that crosses from the qualitative and quantitative descriptions. In other words, the birth of fuzzy set theory is an important milestone in the history of artificial intelligence. As students and friends of Prof. L. A. Zadeh, the authors are deeply indebted to his great contribution to this field. The best way to pay tribute to him is to inherit and promote his theory. This paper aims to report a brief outline of the researches of factors space theory. Since the most important CONTACT Peizhuang Wang peizhuangw@126.com © 2018 The Author(s). Published by Taylor & Francis Group on behalf of the Fuzzy Information and Engineering Branch of the Operations Research Society of China & Operations Research Society of Guangdong Province. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/ by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. 20 P. WANG AND Y. BAO problem in the early stage of fuzzy sets was the comparison between the fuzziness with the randomness. The authors recognised that the two kinds of uncertainties are caused by the lack of factors to describe both, where we employ a very important word ‘factor’ into peo- ple’s intention. The authors observe that the key to open the door of major advancement in biology is the discovery of gene, the root of bio-qualities. It was called the Mendelian factor. Indeed, factor is a generalisation of gene, which is the root of qualities for anything, especially, for comparing the two kinds of uncertainties. From the view of mathematics, a factor f is essentially a mapping, which maps an object u ∈ U to its state/attribute in X(f), Definition 1.1: A factor space defined on universe of discourse U is a family of sets ψ = ({X(f)} ; U) satisfying: (f∈F ) (1) F = (F, ∪, ∩, ) is a Boolean algebra; (2) X(∅) ={∅}; (3) For any T ⊆ F,if {f |f ∈ T} are irreducible (i.e., s = t ⇒ s ∩ t =∅ (s, t ∈ T)), then X({f |f ∈ T}) = X(f ) ( stands for Cartesian product); f ∈T (4) ∀f ∈ F, there is a mapping with the same symbol f : U → X(f ). F is called the set of factors, f ∈ F is called a factor on U. X(f) is called the state space of factor f. The definition has not been changed much since the first paper [2] was published in 1982 – the same year when the Formal Concept Analysis [3] and the Rough Sets [4]were also appeared. They all attempted to put forth formal, mathematical description knowledge and intelligence. P. Z. Wang, H. X. Li, Z. L. Liu and many colleagues have done a lot of works on factor space theory and its applications [5–28]. We developed factorial analysis on the basic space of a probability field and defined the factorial probability in order to develop a stronger foundation, which establishes the symmetry principle and the data parity principle, respectively. Then we do factorial analysis on the domain U of fuzzy subsets. We had found out the duality between randomness and fuzziness and presented the falling shadow theory, which offers four contributions to fuzzy sets theory: (1) Developing the theoretical base of subjective measurement by the falling basic theorem; (2) Developing the typical models of membership curves; (3) Establishing the typical fuzzy numbers scoring system; (4) Indicating the selection of fuzzy operations. The organisation of the paper is as follows: The factorial probability is introduced in Section 2; the Falling shadow theory of fuzzy sets is introduced in Section 3 and the conclusion is given in Section 4. 2. Factorial Probability Definition 2.1: A factor f : U → X(f ) is symmetric if the states in X(f) are symmetric. A symmetric factor is denoted as S usually. Example 2.1: S is the appearance of a coin-throwing, X(S ) ={Head, Back}, the two states 1 1 are symmetric; FUZZY INFORMATION AND ENGINEERING 21 Example 2.2: S is the appearance of a dicing, X(S ) ={1,2,3,4,5,6}, the six states are 2 2 symmetric; Example 2.3: S is the appearance of touching to take a ball from a bag containing white and black balls. X(S ) ={W ... ,W ;B , ... ,B } (a, b are natural numbers), the a + b states 3 1 a 1 are symmetric; To predict the occurrence of an event, the process of prediction is called a ‘test’, which is a factor f, its states space X(f ) ={a , ... , a } is called the testing space and a are called 1 n i results. In each test, there occurs one and only one result. Randomness is the uncertainty on predicting which result will be occurred, which is caused by the insufficiency of the stipulation on the conditional or causal factors. Ran- domness comes from the break-down of causality, while probability is a generalised law of causality. How do we take such a proposition? We propose the assumption as follows: The Symmetry Principle The symmetric test factor guarantees that the result will have the same degree of certainty: P(a ) = ... = P(a ) = 1/n. (2.1) 1 n Definition 2.2: Let S: U → X(S) ={a , ... , a } be a symmetric factor, let A be the σ -field 1 n generated by X(S), and let p be the probability on A extended by the symmetry principle (2.1). We call P the factorial probability under the symmetric factor S. Example 2.1 : P is the factorial probability under S if P(Head) = P(Back). Example 2.2 : P is the factorial probability under S if P( 1 ) = P( 2 ) = P( 3 ) = P( 4 ) = P( 5 ) = P( 6 ). Example 2.3 : P is the factorial probability under S if P(W ) = ... = P(W ) = P(B ) = ... = P(B ). 1 a 1 b Probability is the law of generalised causality; condition causes result and condition deter- mines the value of probability. However, in many practical applications, causal conditions are unknown or not available. When we say that a dam can withstand ‘the flood of a cen- tury’, would we know the condition to ensure that the probability of unexpected flood is lower than1%? The lack of rigorous specification on probability will lead to inconspic- uous risks. The factorial probability has a rigorous specification on its condition, which is the symmetry of the test factor. The factorial probability is essentially a logical matter, which is the essence reflecting the causal relationship between things. If we do experiments on event-frequency, it must be stabled around the factorial probability. Some people refer to subjective probability, which is not a derogatory term, it reflects the subjective initiative of cognition subject, and which is worth to be studied. Factorial probability is not subjective probability, but it can provide a logical basis for it. 22 P. WANG AND Y. BAO Factorial probability has the universality of application. In the area of data mining and information transformation, all probabilities we encounter are factorial probabilities because we propose the following principle: Data parity principle. Without special declaring, all sample points in a data sampling are equal and have the same weights. If S is a sampling factor with state space D ⊆ R,let n be the size of sampling, then accord- ing to the data parity principle, each sample point carries probability 1/n falls into D,and a sample distribution is formed in D. Which will not be symmetric usually! The multifactorial sampling factor forms a joint sample distribution in the state space D ⊆ R , and the joint distribution determines the causal relationship between the group of factors. By increasing the size of sampling and investigating the limiting properties of the sample distribution, we get the population distribution. Existing probability distributions can be re- certified along this approach. In some areas, such as remote sensing data, there are many unknown distributions, which can be discovered. New distribution types and expressions can be obtained by means of the Monte Carlo method. The probability distribution of the same class is called a type. There are some parameters in each type, and the most important parameters are two: one is the sample mean, and the other one is the sample mean variance. These two parameters play two roles: (1) Generalisation of data processing: if we take linear transformation such that the two parameters are equal to 0 and 1, respectively, then the distributions with the same type becomes one. This is the generalisation principle of image data processing; (2) Taking these two as hidden parameters, solving or iterating them in the optimised format, then the key factors will be obtained, which are secret of success in the classification and learning. 3. Falling Shadow Theory of Fuzzy Sets 3.1. Basic Falling Theorem In the fuzzy sets theory, the domain U is an undefined noun, but we take it as a factors space. Fuzziness is the uncertainty of boundary demarcation caused by the lack of description for judge-factors around a concept. The duality between fuzziness and randomness is found by comparing the two kinds of uncertainties. As shown in Figure 1, the probability model is ‘the circle is fixed, the point is changing’, the fuzzy model is ‘the point is fixed, the circle/interval is changing’, which is mathematically the relation between the Universe U (ground) and the power set of U, P(U)(sky). For example, in coin-tossing, if one knows the speed, angle of contact, the mass of the coin, ... , etc., one could apply Newtonian mechanics to solve the motion equations and may accurately determine whether the coin will land as head or back. However, if one does not bother to measure all these factors, then one can attribute all these to probability. The outcome of the coin-tossing is a point in the fundamental space as shown in the left figure of Figure 1. Thus, the condition circle is fixed, the point (i.e. the outcome) is changing. On the other hand, for a typical concept like ‘young’, different persons have slightly different FUZZY INFORMATION AND ENGINEERING 23 Figure 1. Duality in two models. ideas. One may regard young as between 17 and 30 years, other may be 18 and 28 years. Each opinion can be regarded as a random interval. The aggregation of these sample gives rise to the general concept of ‘young’, which is a fuzzy concept with certain membership function. So for a fuzzy concept, the point (i.e. ‘young’) is fixed but the circle (i.e. the interval) is changing. The fuzzy model on the ground can be transformed into a random model in the sky, which is stated by the ‘falling shadow’ theory. In the book [5], three kinds of mathematical structures, Order, Topology and Measure, have been promoted from U to the power of U, and we set up a variety of hyper-topologies and produced a variety of super measurable structures, they formed a variety of random sets in the sky, and according to the differ- ent ways of falling, a variety of subjective/non-additive measures can be formed. Among them, there are four popular types: Belief (BL), Plausibility (PL), anti-belief (ABL) and anti- plausibility (APL). Fuzzy measure is a special APL. Their definitions are quite complex, and we can simply re-define them as follows: Suppose that H is a σ -field defined on P(U). For any subset A of U,set o c oc o A ={B|B ⊆ A}, A ={B|A ⊆ B}, A ={B|B ∈ / A }, A ={B|B ∈ / A }. (3.1) o o o It is known that A and A are the filter and ideal of A, respectively. Definition 3.1: Let p be a probability defined on P(U), set o o μ (A) = p(A ), μ (A) = p(A ), μ (A) = 1 − p(A ), μ (A) = 1 − p(A ). BL o PL ABL o APL They are called the BL, PL, ABL and APL on U, respectively. Basic falling theorem [5]. Given a measure µ (belongs to BL, PL, ABL or APL), there is one and only one probability p defined on H such that it falls down to be µ according to (3.1). This is a very important theorem. Without the existence of this uniqueness theorem, fuzzy sets and Dempster-Shafer’s non-additive measures theory cannot be applied in prac- tice since there lack of solid foundation. The proof of this theorem is not easy; it needs to apply the measure expansion theorem. The starting point of the measure expansion is semi-ring, but this proof requires that the starting point must be π–system, which is much primeval than semi-ring, and so that the theorem is a very difficult and important work in mathematics. 24 P. WANG AND Y. BAO Figure 2. Falling membership and density. 3.2. The Types of Fuzzy Membership Curves Probability has had distribution styles such as Poison distribution, Normal distribution, -distribution and some distributions have Tables to query the confidence limits for sta- tistical inference. Those progresses show the mature of probability; fuzzy sets can have similar styles and tables. Falling shadow theory can transfer probability distributions to membership degrees. The only problem we have to face in practice is such a challenge: The complexity will be exponentially increased when we promote domain to its power. Fortunately, this problem can be overcome by limiting the set-value statistics to be inter- val statistics. Let us look at an example: Consider a domain including eight elements U ={a,b,c,d,e,f,g}, its power P(U) contains 256 subsets. But, if we limit the power contains hyphen only, then. |P (U)|= 1 + 8 + 7 + 6 + 5 + 4 + 3 + 2 + 1 = 73. With an empty hyphen, there are only 74 elements. Where I is the set of hyphens and P (U) ={A ∈ I|A ⊆ U}, which contains the common subsets of U and I.Wecall I the background set, and P (U)is called the background power. Suppose that the total probability 1 is assigned to the following five hyphens: cde 0.4, bcde 0.2, dcf 0.2, bcdef 0.2. Then the falling shadow of random hyphen on U is the following membership degrees: 0 0.4 0.8 1 1 0.4 0 ab c d e f g Consider background power P (R), and the background set is the set I of all intervals, the complexity is not so big. Under the simplification, the membership curve in the real domain only depends on the change of the two random variables only. As shown in Figure 2,the left and right sides of the subordinate curve are the left and right distribution functions of the distribution density of the two endpoints of the random interval. If we divide the membership curve in half and only take care around the tail of the membership curves, we can prove the following theorem. FUZZY INFORMATION AND ENGINEERING 25 The transformation theorem. The left (right) subordinate curve of membership (falling shadow) is equal to the left (right) distributive function of the distributive density of the left (right) endpoint of the random interval. According to this theorem, the tail type of the membership curve can be determined by the probability density. There are three main types of subordinate membership curve: (1) Negative power type. If the distribution density of the left (right) endpoint of the random interval is the power density curve (p(x) = θ/(x − a) } (x < a)(x > a), then the left (right) tail expression of the subordinate membership curve is. μ(x) = c/(a − x)(−c < x < a − 1/c), (μ(x) = c/(x − a)(a + 1/c < x < c)). (2) Negative exponential type. If the distribution density of the left (right) endpoint of the random interval is the negative exponential density curve p(x) = exp{−θ(a − x)} (x < a), (p(x) = exp{−θ(x − a)} (x > a)), then the left (right) tail expression of the subordinate membership curve is. μ(x) = cθ(exp{−θ(a − x)}− 1)(−1/e < x < a − e), c = 1/θ (exp{−qe}− 1), (μ(x) = cθ(exp{−θ(x − a)}− 1)(a + e < x < 1/e), c = 1/θ (exp{−θe}− 1)), (3) Negative logarithmic type. If the distribution density of the left (right) ending point of the random interval is the reciprocal curve p(x) = θ/(a − x)(x < a), (p(x) = θ/(x − a)(x > a)), then the left (right) tail expression of the subordinate membership curve is. μ(x) = c(ln θ(1/e) − ln θ(a − x)) (−1/e < x < a − e), c =−1/2ln e, μ(x) = c(ln θ(x − a) − ln θ(1/e)) (a + e < x < 1/e), c = 1/2ln e. Negative exponential type and logarithmic type should become the normal types of membership curves. 26 P. WANG AND Y. BAO Logarithmic regression, the logarithmic weight distribution is derived from these typical membership curves. Similar to the confidence limit settled in probability statistics, we can design table to query the certainty limit in fuzzy statistics. Thus, the transformation theory enables us to obtain the membership degree of a fuzzy concept through the random interval statistics. And the random intervals can be obtained through a survey. In essence, the bridge between probability and fuzziness is established. 3.3. Fuzzy Scoring Systems One important task of fuzzy sets in artificial intelligence is grading or scoring. There are two types of data: the physical measure data and the subjective scoring data. The latter one is mainly graded by experts with decision-making, it requires the operation of fuzzy numbers. Guo’s [29] structural element theory has made an important contribution to the fuzzy num- ber. According to his theory, we take a standard triangular fuzzy number E as the structural unit, which satisfies that E(−1) = 0, E(0) = 1and E(1) = 0. For any fuzzy number A, there is −1 the only monotone function h such that A(x) = E(h (x)), and we denote that A = h(E). Any fuzzy number defined on R can be generated by the structural unit E throughout a mono- tone function. A fuzzy number is called a tine fuzzy number if it takes height 1 at a single point. All triangular fuzzy numbers are tine fuzzy numbers. We can concretely set that h(x) = a + 0.ax (0 < x < +∞), where 0.a = a/10. Set N(0, +∞) ={[a] = a + 0.ax|0 < a < +∞}, which forms a tine fuzzy number system enclosed for the addition operation of fuzzy numbers [a] + [b] = [a + b] = (a + b) + 0.(a + b)E. When b < a, you can also do the subtraction of fuzzy numbers within the system N(0, +∞): [a] − [b] = [a − b] = (a − b) + 0.(a − b)E. The scalar multiply can be also taken within the system: c[a] = (ca) + 0.(ca)E = [ca]. The domain of the scoring system should be the interval (0,1], but the distinguish rate is not satisfied on the domain. The falling shadow theory emphasise that the negative expo- nential or the negative logarithm curves are the better style. We need to transfer the scoring domain from (0,1) to (0,+∞). Set that y =−ln x, i.e., x = exp{−ln y}, and set N = N(0, 1]; (N) = N(0, +∞), • • Definition 3.2: A scoring system is a dual triples (N, +, )- ((N), (+), ( )), where operation + • • and (+) are addition in N and (N) respectively, the operations and ( ) are the scalar multiply FUZZY INFORMATION AND ENGINEERING 27 • • in N and (N), respectively. (N, +, ) and ((N), (+), ( )) are called the ground and arm scoring systems, respectively. Information synthesis for physical data is a process of weighted average. Given a group of numbers y , ... ,y and weight w = (w , ... ,w ), we get the weighted average 1 n 1 n y = w y + ... +w y . Information synthesis on subjective scoring is different with that of 1 1 n n physical measurements. According to Guo’s fuzzy number system, we have the following principle: Arm scoring principle. The fuzzy numbers should be taken in the arm scoring system firstly, and the weights should be averaged on the arm. And then return to the ground domain. Scoring Algorithm Stage 1. Doing single factor scoring, get n scores [x ], ... ,[x ] in the ground N = N(0,1]; 1 n Stage 2.1. Transferring scores to numbers [y − ln x , ... , y =−ln x ]inthe arm(N); ] [ 1= 1 n n Stage 2.2. Weighted synthesis on the arm [y] = w [y ] + ... + w [y ]; 1 1 n n Stage 2.3. Returning to ground, get that w wn [x] = [x ... x ]. (3.2) 1 n 3.4. Fuzzy Operations’ Selection There many kinds of operations between fuzzy sets. How to select the fuzzy operations is a puzzle problem. Falling shadow theory tells us that the source is in the joint distribution of random sets in the sky. Selection Theorem on fuzzy operations.[30]Let ξ and η be two random sets falling to be fuzzy sets, A and B respectively. (1) The operation pair (∪, ∩) is represented by max-min: μ (u) = max(μ (u), μ (u)), A∪B A B μ (u) = min(μ (u), μ (u)). A A B ∩B If and only if they are completely positive related, i.e. η(u) ≡ cξ(u)(c > 0); (2) The operation pair (∪, ∩) is represented by bounded sum and product: μ (u) = min(μ (u) + μ (u),1), A A B ∪B μ (u) = max(μ (u) + μ (u) − 1, 0). A A B ∩B If and only if they are completely negative related, i.e., η(u) ≡ cξ(u)(c < 0); (3) The operation pair (∪, ∩) is represented by probability sum and product, i.e. μ (u) = μ (u) + μ (u) − μ (u)μ (u), A A B A B ∪B μ (u) = μ (u)μ (u). A A B ∩B 28 P. WANG AND Y. BAO Figure 3. Two random sets’ falling. If and only if they are independent, i.e. p(ξ(u) = a and η(u) = b) = p(ξ(u) = a)p(η(u) = b)η.(u) ≡ cξ(u). There are many different formulae that have been defined around the union and inter- section operations of fuzzy subsets, but no one tells us how to select operations for fuzzy sets. The selection theorem first time gave the selection principle in three typical kinds, which indicates that the selection depends on the relationship between random sets. Thus, the falling shadow theory offers a theoretical basis and explanations on the mathematical meanings of fuzzy theory, which further establishes a deeper understanding of fuzzy sets theory (Figure 3). 4. Conclusion Factor space theory has been used in the analysis towards fuzziness’ domain, which can be transformed to be the randomness in the ‘sky’. The falling shadow theory, which brings fuzzy sets and evidence theory to a solid foundation in applications, offers the following: (1) by means of the transformation theorem in between probability density and membership curves, fuzzy sets have obtained typical formulae; (2) by means of scoring fuzzy numbers systems, fuzzy calculation can perform mechanical evaluation and decision-making; and (3) by means of the joint distribution of random sets in the sky, the selection of fuzzy operations becomes reasonable. As such, factors space opens a new frontier of fuzzy sets. Acknowledgements The author wishes to thank Professor B. Y. Cao and all friends for their valuable critics, comments and assistances on this paper. FUZZY INFORMATION AND ENGINEERING 29 Disclosure statement No potential conflict of interest was reported by the authors. Funding This study was partially supported by the grants [grant numbers 61350003, 70621001, 70531040, 90818025] from the Natural Science Foundation of China. Notes on contributors Peizhuang Wang, male, born in 1936, professor, doctoral supervisor, mainly studied fuzzy mathemat- ics and its application in artificial intelligence, has published more than 200 and found the fuzzy falling shadow representation, truth value flow inferences and factors space theory, won several national rewards and an international awards, the recent focus on factors space in the application of artificial intelligence and data science. Yanke Bao, male, born in 1962, associate professor, master supervisor, mainly studied statistical machine learning and theory and application of knowledge discovery based on factors space, has published more than 20 and proposed the algorithm of S&R, found and proved the dual convolution theorem of factors space. References [1] Zadeh LA, Fuzzy sets. Inf Control. 1965;8(3):338–335. [2] Wang PZ, Sugeno M. Factors field and the background structure of fuzzy sets, Fuzzy Math. 1982;(2):45–54. [3] Wille R. Restructuring lattice theory: an approach based on hierarchies of concepts. Ordered Set. 1982:445–470. [4] Pawlak Z. Rough sets. Int J Comput Inf Sci. 1982;11(11):341–356. [5] Wang PZ. Fuzzy sets and the falling shadow of random sets. Beijing: Beijing Normal University Press; 1985. [6] Wang PZ, Li HX. Mathematical theory of knowledge representation. Tianjin: Tianjin Science and Technology Press; 1994. [7] Wang PZ, Li HX. Fuzzy system theory and fuzzy computer. Beijing: Science Press; 1995. [8] Li HX. Factor space theory and mathematical framework of knowledge representation (I) Axiom definition. J Beijing Normal Univ (Nat Sci). 1996;32(4):470–475. [9] Li HX, Li L, Wang J. Fuzzy decision making based on variable weights. Math Comput Model. 2004;39(2–3):163–179. [10] Liu ZL. Theory of factorial neural networks. Beijing: Beijing Normal University; 1990. [11] Wang PZ, Zhong YX, He HC, et al. Cognition mathematics and factors space. Ann Data Sci. 2016;3(3):281–303. Available from: http://link.springer.com/article/10.1007/s40745-016-0084-x [12] Wang PZ, Guo SZ, Bao YK, et al. Causality analysis in factors space. J Liaoning Techn Univ (Nat Sci). 2015;34(2):273–280. [13] Shi Y. Big data and new technology challenges of scientific. Sci Technol Dev. 2014;1(1):25–30. [14] Liu HT, Guo SZ. Inference model of causality analysis. J Liaoning Techn Univ (Nat Sci). 2015;34(1):124–128. [15] Bao YK, Ru HY, Jin SJ. A new algorithm for knowledge mining in factors space. J Liaoning Techn Univ (Nat Sci). 2014;33(8):1141–1144. [16] Bao YK, Wang PZ, Guo SZ. Structural and dual convolution theorem of factor space. J Intell Syst. 2018;13(1):1–10. [17] Zeng FH, Zheng L. The sample cultivation in factors space. J Liaoning Techn Univ (Nat Sci). 2017;36(3):320–323. 30 P. WANG AND Y. BAO [18] Zhong YB, Li ZY. The text clustering algorithm based on factors Space. In Oriental thinking – International conference on the 50th anniversary of the fuzzy sets, Dalian; 2015. [19] Yuan XH, Wang P. Z., Lee ES. Factor space and its algebraic representation theory. J Math Anal Appl. 1992;17(1):256–276. [20] Peng XT, Kandel A., Wang PZ. Concepts, rules and fuzzy reasoning: a factors space approach. IEEE Trans Syst Man Cybern. 1991;21(1):194–205. [21] Huang. CF. Principle of internet of intelligences and development of its core technology. J Risk Anal Crisis Response, 2018(3):146–155. [22] Cheng QF, Wang TT, Guo SC, et al. The logistic, regression from the viewpoint of the factor space theory. Int J Comput Commun Control. 2017;12(4):492–502, ISSN 1841-9836. [23] Qu GH, Li CH, Zhang Q. The distinguishing function for attributes reduction in factors space. J Intell Syst. 2012; 12(6):890–894. [24] Li DQ, Cui HM, Li HX. Multiple factorial decision making based on multi-level variable weights. J Syst Eng. 2004;19(3):258–263. [25] Cui TJ, Ma YD. Research on the method of coal mine safety based on factor space. Syst Eng Theory Practice 2015;35(11):2891–2897. [26] Wang PZ. A factors space approach to knowledge representation. Fuzzy Sets Syst. 1990; 36(1):113–124. [27] Wang PZ, Loe KF. Between mind and computer: fuzzy science and engineering. Singapore: World Scientific Publishing; 1994. [28] Wang PZ, Liu ZL, Shi Y, et al. Factor space, the theoretical base of data science. Ann Data Sci. 2014;1(2):233–251. [29] Guo SZ. The fuzzy analysis of the structure element method (I), (II). J Liaoning Techn Univ (Nat Sci). 2002;21(5):670–673; 21(6):808–810. [30] Wang PZ, Zhang HM, Ma XW, et al. Fuzzy sets operation representation by falling shadow theory. In Fuzzy Engineering toward Human Friendly Systems, Proceeding of IFES 95 Conference.
Journal
Fuzzy Information and Engineering
– Taylor & Francis
Published: Jan 2, 2018
Keywords: Fuzzy sets; artificial intelligence; probability; factors space; falling shadow theory; 90C05