CN116433799A - Flow chart generation method and device based on semantic similarity and sub-graph matching - Google Patents

Flow chart generation method and device based on semantic similarity and sub-graph matching Download PDF

Info

Publication number
CN116433799A
CN116433799A CN202310698508.2A CN202310698508A CN116433799A CN 116433799 A CN116433799 A CN 116433799A CN 202310698508 A CN202310698508 A CN 202310698508A CN 116433799 A CN116433799 A CN 116433799A
Authority
CN
China
Prior art keywords
document
word
graph
sub
flow chart
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CN202310698508.2A
Other languages
Chinese (zh)
Other versions
CN116433799B (en
Inventor
袁水平
董丙冰
高元鑫
吴信东
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Anhui Sigao Intelligent Technology Co ltd
Original Assignee
Anhui Sigao Intelligent Technology Co ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Anhui Sigao Intelligent Technology Co ltd filed Critical Anhui Sigao Intelligent Technology Co ltd
Priority to CN202310698508.2A priority Critical patent/CN116433799B/en
Publication of CN116433799A publication Critical patent/CN116433799A/en
Application granted granted Critical
Publication of CN116433799B publication Critical patent/CN116433799B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06TIMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T11/002D [Two Dimensional] image generation
    • G06T11/20Drawing from basic elements, e.g. lines or circles
    • G06T11/206Drawing of charts or graphs
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/30Information retrieval; Database structures therefor; File system structures therefor of unstructured textual data
    • G06F16/33Querying
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/30Information retrieval; Database structures therefor; File system structures therefor of unstructured textual data
    • G06F16/36Creation of semantic tools, e.g. ontology or thesauri
    • G06F16/367Ontology
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F8/00Arrangements for software engineering
    • G06F8/10Requirements analysis; Specification techniques
    • YGENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02PCLIMATE CHANGE MITIGATION TECHNOLOGIES IN THE PRODUCTION OR PROCESSING OF GOODS
    • Y02P90/00Enabling technologies with a potential contribution to greenhouse gas [GHG] emissions mitigation
    • Y02P90/30Computing systems specially adapted for manufacturing

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • Computational Linguistics (AREA)
  • Data Mining & Analysis (AREA)
  • Databases & Information Systems (AREA)
  • Software Systems (AREA)
  • Life Sciences & Earth Sciences (AREA)
  • Animal Behavior & Ethology (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)

Abstract

The invention discloses a flow chart generation method based on semantic similarity and sub-graph matching, which comprises the following steps: acquiring a user demand document and an RPA project asset library document; calculating the semantic similarity of the user demand document and the RPA project asset library document, and obtaining a top-k sub-graph to be matched according to the semantic similarity from high to low; constructing a query knowledge graph according to a user demand document, and setting a starting node; searching and matching the subgraphs to be matched in the query knowledge graph to obtain a final optimal matching graph, and returning to the corresponding flow chart. The technical scheme of the invention reduces the time of sub-graph matching search traversal, and more accurately generates the flow chart of the current user requirement from dual constraint of semantics and structure.

Description

Flow chart generation method and device based on semantic similarity and sub-graph matching
Technical Field
The invention belongs to the technical field of data processing, and particularly relates to a flow chart generation method and device based on semantic similarity and sub-graph matching.
Background
For execution of business processes, employees currently spend a great deal of time processing Enterprise Resource Planning (ERP), customer Relationship Management (CRM), spreadsheets, and legacy systems, performing manually repeatable tasks such as entering, copying, pasting, extracting, merging, and moving data of large volumes of data from one system to another. It is contemplated that some of these highly structured, routine, and manual tasks may be handled by robots, so that knowledge workers have more time to handle value-added tasks. Robotic Process Automation (RPA) emerges as a software-based solution for automating rule-based business processes that involve routine tasks, structured data, and deterministic results. The flow chart is an important ring in the RPA technology, the flow chart is drawn according to the requirement of a user, and then the execution code is generated according to the flow chart to complete the appointed operation. The flow chart is helpful in determining how things are going and deciding how the process should be improved. And the manual drawing of the flow chart requires longer time and consumes more manpower resources. How to automatically generate a flow chart for the current user demands by utilizing the existing flow charts in the RPA implementation library can save manpower and material resources, greatly improves the efficiency of RPA implementation, and is the direction of current research.
Disclosure of Invention
In view of this, the invention proposes a flow chart generating method based on semantic similarity and sub-graph matching, comprising the following steps:
s1, acquiring a user demand document and an RPA project asset library document;
s2, calculating semantic similarity of the user demand document and the RPA project asset library document, and obtaining a top-k sub-graph to be matched according to the semantic similarity from high to low;
s3, constructing a query knowledge graph according to the user demand document, and setting a starting node;
and S4, searching and matching the subgraphs to be matched in the query knowledge graph to obtain a final optimal matching graph, and returning to the corresponding flow chart.
The invention also provides a flow chart generating device based on semantic similarity and sub-graph matching, which comprises the following steps:
a processor;
a memory having stored thereon a computer program executable on the processor;
the method comprises the steps of generating a flow chart based on semantic similarity and sub-graph matching, wherein the computer program is executed by the processor.
The technical scheme provided by the invention has the beneficial effects that:
according to the technical scheme provided by the invention, the items similar to the current demands in the project library are screened out through semantic similarity by using the demand documents of the users, meanwhile, the demand documents of the users are constructed into small demand graphs, and the small demand graphs are matched with the RPA project asset knowledge graph by using a fuzzy sub-graph matching method, so that the items similar to the current user demand flow structure are found. First, semantic is used for preliminary screening, and then sub-graph matching is used for searching traversal. On one hand, the time for sub-graph matching search traversal is reduced, and on the other hand, the flow chart of the current user requirement is generated more accurately by double constraint from semantics and structure. The flow chart is automatically generated according to the user requirement by using the generation technology, so that the user can directly use or fine tune conveniently, the process of drawing the flow chart is simplified, the manual intervention is greatly reduced, and the RPA efficiency is improved.
Drawings
FIG. 1 is a flow chart of a flow chart generation method based on semantic similarity and sub-graph matching according to an embodiment of the present invention;
FIG. 2 is a knowledge graph of the agricultural online silver flow water downloading user requirements constructed in an embodiment of the invention;
fig. 3 is a diagram of the network silver flow water downloading knowledge of RPA asset library project B company constructed in an embodiment of the present invention.
Detailed Description
For the purpose of making the objects, technical solutions and advantages of the present invention more apparent, embodiments of the present invention will be further described with reference to the accompanying drawings.
The invention provides a flow chart generation method based on semantic similarity and sub-graph matching, referring to fig. 1, fig. 1 is a flow chart of a flow chart generation method based on semantic similarity and sub-graph matching, comprising the following steps:
s1, acquiring a user demand document and an RPA project asset library document.
In a further embodiment, the user's demand is a farm bank running water download.
And S2, calculating the semantic similarity of the user demand document and the RPA project asset library document, and obtaining a top-k sub-graph to be matched according to the semantic similarity from high to low.
The method comprises the following steps:
s21, a requirement document Q of a user and an RPA project asset library user document
Figure SMS_1
And performing word segmentation and removing stop words.
In the embodiment, a word segmentation component jieba is used for a user requirement document Q and an RPA project asset library user document
Figure SMS_2
And performing word segmentation.
S22, describing the document by using the frequency of word occurrence in the text, and enabling the user' S requirement document Q and RPA project asset library user document
Figure SMS_3
Represented as a one-dimensional vector.
In this embodiment, the method of normalizing the bag of words model of BOW is used to represent Q and Q, respectively
Figure SMS_4
S23, learning each word of the user demand document Q and the RPA project asset library user document according to the one-dimensional vector obtained in S22
Figure SMS_5
Is a term of similarity, in this vector space, the distance between semantically similar terms is similar.
In this embodiment, the word2vec method is used to learn the userEach word of requirement document Q and RPA project asset library user document
Figure SMS_6
Is a term for each word.
S24, calculating user requirement document Q and RPA project asset library user document by using WMD algorithm
Figure SMS_7
The text similarity between the two documents is obtained by the WMD algorithm, the document distance is modeled into a combination of semantic distances of words in the two documents, the Euclidean distance is calculated for word vectors corresponding to any two words in the two documents, and then the Euclidean distances are weighted and summed. The WMD algorithm is an algorithm that measures the similarity of texts by calculating the distance of words between texts based on word2 vec.
S241, document Q and document
Figure SMS_8
The number of times of word occurrence in the document Q is normalized, and word frequency +.>
Figure SMS_9
Document->
Figure SMS_10
The word frequency of the jth word in the list is +.>
Figure SMS_11
Figure SMS_12
Figure SMS_13
Wherein m and n are respectively the document Q and the document D s The number of words in the medium-sized word,
Figure SMS_14
、/>
Figure SMS_15
respectively represent document Q and document D s The number of occurrences of the ith word and the jth word;
s242, calculating word i from document Q and word D from document D s The Euclidean distance between two words of word j of (a) is
Figure SMS_16
Figure SMS_17
wherein ,
Figure SMS_18
and />
Figure SMS_19
The embedded vectors learned for words i and j;
s243, solving the document Q and the RPA project asset library D by using a dynamic programming algorithm s WMD distance of each document:
Figure SMS_20
Figure SMS_21
Figure SMS_22
wherein ,
Figure SMS_23
representing the mapping of word i in document Q to document D s Weights of word j in +.>
Figure SMS_24
Representing word i and document D in document Q s Distance between words j in (a); notably, the ith word of document Q corresponds to D s Weights of all words in a documentThe sum of the values is equal to->
Figure SMS_25
Similarly, D s The sum of the weight values of all words of the j-th word of the document mapped to document Q is equal to +.>
Figure SMS_26
Wherein the smaller the f-number, the more similar the two documents.
S244, calculating document Q and document D s Similarity of (3):
Figure SMS_27
s245, setting a similarity threshold
Figure SMS_28
According to document Q and document D s The similarity of (2) is less than the threshold +.>
Figure SMS_29
And (3) the k RPA project asset documents and the knowledge maps and flowcharts corresponding to the k projects.
In a further embodiment, referring to fig. 2 and fig. 3, fig. 2 is a rural online banking water downloading user demand knowledge graph constructed in the embodiment of the present invention, and fig. 3 is an RPA asset library project B company online banking water downloading knowledge graph constructed in the embodiment of the present invention. The user's demand documents include farm bank running water, etc., and project documents that can be matched to similar completions in the RPA asset library, such as company B running water, including construction bank running water and industry bank running water downloads.
S3, constructing a query knowledge graph according to the user demand document, and setting a starting node. As shown in fig. 2, the user's demand is a rural internet banking serial download, and includes the substeps of a rural internet banking U-shield login, a rural internet banking serial export, and a rural internet banking serial data conversion.
And S4, searching and matching the subgraphs to be matched in the query knowledge graph to obtain a final optimal matching graph, and returning to the corresponding flow chart.
S41, searching the best possible matching result of the query knowledge graph in the sub-graph to be matched by using a TALE approximate large graph matching tool.
S42, if the best matching result is searched in the step S41, returning the matched candidate subgraph and the flow chart corresponding to the matched candidate subgraph, and if the best matching result is not searched, executing the step S43.
S43, dividing the graph according to the attribute of the edge of the current starting node as the inclusion relation to obtain a sub-graph set, and repeatedly executing the step S41 and the step S42, wherein the starting node is updated as the tail entity of the current node until the best matching result is obtained or the sub-graph set is empty.
The invention also provides a flow chart generating device based on semantic similarity and sub-graph matching, which comprises the following steps:
a processor;
a memory having stored thereon a computer program executable on the processor;
the method comprises the steps of generating a flow chart based on semantic similarity and sub-graph matching, wherein the flow chart is generated by the computer program when the computer program is executed by the processor.
According to the technical scheme provided by the invention, the similarity between the user demand document and the RPA project asset library document is measured by using a WMD algorithm, and the project similar to the current user demand is found, so that the scope of further searching by using sub-graph matching is reduced, and the efficiency is improved.
The method of matching the graph division with the subgraph is combined, and the optimal matching subgraph is searched iteratively. Searching the best matching subgraph from the RPA project asset knowledge graph by using a fuzzy subgraph matching method, allowing certain nodes to be unmatched and certain edges to be missed by fuzzy subgraph matching, recommending a related flow chart, and manually participating in correcting the flow chart. When the searching is not completed, the concept of edge division of graph division is utilized, the characteristics of the knowledge graph required by the user are considered at the same time, the relationship edge is limited to be 'containing' relationship, sub-graph division is carried out, and then the best matching sub-graph is searched.
The method for matching the semantic similarity and the subgraph is utilized to jointly generate a flow chart: firstly, searching for the first round by using semantic similarity to obtain a history item which is more similar to the user demand, and simultaneously reducing the matching search space of the second wheel diagram; and secondly, carrying out a second round of search by using fuzzy subgraph matching, finding a history item which is similar to the user demand semanteme and structure as an optimal matching item, and finding a corresponding flow chart.
The previous description of the disclosed embodiments is provided to enable any person skilled in the art to make or use the present invention. Various modifications to these embodiments will be readily apparent to those skilled in the art, and the generic principles defined herein may be applied to other embodiments without departing from the spirit or scope of the invention. Thus, the present invention is not intended to be limited to the embodiments shown herein but is to be accorded the widest scope consistent with the principles and novel features disclosed herein.

Claims (8)

1. The flow chart generation method based on semantic similarity and sub-graph matching is characterized by comprising the following steps of:
s1, acquiring a user demand document and an RPA project asset library document;
s2, calculating semantic similarity of the user demand document and the RPA project asset library document, and obtaining a top-k sub-graph to be matched according to the semantic similarity from high to low;
s3, constructing a query knowledge graph according to the user demand document, and setting a starting node;
and S4, searching and matching the subgraphs to be matched in the query knowledge graph to obtain a final optimal matching graph, and returning to the corresponding flow chart.
2. The flow chart generating method based on semantic similarity and sub-graph matching according to claim 1, wherein step S2 specifically comprises:
s21, a requirement document Q of a user and an RPA project asset library user document
Figure QLYQS_1
The word segmentation is carried out,and removing stop words;
s22, describing the document by using the frequency of word occurrence in the text, and enabling the user' S requirement document Q and RPA project asset library user document
Figure QLYQS_2
Represented as a one-dimensional vector;
s23, learning each word of the user demand document Q and the RPA project asset library user document according to the one-dimensional vector obtained in S22
Figure QLYQS_3
Is a term for each word;
s24, calculating user requirement document Q and RPA project asset library user document by using WMD algorithm
Figure QLYQS_4
Text similarity between.
3. The method for generating a flow chart based on semantic similarity and sub-graph matching according to claim 2, wherein in step S21, the word segmentation component jieba is used for the user' S requirement document Q and RPA project asset library user document
Figure QLYQS_5
And performing word segmentation.
4. The method for generating a flow chart based on semantic similarity and sub-graph matching according to claim 2, wherein in step S22, Q and Q are represented by using a normalized BOW bag-of-word model method, respectively
Figure QLYQS_6
5. The flow chart generating method based on semantic similarity and sub-graph matching according to claim 2, wherein in step S23, each word of the user-required document Q is learned using word2vec methodLanguage and RPA project asset library user documentation
Figure QLYQS_7
Is a term for each word.
6. The method for generating a flow chart based on semantic similarity and sub-graph matching according to claim 2, wherein step S24 specifically comprises:
s241, document Q and document
Figure QLYQS_8
The number of times of word occurrence in the document Q is normalized, and word frequency +.>
Figure QLYQS_9
Document->
Figure QLYQS_10
The word frequency of the jth word in the list is +.>
Figure QLYQS_11
Figure QLYQS_12
Figure QLYQS_13
Wherein m and n are respectively the document Q and the document D s The number of words in the medium-sized word,
Figure QLYQS_14
、/>
Figure QLYQS_15
respectively represent document Q and document D s The number of occurrences of the ith word and the jth word;
s242, calculating word i and word ii from document QFrom document D s The Euclidean distance between two words of word j of (2) is C i,j
Figure QLYQS_16
wherein ,
Figure QLYQS_17
and />
Figure QLYQS_18
The embedded vectors learned for words i and j;
s243, solving the document Q and the document D by using a dynamic programming algorithm s WMD distance of (b):
Figure QLYQS_19
Figure QLYQS_20
Figure QLYQS_21
wherein f is document Q and document D s Is used for the distance of the WMD of (c),
Figure QLYQS_22
representing the mapping of word i in document Q to document D s Weights of word j in +.>
Figure QLYQS_23
Representing word i and document D in document Q s Distance between words j in (a); notably, the ith word of document Q corresponds to D s The sum of the weight values of all words in a document is equal to +.>
Figure QLYQS_24
Similarly, D s The sum of the weight values of all words of the j-th word of the document mapped to document Q is equal to +.>
Figure QLYQS_25
S244, calculating document Q and document D s Similarity of (3):
Figure QLYQS_26
s245, setting a similarity threshold
Figure QLYQS_27
According to document Q and document D s The similarity of (2) is less than the threshold +.>
Figure QLYQS_28
And (3) the k RPA project asset documents and the knowledge maps and flowcharts corresponding to the k projects.
7. The flow chart generating method based on semantic similarity and sub-graph matching according to claim 1, wherein step S4 specifically comprises:
s41, searching the best possible matching result of the query knowledge graph in the sub-graph to be matched by using a TALE approximate large graph matching tool;
s42, if the best matching result is searched, returning the matched candidate subgraph and the flow chart corresponding to the matched candidate subgraph in the step S41, and if the best matching result is not searched, executing the step S43;
s43, dividing the graph according to the attribute of the edge of the current starting node as the inclusion relation to obtain a sub-graph set, and repeatedly executing the step S41 and the step S42, wherein the starting node is updated as the tail entity of the current node until the best matching result is obtained or the sub-graph set is empty.
8. A flow chart generation apparatus based on semantic similarity and sub-graph matching, the apparatus comprising:
a processor;
a memory having stored thereon a computer program executable on the processor;
wherein the computer program when executed by the processor implements a method of generating a flow chart based on semantic similarity and sub-graph matching as claimed in any one of claims 1 to 7.
CN202310698508.2A 2023-06-14 2023-06-14 Flow chart generation method and device based on semantic similarity and sub-graph matching Active CN116433799B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202310698508.2A CN116433799B (en) 2023-06-14 2023-06-14 Flow chart generation method and device based on semantic similarity and sub-graph matching

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202310698508.2A CN116433799B (en) 2023-06-14 2023-06-14 Flow chart generation method and device based on semantic similarity and sub-graph matching

Publications (2)

Publication Number Publication Date
CN116433799A true CN116433799A (en) 2023-07-14
CN116433799B CN116433799B (en) 2023-08-25

Family

ID=87083684

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202310698508.2A Active CN116433799B (en) 2023-06-14 2023-06-14 Flow chart generation method and device based on semantic similarity and sub-graph matching

Country Status (1)

Country Link
CN (1) CN116433799B (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN116628228A (en) * 2023-07-19 2023-08-22 安徽思高智能科技有限公司 RPA flow recommendation method and computer readable storage medium

Citations (14)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20120221558A1 (en) * 2011-02-28 2012-08-30 International Business Machines Corporation Identifying information assets within an enterprise using a semantic graph created using feedback re-enforced search and navigation
US20130111375A1 (en) * 2011-11-01 2013-05-02 Matthew Scott Frohliger Software user interface allowing logical expression to be expressed as a flowchart
CN110704574A (en) * 2019-09-03 2020-01-17 福建省农村信用社联合社 Method and system for managing bank business demand assets
CN111666740A (en) * 2020-06-22 2020-09-15 深圳壹账通智能科技有限公司 Flow chart generation method and device, computer equipment and storage medium
CN112836029A (en) * 2021-01-27 2021-05-25 润联软件系统(深圳)有限公司 Graph-based document retrieval method, system and related components thereof
US20210209311A1 (en) * 2018-11-28 2021-07-08 Ping An Technology (Shenzhen) Co., Ltd. Sentence distance mapping method and apparatus based on machine learning and computer device
WO2021164171A1 (en) * 2020-02-17 2021-08-26 平安科技(深圳)有限公司 Method and apparatus for processing data in knowledge base, and computer device and storage medium
CN113641833A (en) * 2021-08-17 2021-11-12 同济大学 Service requirement matching method and device
US20210374479A1 (en) * 2020-06-02 2021-12-02 Accenture Global Solutions Limited Intelligent payment processing platform system and method
CN114298022A (en) * 2021-12-03 2022-04-08 天津大学 Subgraph matching method for large-scale complex semantic network
WO2022088409A1 (en) * 2020-10-28 2022-05-05 中国商用飞机有限责任公司北京民用飞机技术研究中心 Interactive retrieval method and apparatus, and computer device and storage medium
CN114780746A (en) * 2022-04-22 2022-07-22 润联软件系统(深圳)有限公司 Knowledge graph-based document retrieval method and related equipment thereof
US20220253871A1 (en) * 2020-10-22 2022-08-11 Assent Inc Multi-dimensional product information analysis, management, and application systems and methods
CN115496830A (en) * 2022-09-29 2022-12-20 中国银行股份有限公司 Method and device for generating product demand flow chart

Patent Citations (14)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20120221558A1 (en) * 2011-02-28 2012-08-30 International Business Machines Corporation Identifying information assets within an enterprise using a semantic graph created using feedback re-enforced search and navigation
US20130111375A1 (en) * 2011-11-01 2013-05-02 Matthew Scott Frohliger Software user interface allowing logical expression to be expressed as a flowchart
US20210209311A1 (en) * 2018-11-28 2021-07-08 Ping An Technology (Shenzhen) Co., Ltd. Sentence distance mapping method and apparatus based on machine learning and computer device
CN110704574A (en) * 2019-09-03 2020-01-17 福建省农村信用社联合社 Method and system for managing bank business demand assets
WO2021164171A1 (en) * 2020-02-17 2021-08-26 平安科技(深圳)有限公司 Method and apparatus for processing data in knowledge base, and computer device and storage medium
US20210374479A1 (en) * 2020-06-02 2021-12-02 Accenture Global Solutions Limited Intelligent payment processing platform system and method
CN111666740A (en) * 2020-06-22 2020-09-15 深圳壹账通智能科技有限公司 Flow chart generation method and device, computer equipment and storage medium
US20220253871A1 (en) * 2020-10-22 2022-08-11 Assent Inc Multi-dimensional product information analysis, management, and application systems and methods
WO2022088409A1 (en) * 2020-10-28 2022-05-05 中国商用飞机有限责任公司北京民用飞机技术研究中心 Interactive retrieval method and apparatus, and computer device and storage medium
CN112836029A (en) * 2021-01-27 2021-05-25 润联软件系统(深圳)有限公司 Graph-based document retrieval method, system and related components thereof
CN113641833A (en) * 2021-08-17 2021-11-12 同济大学 Service requirement matching method and device
CN114298022A (en) * 2021-12-03 2022-04-08 天津大学 Subgraph matching method for large-scale complex semantic network
CN114780746A (en) * 2022-04-22 2022-07-22 润联软件系统(深圳)有限公司 Knowledge graph-based document retrieval method and related equipment thereof
CN115496830A (en) * 2022-09-29 2022-12-20 中国银行股份有限公司 Method and device for generating product demand flow chart

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN116628228A (en) * 2023-07-19 2023-08-22 安徽思高智能科技有限公司 RPA flow recommendation method and computer readable storage medium
CN116628228B (en) * 2023-07-19 2023-09-19 安徽思高智能科技有限公司 RPA flow recommendation method and computer readable storage medium

Also Published As

Publication number Publication date
CN116433799B (en) 2023-08-25

Similar Documents

Publication Publication Date Title
US20210019341A1 (en) Implementing a software action based on machine interpretation of a language input
Miao et al. Towards unified data and lifecycle management for deep learning
Das et al. A group incremental feature selection for classification using rough set theory based genetic algorithm
Escalante Automated machine learning—a brief review at the end of the early years
CN116433799B (en) Flow chart generation method and device based on semantic similarity and sub-graph matching
US20190244094A1 (en) Machine learning driven data management
Miao et al. Modelhub: Towards unified data and lifecycle management for deep learning
US20220405701A1 (en) Matching past post-approved transactions with past pre-approved transactions using machine learning systems
Panahi et al. Towards Interactive Debugging of Rule-based Entity Matching.
US20210374276A1 (en) Smart document migration and entity detection
Anderson et al. Sample, estimate, tune: Scaling bayesian auto-tuning of data science pipelines
CN116628228B (en) RPA flow recommendation method and computer readable storage medium
CN117591547A (en) Database query method and device, terminal equipment and storage medium
Bellare et al. Active sampling for entity matching with guarantees
Li et al. Optimizing ml inference queries under constraints
CN116400910A (en) Code performance optimization method based on API substitution
US20220284023A1 (en) Estimating computational cost for database queries
Berti-Équille et al. Explaining automated data cleaning with cleanex
Hsu et al. Similarity search over personal process description graph
Eidoon et al. A vector based method of ontology matching
Lin et al. An efficient modified Hyperband and trust-region-based mode-pursuing sampling hybrid method for hyperparameter optimization
Hmaidi et al. Anime Link Prediction Using Improved Graph Convolutional Networks
US11983185B2 (en) Systems and methods for machine learning-based query context generation and query response handling
CN113849163B (en) API (application program interface) document map-based operating system intelligent programming method and device
US11657803B1 (en) Method for speech recognition by using feedback information

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant