scholarly journals High Influencing Pattern Discovery over Time Series Data

2021 ◽  
Vol 10 (10) ◽  
pp. 696
Author(s):  
Dianwu Fang ◽  
Lizhen Wang ◽  
Jialong Wang ◽  
Meijiao Wang

A spatial co-location pattern denotes a subset of spatial features whose instances frequently appear nearby. High influence co-location pattern mining is used to find co-location patterns with high influence in specific aspects. Studies of such pattern mining usually rely on spatial distance for measuring nearness between instances, a method that cannot be applied to an influence propagation process concluded from epidemic dispersal scenarios. To discover meaningful patterns by using fruitful results in this field, we extend existing approaches and propose a mining framework. We first defined a new concept of proximity to depict semantic nearness between instances of distinct features, thus applying a star-shaped materialized model to mine influencing patterns. Then, we designed attribute descriptors to perceive attributes of instances and edges from time series data, and we calculated the attribute weights via an analytic hierarchy process, thereby computing the influence between instances and the influence of features in influencing patterns. Next, we constructed influencing metrics and set a threshold to discover high influencing patterns. Since the metrics do not satisfy the downward closure property, we propose two improved algorithms to boost efficiency. Extensive experiments conducted on real and synthetic datasets verified the effectiveness, efficiency, and scalability of our method.

Author(s):  
Anne Denton

Time series data is of interest to most science and engineering disciplines and analysis techniques have been developed for hundreds of years. There have, however, in recent years been new developments in data mining techniques, such as frequent pattern mining, that take a different perspective of data. Traditional techniques were not meant for such pattern-oriented approaches. There is, as a result, a significant need for research that extends traditional time-series analysis, in particular clustering, to the requirements of the new data mining algorithms.


As time-series data are eventually large the discovery of knowledge from these massive data seems to be a challenge issue. The similarity measure plays a primary role in time series data mining, which improves the accuracy of data mining task. Time series data mining is used to mine all useful knowledge from the profile of data. Obviously, we have a potential to perform these works, but it leads to a vague crisis. This paper involves a survey regarding time series technique and its related issues like challenges, preprocessing methods, pattern mining and rule discovery using data mining. Streaming of data is one of the difficult tasks that should be managed over time. Thus, this paper can provide a basic and prominent knowledge about time series in data mining research field.


2018 ◽  
Vol 232 ◽  
pp. 02049
Author(s):  
Dalin Xu ◽  
Yingmei Wei

Sequential pattern mining is always a very important branch of time series data mining. The pattern mining with visual means can be used to extract the knowledge of time series data more intuitively. Based on the research content, this paper analyzes the sequence pattern mining methods in different aspects and their combination with visualization technology. We further discuss and summarize the advantages of different visualization methods in discovering the potential patterns in time series data. Different systems and models have their unique information to show the focus. Compared with the characteristics of the model, the development and evolution of visualization technology for the discovery of potential patterns of time series data can be summarized. Finally, this paper discusses its development trend and how to play a greater role in the era of big data.


Entropy ◽  
2021 ◽  
Vol 23 (3) ◽  
pp. 365
Author(s):  
Qiang Zhao ◽  
Qing Li ◽  
Deshui Yu ◽  
Yinghua Han

In many industrial domains, there is a significant interest in obtaining temporal relationships among multiple variables in time-series data, given that such relationships play an auxiliary role in decision making. However, when transactions occur frequently only for a period of time, it is difficult for a traditional time-series association rules mining algorithm (TSARM) to identify this kind of relationship. In this paper, we propose a new TSARM framework and a novel algorithm named TSARM-UDP. A TSARM mining framework is used to mine time-series association rules (TSARs) and an up-to-date pattern (UDP) is applied to discover rare patterns that only appear in a period of time. Based on the up-to-date pattern mining, the proposed TSAR-UDP method could extract temporal relationship rules with better generality. The rules can be widely used in the process industry, the stock market, etc. Experiments are then performed on the public stock data and real blast furnace data to verify the effectiveness of the proposed algorithm. We compare our algorithm with three state-of-the-art algorithms, and the experimental results show that our algorithm can provide greater efficiency and interpretability in TSARs and that it has good prospects.


2021 ◽  
pp. 89-104
Author(s):  
Yoshimasa Takabatake ◽  
Tomohiro I ◽  
Hiroshi Sakamoto

AbstractWe survey our recent work related to information processing on compressed strings. Note that a “string” here contains any fixed-length sequence of symbols and therefore includes not only ordinary text but also a wide range of data, such as pixel sequences and time-series data. Over the past two decades, a variety of algorithms and their applications have been proposed for compressed information processing. In this survey, we mainly focus on two problems: recompression and privacy-preserving computation over compressed strings. Recompression is a framework in which algorithms transform a given compressed data into another compressed format without decompression. Recent studies have shown that a higher compression ratio can be achieved at lower cost by using an appropriate recompression algorithm such as preprocessing. Furthermore, various privacy-preserving computation models have been proposed for information retrieval, similarity computation, and pattern mining.


2020 ◽  
Vol 70 (2) ◽  
pp. 275-296
Author(s):  
József Varga ◽  
Gyöngyi Bánkuti ◽  
Rita Kovács-Szamosi

AbstractRating the reliability of banks has always been an important practical problem for businesses and the economic policy makers. The best way to do this is the CAMEL analysis. The aim of this paper was to create a bank-rating indicator from the five fields of the CAMEL analysis using two-two indicators for each field for the Turkish Islamic banking system. According to the results of the analysis, we could rank the Turkish Islamic banks. Beside the widespread use of the CAMEL analysis, we applied the Similarity Analysis as a new method. We compared the results from the two methods and came to the conclusion that the CAMEL analysis does not adequately provide a fairly shaded picture about the banks. The Component-based Object Comparison for Objectivity (COCO) method gave us the yearly results in time series form. The comparison of the time series data leads to the problem of deciding about what is more important for us – average, standard deviation or the slope. For handling this problem, we used Analytic Hierarchy Process, which gave weights to these indicators.


Author(s):  
Anne Denton

Time series data is of interest to most science and engineering disciplines and analysis techniques have been developed for hundreds of years. There have, however, in recent years been new developments in data mining techniques, such as frequent pattern mining, which take a different perspective of data. Traditional techniques were not meant for such pattern-oriented approaches. There is, as a result, a significant need for research that extends traditional time-series analysis, in particular clustering, to the requirements of the new data mining algorithms.


2022 ◽  
pp. 116435
Author(s):  
Meserret Karaca ◽  
Michelle M. Alvarado ◽  
Mostafa Reisi Gahrooei ◽  
Azra Bihorac ◽  
Panos M. Pardalos

Sign in / Sign up

Export Citation Format

Share Document