Study of Approximate Periodicity Mining with Multi-granularity Time
Xiao Jian-hua
Abstract
Xiao Jian-hua
Abstract
This paper discusses a mining problem of approximate periodicity with multi-granularity time in the temporal database. It introduces the concepts and properties of the multi-granularity time interval on the basis of multi-granularity time and multi-granularity time format. It constructs multi-granularity approximate periodic pattern. It proposes an mining algorithm based on self-organizing map to find multi-granularity approximate periodic pattern. Results obtained from experiments on high frequency stock market data of 580000 Bao Steel JBT1 demonstrate that the proposed algorithm is efficient.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
This paper discusses a mining problem of approximate periodicity with multi-granularity time in the temporal database. It introduces the concepts and properties of the multi-granularity time interval on the basis of multi-granularity time and multi-granularity time format. It constructs multi-granularity approximate periodic pattern. It proposes an mining algorithm based on self-organizing map to find multi-granularity approximate periodic pattern. Results obtained from experiments on high frequency stock market data of 580000 Bao Steel JBT1 demonstrate that the proposed algorithm is efficient.
Key concepts: Granularity, Computer science, Data mining, Interval (graph theory), Temporal database, Algorithm, Basis (linear algebra), Theoretical computer science