Method for selecting knowledge of computer-assisted decision making system based on undistinguishable relation
A computer-aided knowledge selection technology, applied in the evaluation field of knowledge matching discrimination and screening, can solve the problems that affect the flexible and efficient application of knowledge, and are not enough to describe the supporting strength and degree of auxiliary decision-making
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0083] Suppose the target database is a triplet S=(U,C,d), where U represents the target set, consisting of 10 targets x 1 ,x 2 ,...,x 10 Composition, ie U={x 1 ,x 2 ,...,x 10}, C={c 1 ,c 2 ,c 3 ,c 4} represents the target attribute set, consisting of 4 attributes, d represents the target category, and each record in the target database corresponds to a target x i (1≤i≤10), including target x i The values of the 4 attributes f(x,c 1 ), f(x,c 2 ), ... and f(x,c 4 ), and its target class f(x i , d). At the same time, it is assumed that there is only one piece of knowledge K in the existing knowledge set Ω={K} in the knowledge collection database, that is, |Ω|=n=1, and the knowledge K={c 1 ,c 2}; and assume that the threshold threshold is α=0.9. The target database is shown in the table below. Calculate the decision attribute support vector of knowledge K according to steps 4.1-4.13.
[0084] Table 1 Target database
[0085]
[0086] Step 4.1, constructing...
Embodiment 2
[0115] Assume that on the basis of the target database (Table 1) in the implementation case 1, there is a knowledge set Ω={K 1 , K 2 , K 3}, where knowledge K 1 ={c 1 ,c 2}, knowledge K 2 、K 3 is newly added, and K 2 ={c 3},K 3 ={c 4}, firstly, according to the indistinguishable relationship sets and decision attribute support vectors of the three pieces of knowledge generated in steps 4.1-4.13, assuming that the threshold threshold is α=0.7, then output the final optimized knowledge set according to steps 4.14-4.15.
[0116] For Article 1 Knowledge K 1 ={c 1 ,c 2} The set of indistinguishable relations constructed is: U / IND(K 1 )={{x 1 ,x 2 ,x 3},{x 4 ,x 5 ,x 6},{x 7 ,x 8},{x 9 ,x 10}}. For Article 2 Knowledge K 2 ={c 3} The set of indistinguishable relations constructed is: U / IND(K 2 )={{x 1 ,x 2 ,x 3 ,x 4},{x 5 ,x 6 ,x 7},{x 8 ,x 9 ,x 10}}; for article 3 knowledge K 3 ={c 4} The set of indistinguishable relations constructed is: U / IND(...
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