Top-k adaptive comparison mode mining method based on incomplete network tree
A top-k, pattern mining technology, applied in neural learning methods, character and pattern recognition, biological neural network models, etc.
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0119] Given a binary sequence database D={s 1 =s 1 the s 2 the s 3 the s 4 the s 5 the s 6 the s 7 =tggtggt,s 2 =s 1 the s 2 the s 3 =tgt,s 3 =s 1 the s 2 the s 3 the s 4 =tgtt,s 4 =s 1 the s 2 =gt,s 5 =s 1 the s 2 the s 3 the s 4 the s 5 =ggcct,s 6 =s 1 the s 2 the s 3 =gat}, a given density threshold ρ τ =0.2, the expected number of comparison patterns k=3.
[0120] The first step is to read into the sequence database D, the density threshold ρ τ And the expected number of comparison patterns k:
[0121] Read into a given sequence database D, and determine that the total number of sequences contained in it is N, and the number of positive sequences is N + , the number of negative sequences is N - , each sequence in the sequence database D is recorded as sequence s 1 , sequence s 2 , ..., sequence s, ..., sequence s N , where 1≤≤N, the characters contained in the sequence s are respectively recorded as characters s 1 , character s 2 , ......
Embodiment 2
[0217] Given a binary sequence database D={s 1 =s 1 the s 2 the s 3 the s 4 the s 5 the s 6 the s 7 the s 8 =hihiohig,s 2 =s 1 the s 2 the s 3 the s 4 the s 5 the s 6 the s 7 the s 8 the s 9 the s 10 = googgoigoh}, given the density threshold ρ τ =0.2, the expected number of comparison patterns k=3, mining top-k adaptive comparison patterns under one-time conditions.
[0218] In addition to "step (3.2.1.1), create an incomplete network tree of mode q Calculate the support of the mode q in the sequence s sup(q, s) to judge whether it is necessary to create a sub-mode p j node in queue j
[0219] ①If s i =p j and then node As a root node, it can be created directly;
[0220] ②Hypothetical node is the last node of layer (j-1) and has no children, if j>1 and u can be used as The child node of is created; "except, the others are the same as embodiment 1.
[0221] Because when creating an incomplete network tree of mode q under one-time conditio...
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