Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Method for expanding domain knowledge database attribute

A technology of attribute expansion and domain knowledge, applied in the direction of knowledge expression, other database retrieval, special data processing applications, etc., can solve the problem of less seed attributes, and achieve the effect of wide coverage, simple and efficient establishment, and close correlation

Inactive Publication Date: 2015-04-29
NANTONG UNIVERSITY
View PDF4 Cites 10 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0003] The purpose of the present invention is to solve the problem that there are few selected seed attributes, and the establishment of domain knowledge requires huge attribute information, so it is necessary to use the seed attribute design algorithm to continuously expand and improve the attribute information to achieve comprehensive and accurate domain knowledge.

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Method for expanding domain knowledge database attribute
  • Method for expanding domain knowledge database attribute
  • Method for expanding domain knowledge database attribute

Examples

Experimental program
Comparison scheme
Effect test

example 1

[0103] Example 1: Seed: word+ / m+ / n Candidate: word+ / m+ /

[0104] Seed refers to the seed mode, and Candidate refers to the candidate mode.

[0105] Table 4

[0106]

[0107] Among them, the 3*3 cells in the lower right corner of the table, first from top to bottom and then from left to right, are A, B, C, D, E, F, G, H, and I in turn. Each bit of Seed is marked as 1, 2, 3, and each bit of Candidate is also marked as 1, 2, 3.

[0108] Table 4 describes the basic calculation process of the edit distance algorithm. At A is the comparison between the first digit of Seed and the first digit of Candidate. After one comparison, the values ​​on the left and upper sides of A are respectively increased by 1, and both sides are 1+ 1=2, since the first digit is the trigger word word with the same content, then the upper left corner of A is 0+0=0, the three added values ​​are 0, 1, 1 respectively, choose the smallest 0, this is The value at A means that this bit is the same and no op...

example 2

[0120] Example 2: Seed: Organize expert consultations Candidate: Organize expert consultations in various provinces

[0121] table 5

[0122]

[0123] As shown in Table 5, in this example, according to the above algorithm steps, the final operand is 2, that is, the Candidate can be converted into Seed by deleting "each" and "province". In this example, the length of the Seed is 6, and the length of the Candidate is 8. According to the matching degree formula, the maximum length is 5, and the operand is 2. Therefore, the matching degree in this example is 1-2 / 8=0.75.

[0124] When the matching degree is greater than or equal to 0.3, it meets the requirements by default, and the seed mode can be added, and if it is less than, the candidate mode is ignored.

[0125] Since the quality of candidate patterns in the step of evaluating seed patterns is very important to the whole process of pattern acquisition, it directly affects the final result. Therefore, a certain standard ...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

The invention discloses a method for expanding domain knowledge database attribute; the method comprises the following steps: establishing an attribute element framework, expanding attribute words by referencing to 'Chinese thesaurus' in order to be used as a seed set; using existing, word class marked and Gate marked attribute information as a seed attribute set; designing a seed mode; selecting content information matched with the seed mode; expressing, in a modeled manner, these characteristic words based on a given text mode structure, so as to generate a new text mode; then using these automatically obtained text modes for extracting new characteristic attributes, and adding these new characteristic attributes into an attribute characteristic seed set; continuously repeating these processes in order to finish expanding the attribute information; the method for expanding domain knowledge database attribute is able to increase the coverage and precision of expanding the domain knowledge database attribute, thereby increasing the quality of the domain knowledge database; meanwhile, the method is simple and efficient.

Description

technical field [0001] The invention relates to the field of information technology, in particular to a method for extending domain knowledge base attributes. Background technique [0002] Automatic query expansion can be divided into global query expansion and local query expansion. Partial query expansion is to extract a certain part of documents from the returned results of the first query, recalculate the search terms and documents, generate new search terms, and search again. It has been proved that this method has improved the effect of information retrieval, but the problem is that if the content that is not related to the required domain knowledge is selected in the result set of automatic expansion, or the previous expansion effect is not good, Then this method will not get better results. Moreover, the secondary expansion will affect the efficiency of search engines. The global-based query expansion method usually establishes a synonym dictionary or a related se...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
Patent Type & Authority Applications(China)
IPC IPC(8): G06F17/30G06F17/27
CPCG06F16/93G06F40/205G06N5/02
Inventor 王理张远鹏钱旦敏董建成姚敏邵劲松蓝俊
Owner NANTONG UNIVERSITY
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products

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