Intelligent search completion method for block decomposition based on relation interaction
A technology of intelligent search and relation, applied in the field of intelligent search and completion of block decomposition method, can solve problems such as cost and accuracy constraints, and achieve the effect of no technical requirements and simple system interface
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment Construction
[0018] An intelligent search and completion method based on block decomposition based on relational interaction of the present invention will be described in detail below with reference to the embodiments and drawings. Apparently, the described embodiments are only some of the embodiments of the present invention, but not all of them. Based on the embodiments of the present invention, all other embodiments obtained by persons of ordinary skill in the art without creative efforts fall within the protection scope of the present invention.
[0019] Such as figure 1 , figure 2 As shown, a kind of intelligent search and completion method of block decomposition based on relational interaction of the present invention comprises the following steps:
[0020] 1) Divide the data set to be completed into training set T and test set S according to the ratio of 8:2;
[0021] 2) Structuring the data set, specifically, using the language technology platform (LTP) to sequentially perform ...
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