scholarly journals Of the trend detection problem for a stochastic sequence

1972 ◽  
Vol 12 (4) ◽  
pp. 113-123
Author(s):  
I. Legostayeva

The abstracts (in two languages) can be found in the pdf file of the article. Original author name(s) and title in Russian and Lithuanian: И. Легостаева. К задаче выделения тренда случайной последовательности I. Legostajeva. Apie atsitiktinės sekos trendo išskyrimo uždavinį

1971 ◽  
Vol 16 (2) ◽  
pp. 344-349 ◽  
Author(s):  
I. L. Legostaeva ◽  
A. N. Shiryaev

Author(s):  
Faith Ellen ◽  
Rati Gelashvili ◽  
Philipp Woelfel ◽  
Leqi Zhu

2021 ◽  
pp. 106907
Author(s):  
Sahar Behpour ◽  
Mohammadmahdi Mohammadi ◽  
Mark V. Albert ◽  
Zinat S. Alam ◽  
Lingling Wang ◽  
...  

2021 ◽  
Vol 13 (2) ◽  
pp. 1-27
Author(s):  
A. Khalemsky ◽  
R. Gelbard

In dynamic and big data environments the visualization of a segmentation process over time often does not enable the user to simultaneously track entire pieces. The key points are sometimes incomparable, and the user is limited to a static visual presentation of a certain point. The proposed visualization concept, called ExpanDrogram, is designed to support dynamic classifiers that run in a big data environment subject to changes in data characteristics. It offers a wide range of features that seek to maximize the customization of a segmentation problem. The main goal of the ExpanDrogram visualization is to improve comprehensiveness by combining both the individual and segment levels, illustrating the dynamics of the segmentation process over time, providing “version control” that enables the user to observe the history of changes, and more. The method is illustrated using different datasets, with which we demonstrate multiple segmentation parameters, as well as multiple display layers, to highlight points such as new trend detection, outlier detection, tracking changes in original segments, and zoom in/out for more/less detail. The datasets vary in size from a small one to one of more than 12 million records.


Mathematics ◽  
2021 ◽  
Vol 9 (4) ◽  
pp. 443
Author(s):  
Inmaculada Gutiérrez ◽  
Juan Antonio Guevara ◽  
Daniel Gómez ◽  
Javier Castro ◽  
Rosa Espínola

In this paper, we address one of the most important topics in the field of Social Networks Analysis: the community detection problem with additional information. That additional information is modeled by a fuzzy measure that represents the risk of polarization. Particularly, we are interested in dealing with the problem of taking into account the polarization of nodes in the community detection problem. Adding this type of information to the community detection problem makes it more realistic, as a community is more likely to be defined if the corresponding elements are willing to maintain a peaceful dialogue. The polarization capacity is modeled by a fuzzy measure based on the JDJpol measure of polarization related to two poles. We also present an efficient algorithm for finding groups whose elements are no polarized. Hereafter, we work in a real case. It is a network obtained from Twitter, concerning the political position against the Spanish government taken by several influential users. We analyze how the partitions obtained change when some additional information related to how polarized that society is, is added to the problem.


Sign in / Sign up

Export Citation Format

Share Document