Periodic associated rule discovery algorithm based on time sequence vector diverse sequence method clustering

A technology of difference sequences and timing vectors, applied in computing, special data processing applications, instruments, etc., can solve problems such as time-consuming, large candidate item sets, and low operating efficiency

Inactive Publication Date: 2008-02-20
杭州龙衍信息工程有限公司
View PDF1 Cites 25 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0005] Problem 1: Selection of time-domain data feature points
[0009] Question 2: Determination of the number of segments in the cycle time area
[0011] Question 3: The choice of the basic algorithm for discovering periodic association rules
[0012] arts [2][3][4][5][21] Periodic association rule algorithms are based on Apriori algorithm [6] , and text [1] Algorithms and Doc

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Periodic associated rule discovery algorithm based on time sequence vector diverse sequence method clustering
  • Periodic associated rule discovery algorithm based on time sequence vector diverse sequence method clustering
  • Periodic associated rule discovery algorithm based on time sequence vector diverse sequence method clustering

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0021] (1) Related basic concepts and properties of time domain data

[0022] Definition 1 (time-domain data). Time-domain data refers to transaction sets with time attributes. Let the time zone of the entire transaction set be T, which can be expressed as T=∪T i ;T i ∩ T j = 0; |T j |=|T i |Where i≠j; i, j=1, 2,..., n|T i | means T i length of time. here called |T i |is a cycle length, T i is the i-th cycle, |T i |Length is user defined such as 1 year, 1 month or 1 week. The goal of the invention is to find at all periods T i The association relationship between some frequent items in a certain period of time.

[0023] Definition 2 (time series vector). A series of observations obtained in time order, each observation value is an n-dimensional vector, these vectors with time attributes are called time series vectors.

[0024] The time series vector sequence composed of time series vectors is a time series (see the text for related concepts of time series [17] )...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

The utility model relates to a discovering algorithm with clustered cycling associated rule, based on a differing sequence method of time series vector. Firstly, in view of the drawback of the current discovering algorithm with cycling associated rule on the problem of dividing a plurality of time domains, an algorithm called CMDSA is proposed. The algorithm selects a time series vector which comprises a item supporting degree as the data character in time area to cluster; meanwhile, the clustering number is controlled by a DB principle to reach the best clustering result, so that each time area under the cycling associated rule can be identified more accurately and more useful cycling associated rules can be found compared with the current algorithm. Aiming at the fact that all the current algorithm of cycling associated rule are based on the Apriori algorithm and the efficiency is low, an algorithm of CFP-tree based on Fp tree is proposed. The algorithm of CFP-tree adopts cycling tailoring technique based on the condition FP tree to enhance the algorithm efficiency. Thus, the adoption of the discovering algorithm with cycling associated rule of CFP-tree is far better than the prior algorithm based on Apriori in the time and space efficiency.

Description

1 technical field [0001] The present invention relates to an algorithm for discovering periodic association rules of time series in the field of data mining; in particular, it relates to a class of periodic temporal association rules between attribute states based on temporal constraints, which is suitable for developing a limited number of attributes The problem of associativity of states periodically by time. The temporal association rules of equivalent event mapping, non-identical attributes and identical attributes are defined, and the extraction of temporal association rules is determined by calculating the support rate and credibility. While confirming the effectiveness of temporal association rules, the main steps of the algorithm for mining periodic association rules of time series are given. 2 background technology [0002] Changes in the real world are inseparable from time factors, so studying the periodic association rules of temporal data in real world data can...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
IPC IPC(8): G06F17/30
Inventor 曾斌曾凯姜小丽王宇熙
Owner 杭州龙衍信息工程有限公司
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap