Intelligent Methods for Cyber Warfare pp 4367  Cite as
Soft Computing Based Epidemical Crisis Prediction
 1 Citations
 1.5k Downloads
Abstract
Epidemical crisis prediction is one of the most challenging examples of decision making with uncertain information. As in many other types of crises, epidemic outbreaks may pose various degrees of surprise as well as various degrees of “derivatives” of the surprise (i.e., the speed and acceleration of the surprise). Often, crises such as epidemic outbreaks are accompanied by a secondary set of crises, which might pose a more challenging prediction problem. One of the unique features of epidemic crises is the amount of fuzzy data related to the outbreak that spreads through numerous communication channels, including media and social networks. Hence, the key for improving epidemic crises prediction capabilities is in employing sound techniques for data collection, information processing, and decision making under uncertainty and exploiting the modalities and media of the spread of the fuzzy information related to the outbreak. Fuzzy logicbased techniques are some of the most promising approaches for crisis management. Furthermore, complex fuzzy graphs can be used to formalize the techniques and methods used for the data mining. Another advantage of the fuzzybased approach is that it enables keeping account of events with perceived low possibility of occurrence via low fuzzy membership/truthvalues and updating these values as information is accumulated or changed. In this chapter we introduce several soft computing based methods and tools for epidemic crises prediction. In addition to classical fuzzy techniques, the use of complex fuzzy graphs as well as incremental fuzzy clustering in the context of complex and high order fuzzy logic system is presented.
Keywords
Fuzzy logic Fuzzy functions Fuzzy expectation Complex fuzzy logic Complex fuzzy graph Fuzzy clustering Incremental clustering1 Introduction
In the context of this Chapter, the term epidemical (or epidemic) referrers to a disease which spreads widely and attacks many persons at the same time. An epidemical crisis is an epidemic that spreads very fast and affects numerous people in different countries and continents. In this sense, the term epidemical crisis and pandemic are almost synonyms.
Epidemical crisis prediction (ECP) is a special case of disaster prediction and management (DPM). DPM is one of the most challenging examples of decision making under uncertain information. One of the main issues related to ECP/DPM is the amount of a priori information available, i.e., the amount of surprise affiliated with the epidemical crisis as well as the risk and devastation that follow the crisis outbreak. A closer look at these parameters shows that the velocity and acceleration (and higher derivatives) of these parameters are highly important. Another important aspect includes secondary adverse effects (i.e., secondary epidemical crises) that are triggered by the initial disaster.
One of the main concerns about epidemical crises is the amount of surprise that accompanies the outbreak. Emergencies may produce a wide range of surprise levels. The terror attack of 9/11 is an example of a disaster with very high level of surprise. On the other hand the landfall of a hurricane in Florida in the middle of a hurricane season is not as surprising.
Even in the extreme cases where the nature of the disaster is known, preparedness plans are in place, and analysis, evaluation, and simulations of the disaster management procedures have been performed, the amount and magnitude of “surprises” that accompany the real disaster pose an enormous demand. In the more severe cases, where the entire disaster is an unpredicted event, the disaster management and response system might fast run into a chaotic state. Hence, the key for improving disaster preparedness and mitigation capabilities is in employing sound techniques for data collection, information processing, and decision making under uncertainty.
Analysis of epidemical crises presents three types of challenges: the first is the ability to predict the occurrence of epidemical crises, the second is the need to produce a preparedness plan, and the third is the actual real time response activities related to providing remedies for a currently occurring disaster.
As a special case of DPM, ECP is a highly challenging example of decision making under uncertain information. Epidemical outbreaks might pose various degrees of surprise as well as various degrees of the “derivatives” of the surprise. One of the unique features of epidemical crises is the amount of fuzzy data related to an outbreak that spreads through numerous communication channels and social networks.
The key for improving epidemical crises prediction and management capabilities is in employing sound techniques for data collection, information processing, and decision making under uncertainty and in exploiting the modalities and media of the spread of the fuzzy information related to the outbreak. Hence, fuzzy logicbased techniques are some of the most promising approaches for crisis management. Furthermore, complex fuzzy graphs can be used to formalize the techniques and methods used for the data mining. Another advantage of the fuzzybased approach is that it enables keeping account of events with perceived low possibility of occurrence via low fuzzy membership/truthvalues and updating these values as information is accumulated or changed.
In this chapter we introduce several soft computing based methods and tools for epidemical crises prediction. In addition to classical fuzzy techniques, the use of complex fuzzy graphs as well as incremental fuzzy clustering in the context of complex and high order fuzzy logic systems is presented.
The rest of this chapter elaborates on some of the important aspects of ECP and DPM, concentrating on the related uncertainty which can be addressed via fuzzy logicbased tools as well as the geospatialtemporal analytics/Big Data aspects of the problem. Section 2.2 provides the background, Sect. 2.3 provides an overview of several fuzzy logicbased tools for ECP, and Sect. 2.4 concludes and proposes future research.
2 Background
The topic of predicting epidemical crises falls under the more general subject of disaster prediction management and mitigation (DPM). In this section, we discuss DPM (Sect. 2.2.1) and elaborate on some of the distinguishing factors of ECP (Sect. 2.2.2). In addition, we describe the geospatialtemporal analytics of the correlation of environmental factors and incidence of disease and report on a set of tools and concept demonstrations that show the solvability of Big Data problems involving geospatial data correlated with publically available medical data.
Epidemical crises occur with different degrees of unpredictability and severity, which are manifested in two main facets. First, the actual occurrence of the pandemics might be difficult (potentially impossible) to predict. Second, regardless of the level predictability of the crisis, it is very likely that it will be accompanied by secondary effects. Hence, epidemical crises are a major source of “surprise” and uncertainty and their mitigation and management require sound automatic and intelligent handling of uncertainty.
Often, the stakeholders of ECP programs are classifying the unpredictability of epidemical crises as two types of unknowns: unknown unknowns and known unknowns. The first type of unknowns (unknown unknowns) is often referred to by the metaphor of a black swan, coined by Taleb [30, 31], while the second type of unknowns (known unknowns) is referred to as a gray swan. Arguably, however, there is no such animal as a black swan and every swan is a gray swan depending on the amount of surprise it carries and the potential devastation associated with it. In almost all the cases of epidemical crises recorded so far there was some a priori information concerning the disaster yet this information was filtered, ignored, or just did not pass a threshold of being classified as significant.
2.1 Severity and Predictability of Epidemical Crises
 1.
The blackswan is an outlier; lying outside of the space of regular expectations.
 2.
It has very low predictability and it carries an extremely adverse impact.
 3.
The unknown component of the event is far more relevant than the known component.
 4.
Finally, we can explain the event post factum and through those explanations make it predictable in retrospect.
This suggests that the term black swan is a bit too extreme and one should consider using the term gray swan where the gray level relates to the level of surprise. A gray swan represents an unlikely event that can be anticipated and carries an extremely adverse impact. In this respect, gray swans represent a two dimensional spectrum of information. The first dimension represents the predictability of the event where black swans are highly unpredictable and white swans are the norm. The second dimension represents the amount of adverse outcome embedded in the event; with black swans representing the most adverse outcomes. Consequently, the black swan is a special case of a gray swan.
To further elaborate, one type of unpredictability relates to a set of events that can be considered as known unknowns. For example, a hurricane occurring in Florida during the hurricane season should not surprise the responsible authorities. Moreover, often, there is a span of a few days between the identification of the hurricane and the actual landfall. Regardless, even a predictable hurricane landfall carries numerous secondary disastrous events that are hard to predict.
We refer to these secondary events as second generation gray swans. Second generation swans are generated and/or detected while the disaster is occuring. The collapse of the Twin Towers in 9/11 is an example of a secondgeneration gray swan. A gray swan might (and according to the Murphy laws is likely to) spawn additional gray swans. Generally, second generation swans evolve late and fast. Hence, they introduce a more challenging detection problem and require specialized identification tools, such as dynamic clustering. Detecting relatively slow evolving [first generation] gray swans before the disaster occurs and relatively fast evolving second generation gray swans requires an adequate set of uncertainty management tools.
 1.
Philippines typhoon disaster
 2.
Bangladeshi factory collapse
 3.
Iceland volcano eruption
 4.
Fukushima—tsunami followed by nuclear radiation and risk of meltdown of nuclear facilities in the area
 5.
HIV, HSV2, Swine, SARS, and West Nile Virus infection outbreaks
 6.
9/11 NYC attack followed by the collapse of the Twin Towers
 7.
Financial Markets’ falls (1987, 2008), Madoff’s fraud
 8.
The 1998 fall and bailout of LongTerm Capital Management L.P. hedge fund
 9.
Yom Kippur War
 10.
December 7, 1941—Pearl Harbor
 11.
Assassinations of Lincoln, Kennedy, Sadat, and Rabin
Recently, the academic community and government agencies have effected spurring growth in the field of data mining in Big Data systems.These advances are beginning to find their way into ECP programs and are redefining the way we address potential disaster and mitigate the effects of epidemical crises. Nevertheless, academia, industry, and governments need to engage as a unified entity to advance new technologies as well as apply established technologies in preparation and response to the specific emerging problems of epidemical crises.
2.2 Epidemical Crises Information Spread
Predicting the epidemical outbreak is an important component of the management and mitigation of a pandemic. It can enable early setup of a mitigation plan. Nevertheless, the fact that an epidemical crisis is somewhat predictable does not completely reduce the amount of surprise that accompany the actual occurrence of the crisis. Hence, any mitigation plan, that is, a set of procedures compiled in order to address the adverse effects of epidemical crises, should be flexible enough to handle additional surprises related to secondary adverse effects of the epidemical crisis. Finally, the real time ramification program is the actual set of procedures enacted and executed as the epidemical crisis occurs. There are two preconditions for successful remedy of epidemical crisis affects. First, the authorities/leadership have to attempt following the original mitigation plan as close as possible while instilling a sense of trust and calmness in the people that experience the crisis and the mitigation provider teams. Second, and as a part of their leadership traits, the authorities must possess the ability to adapt their remedy procedures to the dynamics of the epidemical crisis, potentially providing effective improvisations aimed at handling secondary disastrous events that evolve from the main disaster. A simple example for such events is looting and violence that might accompany a major disaster. For this end, fast automatic assessment of the dynamics is paramount.
One of the distinguishing features of pandemics’ outbreaks is the modalities of sharing information in communication and social networks. Often, due to the panic that accompanies outbreaks there is an explosion of data which is characterized by large amount of information and high “velocity” and higher derivatives of velocity of information spread. Using the current terminology to describe the phenomenon: pandemic news are likely to become viral. Notably, many countries would try to completely ban, control, or limit, the news spread. But experience show that these attempts are not likely to be fruitful: citizens of these countries can still find numerous ways to spread the information through social networks. Hence, data mining in electronic versions of newspapers and related media as well as in social networks is an important cyber warfare ammunition. In addition, it is well known (but not published) that many national security agencies are digitizing “hard forms” of publicly available information of other countries such as newspapers. These might be related to official, semiofficial, or private mediaoutlets. This media, however, is easier to control by a country that is trying to conceal an epidemical outbreak. One interesting pattern in this situation is the appearance of a few news reports at the beginning of the outbreak, followed by acceleration in reports, followed by a complete seizure of these reports due to a discovery of the news by the country’s leaders, followed by a complete ban on this news.
Interestingly, there is another cyber source of information which relates to restrictions that a country might put on travelers entering the country. For example, during the SARS pandemic several countries has required that people entering the country would go through a fast automatic screening of body temperatures.
2.3 GeospatialTemporal Analytics of Correlation of Environmental Factors and Incidence of Disease
We have developed tools and concept demonstrations that show the solvability of Big Data problems involving geospatial data correlated with publically available medical data. We bring the Big Data approach to geospatial epidemiology, a field of study focused on describing and analyzing geographic variations of disease spread, considering demographic, environmental, behavioral, socioeconomic, genetic, and infectious risk factors [8]. Our work in this area assists the development of the related field of personalized medicine by correlating clinical, genetic, environmental, demographic, and other background geospatial data.
Our TerraFly GeoCloud [18] system combines several diverse technologies and components in order to analyze and visualize geospatial data. In this system, a user can upload a spatial dataset and display it using the TerraFly Map API [26]. Datasets can be subsequently analyzed using various functions, such as Kriging, a geostatistical estimator for unobserved locations, and Spatial Clustering, which involves the grouping of closely related spatial objects. Various analysis functions related to spatial epidemiology have been integrated into TerraFly GeoCloud. Analysis functions can be used by selecting the appropriate dataset and function in the interface menu, along with the variables to be analyzed. TerraFly GeoCloud then processes the data and returns a result that can be visualized on the TerraFly Map or on a chart. Results displayed on the map include a legend, which identifies certain range values by color. Certain visualizations are interactive, allowing additional information to be displayed.
Our Spatial Epidemiology System provides four kinds of API algorithms for data analysis and results visualization, based on the TerraFly GeoCloud System: (1) disease mapping (mortality/morbidity map, SMR map); (2) disease cluster determination (spatial cluster, HotSpot analysis tool, cluster and outlier analysis); (3) geographic distribution measurement (mean central, median central, standard distance, distributional trends); and (4) regression (linear regression, spatial autoregression). The system is interfaced with our Health Informatics projects [4, 13, 25, 27, 28, 29, 40, 43].
We work on tools and methodologies that will assist in operational and analytical Health Informatics. The TerraFly Geospatial Analytics System (http://terrafly.com) demonstrates correlation of location to environmentrelated disorders, enabling clinicians to more readily identify macroenvironmental exposure events that may alter an individual’s health. It also enables applications in targeted vaccine and disease management, including disease surveillance, vaccine evaluation and followup, intelligent management of emerging diseases, crossanalysis of locations of patients and health providers with demographic and economic factors, personalized medicine, and other geospatial and dataintensive applications.
3 Tools for Predictions and Evaluations of Fuzzy Events
 1.
Fuzzy switching mechanisms
 2.
Fuzzy expectation and variance
 3.
Fuzzy relational databases (FRDB), fuzzy datamining and fuzzy social network architectures (FSNA)
 4.
Neuro Fuzzybased Logic, and Systems
 5.
Complex and multidimensional fuzzy Sets, Logic, and Systems
 6.
Complex fuzzy graphs
 7.
Dynamic and incremental fuzzy clustering
3.1 Making Decisions with no Data
As an example for this idea we use the fuzzy treatment of the transient behavior of a switching system and its static hazards [12]. Perhaps the major reason for the ineffectiveness of classical techniques in dealing with a static hazard and obtaining a logical explanation of the existence of a static hazard lies in their failure to come to grips with the issue of fuzziness. This is due to the fact that the hazardous variable implies imprecision in the binary system, which does not stem from randomness but from the lack of a sharp transition between members in the class of input states. Intuitively, fuzziness is a type of imprecision that stems from a grouping of elements into classes that do not have sharply defined boundaries—that is, where there is no sharp transition from membership to nonmembership. Thus, the transition of a state has a fuzzy behavior during the transition time.
Any fuzzyvalued switching function can be expressed in disjunctive and conjunctive normal forms, in a similar way to twovalued switching functions. A fuzzyvalued switching function over \(n\) variables can be represented by a mapping \(f{:}\, [0, 1]^n \rightarrow [0, 1]\) . We define a Vfuzzy function as a fuzzy function \(f(x)\) such that \(f(\xi )\) is a binary function for every binary ndimensional vector \(\xi \). It is clear that a Vfuzzy function \(f\) induces a binary function \(F\) such that \(F{:}\, [0, 1]^n \rightarrow [0, 1]\) determined by \(F(\xi ) = f(\xi ) \) for every binary ndimensional vector \(\xi \).
If a Vfuzzy function \(f\) describes the complete behavior of a binary combinational system, its steadystate behavior is represented by \(F\), the binary function induced by \(f\). Let \(f(x)\) be an ndimensional Vfuzzy function, and let \(\xi \) and \(\rho \) be adjacent binary ndimensional vectors. The vector \(T_{\xi _j}^{\rho }\) is a static hazard of \(f\) iff \(f(\xi ) = f(\rho ) \ne f(T_{\xi _j}^{\rho }).\)
Theorem 1
Proof

State 1: \(\xi _{j} = 1 \) and \({\overline{\xi }}_{j} = 0 \) imply \(f_{1}(\xi ^{j}) +f_{4}(\xi ^{j}) = 1\).

State 2: \(\xi _{j} = 0\) and \({\overline{\xi }}_{j} = 1 \) imply \(f_{2}(\xi ^{j}) +f_{4}(\xi ^{j}) = 1\).
 Transition state: \(\xi _{j} \in (0,1)\) [which implies \({\overline{\xi }}_{j} \in (0, 1)\)], and thus:It is clear from the transition state that \(f_{4}(\xi _{j})\) cannot be equal to one, and thus:$$ 0 \le max\{min[\xi _{j}, f_{1}(\xi ^{j})], min[{\overline{\xi }}_{j}, f_{2}(\xi ^{j})], min[\xi _{j},{\overline{\xi }}, f_{3}(\xi ^{j})], f_{4}(\xi ^{j})\}< 1. $$$$ f_{4}(\xi ^{j})= 0, \qquad f_{1}(\xi ^{j}) = f_{2}(\xi ^{j}) = 1. $$
Several items must be pointed out. The system is not a fuzzy system. It is a Boolean system. The modeling of the system as a fuzzy system is due to the lack of knowledge regarding the behavior of \(\mathrm{x}_{j}\) during the transition. It is providing us with a tool to make decisions (regarding the Boolean values of \(f_{1}, f_{2}\) and \(f_{4}\)) with no data whatsoever regarding \(x^j\). Thus, we were able to make nonfuzzy decisions in a deterministic environment with no data.
3.2 Fuzzy Expectation and Variance
Ordinarily, imprecision and indeterminacy are considered to be statistical, random characteristics and are taken into account by the methods of the Probability Theory. In real situations, a frequent source of imprecision is not only the presence of random variables, but the impossibility, in principle, of operating with exact data as a result of the complexity of the system, or the imprecision of the constraints and objectives. At the same time, classes of objects that do not have clear boundaries appear in the problems; the imprecision of such classes is expressed in the possibility that an element not only belongs or does not belong to a certain class, but that intermediate grades of membership are also possible. The membership grade is subjective; although it is natural to assign a lower membership grade to an event that have a lower probability of occurrence. The fact that the assignment of a membership function of a fuzzy set is “nonstatistical” does not mean that we cannot use probability distribution functions in assigning membership functions. As a matter of fact, a careful examination of the variables of fuzzy sets reveals that they may be classified into two types: statistical and nonstatistical.
Definition 1
 1.
\(\upmu (\varPhi )=0 \qquad (\varPhi \, \text {is the empty set})\);
 2.
\(\upmu (\Omega ) = 1\);
 3.
If \(\alpha , \beta \in B\) and \(\alpha \subset \beta \) then \(\upmu (\alpha ) \le \upmu (\beta )\);
 4.If \(\{\alpha _{j}\mid 1 \le j < \infty \}\) is a monotonic sequence, then$$ {\mathop {lim}\limits _{j \rightarrow \infty }}[\upmu (\alpha _{j})] = \upmu [{\mathop {lim}\limits _{j \rightarrow \infty }}(\alpha _{j})]. $$
Clearly, \(\varPhi , \Omega \in B\); also, if \(\{\alpha _{j}\mid 1 \le j < \infty , {\alpha _{j}} \in B\}\) is a monotonic sequence then \({\mathop {lim}\limits _{j \rightarrow \infty }}(\alpha _{j}) \in B\). In the above definition, (1) and (2) mean that the fuzzy measure is bounded and nonnegative, (3) means monotonicity (in a similar way to finite additive measures used in probability), and (4) means continuity. It should be noted that if \(\Omega \) is a finite set, then the continuity requirement can be deleted. \((\Omega , B, \upmu )\) is called a fuzzy measure space; \(\upmu (\cdot )\) is the fuzzy measure of \((\Omega , B)\). The fuzzy measure \(\upmu \) is defined on subsets of the real line. Clearly, \(\upmu [\chi _{A} \ge T]\) is a nonincreasing, realvalued function of T when \(\chi _{A}\) is the membership function of set \(A\). Throughout our discussion, we use \(\xi ^{T}\) to represent \(\{x\mid \chi _{A}(x) \ge T\}\) and \(\upmu (\xi ^T)\) to represent \(\upmu [\chi _{A} \ge T]\), assuming that the \(A\) set is well specified. Let \(\chi ^{A}{:}\, \Omega \rightarrow [0, 1]\) and \(\xi ^{T} = \{x\mid \chi _{A}(x) \ge T\}\). The function \(\chi _{A}\) is called a Bmeasurable function if \(\xi ^{T} \in B, \forall T \in [0, 1]\). Definition 2 introduces the fuzzy expected value (\(FEV\)) of \(\chi _{A}\) when \(\chi _{A} \in [0, 1]\). Extension of this definition when \(\chi _{A} \in [a, b], a<b<\infty \), is presented in [12].
Definition 2
([12]): Let \(\chi _{A}\) be a \(B\)measurable function such that \(\chi _{A} \in [0, 1]\). The fuzzy expected value (FEV) of \(\chi _{A}\) over a set \(A\), with respect to the measure \(\upmu (\cdot )\), is defined as \({\left( \mathop {T \in [0,1]}\limits ^{sup}\right) }\{min[T, \upmu (\xi ^T)]\}\), where \(\xi ^{T} = \{x\mid {\chi _{A}}(x) \ge T\}\). Now, \(\upmu {\{x\mid {\chi _{A}}(x) \ge T\}} = f_{A}(T)\) is a function of the threshold \(T\). The actual calculation of FEV \((\chi _{A})\) then consists of finding the intersection of the curves \(T = f_{A}(T)\). The intersection of the two curves will be at a value \(T = H\), so that FEV \((\chi _{A} = H \in [0,1]\). It should be noted that when dealing with the FEV \((\eta )\) where \(\eta \in [0,1]\), we should not use a fuzzy measure in the evaluation but rather a function of the fuzzy measure, \(\eta '\), which transforms \(\eta \) under the same transformation that \(\chi \) and \(T\) undergo to \(\eta \) and \(T^\prime \), respectively. In general the FEV has the promise and the potential to be used as a very powerful tool in developing ECP technologies.
3.3 Fuzzy Relational Databases and Fuzzy Social Network Architecture
The FRDB model which is based on research in the fields of relational databases and theories of fuzzy sets and possibility is designed to allow representation and manipulation of imprecise information. Furthermore, the system provides means for “individualization” of data to reflect the user’s perception of the data [42]. As such, the FRDB model is suitable for use in fuzzy expert system and other fields of imprecise informationprocessing that model human approximate reasoning such as FSNA [15, 19].
The objective of the FRDB model is to provide the capability to handle imprecise information. The FRDB should be able to retrieve information corresponding to natural language statements as well as relations in FSNA. Although most of these situations cannot be solved within the framework of classical database management systems, they are illustrative of the types of problems that human beings are capable of solving through the use of approximate reasoning. The FRDB model and the FSNA model retrieve the desired information by applying the rules of fuzzy linguistics to the fuzzy terms in the query.
 1.
representation of imprecise information,
 2.
derivation of possibility/certainty measures of acceptance,
 3.
linguistic approximations of fuzzy terms in query languages,
 4.
development of fuzzy relational operators (IS, AS...AS, GREATER, ...),
 5.
processing of queries with fuzzy connectors and truth quantifiers,
 6.
nullvalue handling using the concept of the possibilities expected value,
 7.
modification of the fuzzy term definitions to suit the individual user.
As an example, let us take a look at one of these relations, the similarity relation. Let \(D_{i}\) be a scalar domain, \(y \in D_{i}\). Then \(s(x, y) \in [0, 1]\) is a similarity relation with the following properties: Reflexivity: \(s(x, x) = 1\); Symmetry: \(s(x, y) = s(y, x)\); \(\varTheta \)transitivity: where \(\varTheta \) is most commonly specified as maxmin transitivity. If, \(y, z \in U\), then \(s(x, z) \ge max (y \in D_{i})\,min(s(x, y), s(y, z))\). Another example is the proximity relation defined below. Let \(D_{i}\) be a numerical domain and , \(y, z \in D_{i}\). Here \(p(x,y) \in [0,1]\) is a proximity relation that is reflexive, and symmetric with transitivity of the form \(p(x, z) \ge max (y \in D_{i})p(x, y)*p(y, z)\).
The generally used form of the proximity relations is \(p(x, y) = e^{\beta \mid xy \mid }\), where \(\beta > 0\). This form assigns equal degrees of proximity to equally distant points. For this reason, it is referred to as the absolute proximity in the FRDB and FSNA models. Similarity and proximity are used in evaluation of queries of the general form: “Find \(X\) such that \(X. A \ominus d\) ” Where \(X. A\) is an attribute of \(X, d \in D\) is a value of attribute \(A\) defined on the domain \(D\), and \(\ominus \) is a fuzzy relational operator. Clearly, both FRDS and FSNA may have numerous applications in epidemical outbreak prediction.
In many ECP/DPM programs the amount of information is determined by the amount of the uncertainty—or, more exactly, it is determined by the amount by which the uncertainty has been reduced; that is, we can measure information as the decrease of uncertainty. The concept of information itself has been implicit in many ECP models. That is, both as a substantive concept important in its own right and as a consonant concept that is ancillary to the entire structure of ECP.
3.4 NeuroFuzzy Systems
The term NeuroFuzzy systems refers to combinations of artificial neural networks and Fuzzy logic. NeuroFuzzy systems enable modeling human reasoning via fuzzy inference systems along with the modeling of human learning via the learning and connectionist structure of neural networks. NeuroFuzzy systems can serve as highly efficient mechanisms for inference and learning under uncertainty. Furthermore, incremental learning techniques can enable observing outliers and the Fuzzy inference can allow these outliers to coexist (with low degrees of membership) with “mainstream” data. As more information about the outliers becomes available, the information, and the derivatives of the rate of information flow, can be used to identify potential epidemical crises that are hidden in the outliers. The classical model of NeuroFuzzy systems can be extended to include multidimensional Fuzzy logic and inference systems in numerical domains and in domains characterized by linguistic variables.
Assuming that people form opinions that are fuzzy and that the information exchange between people influences the opinion formation, the opinion formation process is naturally modeled by structures such as fuzzy coupled map networks and fuzzy and neurofuzzy networks [35, 36, 37, 38, 39]. In these networks of information aggregation and personal and collective opinion formation, interesting dynamic processes that eventually produce selforganization in structured opinion groups is developed [35, 39].
3.5 Complex Fuzzy Systems
Several aspects of the ECP program can utilize the concept of complex fuzzy logic [7, 12, 14, 23, 24, 32, 33, 34, 41].
Complex fuzzy logic can be used to represent the twodimensional information embedded in the description of an epidemical crisis; namely, the severity and uncertainty. In addition, inference based on complex fuzzy logic can be used to exploit the fact that variables related to the uncertainty that is a part of epidemical crises are multidimensional and cannot be readily defined via single dimensional clauses connected by single dimensional connectives. Finally, the multidimensional fuzzy space defined as a generalization of complex fuzzy logic can serve as a media for clustering of epidemical crisis information in a linguistic variablebased feature space.
Tamir et al. introduced a new interpretation of complex fuzzy membership grade and derived the concept of pure complex fuzzy classes [32]. This section introduces the concept of a pure complex fuzzy grade of membership, the interpretation of this concept as the denotation of a fuzzy class, and the basic operations on fuzzy classes.
To distinguish between classes, sets, and elements of a set we use the following notation: a class is denoted by an upper case Greek letter, a set is denoted by an upper case Latin letter, and a member of a set is denoted by a lower case Latin letter.
The difference between pure complex fuzzy grades of membership and the complex fuzzy grade of membership proposed by Ramot et al. [23, 24] is that both components of the membership grade are fuzzy functions that convey information about a fuzzy set. This entails different interpretation of the concept as well as a different set of operations and a different set of results obtained when these operations are applied to pure complex grades of membership. This is detailed in the following sections.
3.5.1 Complex Fuzzy Class
A fuzzy class is a finite or infinite collection of objects and fuzzy sets that can be defined in an unambiguous way and comply with the axioms of fuzzy sets given by Tamir and Kandel [33] and the axioms of fuzzy classes given by [3, 6]. While a general fuzzy class can contain individual objects as well as fuzzy sets, a pure fuzzy class of order one can contain only fuzzy sets. In other words, individual objects cannot be members of a pure fuzzy class of order one. A pure fuzzy class of order \(M\) is a collection of pure fuzzy classes of order \(M1\). We define a Complex Fuzzy Class \(\varGamma \) to be a pure fuzzy class of order one, i.e., a fuzzy set of fuzzy sets. That is, \( \varGamma = {\{V_{i}\}}_{i=1}^{\infty }\); or \( \varGamma = {\{V_{i}\}}_{i=1}^{N}\) where \(V_{i}\) is a fuzzy set and \(N\) is a finite integer. Note that despite the fact that we use the notation \( \varGamma = {\{V_{i}\}}_{i=1}^{\infty }\) we do not imply that the set of sets \(\{V_{i}\}\) is enumerable. The set of sets \(\{V_{i}\}\) can be finite, countably infinite, or uncountably infinite. The use of the notation \({\{V_{i}\}}_{i=1}^{\infty }\) is just for convenience.
In order to provide a concrete example we define the following pure fuzzy class. Let the universe of discourse be the set of all the pandemics that hit the U.S. (in any time in the past) along with a set of attributes related to the pandemic, such as spread mechanism, speed of spread, symptoms, etc. Let \(M_{i}\) denote the set of pandemics that hit the U.S. in the last \(i\) years. Furthermore, consider a function \((f_{1})\) that associates a number between 0 and 1 with each set of pandemics. For example, this function might reflect the severity of the pandemics in terms risk to affected people. In addition, consider a second function \((f_{2})\) that associates a number between 0 and 1 with each specific epidemic. For example, this function might denote the incubation time of the relevant microorganisms. The functions \((f_{1}, f_{2})\) can be used to define a pure fuzzy class of order One. A compound of the two functions in the form of a complex number can represent the degree of membership in the pure fuzzy class of “high risk pandemics”in the set of pandemics that have occurred in the last 10 years.
Depending on the form of \({\mu _{\varGamma }}(\alpha )\) (Cartesian or polar), \(\mu _{r}(\alpha )\), ì\(_{i}(\alpha ), r(\alpha ),\) and \(\phi (\alpha )\) denote the degree of membership of \(z\) in \(V\) and/or the degree of membership of \(V\) in \(\varGamma \) Without loss of generality, however, we assume that \(\mu _{r}(\alpha )\) and \(r(\alpha )\) denote the degree of membership of \(V\) in \(\varGamma \) for the Cartesian and the polar representations respectively. In addition, we assume that \( \mu _{i}(\alpha )\) and \(\phi (\alpha )\) denote the degree of membership of \(z\) in \(V\) for the Cartesian and the polar representations respectively. Throughout this chapter, the term complex fuzzy class refers to a pure fuzzy class with pure complexvalued membership function, while the term fuzzy class refers to a traditional fuzzy class such as the one defined by [3].
Degree of Membership of Order \({{\varvec{N}}}\)
Basic propositional fuzzy logic connectives
Operation  Interpretation 

Negation  \(f({'P}) = 1+j1f(P)\) 
Disjunction  \(f(P\oplus Q) = \text {min} (p_{R}, q_{R}) + j\times \text {min}(p_{1}, q_{1})\) 
Conjunction  \(f(P\otimes Q) = \text {min} (p_{R}, q_{R}) + j\times \text {min}(p_{1}, q_{1})\) 
Implication  \(f(P\longrightarrow Q) = \text {min} (1,1  p_{R}+q_{R}) + j\times \text {min}(1,1  p_{1}+q_{1})\) 
Definition 3
 (1)
A fuzzy class of order 0 is a fuzzy set; it is characterized by a degree of membership of order 1 and a mapping into a one dimensional space.
 (2)
A fuzzy class of order 1 is a set of fuzzy sets. It is characterized by a pure complex degree of membership. Alternatively, it can be characterized by a degree of membership of order Two and a mapping into a twodimensional space.
 (3)
A fuzzy class of order \(N\) is a fuzzy set of fuzzy classes of order \(N1\); it is characterized by a degree of membership of order \(N+1\) and a mapping into an \((N+1)\)dimensional space.
Generalized Complex Fuzzy Logic
A general form of a complex fuzzy proposition is: “\(x... A ...B ...\)” where \(A\) and \(B\) are values assigned to linguistic variables and ‘...’ denotes natural language constants. A complex fuzzy proposition \(P\) can get any pair of truth values from the Cartesian interval \([0, 1]\times [0, 1]\) or the unit circle. Formally a fuzzy interpretation of a complex fuzzy proposition \(P\) is an assignment of fuzzy truth value of the form \(p_{r}+jp_{i}\), or of the form \(r(p)e^{j\theta (p)}\), to \(P\). In this case, assuming a proposition of the form “\(x... A ...B ...,\)” then \(p_{r}(r(p))\) is assigned to the term \(A\) and \(p_{i}(\theta (p))\) is assigned to the term \(B\).
For example, under one interpretation, the complex fuzzy truth value associated with the complex proposition:
x is a young person that lives close to the north pole of jupiter
can be \(0.1 +j0.5 \). Alternatively, in another context, the same proposition can be interpreted as having the complex truth value \(0.3e^{j0.2}\). As in the case of traditional propositional fuzzy logic, we use the tight relation between complex fuzzy classes / complex fuzzy membership to determine the interpretation of connectives. For example, let \(C\) denote the complex fuzzy set of “young people that live close to the north pole of jupiter,” and let \(f_{c} = c_{r}+ jc_{i}\), be a specific fuzzy membership function of \(C\), then \(f_{c}\) can be used as the basis for interpretations of \(P\). Next we define several connectives along with their interpretation.
Table 2.1 includes a specific definition of connectives along with their interpretation. In this table, \(P, Q\) and \(S\) denote complex fuzzy propositions and \(f_{S}\) denotes the complex fuzzy interpretation of \(S\). We use the fuzzy Łukasiewicz logical system as the basis for the definitions [5, 9]. Hence, the max tnorm is used for conjunction and the min tconorm is used for disjunction. Nevertheless, other logical systems, such as Gödel fuzzy systems, can be used [5, 20].
The axioms used for fuzzy logic are used for complex fuzzy logic, and Modus ponens is the rule of inference.
Complex Fuzzy Propositions and Connectives Examples
Consider the following propositions(\(P, Q,\) and \(S\) respectively):
\(P\): “x is a young person that lives close to the north pole of Jupiter”.
\(Q\): “x has elevated body temperature with a severe headach”.
\(S\): “x is closely monitored due to high risk of acquiring the pandemic”.
 (1)
\(f({'P}) = (1p_{r}) + j(1p_{I})\)
That is, \({'P}\) denotes the proposition
“x is an old person that lives close to the north pole of Jupiter”.
The confidence level in \({'P}\) is \((1p_{r}) + j(1p_{i})\); where the fuzzy truth value of the term “x is an old person,” is \((1p_{r})\) and the fuzzy truth value of the term “...lives far ...,” is \((1p_{i})\)
 (2)
\(f(P \oplus {'Q}) = \text {max}(p_{r}, 1 q_{r})+j \times \text {max}(p_{i}, 1q_{i}).\)
That is, \((P \oplus {'Q})\) denotes the proposition
“x is a young person that lives close to the north pole of Jupiter”. OR
“x has low fever and no headach”. The truth values of individual terms, as well as the truth value of \(P \oplus {'Q}\) are calculated according to Table 2.1.
 (3)
\(f({'P} \oplus Q) = \text {min}(1 p_{r}, q_{r})+j \times \text {min}(1p_{i}, q_{i}).\)
That is, \(({'P} \oplus Q)\) denotes the proposition
“x is an old person that lives far from the north pole of Jupiter”. AND
“x has high fever and severe headach”. The truth values of individual terms, as well as the truth value of \({'P} \oplus Q\) are calculated according to Table 2.1.
 (4)
Let the term \(R\) stand for \((P \oplus Q)\), (the complex fuzzy interpretation of \(R\) is \(r_{r}+jr_{i}\).) then,
R \(\longrightarrow \) S = min (\(1,1  r_{r}+s_{r}\)) + \(j \times \)min (\(1,1 r_{i}+s_{r}\))
IF “x is a young person that lives close to the north pole of Jupiter”. AND
“x has high fever and severe headach”.
THEN
“x is closely monitored due to high risk of acquiring the pandemic disease”. The truth values of individual terms, as well as the truth value of are calculated according to Table 2.1.
Complex Fuzzy Inference Example
In other words if one is using:
“x is a young person that lives close to the north pole of Jupiter”
AND “x has high fever and severe headach”.
IF
“x is a young person that lives close to the north pole of Jupiter”
AND “x has high fever and severe headach”.
THEN
“x is closely monitored due to high risk of acquiring the pandemic”.
“x is closely monitored due to high risk of acquiring the pandemic”.
Hence, using Modus ponens one can infer:
“x is closely monitored due to high risk of acquiring the pandemic disease”. with a degree of confidence of \(\text {min}(r_{r}, t_{r}) + j \times \text {min}(r_{i}, t_{i})\) .
3.6 Fuzzy Graph Theory
Graph theory and in specific fuzzy graph theory can be used for deriving algorithms for early identification of pandemic outbreaks. In this section we provide the basic definitions and list some of the relevant algorithms. A literature search performed has revealed inconsistencies in the definitions. For this reason, we review some of the definitions of nonfuzzy graphs and provide a detailed and precise definition of the basic terms related to fuzzy graphs.
3.6.1 Nonfuzzy Graphs
A directed graph \(G\) is a tuple of the form \(G = (V, E, \varphi )\), where \(V\) is a set referred to as the set of vertices. \(E\) is a set of edges, and \(\varphi \) is a function \(\varphi {:}\, E \rightarrow V \times V\), such that for every \(e \in E, \varphi (e) = (u, v)\) , where \(u \in V\) and \(v \in V\). We assume that \(V \cap E = \emptyset \) and in general, we use the form \(e = (a, b)\) to denote a specific edge that is “said” to connect the vertices \(a\) and \(b\). For an undirected graph, both \(e_{1} = (u, v)\) and \(e_{2} = (v, u)\) are in the domain/range of \(\varphi \). A relation \(E \subseteq V \times V\) can be used as an implicit definition of an undirected graph with a set of vertices \(V\) and a set of edges \(E\). A weighted graph \(G\) is a quintuple \(G= (V, E, \varphi , w_{1}, w_{2})\), where \(V, E\), and \(\varphi \) are defined before and \(w_{1}: V\rightarrow R; w_{2}: E \rightarrow R\); are functions thatmap vertices and or edges to the set of real numbers \(R\) (it is possible but less common to assign complex weights to vertices and edges).
We list some of the important terms and algorithms related to nonfuzzy graphs. These terms and algorithms can be found in numerous textbooks [2]. The fundamental terms related to graphs are the order of the graph, the order of a vertex, and the connectedness of the graph. Other fundamental terms related to graphs are complete graphs, planner graphs and simple graphs, subgraphs, spanning subgraphs, cliques, paths, cycles, tours, connectivity, Euler tours, Euler cycles, Hamiltonian tours, Hamiltonian cycles, forests, and trees. The fundamental algorithms applied to weighted graphs are: (1) finding the shortest path between vertices, (2) finding the minimum spanning tree, (3) identifying maximal cliques, (4) finding the minimal Euler tour/cycle and (5) finding the minimal Hamiltonian tour/cycle. In this context, short, max and min might relate to the number of vertices/edges or the sum of weights of the relevant vertices/edges.
3.6.2 Fuzzy Graphs
A fuzzy directed graph \(G\) is a quadruple of the form \(\hat{G} = (\hat{V}, \sigma , \hat{E}, \varphi )\), where \(\hat{V}\) is a set referred to as the set of vertices and \(\hat{E} \subseteq \hat{V} \times \hat{V}\) is a set of edges, \(\sigma {:}\, \hat{V} \rightarrow [0, 1]\) is a mapping (function) from \(\hat{V}\) to [0, 1] ( i.e., \(\sigma \) is the assignment of degrees of membership to members of \(\hat{V}\)), and \(\varphi {:}\, \hat{E} \rightarrow [0,1]\) is a function that maps elements of the form \(e \in \hat{E} = (u, v)\), to [0, 1] (i.e., \(\varphi \) is the assignment of degrees of membership to members of \(\hat{E}\)), where \(u \in \hat{V}\) and \(v \in \hat{V}\). We assume that \(\hat{V} \cap \hat{E} = \emptyset \) and in general, we use the form \(e = (a, b)\) to denote a specific edge that is “said” to connect the vertices \(a\) and \(b\). For an undirected graph, both \(e_{1} = (u, v)\) and \(e_{2} = (v, u)\) are in the domain of \(\varphi \). A weighted fuzzy graph \(G\) is an sextuple \(\hat{G} = (\hat{V}, \sigma , w_{1}\hat{E}, \varphi , w_{2})\), where \(\hat{V}, E, \sigma \), and \(\varphi \) are as defined previously, \(w_{1}{:}\, \hat{V}\rightarrow R\); and \(w_{2}{:}\, \hat{E}\rightarrow R\) are functions that map vertices and or edges to the set of real numbers \(R\) (it is possible but less common to assign complex weights to vertices and edges).
Following these definitions, a fuzzy graph is a special case of a nonfuzzy weighted graph. Hence, many of the algorithms applied to weighted graphs might be of interest when fuzzy graph and their semantics are considered. Moreover, without loss of generality, we can assume that weights represented by real numbers are normalized to the range of [0, 1]. In this case the vertices and/or the edges can be represented via a complex number representing the degree of membership of the vertex/edge in the graph. Clearly, a nonweighted fuzzy graph is a special case of a “regular” fuzzy graph. Fuzzy graphs were used in neurofuzzy models of information propagation and aggregation, including opinion formation [37, 39]. In the next section we provide important definitions related to complex fuzzy graphs.
3.6.3 Complex Fuzzy Graphs
A complex fuzzy directed graph \(\tilde{G}\) is a quadruple of the form \(\tilde{G} = (\tilde{V}, \sigma , {\tilde{E}}, \varphi )\), where \(\tilde{V}\) is a complex fuzzy set referred to as the set of vertices and \(\tilde{E} \subseteq \tilde{V} \times \tilde{V}\) is a complex fuzzy set of edges, \(\sigma {:}\, \tilde{V} \rightarrow [0,1] \times [0,1]\) is a mapping from \(\tilde{V}\) to \([0,1] \times [0,1]\) (i.e., \(\sigma \) is the assignment of a complex degrees of membership to members of \(\tilde{V}\) ), and \(\varphi {:}\, \tilde{E} \rightarrow [0,1] \times [0,1]\) is a function that maps elements of the form \(e \in \tilde{E} = (u, v)\), to \([0,1] \times [0,1]\) (i.e., \(\varphi \) is the assignment of complex degrees of membership to members of \(\tilde{E}\)), where \(u \in \tilde{V}\) and \(v \in \tilde{V}\). We assume that \(\tilde{V} \cap \tilde{E} = \emptyset \) and in general, we use the form \(e = (a, b)\) to denote a specific edge that is “said” to connect the vertices \(a\) and \(b\). For an undirected graph, both \(e_{1} = (u, v)\) and \(e_{2} = (v, u)\) are in the domain of \(\varphi \). Note that the use of complex fuzzy logic is a very strong “tool” that enables dealing with the edges/vertices as carrying complex fuzzy membership values. Hence, it enables exploiting the features of complex fuzzy set theory, complex fuzzy set theory, and complex fuzzy inference. In general, one can use the two components of the complex number assigned to vertices/edges as denoting complex fuzzy information. Alternatively one can use on of the two components as a real fuzzy value and the second component as a weight. To illustrate we provide the following example.
Complex Fuzzy Graph Example
In this graph the vertex ‘B’ represents Bob along with its degree of membership in a complex fuzzy class. The vertex ‘A’ represents the same for Alice and the directed edge from Bob to Alice represents the part of the communication between Bob and Alice where Bob reveals his membership in yet another complex fuzzy class. This type of graphs can be used to represent information, actions, and inference.
3.6.4 Complex Fuzzy Graphs’ Features and Algorithms
The order of a complex fuzzy graph \(\tilde{G}\) is the cardinality of \(\tilde{V}\) (denoted as \(\mid \!\!{\tilde{V}}\!\!\mid \)). The order of a vertex in \(\tilde{G}\) is the number of edges incident to the vertex. Other terms related to complex fuzzy graphs are complete graphs, planner graphs and simple graphs, sub graphs, spanning subgraphs, cliques, paths, cycles, tours, Euler tours, Euler cycles, Hamiltonian tours, Hamiltonian cycles, forests, and trees. The fundamental algorithms applied to complex fuzzy graphs are: (1) finding the shortest path between vertices, (2) finding the minimum spanning tree, (3) identifying maximal cliques, (4) finding the minimal Euler tour/cycle, and (5) finding the minimal Hamiltonian tour/cycle. In this context, short, max and min, might relate to the number of vertices/edges or the sum of weights of the relevant vertices/edges. These terms and algorithms are derived from their definitions in the context of nonfuzzy graphs [2] and fuzzy graphs [22]. We are currently working on the extension of these algorithms to complex fuzzy graphs. One interesting and relevant example is finding the maximal complex fuzzy clique in a complex fuzzy graph. In this example, we expand the work reported in [22] and use a neurofuzzy system as a “tool” for addressing the problem.
3.7 Dynamic and Incremental Fuzzy Clustering
Clustering is a widely used mechanism for pattern recognition and classification. Fuzzy clustering (e.g., the Fuzzy Cmeans) enables patterns to become members of more than one cluster. Additionally, it enables maintaining clusters that represent outliers through low degree of membership. These clusters would be discarded in clustering of hard (vs. Fuzzy) data. Incremental and dynamic clustering (e.g., the incremental Fuzzy ISODATA) enable the clusters’ structures to change as information is accumulated. Again, this is a strong mechanism for enabling identification of unlikely events without premature discarding of these events. The clustering can be performed in a traditional feature space composed of numerical measurements of feature values. Alternatively, the clustering can be performed in a multidimensional Fuzzy logic space where the features represent values of linguistic variables The combination of powerful classification capability, adaptive and dynamic mechanisms, as well as the capability to consider uncertain data, maintain data with low likelihood of occurrence, and use a combination of numerical and linguistic values makes this tool, one of the most promising tools for predicting epidemical crisis outbreaks. We currently conduct research on dynamic and incremental fuzzy clustering and it is evident that the methodology can serve as a highly efficient tool for identifying outliers. We plan to report on this research in the near future.
4 Conclusion
In this chapter, we have outlined features of epidemical crises outbreaks. We have shown that an important challenge related to an epidemical crisis is the identification of slowevolving uncertain events that points to the potential of occurrence of the crisis before it occurs and of fastevolving data concerning the secondary effect of epidemical crises after the occurrence of primary crisis. We have outlined a set of fuzzy logicbased tools that can be used to address these and other challenges related to ECP.
 1.
Accelerated delivery of technical capabilities for ECP
 2.
Preparation for an uncertain future
 3.
Development of worldclass science, technology, engineering and mathematics (STEM) capabilities
 1.
ValueatRisk (VaR) under fuzzy uncertainty
 2.
Noncooperative fuzzy games
 3.
Fuzzy logicdriven web crawlers and webbots
 4.
Fuzzy Expert Systems and Fuzzy Dynamic Forecasting
References
 1.Aaron, B., Tamir, D.E., Rishe, N., Kandel, A.: Dynamic incremental Kmeans clustering, In: The 2014 International Conference on Computational Science and Computational Intelligence, Las Vegas, USA (2014)Google Scholar
 2.Balakrishnan, R., Ranganathan, K.: Textbook of Graph Theory. Springer, New York (2001)Google Scholar
 3.Běhounek, L., Cintula, P.: Fuzzy class theory. Fuzzy Sets Syst. 154(1), 34–55 (2005)CrossRefzbMATHGoogle Scholar
 4.Bochare, A., Gangopadhyay, A., Yesha, Y., Joshi, A., YeshaYa., Grasso, M.A., Brady, M., Rishe, N.: Integrating domain knowledge in supervised machine learning to assess the risk of breast cancer. Int. J. Med. Eng. Informatics. (In press)Google Scholar
 5.Casasnovas, J., Rosselló, F.: Scalar and fuzzy cardinalities of crisp and fuzzy multisets. Int. J. Intell. Syst. 24(6), 587–623 (2009)CrossRefzbMATHGoogle Scholar
 6.Cintula, P.: Advances in L\(\Pi \) and L\(\Pi \)1/2 logics. Arch. Math. Logic 42, 449–468 (2003)CrossRefzbMATHMathSciNetGoogle Scholar
 7.Dick, S.: Towards complex fuzzy logic. IEEE Trans. Fuzzy Syst. 13, 405–414 (2005)CrossRefGoogle Scholar
 8.Elliott, P., Wartenberg, D.: Spatial epidemiology: current approaches and future challenges. Environ. Health Perspect. 112, 998–1006 (2004)CrossRefGoogle Scholar
 9.Fraenkel, A.A., BarHillel, Y., Levy, A., Foundations of Set Theory, 2nd (edn.). Elsevier, Amsterdam (1973)Google Scholar
 10.Hájek, P.: Fuzzy logic and arithmetical hierarchy. Fuzzy Sets Syst. 3(8), 359–363 (1995)CrossRefGoogle Scholar
 11.Kandel, A., Tamir, D.E., Rishe, N., Fuzzy logic and data mining in disaster mitigation. In: Teodorescu, H.N., (ed.) Improving Disaster Resilience and MitigationNewMeans and Tools, Trends, Book Series: NATO Science Series Computer and Systems Sciences, to be published, 2014, Springer, New York (2014)Google Scholar
 12.Kandel, A.: Fuzzy Mathematical Techniques with Applications. AddisonWesley, Reading (1986)zbMATHGoogle Scholar
 13.Kugaonkar, R., Gangopadhyay, A., Yesha, Y., Joshi, A., YeshaYa., Grasso, M.A., Brady, M., Rishe, N.: Finding associations among SNPs for prostate cancer using collaborative filtering. In: DTMBIO12: Proceedings of the ACM Sixth International Workshop on Data and Text Mining in Biomedical Informatics, pp. 57–60. Hawaii, USA, 29 Oct 2012Google Scholar
 14.Klir, G.J., Tina, A.: Fuzzy Sets, Uncertainty, and Information. Prentice Hall, Upper Saddle River (1988)Google Scholar
 15.Last, M., Kandel, A., Bunke, H. (eds.): Data Mining in Time Series Databases, Series in Machine Perception and Artificial Intelligence, vol. 57. World Scientific, Singapore (2004)Google Scholar
 16.Last, M., Kandel, A. (eds.): Fighting Terror in Cyberspace, Series in Machine Perception and Artificial Intelligence, vol. 65. World Scientific, Singapore (2005)Google Scholar
 17.Lemnios, Z.J., Shaffer, A.: The critical role of science and technology for national defense, Comput. Res. News 21(5), (2009) (a publication of the CRA)Google Scholar
 18.Lu, Y., Zhang, M., Li, T., Guang, Y., Rishe, N.: Online spatial data analysis and visualization system. In: Proceedings of the 19th ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD’13), pp. 72–79. Chicago, Illinois USA, 11–14 August 2013Google Scholar
 19.Mikhail, R.F., Berndt, D., Kandel, A.: Automated Database Application Testing, Series in Machine Perception and Artificial Intelligence, vol. 76. World Scientific, Singapore (2010)Google Scholar
 20.Montagna, F.: On the predicate logics of continuous tnorm BLalgebras. Arch. Math. Logic 44, 97–114 (2005)CrossRefzbMATHMathSciNetGoogle Scholar
 21.Mundici, D., Cignoli, R., D’Ottaviano, I.M.L.: Algebraic foundations of manyvalued reasoning. Kluwer Academic Press, Dordrecht (1999)Google Scholar
 22.Nair, P.S., Cheng, S.C.: Cliques and fuzzy cliques in fuzzy graphs. In: IFSA World Congress and 20th NAFIPS Joint 9\(^{th}\) IEEE International Conference, vol. 4, pp. 2277–2280. (2005)Google Scholar
 23.Ramot, D., Milo, R., Friedman, M., Kandel, A.: Complex fuzzy sets. IEEE Trans. Fuzzy Syst. 10(2), 171–186 (2002)CrossRefGoogle Scholar
 24.Ramot, D., Friedman, M., Langholz, G., Kandel, A.: Complex fuzzy logic. IEEE Trans. Fuzzy Syst. 11(4), 450–461 (2003)CrossRefGoogle Scholar
 25.Ribitzky, R., Yesha, Y., Karnieli, E., Rishe, N.: Knowledge mining & bioinformatics techniques to advance personalized diagnostics & therapeutics. Report to the U.S. National Science Foundation (NSF) on the Outcomes and Consensus Recommendations of the NSFsponsored International Workshop, February 2012, in Florence, Italy, http://CAKE.fiu.edu/HITpapers/Book_post_NSF_Workshop_Knowledge_Mining_and_Bioinformatics_Techniques_to_Advance_Personalized_Diagnostics_and_Therapeutics.pdf
 26.Rishe, N., Sun, Y., Chekmasov, M., Selivonenko, A., Graham, S.: System architecture for 3D terraFly online GIS. In: IEEE Sixth International Symposium on Multimedia Software Engineering (MSE2004), pp. 273–276. Miami, FL, 13–15 December 2004Google Scholar
 27.Rishe, N., Espinal, C., Lucic, T., Yesha, Y., YeshaYa., Mathee, K., Marty, A.: Geospatial data for intelligent solutions in public health. In: eProceedings of Vaccinology 2012, Rio de Janeiro, 3–7 September 2012Google Scholar
 28.Rishe, N., Yesha, Y., YeshaYa., Lucic, T.: Intelligent solutions in public health: models and opportunities. In: Proceedings of the Second Annual International Conference on Tropical Medicine: Intelligent Solutions for Emerging Diseases, p. 45. Miami, Florida, 23–24 February 2012Google Scholar
 29.Rishe, N., Yesha, Y., YeshaYa., Lucic, T.: Data mining and querying in electronic health records. In: Proceedings of Up Close and Personalized, International Congress on Personalized Medicine (UPCP 2012), Florence, Italy, p. 40. 2–5 February 2012Google Scholar
 30.Taleb, N.N.: Fooled by Randomness. Random House, NY (2004)Google Scholar
 31.Taleb, N.N.: The Black Swan. Random House, NY (2007)Google Scholar
 32.Tamir, D.E., Lin, J., Kandel, A.: A new interpretation of complex membership grade. Int. J. Intell. Syst. 26(4), (2011)Google Scholar
 33.Tamir, D.E., Kandel, A.: An axiomatic approach to fuzzy set theory. Inf. Sci. 52, 75–83 (1990)CrossRefzbMATHMathSciNetGoogle Scholar
 34.Tamir, D.E., Kandel, A.: Fuzzy semantic analysis and formal specification of conceptual knowledge. Inf. Sci. Intell. Syst. 82(3–4), 181–196 (1995)zbMATHGoogle Scholar
 35.Teodorescu, H.N.: Selforganizing uncertaintybased networks. In: Systematic Organisation of Information in Fuzzy Systems. Book Series: NATO Science Series Computer and Systems Sciences, vol. 184, pp. 131–159, 2003, NATO Advanced Research Workshop on Systematic Organisation of Information in Fuzzy Systems, Vila Real, Portugal, 24–26 Oct 2001Google Scholar
 36.Teodorescu, H.N., Kandel, A., Schneider, M.: Fuzzy modeling and dynamics. Fuzzy Sets Syst. 106(1), 1–2 (1999)CrossRefMathSciNetGoogle Scholar
 37.Teodorescu, H.N.: Information, data, and information aggregation in relation to the user model. NATO Advanced Research Workshop on Systematic Organisation of Information in Fuzzy Vila Real, Portugal, Oct 24–26, 2001. In: Systematic Organisation of Information in Fuzzy Systems Book Series: NATO Science Series Computer and Systems Sciences, vol. 184, pp. 7–10, 2003Google Scholar
 38.Teodorescu, H.N.: Pattern formation and stability issues in coupled fuzzy map lattices. Stud. Informatics Control 20(4), 345–354 (2011)Google Scholar
 39.Teodorescu, H.N.: Parallelizing dynamic models based on fuzzy coupled map networks. In: IDAACS 2007: Proceedings of The 4th IEEE Workshop on Intelligent Data Acquisition and Advanced Computing Systems, Book Series: IEEE International Workshop on Intelligent Data Acquisition and Advanced Computing SystemsTechnology and ApplicationsIDAACS, pp. 170–175, 2007Google Scholar
 40.Yesha, Y., Rishe, N., YeshaYa., Lucic, T.: Clinicalgenomic analysis using machine learning techniques to predict risk of disease. In: Proceedings of Up Close and Personalized, International Congress on Personalized Medicine (UPCP 2012), p. 48. Florence, Italy, 2–5 Feb 2012Google Scholar
 41.Zadeh, L.A.: The concept of a linguistic variable and its application to approximate reasoning  Part I. Inf. Sci. 7, 199–249 (1975)CrossRefMathSciNetGoogle Scholar
 42.ZemankovaLeech, M., Kandel, A.: Fuzzy Relational Data Bases—A key to Expert Systems. Verlag TUV Rheinland, Koln (1984)zbMATHGoogle Scholar
 43.Zolotov, S. Ben Yosef, D., Rishe, N., Yesha, Y., Karnieli, E.: Metabolic profiling in personalized medicine: bridging the gap between knowledge and clinical practice in Type 2 diabetes. Personalized Med. 8(4), 445–456 (2011)Google Scholar