Parallelizing method of association analytical algorithm
A correlation analysis and algorithm technology, applied in computing, special data processing applications, instruments, etc., can solve the problem that Apriori cannot adapt well to parallelization, saving time, improving generation speed, and reducing network pressure.
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment Construction
[0036] Details:
[0037] k-itemset: The association rule algorithm is to find rules such as A→B from {A, B, C, D}, {A, B}... and other sets. Therefore, for example, {A}, {C} is called a 1-itemset, {A, B} is called a 2-itemset, and {A, B, C...} is called a k-itemset , where k represents how many items are in the set.
[0038] Frequent k-itemsets: 1-itemsets whose occurrence frequency satisfies the threshold value are called frequent 1-itemsets, and 2-itemsets whose occurrence frequency satisfies the threshold value are called frequent 2-itemsets. Similarly, occurrence The k-itemset whose frequency satisfies the threshold is called frequent k-itemset.
[0039] Candidate frequent k-itemsets: 2-itemsets obtained through set connection that may become frequent 2-itemsets are called candidate frequent 2-itemsets. The k-itemsets obtained through set connection that may become frequent k-itemsets are called candidate frequent k-itemsets.
[0040] Confidence: Indicates how credible...
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