A Top-K contrast sequential pattern mining algorithm based on concurrence and having interval constraints
A technology of pattern mining and sequence comparison, applied in computing, special data processing applications, instruments, etc., can solve problems such as dissatisfaction, pattern clipping, and difficulty for users to set support thresholds, so as to improve applicability and efficiency. , the effect of improving the efficiency of the algorithm
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0048] Embodiment 1: as Figure 1 to Figure 5 Shown; A Top-k contrast sequence pattern mining algorithm based on concurrency with interval constraint, it includes:
[0049]S1: Input the data set and parameters according to the specified format;
[0050] S2: scan the data set, produce a set of candidate elements and the position information of all elements in it;
[0051] S3: The data set enumeration tree traverses all candidate patterns, and finds the k patterns with the most significant contrast;
[0052] S4: Output the k patterns with the most significant contrast to the specified position.
[0053] The data set parameters input in step S1 include: a) positive example data set; b) negative example data set; c) interval constraint; d) k value.
[0054] Step S2 specifically includes:
[0055] S211: scan the positive example data set in the data set;
[0056] S212: For the input sequence data set, traverse each sequence according to the order of the sequence, and then upda...
Embodiment 2
[0078] Embodiment 2: This embodiment is a preferred implementation. like Figure 1 to Figure 5 Shown; a concurrent Top-k contrast sequence pattern mining algorithm with interval constraints, for the input positive example data set (D+) and negative example data set (D-), the interval constraint γ and the user needs to mine Comparing the number (k) of the most significant comparison patterns, the present invention decomposes specific tasks into multiple parallel parts, and then executes these tasks concurrently, and finally obtains the most significant change in support from the positive example data set to the negative example data set. Sequential patterns of k alignments that are significant and satisfy the interval constraints.
[0079] In order to effectively and efficiently mine the top-k comparison sequence pattern with interval constraints, the present invention needs to solve the four problems of validity, applicability, high efficiency and scalability of high-dimensio...
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