Lightning activity data statistics method based on modified Apriori algorithm
A technology of activity data and statistical methods, applied in the laser field, can solve problems such as low efficiency, achieve the effect of improving execution efficiency and saving storage overhead
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0023] The present invention adopts the optimization strategy based on directed graph and weighted association rules to improve Apriori algorithm, promptly based on the optimization method of directed graph and the Apriori algorithm of weighted association rules, first will calculate weighted support degree and weighted confidence degree:
[0024] Let I={i1, i2, ..., im}, the weight vector W={w1, w2, ..., wm} corresponding to i, the i-th transaction ti is a subset of I, and the j-th item in ti ( Denoted as ti [ij]) has a weight w. In this way, each item corresponds to a value in W.
[0025] The item set transaction weight is a summary of the weight of each item in the item set in the database. The item weight of the item set X in the transaction ti is calculated as:
[0026] Weighted support is a summary of the weights of transaction item sets in the transaction database that contain the item:
[0027]
[0028] Where NX is the count of occurrences of X in the database; ...
Embodiment 2
[0032] The invention improves the Apriori algorithm by adopting an optimization strategy based on a directed graph and weighted association rules. The algorithm is stored in a bit vector structure, and there is a bit vector corresponding to each frequent set, so the number of bits in the bit vector is the total number of transactions in the database. The algorithm scans the database only once, counts the frequent items and sets their corresponding bit vectors.
[0033] For example: the transactional database is {, , , , , , , , }
[0034] refer to figure 2 . The specific method is:
[0035]If there is a corresponding item in the transaction, set the corresponding item to 1, otherwise set the corresponding item to 0. After checking all transaction sets, each item corresponds to a binary bit string. Items (nodes) in the database are then mapped to bitmaps sorted from highest to lowest support. If the minimum support count is 2, then the frequent item in this database is i ...
Embodiment 3
[0038] The method of improving the Apriori algorithm optimization based on the directed graph and the weighted association rules to construct the vector bitmap is the same as that in Embodiment 2. Build the frequent binomial graph as described in step 3. In this example combine figure 1 , specifically introduces the construction method of the directed graph. Put the node with the most occurrences of 1 in the obtained bitmap on the top layer. If some two items appear at the same time in one transaction, and the number of occurrences meets the minimum support requirement (greater than or equal to the minimum support), then in the directed Draw an edge between these two nodes in the graph. The edge is represented by a binary string (the binary string is obtained by summing two nodes, and the number of 1s in the string represents the number of times the two nodes appear at the same time). Combined with the transaction database instance in Embodiment 2, the frequent item diagram...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com