p class="p1"span class="s1"The discrete mathematical analysis (DMA) is a series of algorithms aimed at the solution of basic problems of data analysis: clustering and tracing in multidimensional arrays, morphological analysis of reliefs, search for anomalies and trends in records etc. All the DMA algorithms are of universal nature, joined by the same formal foundation, based, in its turn, on fuzzy logic (FL) and fuzzy mathematics (FM)./span/pp class="p2"span class="s1"The current study finalizes the search for the anomalies in one-dimensional time series within the scope of DMA: here the initial concept of an interpreter’s logic gets its additional development. First, the formal expert’s opinions are more fully expressed, and this is realized with the more complex measures of activity (the concept of straightenings (Gvishiani et al. 2003; Gvishiani et al. 2004; Zlotnicki et al. 2005) is replaced by the measures of activity which come to the fore): second, for the junction of anomalies, a recently created DPS (Discrete Perfect Sets) algorithm is used DPS (Discrete Perfect Sets) (Agayan et al. 2011; Agayan et al. 2014)./span/p
展开▼
机译：class =“ p1”> class =“ s1”>离散数学分析（DMA）是一系列算法，旨在解决数据分析的基本问题：多维数组的聚类和跟踪，浮雕的形态分析，搜索记录中的异常和趋势等。所有DMA算法都是通用的，并且基于模糊逻辑（FL）和模糊数学（FM），由相同的形式基础加入。 < / p> class =“ p2”> class =“ s1”>当前的研究完成了对DMA范围内的一维时间序列异常的搜索：此处解释器逻辑的初始概念得到了额外的发展。首先，正式专家的意见得到了更充分的表达，并且可以通过更复杂的活动度量（矫正的概念（Gvishiani等，2003; Gvishiani等，2004; Zlotnicki等，2005））来实现。第二，对于异常的交汇处，使用最近创建的DPS（离散完美集）算法DPS（离散完美集）（Agayan等人2011; Agayan等人2014）。
展开▼
