search for


Detection of Structural Breaks in Time Series Using Fuzzy Techniques
Int. J. Fuzzy Log. Intell. Syst. 2018;18(1):1-12
Published online March 25, 2018
© 2018 Korean Institute of Intelligent Systems.

Vilém Novák

Institute for Research and Applications of Fuzzy Modeling, NSC IT4Innovations, University of Ostrava, Ostrava, Czech Republic
Correspondence to: Vilém Novák (
Received September 3, 2017; Revised November 28, 2017; Accepted March 18, 2018.
This is an Open Access article distributed under the terms of the Creative Commons Attribution Non-Commercial License ( which permits unrestricted non-commercial use, distribution, and reproduction in any medium, provided the original work is properly cited.

In this paper we suggest to use special “fuzzy” techniques for detection of structural breaks in time series, namely the fuzzy (F)-transform and one method of fuzzy natural logic (FNL). The idea is based on application of the F1-transform which makes it possible to estimate effectively slope of time series (ignoring its possible volatility) and its evaluation by a suitable evaluative linguistic expression. The method is computationally very effective.

Keywords : Fuzzy transform, F-transform, Evaluative linguistic expressions, Fuzzy natural logic
1. Introduction

This paper addresses interesting problem related to the area of mining information from time series (cf. [1]), namely detection of structural breaks in the latter. These are unexpected shifts in the course of the time series that can be caused, e.g., by economic development, global shifts in capital and labor, changes in resource availability due to war or natural disaster, discovery or depletion of natural resources, or a change in political system, etc. From the general point of view, a structural change is possible because of the dynamic nature of the economic system and it occurs when an industry or market changes the way how it functions or operates. Structural breaks are quite frequent and concern not only time series analysis but also general signal processing, for example searching faults in a wire, irregularities in heart functioning, etc.

There are a lot of methods for detection of structural breaks in time series. Most of them are statistical, for example [24]. There are also non-statistical approaches, e.g., [5] where the authors suggest to use genetic algorithms.

In this paper we suggest to use special “fuzzy” techniques for detection of structural breaks in time series, namely the fuzzy (F)-transform and one method of fuzzy natural logic (FNL). Application of these techniques to the analysis and forecasting of time series was described in several papers and also in the book [6]. The first application of the F-transform to detection of changes in a signal was described in [7] where the problem was to recognize network attacks. Let us recall that the F-transform makes it possible to analyze time series, extract its trend and trend-cycle, and to detect specific areas, for example intervals of monotonous behavior. The FNL stems from these results and provides methods for forecasting of the future behavior of time series, automatic generation of linguistic description of specific parts of it, and for obtaining other kinds of information.

One of the important outcomes of the F-transform is its ability to estimate derivatives of the time series (taken as a function) over a larger area that can be specified imprecisely, and in which the volatility is ignored. Then, using methods of FNL, we can generate comments in natural language to various characteristic features of the time series (cf. [8, 9]).

In this paper, we suggest methods how the above mentioned techniques can be used for detection of the structural breaks in time series. We will apply estimation of the first derivative and the theory of evaluative linguistic expressions. The main outcome of this method is its relative simplicity, transparency and computation effectiveness because the complexity of the F-transform is linear.

The structure of the paper is the following. In Section 2, we will briefly overview the main principles of the fuzzy transform with the focus on those parts that are used in our paper. In Section 3, we will mention FNL and especially the theory of evaluative linguistic expressions that is applied in the sequel. In Section 4 we describe how the F-transform is applied in the analysis of time series. Finally, Section 5 is devoted to description of the method for finding structural breaks in time series. The paper is finished by demonstration of the method on four concrete examples of structural breaks and its comparison with statistical methods.

By a fuzzy set AU we understand a function A : U → [0, 1] where U is an ordinary set called the universe. The [0, 1] is the support of a suitable algebra. In this paper we will consider the standard Łukasiewicz MV-algebra (see [10, 11]).

2. The Principle of F-Transform

The fuzzy F-transform is a universal approximation technique introduced in [12, 13]. Its fundamental idea is to map a bounded continuous function f : [a, b] → ℝ to a finite vector F[f] of components and then to transform it back. The former is called the direct F-transform and the latter the inverse one. The result of the inverse F-transform is a function that approximates the original function f. The parameters of the F-transform can be set in such a way that the approximating function has desired properties.

The power of the F-transform stems from the proof of its approximation power, its ability to filter out high frequencies and reduce noise [14], and the possibility to estimate average values of derivatives over a given imprecisely specified area [15]. This property is especially useful in mining information from time series.

2.1 Fuzzy Partition

The first step of the F-transform procedure is to form a fuzzy partition of the domain [a, b]. It consists of a finite set of fuzzy sets

A={A0,,An},         n2,

defined over nodes


The properties of the fuzzy sets from are specified by five axioms, namely: normality, locality (bounded support), continuity, unimodality, and orthogonality. The support of k-the fuzzy set Ak, k = 1, . . . , n – 1, is formed by the interval [ck–1, ck] ∪ [ck, ck+1]. A fuzzy partition is called h-uniform if the nodes c0, . . . , cn are h-equidistant, i.e., for all k = 0, . . . , n – 1, ck+1 = ck + h, where h = (ba)/n and the fuzzy sets A1, . . . , An–1 are shifted copies of a generating function A : [−1, 1] –→ [0, 1] such that for all k = 1, . . . , n–1

Ak(x)=A(x-xkh),         x[ck-1,ck+1]

(for k = 0 and k = n we consider only half of the function A, i.e. restricted to the interval [0, 1] and [−1, 0], respectively). Membership functions A0, . . . , An of the fuzzy sets forming the fuzzy partition are usually called basic functions.

The orthogonality is formally defined as

i=1nAi(x)=1,         x[a,b]

(Equation (3) is sometimes called Ruspini condition).

2.2 Zero Degree F-Transform

Once the fuzzy partition A0, . . . , is determined, we define a direct F-transform of a continuous function f as a vector F[f] = (F0[f], . . . , Fn[f]), where each k-th component Fk[f] is equal to

Fk[f]=abf(x)Ak(x)dxabAk(x)dx,         k=0,,n.

Clearly, the Fk[f] component is a weighted average of the functional values f(x) where weights are the membership degrees Ak(x). The inverse F-transform of f with respect to F[f] is a continuous function : [a, b] –→ ℝ such that

f^(x)=k=0nFk[f]·Ak(x),         x[a,b].
Theorem 1

The inverse F-transform has the following properties:

  1. The sequence of inverse F-transforms {n} determined by a sequence of uniform fuzzy partitions based on uniformly distributed nodes with h = (ba)/n uniformly converges to f for n→∞.

  2. The F-transform is linear, i.e., if f = αu + βv then = αû + βv̂.

All the details and full proofs can be found in [12, 13].

2.3 Higher Degree F-Transform

The F-transform introduced above is F0-transform (i.e., zero-degree F-transform). Its components are real numbers. If we replace them by polynomials of arbitrary degree m ≥ 0, we arrive at the higher degree Fm transform. This generalization has been in detail described in [13]. Let us remark that the F1 transform enables to estimate also derivatives of the given function f as weighted average values over a specified area.

The direct F1-transform of f with respect to A1, . . . , An–1 is a vector F1[f]=(F11[f],,Fn-11[f]) where the components Fk1[f], k = 1, . . . , n – 1 are linear functions


with the coefficients βk0,βk1 given by


Note that βk0=Fk[f], i.e. the coefficients βk0 are just the components of the F0 transform given in (4). The F1-transform has also the properties stated in Theorem 1 (see [13]).

We may also use the F2-transform. Its components are the functions


(provided that the basic functions are triangles) and the coefficient βk2 is estimation of the second derivative.

Theorem 2

If f is four-times continuously differentiable on [a, b] then for each k = 1, . . . , n – 1,


Thus, each F-transform component provides a weighted average of values of the function f in the area around the node ck (8), and also a weighted average of slopes (9) of f and that of its second derivatives (10) in the same area. Let us remark that only the nodes c1, . . . , cn–1 should be considered when dealing with the F-transform

3. Fuzzy Natural Logic

3.1 Definition of FNL

The fuzzy natural logic is a class of formal logical theories developed on unique grounds whose goal is to develop a mathematical model of special human reasoning schemes that employ natural language. So far, the following theories are included:

  1. A formal theory of evaluative linguistic expressions [16].

  2. A formal theory of fuzzy/linguistic IF-THEN rules and approximate reasoning [1720].

  3. A formal theory of intermediate and generalized fuzzy quantifiers [2125].

In this paper, we will apply only the theory of evaluative linguistic expressions.

Remark 1

Of course, the fuzzy IF-THEN rules or fuzzy and generalized quantifiers are studied by many authors, for example [26, 27] or [2831]. Though a lot of their results are source of inspiration for the development of FNL, they lack a sound formal theory and so, we do not consider them as part of FNL.

3.2 Evaluative Linguistic Expressions

Evaluative linguistic expressions are special expressions of natural language that have the general form

linguistic hedgeTE-adjective

where 〈TE-adjective〉 is one of the canonical adjectives “small, medium, big”, or “zero” and possibly also a symmetric fuzzy number. Instead of the canonical adjectives, we can use other kinds of adjectives having similar nature (they belong to specific classes such as gradable or evaluative adjectives), for example “shallow, medium deep, deep”, “weak, medium strong, strong”, etc. The 〈linguistic hedge〉 is a special expression that makes the meaning of the 〈TE-adjective〉 more specific. Quite often it is represented by an intensifying adverb such as “very, roughly, approximately, significantly”, etc. Linguistic hedges can have narrowing (“extremely, significantly, very, typically”) and widening effect (“more or less, roughly, quite roughly, very roughly”) on the meaning of the 〈TE-adjective〉.

If 〈linguistic hedge〉 is not present (expressions such as “weak, large”, etc.) then we take it as presence of empty linguistic hedge. Thus, all the simple evaluative expressions have the same form (11). Since they characterize values on an ordered scale, we may consider also scales divided into two parts that are usually interpreted as positive and negative. Hence, the evaluative expressions may have also a sign, namely “positive” or “negative”. Simple evaluative expressions of the form (11) can also be combined using logical connectives (usually “and” and “or”) to obtain compound ones but we do not consider them in this paper. The set of all (considered) evaluative expressions is denoted by EvExpr.

We distinguish abstract evaluative expressions from more specific evaluative predications. The latter are expressions of natural language of the form ‘X is ’ where is an evaluative expression and X is a variable which stands for objects, for example “degrees of temperature, height, length, speed”, etc. Examples are “temperature is high”, “speed is extremely low”, “quality is very high”, etc. In general, the variable X represents certain features of objects such as “size, volume, force, strength,” etc. and so, its values are often real numbers.

When using evaluative expressions, we must first specify the linguistic context. In our theory it is an interval [vL, vS] ∪ [vS, vR] determined by a triple of numbers w = 〈vL, vS, vR〉 where vL is the leftmost typically small value, vS is typically medium value and vR is the rightmost typically big value. For example, when speaking about temperature of water, we may set vL = 15°C (water temperature in the crane), vS = 50°C and vR = 100°C. In the sequel, we will consider a set of all linguistic contexts


The element x belongs to a context wW if x ∈ [vL, vR] and we may write xw.

The meaning of an evaluative linguistic expression or predication is represented by its intension

Int(Xis A):WF(R)

where ℱ(ℝ) is a set of all fuzzy sets on ℝ. This is a function that to each context wW assigns the extension Extw(X is ) where the latter is a specific fuzzy set on ℝ. Example of extensions of several evaluative linguistic expressions is in Figure 1. Let us emphasize that their shapes have been established on the basis of logical analysis of the meaning of the corresponding evaluative expressions (for the details, see [16]).

Moreover, there is a natural ordering ⋘ of these expressions obtained as lexicographic ordering based on the natural ordering


and the following ordering of hedges:

Ex(extremely)Si(significantly)Ve(very)empty hedgeMLmore or lessRo(roughly)QR(quite roughly)VR(very roughly)<<<VV(very very roughly).

The linear lexicographic ordering ⋘ of simple evaluative expressions (11) can be interpreted as “to be more precise” (or, “to have a sharper meaning”).

The function due to the following definition is needed in the sequel.

Definition 1

The function of local perception is a partial function LPerc : ℝ × W –→ EvExpr defined as follows:

LPerc(u,w)={Xis Aif uw,undefinedotherwise.

If (15) is defined, then “X is ” is the sharpest evaluative predication in the sense of the lexicographic ordering ⋘ so that uw ⊂ ℝ is the most typical element for the extension Extw(X is ).

4. Time Series and F-Transform

4.1 Decomposition of Time Series

A time series is a stochastic process (see [32, 33]) X : Q × Ω −→ ℝ where Ω is a set of elementary random events and Q = {0, . . . , p} ⊂ ℕ is a finite set whose elements are interpreted as time moments. Statistical models assume that each X(t), tQ is a random variable having a specific distribution function. This assumption is the basis of many kinds of probabilistic methods for analysis and forecasting of time series.

Fuzzy techniques stem from the following decomposition model:

X(t)=Tr(t)+C(t)+S(t)+R(t),         tT,

where Tr is the trend, C is a cyclic component, S is a seasonal component that is a mixture of periodic functions. Note that Tr, C, S are ordinary functions not being stochastic. Only R is a random noise, i.e., a sequence of independent random variables R(t) such that for each , the R(t) has zero mean and finite variance. Let us remark that trend and cyclic component are quite often joined into one component TC(t) = Tr(t) + C(t) called trend-cycle.

Let us now assume (without loss of generality) that the time series (16) contains periodic subcomponents with frequencies λ1< · · · < λr. These frequencies correspond to periodicities


respectively (via the equality T = 2π/λ).

The following theorem demonstrates the power of the F-transform for time series analysis.

Theorem 3

Let X(t) be realization of the stochastic process (16). Let us assume that all subcomponents with frequencies λ lower than λq are contained in the trend-cycle TC. If we construct a fuzzy partition over the set of equidistant nodes (2) with the distance h = dTq where d ∈ ℕ and Tq is a periodicity corresponding to λq then the corresponding inverse F-transform of X(t) gives the following estimation of the trend-cycle:


for t ∈ [c1, cn–1], where D for d ≥ 2 is a certain small number and ω(h,TC) is a modulus of continuity of TC w.r.t. h.

The precise form of D and the detailed proof of this theorem can be found in [14, 34]. The theorem holds both for F0 as well as for F1-transform. It follows from it that the F-transform makes it possible to filter out frequencies higher than a given threshold and also reduces the noise R.

The periodicity Tq can be found using the well known periodogram — see [32, 33]. Then, by setting a proper fuzzy partition due to Theorem 3, we first compute the F-transform of X(t) (either zero or first degree)


Then the estimation of the trend-cycle TC is obtained using the inverse F-transform: TC(t) ≈ (t).

Theorem 3 tells us how the distance between nodes of the fuzzy partition should be set to obtain good estimation of the trend-cycle. Namely, we put it equal to h = dTq where d is in practice equal to 1 or 2. The fuzzy partition is constructed over an interval [0, p] of real numbers, i.e., it is not constructed over the discrete set of natural numbers. Consequently, we obtain TC which means that we can estimate the trend cycle TC with high fidelity. Of course, the estimation depends on the course of TC and it is the better the smaller is the modulus of continuity ω(h,TC) (which is usually the case).

4.2 Characterization of Trend Using Expressions of Natural Language

In this section, we will briefly describe the principles of linguistic evaluation of the (direction of) trend of time series in a local time slot (for example, quarter of year, production period, etc.). Such evaluation is later used in the detection of structural breaks.

The trend is estimated using the coefficients βk1 determined in (7). Their values over the areas characterized by the respective fuzzy sets Ak (from the fuzzy partition (1)) are evaluated by a specific evaluative expressions. The procedure, that is based on the theories of F-transform and FNL, is outlined below and in detail described in [6, 9]. Note that a similar problem has been discussed also by Kacprzyk et al. [35]. Their approach is based on a construction of a properly inclined line and selection of several angles that might represent specific inclinations of the trend line. The whole procedure, however, is purely heuristic and is not well justified mathematically.

First, we must specify a context in which the (direction of) the trend is evaluated. This is clear because, for example, the increase of temperature in Sweden by 3°C in, say, 2 hours can be taken as a “sharp increase”, while the same in Africa is a “very small increase”. Therefore, must specify the three distinguished values vL, vS, vR of the tangent where vR is the extreme increase (decrease), while the smallest one is typically (but not always) vL = 0. The typical medium value vS is determined analogously as vR. The result is the linguistic context wtg = 〈vL, vS, vR〉 for the trend. Moreover, because we distinguish between increase and decrease of time series, we must also distinguish positive context wtg+=vL+,vS+,vR+ from the negative one wtg-=vR-,vS-,vL-. We usually put vL-=vL+=0.

The trend can be evaluated by the following sentence:

Trendis direction


direction:=stagnatingspecial hedgesign,sign:=increasing decreasing


special hedge:=negligiblyslightlysomewhatclearlyroughlysharplysignificanly.

The empty hedge ∅︀ is used if no more specific characterization of the direction of the trend is required. Note that (19) is not the only possibility. Other possibilities are described in [6].

The evaluative predication (19) is translated into the following standard form:

TrendofXT¯is ±Ev[XT¯]

where is an evaluative expression in which the TE-adjective is canonical (i.e., either of “small, medium, big” or “zero”). This leads to the following definition.

Definition 2

Let X be a time series (16) and be a time interval. Let be coefficient (7) that provides estimation of the slope of trend of X in the area determined by a fuzzy set A with the support . Finally, let wtg-wtg+ be the corresponding context. Then, the evaluative expression ± in (22) is obtained using the function of local perception as follows:


Note that (23) characterizes trend over the time period . Translation of the evaluative expressions (23) into the expressions due to (19), (20) and (21) is in Table 1.

From (23) we can construct extension in the context of either wtg+ or wtg-, depending on the sign of the evaluative expression (23).

Extwtg(TrendofXT¯is direction)R.

Recall that (24) is a fuzzy set of values of the slopes of estimated by (7). More details can be found in [6].

5. Detection of Structural Breaks in Time Series

5.1 The Principle of Detection of Structural Breaks

The fundamental idea for detection of structural breaks consists in the application of the F1-transform over properly defined fuzzy partition. Note that the supports of the basic functions cannot be too wide because then the structural breaks might disappear among other values of the time series X(t) (cf. Theorem 3).

Definition 3

Let the realization {X(t) | } of the time series X be given. Let wtg be a context for the trend of X. A structural break is the sudden change of the values X(t) in an interval such that ± in (22) is “±very big” or bigger w.r.t. the ordering ⋘ defined in (14).

As mentioned, the interval is supposed to be “short”. According to the experiments, its proper value should be {4, . . . , 10} (by | · | we denote length of the corresponding interval).

The method for detection of structural breaks using fuzzy modeling methods is the following:

  1. Specify the distance h between nodes of the fuzzy partition (cf. Subsection 2.1). This means that width of the basic functions is equal to 2h. Recall that the fuzzy partition is constructed over the interval .

  2. Set the context wtg for evaluation of the trend in areas determined by the basic functions due to item 1. This can be determined as follows: vL = 0, vR = (±σ)/(2h) where σ is the standard deviation of the whole time series. Note that it covers both normal course of the time series as well as parts of the structural breaks. Alternatively, we can set vR on the basis of the knowledge of the character of time series or, replace σ by r=maxtTX(t)-mintTX(t).

  3. Compute the F1-transform F1[f]=(F11[X],,Fn-11[X]) over the fuzzy partition determined in item 1.

  4. Locate all components Fk[X], where the coefficient βk1 in (7) is characterized as fairly large increase (decrease), or larger w.r.t. ordering ⋘ specified in (14), and the context wtg from step 2. In other words, this means that LPerc(βk1[X],wtg-wtg+){RoBi,RaBi,MLBi,VeBi,SiBi,ExBi}

    To make the location more convincing, it is possible to shift the corresponding basic function(s) Ak slightly to the left or right. Let us emphasize, however, that the shift can be only little and, as the whole procedure is very robust, we do not need to find the maximal value of βk1[X].

  5. The located components point to the areas of structural breaks in the time series. The areas are determined by the corresponding fuzzy sets (basic functions) from the fuzzy partition (1).

5.2 Demonstration

The method presented in the previous subsection is demonstrated on examples. We prepared 4 artificial time series with typical structural breaks—see Figure 2. The time series were obtained by combination of few real time series taken from the INDUSTRY subset of time series on a monthly basis from the M3-Competition published on the Internet.

5.2.1 Detection using fuzzy modeling methods

Each time series in Figure 3 is depicted together with the fuzzy partition (Figure 3 was prepared using the experimental software FT-studio which makes it possible to apply fuzzy transform to a function given either by a precise formula, or by the data. The program was developed in the Institute for Research of Applications of Fuzzy Modeling of the University of Ostrava, Czech Republic. Its author is Radek Valášek). All the fuzzy partitions are equidistant with h = 4, formed by triangular basic functions with the support equal to 2h. The linguistic contexts of each time series were obtained by setting ±vR = σ/(2h), vL = 0 and vS = 0.4 vR. The standard deviations are σ(a) = 978, σ(b) = 1711, σ(c) = 6307, σ(d) = 4921, respectively. The results are depicted in Figure 3.

One can see that the places of structural breaks are well detected. Moreover, we also immediately know whether it is jump up or down (in correspondence with the sign of β1):

  • There are 2 structural breaks determined by 3 basic functions. The values of the corresponding coefficients are β101=813,β191=-592 and β201=-465 (from left-to-right) with peaks at the time moments t = 41, 77, 81, respectively. It is clear from the signs of β1 that the structural break is shift up in the area around t = 41 and shift down at t ∈ {77, 81}.

    Linguistic evaluation of the course of time series between the structural breaks (the interval [41, 77]) is “stagnating” (Evaluation of the course of time series was obtained using the software LFL Forecaster developed in the Institute for Research of Applications of Fuzzy Modeling of the University of Ostrava, Czech Republic. Its author is Viktor Pavliska).

  • There are 4 structural breaks determined by 5 basic functions. The values of the corresponding coefficients are β41=1430,β51=2299,β111=-3898,β181=2408 and β271=-1842 with peaks at the time moments t = 16, 20, 44, 52, 108, respectively.

    Linguistic evaluations of the course of time series between the structural breaks are in both intervals [20, 44] and [52, 108] “stagnating”.

  • There are 2 narrow structural breaks, each determined by 2 basic functions, one for shift up and the second one for shift down. The values of the corresponding coefficients are β101=616,β111=-695,β271=762 and β281=-628 with peaks at the time moments t = 40, 44, 108, 112, respectively.

  • There are 2 structural breaks determined by 2 basic functions. The values of the corresponding coefficients are β121=2595,β211=-2412, with peaks at the time moments t = 49, 85, respectively. As the right break is wider, the neighboring basic function provides the coefficient β221=-690, t = 89. Moreover, because the time series is very volatile for t ∈ {49, 89}, the volatility is reflected also by the coefficients β1 whose values range around ±500. This provides additional information about the course of the time series.

    Linguistic evaluation of the course of time series between the structural breaks (the interval [49, 89]) is also “stagnating” which means that the volatility does not lead to change of the trend. On the other hand, inside this area places with specific course can be detected, e.g., “clear decrease” in [52, 64] and “clear increase” in [64, 75].

  • 5.2.2 Detection using Chow test

    For comparison, we also applied the classical Chow test on the above four artificial time series. It is based on statistical test of significance of non-zero change of regression coefficients

    yi=βixi+ui,         i=1,,n.

    The null hypothesis is H0 : β0 = βi. If it is rejected then there is a structural break detected. Note that Chow test requires longer time series.

    The results of the Chow test applied to the above 4 artificial time series is in Figure 4. One can see that the detection using this method is not convincing. As a matter of fact, all p-values are significant which means that the structural breaks are detected in each time moment. Of course, it does not mean that other statistical methods cannot be successful. At any case, however, we may conclude that our method has the power to detect structural breaks in time series and sometimes is able to give even more convincing results than the standard statistical techniques.

    6. Conclusions

    In this paper we suggested the method how structural breaks in time series can be detected. The method is based on application of the first degree fuzzy transform that provides estimation of the slope of time series in an imprecisely determined area. The structural breaks are easily detected if we use fuzzy partition whose basic functions are sufficiently narrow. The method is robust w.r.t. the starting position of the fuzzy partition. It is also important to emphasize that the detection is extremely fast because time complexity of the fuzzy transform is linear.

    Finally let us remark that this method is related to detection of intervals of monotonous course of time series described in [9]. Using this algorithm, we can obtain information about length and character of the behavior of the time series between structural breaks.


    The paper has been supported by the project IT4I XS (LQ1602).

    Conflict of Interest

    No potential conflict of interest relevant to this article was reported.

    Fig. 1.

    Shapes of extensions of few evaluative expressions in the context 〈0, 0.5, 1〉. The hedges are {Extremely, Significantly, Very, empty hedge} for “small” and “big” and {More-or-Less, Roughly, Quite Roughly, Very Roughly} for “small”, and “big”. Extension of “medium” is not modified but it can be modified by widening hedges.

    Fig. 2.

    Artificial time series with four types of structural breaks.

    Fig. 3.

    Artificial time series from Figure 2 with fuzzy partition and marked basic functions detecting structural breaks. Note that the fuzzy partition is constructed over the interval [0, q]. The evaluative expression over the interval determined by the marked basic functions is always huge increase (decrease). The green line is approximation of the time series using the inverse F-transform.

    Fig. 4.

    The result of Chow test applied to the artificial time series from Figure 2. The upper part of each subfigure is the given time series, in the lower part are the corresponding p-values.


    Table 1

    The translation table between special and canonical evaluative expressions

    Special hedge, direction from (22)
    stagnatingextremely small or zero
    negligiblysignificantly small
    slightlyvery small
    somewhatrather small
    clearlyvery roughly small or medium
    roughlyvery roughly big
    fairly largeroughly big
    quite largerather big
    sharplyvery big
    significantlysignificantly big
    hugeextremely big

    1. Fu, TC (2011). A review on time series data mining. Engineering Applications of Artificial Intelligence. 24, 164-181.
    2. De Wachter, S, and Tzavalis, D (2012). Detection of structural breaks in linear dynamic panel data models. Computational Statistic & Data Analysis. 56, 3020-3034.
    3. Preuss, P, Puchstein, R, and Detter, H (2015). Detection of multiple structural breaks in multivariate time series. Journal of the American Statistical Association. 110, 654-668.
    4. Fischer, P, and Hilbert, A 2014. Fast detection of structural breaks., Proceedings of the 21th International Conference on Computational Statistics, Lisbon, Portugal, pp.9-16.
    5. Doerr, B, Fischer, P, Hilbert, A, and Witt, C (2017). Detecting structural breaks in time series via genetic algorithms. Soft Computing. 21, 4707-4720.
    6. Novak, V, Perfilieva, I, and Dvorak, A (2016). Insight into Fuzzy Modeling. Hoboken, NJ: John Wiley & Sons
    7. Hurtik, P, Hodakova, P, Perfilieva, I, Liberts, M, and Asmuss, S 2015. Network attack detection and classification by the F-transform., Proceedings of IEEE International Conference on Fuzzy Systems, Turkey, Istanbul, Array, pp.1389-1394.
    8. Novak, V (2016). Mining information from time series in the form of sentences of natural language. International Journal of Approximate Reasoning. 78, 192-209.
    9. Novak, V (2016). Linguistic characterization of time series. Fuzzy Sets and Systems. 285, 52-72.
    10. Novak, V, Perfilieva, I, and Mockor, J (1999). Mathematical Principles of Fuzzy Logic. New York, NY: Springer
    11. Hajek, P (1998). Metamathematics of Fuzzy Logic. Array: Kluwer Academic
    12. Perfilieva, I (2006). Fuzzy transforms: theory and applications. Fuzzy Sets and Systems. 157, 993-1023.
    13. Perfilieva, I, Dankova, M, and Bede, B (2011). Towards a higher degree F-transform. Fuzzy Sets and Systems. 180, 3-19.
    14. Novak, V, Perfilieva, I, Holcapek, M, and Kreinovich, V (2014). Filtering out high frequencies in time series using F-transform. Information Sciences. 274, 192-209.
    15. Perfilieva, I, and Kreinovich, V (2011). Fuzzy transforms of higher order approximate derivatives: a theorem. Fuzzy Sets and Systems. 180, 55-68.
    16. Novak, V (2008). A comprehensive theory of trichotomous evaluative linguistic expressions. Fuzzy Sets and Systems. 159, 2939-2969.
    17. Dvorak, A, Stepnicka, M, and Stepnickova, L (2015). On redundancies in systems of fuzzy/linguistic IF-THEN rules under perception-based logical deduction inference. Fuzzy Sets and Systems. 277, 22-43.
    18. Novak, V (2005). Perception-based logical deduction. Computational Intelligence, Theory and Applications. Heidelberg: Springer, pp. 237-250
    19. Novak, V, and Lehmke, S (2006). Logical structure of fuzzy IF-THEN rules. Fuzzy Sets and Systems. 157, 2003-2029.
    20. Novak, V, and Perfilieva, I (2004). On the semantics of perception-based fuzzy logic deduction. International Journal of Intelligent Systems. 19, 1007-1031.
    21. Holcapek, M (2008). Monadic L-fuzzy quantifiers of the type < 1n, 1 >. Fuzzy Sets and Systems. 159, 1811-1835.
    22. Dvorak, A, and Holcapek, M (2009). L-fuzzy quantifiers of the type < 1> determined by measures. Fuzzy Sets and Systems. 160, 3425-3452.
    23. Novak, V (2008). A formal theory of intermediate quantifiers. Fuzzy Sets and Systems. 159, 1229-1246.
    24. Murinova, P, and Novak, V (2012). A formal theory of generalized intermediate syllogisms. Fuzzy Sets and Systems. 186, 47-80.
    25. Murinova, P, and Novak, V (2014). The structure of generalized intermediate syllogisms. Fuzzy Sets and Systems. 247, 18-37.
    26. Dubois, D, and Prade, H (1996). What are fuzzy rules and how to use them. Fuzzy Sets and Systems. 84, 169-185.
    27. Ruan, D, and Kerre, EE (2000). Fuzzy If-Then Rules in Computational Intelligence: Theory and Applications. New York, NY: Springer
    28. Delgado, M, Ruiz, M, Sanchez, D, and Vila, M (2014). Fuzzy quantification: a state of the art. Fuzzy Sets and Systems. 242, 1-30.
    29. Glockner, I (2006). Fuzzy Quantifiers: A Computational Theory. Heidelberg: Springer
    30. Peters, S, and Westerstahl, D (2006). Quantifiers in Language and Logic. Oxford: Oxford University Press
    31. Zadeh, LA (1983). A computational approach to fuzzy quantifiers in natural languages. Computers & Mathematics with Applications. 9, 149-184.
    32. Andel, J (1976). Statistical Analysis of Time Series. Praha: SNTL
    33. Hamilton, JD (1994). Time Series Analysis. Princeton, NJ: Princeton University Press
    34. Nguyen, L, and Novak, V 2015. Filtering out high frequencies in time series using F-transform with respect to raised cosine generalized uniform fuzzy partition., Proceedings of International Conference on Fuzzy Systems, Istanbul, Turkey, Array, pp.1-8.
    35. Kacprzyk, J, Wilbik, A, and Zadrozny, S (2008). Linguistic summarization of time series using a fuzzy quantifier driven aggregation. Fuzzy Sets and Systems. 159, 1485-1499.

    Vilem Novak received M.Sc. in System engineering at Mining Technical University, Ostrava in 1975, Post-gradual course of theoretical cybernetics at Charles University in Prague, Czechoslovakia, 1982. Also, he received Ph.D. in mathematical logic at Charles University, Prague, 1988, DSc. (Doctor of Sciences) in mathematics at Polish Academy of Sciences, Warsaw in 1995, associate professor habilitation, at Palacky University, Olomouc, in 1995, and became full professor in Masaryk University, Brno in 2001. He is professor of the University of Ostrava, Czech Republic and director of the Institute for Research and Applications of Fuzzy Modeling. His research areas are mathematical fuzzy logic, mathematical modeling of linguistic semantics and fuzzy natural logic, fuzzy modeling, modeling with words and their applications. He has been working as a general chair of international conferences IFSA 1997 and EUSFLAT 2007. He works as an editor and guest editor of some academic journals such as Fuzzy sets and systems, Soft computing, and several other ones. He is the author or co-author of more than 270 scientific research articles, 6 scientific monographs and has known for more than 2,000 citations of his books and papers.