Patents
Literature
Hiro is an intelligent assistant for R&D personnel, combined with Patent DNA, to facilitate innovative research.
Hiro

66 results about "Goal graph" patented technology

Data processing method, device and equipment and medium

Embodiments of the invention provide a data processing method, device and equipment and a medium, and the method relates to an artificial intelligence technology, can be applied to the field of natural language processing, and comprises the steps of obtaining a target text and a standard text, and generating a target entity sub-graph corresponding to the target text and a standard entity sub-graphcorresponding to the standard text according to a knowledge graph, wherein a first entity in the target entity subgraph and a second entity in the standard entity subgraph belong to entities in the knowledge graph; according to the first entity and the second entity, generating a target graph structure feature corresponding to the target entity sub-graph and a standard graph structure feature corresponding to the standard entity sub-graph; and determining graph similarity between the target entity sub-graph and the standard entity sub-graph according to the target graph structure features andthe standard graph structure features, wherein the graph similarity is used for indicating the association degree between the target text and the standard text. By adopting the embodiment of the invention, the matching accuracy between the target text and the standard text can be improved.
Owner:TENCENT TECH (SHENZHEN) CO LTD

Graphic resource conversion method and device, electronic equipment and storage medium

The invention provides a graphic resource conversion method and device, electronic equipment and a storage medium. The method comprises the following steps: when receiving a drawing end instruction ofan OpenGL or OpenGL ES graph input by a user, obtaining a user state set of all graph resource operations for drawing the OpenGL or OpenGL ES graph; and mapping the user state set to a correspondinghardware device or initializing the user state set to a virtual memory to simulate the corresponding hardware device to perform conversion between an OpenGL or OpenGL ES graphic resource interface anda corresponding target graphic resource interface. That is to say, on the basis of not changing the original OpenGL or OpenGL ES upper-layer code architecture, the original OpenGL or OpenGL ES upper-layer code architecture is not changed, when the drawing ending instruction of the OpenGL or OpenGL ES graph is received, the corresponding target graph resource interface is determined according to all the obtained graph resource operations of drawing the graph, so that the conversion of the graph resources is realized, and the workload and the research and development cost of graph special effect rendering research and development personnel are reduced.
Owner:BEIJING DAJIA INTERNET INFORMATION TECH CO LTD

Word sense disambiguation method and device based on graph expansion structure, equipment and medium

PendingCN113204962AImprove the efficiency of disambiguationImproved disambiguation effectSemantic analysisPattern recognitionGraph spectra
The invention relates to the field of artificial intelligence, and provides a word sense disambiguation method and device based on a graph expansion structure, equipment and a medium, which can extract candidate nodes in an initial graph according to a created window, realize the expansion of the graph, and then improve the connectivity. The weight of each edge is calculated according to the text similarity between the two candidate nodes corresponding to each edge and the word meaning similarity between the two candidate nodes corresponding to each edge, and the importance of each candidate node is determined according to the weight of each edge, so that high semantic and emotion information is explored and captured, and the word meaning disambiguation accuracy is improved; and according to the importance degree of each candidate node, interference removal processing is performed on the candidate map to obtain a target map, so that the word sense disambiguation efficiency is improved through interference removal processing, center measurement is carried out on the target map to obtain a target word sense, and the improvement of the word sense disambiguation effect is realized. In addition, the invention also relates to a block chain technology, and the target map can be stored in a block chain node.
Owner:PING AN TECH (SHENZHEN) CO LTD

Quality analysis method and device of comment data, electronic equipment and storage medium

The invention discloses a comment data quality analysis method and device, electronic equipment and a storage medium. The method comprises the steps of obtaining target comment data to be subjected to quality analysis; analyzing the comment contents and the comment phrases to obtain a comment theme corresponding to the target comment data, and obtaining an association relationship set among the comment theme, the comment contents and the comment phrases; generating an initial graph structure based on the comment contents, the comment phrases, the comment themes and the association relationship set, and converting the comment contents, the comment themes and the comment phrases in the initial graph structure into corresponding initial embedded matrixes to obtain a target graph structure; and inputting the target graph structure into a pre-trained graph attention model to obtain a quality analysis result of the target comment data. According to the method, the graph structure is generated by establishing the relation among the theme, the content and the word group, so that the comments are completely covered, meanwhile, feature analysis is performed on the graph structure based on the graph attention model, and the accuracy of comment quality analysis is improved.
Owner:SUZHOU LANGCHAO INTELLIGENT TECH CO LTD

Stable graph structure learning method and device

The invention discloses a stable graph structure learning method and device, and relates to the field of machine learning, and the method comprises the steps: obtaining a graph structure implied witha biased relation in each environment through a data-driven mapping method according to a plurality of given biased sampling environments; obtaining the probability that each point in the graph structure is associated with a symbiotic data sample according to the graph structure of each environment and a multi-environment data generation mechanism; initializing a target graph structure, randomly sampling a symbiotic data sample in a plurality of environments, setting conditions for the symbiotic data sample, respectively obtaining a generation probability in each biased environment and a generation probability under an implicit relationship of the target graph structure, and taking the generation probability of the target graph structure as a mean value of the generation probability of each environment; and carrying out loop iteration until a convergence condition is satisfied so as to obtain a stable graph structure. According to the method, estimation deviation of parameters in a graph structure is reduced, and stable performance is kept in a complex and changeable test environment.
Owner:TSINGHUA UNIV

Graph erasing control method and device and processor

The invention provides a graph erasing control method and device and a processor. The method comprises the following steps: acquiring attribute information of a graph in a first area; performing logical operation on at least part of attribute information to obtain a target attribute combination; determining at least part of the area on the interface as a second area; according to the target attribute combination, the target graph in the second area is deleted, and the target graph is a graph conforming to the target attribute combination. In the scheme, as the attribute information is subjected to logical operation to obtain the target attribute combination, when the graph is erased, only the graph of which the attribute information conforms to the target attribute combination can be erased, that is, only the target graph is erased without mistakenly erasing other graphs on the interface, so that the specified graph can be accurately erased, and the user experience is improved. Therefore, the problem that the specified graph cannot be accurately erased in the prior art is solved, so that when a user erases the specified graph, the user does not need to carefully erase the graph, and the user experience effect is good.
Owner:武汉金山办公软件有限公司 +2

A memory access optimization method and system for graph processing based on activeness layout

The invention discloses a graph processing memory access optimization method and system based on activity layout, belonging to the technical field of computer data processing, including: after obtaining the data of the target graph to be processed, sorting the vertices according to the descending order of betweenness centrality, and Divide the sorting results into active vertex sets and inactive vertex sets according to the active percentage; organize and store the active vertex sets; after organizing and storing the inactive vertex sets, divide them into multiple vertex blocks of size C , and the corresponding outbound edge is divided into multiple edge blocks, each edge block includes one or more outbound edges of consecutively numbered vertices, and each edge block is not less than C, and the state tables TActvB and TActeB are maintained at the same time to Filter out useless data in the inactive vertex set; TActvB is used to record the activity of each vertex block, and TActeB is used to record the activity of each edge block and the offset of the next edge block. The invention can reduce the memory access waiting time in the execution process of the graph application and improve the graph processing efficiency.
Owner:HUAZHONG UNIV OF SCI & TECH

Frequent subgraph indexing method and device applied to frequent subgraph query

The invention discloses a frequent sub-graph indexing method and device applied to frequent sub-graph query, and the method comprises the steps: determining a frequent sub-graph set, dividing the frequent sub-graph set into graph set blocks, and building an external storage index for each graph set block; establishing a memory index for each frequent sub-graph in the frequent sub-graphs, storing each memory index into a memory, and storing each memory index, an external memory index and each graph set block into an external memory; under the condition that a query request for a target graph is received, judging whether the target graph is a frequent sub-graph or not; if so, determining a target memory index of the target image in a memory, determining a target image set block to which the target image belongs in an external memory based on the target memory index, and obtaining a target external memory index of the target image set block; and establishing target connection for the target graph based on the target memory index and the target external memory index. In the query process of the target graph, the query of the target graph is realized based on the memory index and the external memory index, the feature of the target graph does not need to be extracted, and the query speed is improved.
Owner:STATE GRID E COMMERCE CO LTD +1
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products