Product
Patsnap Eureka
For R&D, Patsnap Eureka makes reading and utilizing patents & technical documents easy.
Patsnap Eureka AIR
Designed for self-driven R&D workflows. Generate viable solutions, solve complex R&D challenges, empower your innovation with AI.
Patsnap Eureka Materials
Designed for material experts only. Revolutionize your material R&D, from search, analyze, to developing new materials.
Feature
TechResearch
Generate reliable direction feasibility study reports for your R&D in just a few steps.
TechSeek
Discover and master advanced knowledge NOW. Basics, ideas, possibilities, all at once.
TechMind
As an expert in R&D Theories, TechMind can generates customized viable solutions instantly.
TechRisk
Analyze your overall solution with one click, know your potential R&D risks in advance.
TechMonitor
Get weekly tech updates, stay abreast of the latest tech innovations and key insights.
Patents
Literature
Hiro is an intelligent assistant for R&D personnel, combined with Patent DNA, to facilitate innovative research.
45 results about "Graph patterns" patented technology
Efficacy Topic
Property
Owner
Technical Advancement
Application Domain
Technology Topic
Technology Field Word
Patent Country/Region
Patent Type
Patent Status
Application Year
Inventor
Method for declarative semantic expression of user intent to enable goal-driven stream processing
InactiveUS7899861B2Multiple digital computer combinationsVisual/graphical programmingProgramming languageGraphics
A method for constructing a stream processing requests so that a stream processing application satisfying the stream processing request can be assembled, includes: inputting a stream processing request, wherein the stream processing request includes a goal that is represented by a graph pattern that semantically describes a desired stream processing outcome; and assembling a stream processing graph, wherein the stream processing graph is assembled to include at least one processing element that satisfies the desired processing outcome by associating the graph pattern that semantically describes the desired processing outcome with a graph pattern that semantically describes an input of the at least one processing element and a graph pattern that semantically describes an output of the at least one processing element, or to include at least one data source by associating the graph pattern that semantically describes the desired processing outcome with a graph pattern that semantically describes an output of the at least one data source.
Owner:IBM CORP
Method and system for composing stream processing applications according to a semantic description of a processing goal
A method for assembling a stream processing application in which data source descriptions, component descriptions and a stream processing request are input and used to assemble a stream processing graph. Each of the data source descriptions includes a graph pattern that semantically describes an output of a data source, each of the component descriptions includes a graph pattern that semantically describes an input of a component and a graph pattern that semantically describes an output of the component, the stream processing request includes a goal that is represented by a graph pattern that semantically describes a desired stream processing outcome and the stream processing graph includes at least one data source or at least one component that satisfies the desired processing outcome.
Owner:IBM CORP
Method and system for editing and maintaining a graph schema
ActiveUS20200097504A1Other databases indexingSpecial data processing applicationsGraphicsExternal data
A system and method for creating and editing graph schema data structures in a collaborative, real time graphical editing environment is disclosed. The system and method further operates to integrate external sources of data as components of the graph schema. The system and method outputs definition files for the graph schema data structure and mapping files that enable the population of a graph database.
Owner:DATA WORLD INC
Method and system for editing and maintaining a graph schema
ActiveUS20200117688A1Other databases indexingSpecial data processing applicationsExternal dataTheoretical computer science
A system and method for creating and editing graph schema data structures in a collaborative, real time graphical editing environment is disclosed. The system and method further operates to integrate external sources of data as components of the graph schema. The system and method outputs definition files for the graph schema data structure and mapping files.that enable the population of a graph database.
Owner:DATA WORLD INC
Method for manufacturing transfer film and transfer aluminum-plating paper
The invention discloses a method for manufacturing a transfer film. The method comprises the steps of (1) manufacturing a master die with Fresnel lens patterns and laser graph patterns, and then electroforming to form a die-pressing working plate; (2) mounting the die-pressing working plate on a die-pressing roller, coating a layer of ultraviolet curing embossed coating on a lower surface of a plastic film and enabling the ultraviolet curing embossed coating to be closely contacted with the die-pressing roller, and then curing the coating layer; (3) separating the ultraviolet curing embossed coating layer from the die-pressing working plate to obtain a transfer film. A method for manufacturing transfer aluminum-plating paper comprises the follow-up steps on the basis of the transfer film: (4) plating aluminum on the ultraviolet curing embossed coating layer to form an aluminum-plating layer; (5) coating a layer of oil paint on the aluminum-plating layer and then drying; (6) compounding the transfer film with printing paper, and then separating the ultraviolet curing embossed coating layer from the aluminum-plating layer to obtain the transfer aluminum-plating paper. According to the method, clear Fresnel lens patterns and laser graph patterns can be formed on the transfer film and the transfer aluminum-plating paper.
Owner:汕头市龙湖昌丰化工有限公司
Method for modeling components of an information processing application using semantic graph transformations
InactiveUS7882485B2Computation using non-denominational number representationRequirement analysisInformation processingGraphics
A method for modeling a component of an information processing application, includes: defining an applicability condition of a component, wherein the applicability conditions includes variables representing objects that must be included in a pre-inclusion state and a graph pattern that semantically describes the objects that must be included in the pre-inclusion state, wherein the pre-inclusion state is a state against which the applicability of the component for inclusion in a processing graph is evaluated; and defining an inclusion effect of the component, wherein the inclusion effect includes variables representing objects that must be included in a post-inclusion state and a graph pattern that semantically describes the objects that must be in the post-inclusion state, wherein the post-inclusion state is a state resulting from inclusion of the component in the processing graph.
Owner:IBM CORP
Combined anti-counterfeit label, and generation method and generation device of combined anti-counterfeit label
InactiveCN104778489AImprove anti-counterfeiting performanceFlexibleRecord carriers used with machinesTheoretical computer scienceDot matrix
The invention provides a combined anti-counterfeit label which comprises a two-dimensional code, a blank area and a dot matrix graph, wherein the two-dimensional code, the blank area and the dot matrix graph are arranged on the same plane. A method for generating the combined anti-counterfeit label comprises the steps of obtaining a two-dimensional code pattern converted from plaintext information and ciphertext information via a two-dimensional code generator, generating a dot matrix graph pattern with the area not greater than that of the blank area via a dot matrix graph generator, and superimposing the dot matrix graph pattern on the blank area in the two-dimensional code pattern, wherein the dot matrix graph is to be implanted into the blank area of the two-dimensional code pattern. A device for generating the combined anti-counterfeit label comprises the two-dimensional code generator, a dot matrix graph ID (identification) database, the dot matrix graph pattern generator and a merging device. The label is formed by combining the two-dimensional code and the dot matrix graph; even if the label is imitated by a counterfeiter, information bound with the anti-counterfeit label cannot be acquired, and the anti-counterfeit label has high-grade anti-counterfeiting performance.
Owner:LEADER TECH BEIJING DIGITAL TECH
Method and system for behavior query construction in temporal graphs using discriminative sub-trace mining
InactiveUS20160125094A1Digital data information retrievalDigital data processing detailsMachine learningBuilding construction
A method and system for constructing behavior queries in temporal graphs using discriminative sub-trace mining. The method includes generating system data logs to provide temporal graphs, wherein the temporal graphs include a first temporal graph corresponding to a target behavior and a second temporal graph corresponding to a set of background behaviors, generating temporal graph patterns for each of the first and second temporal graphs to determine whether a pattern exists between a first temporal graph pattern and a second temporal graph pattern, wherein the pattern between the temporal graph patterns is a non-repetitive graph pattern, pruning the pattern between the first and second temporal graph patterns to provide a discriminative temporal graph, and generating behavior queries based on the discriminative temporal graph.
Owner:NEC LAB AMERICA
Method and system for message-oriented semantic web service composition based on artificial intelligence planning
A method for modeling a web service operation, includes: defining an input message pattern that describes input requirements of a web service operation, wherein the input message pattern includes a set of variables representing data elements that must be contained in a message input to the web service operation, and a graph pattern that semantically describes the data elements that must be contained in the message input to the web service operation; and defining an output message pattern that describes an output message of the web service operation, wherein the output message pattern includes a set of variables and exemplars that represent data elements contained in the output message, and a graph pattern that semantically describes the data elements contained in the output message.
Owner:INT BUSINESS MASCH CORP
SPARQL semantic data query optimization method based on connection cost
InactiveCN104834754AImprove experienceFast feedbackSpecial data processing applicationsDynamic planningLogical query
The invention provides a SPARQL semantic data query optimization method based on connection cost. According to the method, the RDF mode information to simplify SPARQL basic graph pattern is used, then a B tree structure is used for rapidly estimating SPARQL connection diagram nose sizes and edge weight values, the connection cost is used for estimating and finding the optimal logical query plan by combining a dynamic planning method, and therefore the query efficiency for improving RDF semantic data is improved.
Owner:WUHAN UNIV
Combined-type anti-counterfeiting mark based on same ID, generating method and device
ActiveCN104766111AFlexibleRelevantRecord carriers used with machinesGraphicsTheoretical computer science
The invention provides a combined-type anti-counterfeiting mark based on a same ID. The combined-type anti-counterfeiting mark is composed of a quick response code and a raster graph. The quick response code and the raster graph all comprise the same ID number extracted from an ID number database during a generating process. The method for generating the combined-type anti-counterfeiting mark comprises the steps that by using a quick response code generator, the ID number, parameter information of the quick response code, plaintext information and preset ciphertext information memory area are converted into the quick response code, wherein the ID number, the parameter information of the quick response code and the plaintext information are extracted from the ID number database; by using a raster graph generator, the raster graph is generated by the ID number which is same as the quick response code. The device for generating the combined-type anti-counterfeiting mark comprises the quick response code generator and the raster graph pattern generator. The quick response code and the raster graph comprise the same ID number, and therefore the quick response code and the raster graph have relevancy, due to the fact that quick response code can only be recognized and read through dedicated equipment, the raster graph cannot be recognized once again after being copied and scanned, and therefore the high level anti-counterfeiting performance is achieved.
Owner:兰芳园食品有限公司
Iterative constraint solving in abstract graph matching for cyber incident reasoning
A technique for storage-efficient cyber incident reasoning by graph matching. The method begins with a graph pattern that comprises a set of elements with constraints and connections among them. A graph of constraint relations (GoC) in the graph pattern is derived. An activity graph representing activity data captured in association with a host machine is then obtained. In response to a query, one or more subgraphs of the activity graph that satisfy the graph pattern are then located and, in particular, by iteratively solving constraints in the graph pattern. In particular, a single element constraint is solved to generate a result, and that result is propagated to connected constraints in the graph of constraint relations. This process continues until all single element constraints have been evaluated, and all propagations have been performed. The subgraphs of the activity graph that result are then returned in response to a database query.
Owner:IBM CORP
Method and system for assembling information processing applications based on declarative semantic specifications
InactiveUS8863102B2Program loading/initiatingRequirement analysisInformation processingProgramming language
A method for assembling an information processing application, includes: inputting a plurality of component descriptions, wherein each of the component descriptions includes a graph pattern that semantically describes an applicability condition of a component and a graph pattern that semantically describes an inclusion effect of the component; inputting a processing request, wherein the processing request includes a goal that is represented by a graph pattern that semantically describes a desired processing outcome; assembling a processing graph, wherein the processing graph includes at least one component that satisfies the desired processing outcome; and outputting the processing graph.
Owner:IBM CORP
Network flow identification method, device and equipment and computer storage medium
PendingCN112437016AGuaranteed accuracyImprove accuracyData switching networksNeural learning methodsData streamInternet traffic
The invention discloses a network traffic identification method, device and equipment and a computer storage medium, and the method comprises the following steps: collecting and labeling network traffic in different graph modes; preprocessing the acquired network traffic, and extracting feature information of each network session; generating a data flow diagram based on the feature information; training a graph neural network by utilizing the data of the data flow graph to generate a network flow identification model; converting unknown flow into data of a data flow graph and inputting the data into the network flow identification model, wherein the network flow identification model matches the data flow graph of the unknown flow with a graph mode learned by the network flow identificationmodel; and when the matching degree is greater than a preset threshold, judging a graph mode corresponding to the unknown flow, thereby determining a network application corresponding to the unknownflow. According to the invention, the problem of low accuracy of network traffic identification is solved, and the graph pattern of the network traffic and the corresponding network application are judged by using the graph neural network.
Owner:INST OF ADVANCED TECH UNIV OF SCI & TECH OF CHINA
Stage lamp optical system with mutually-switched pattern and light beam effect
ActiveCN103807692AImprove utilization efficiencyQuick switchLighting applicationsMechanical apparatusIntegratorOptical axis
The invention relates to a stage lamp optical system with a mutually-switched pattern and light beam effect. The stage lamp optical system comprises a light source component, a pattern component and a zoom lens component which are positioned in the same main optical axis direction and can emit spot light, and also comprises an optical integrator component which can be switched into the main optical axis, wherein the pattern component comprises a light beam pattern component and a graph pattern component which can switch mutually and enter the main optical axis; the light source component can move forward and backward relative to the pattern component along the main optical axis; when the light source component is moved forward to the first position relative to the pattern component, only the light beam pattern component is switched into the main optical axis; the light rays of the light source component are emitted through the light beam pattern component and the zoom lens component; when the light source component is moved backward to the second position relative to the pattern component, the optical integrator component and the graph pattern component enter the main optical shaft at the same time, and the light rays are emitted through the optical integrator component, the graph pattern component and the zoom lens component. The stage lamp optical system with the mutually switched patterns and light beams has the advantages of low optical loss, high utilization rate and the like.
Owner:GUANGZHOU HAOYANG ELECTRONICS CO LTD
Method for declarative semantic expression of user intent to enable goal-driven information processing
InactiveUS8307372B2Computation using non-denominational number representationRequirement analysisGraphicsProgramming language
A method for constructing a processing request so that an information processing application satisfying the processing request can be assembled, includes: inputting a processing request, wherein the processing request includes a goal that is represented by a graph pattern that semantically describes a desired processing outcome; and assembling a processing graph that includes at least one component that satisfies the desired processing outcome, wherein the processing graph is assembled by associating the graph pattern that semantically describes the desired processing outcome with a graph pattern that semantically describes an applicability condition of the at least one component or a graph pattern that semantically describes an inclusion effect of the at least one component.
Owner:INT BUSINESS MASCH CORP
Graph pattern decomposition method adopting triple patterning photoetching technology
ActiveCN104346490AEasy programmingReduce correlationSpecific program execution arrangementsSpecial data processing applicationsAlgorithmGraph patterns
The invention belongs to the field of design for manufacturability of semiconductor photoetching technologies, and particularly relates to a graph pattern decomposition method adopting a triple patterning photoetching technology. The method comprises steps of firstly, establishing a conflict graph through a rectangle expansion method, then randomly producing a three-colored initial solution, fixing one color in each turn of optimization, performing two-colored optimization on a conflict sub-graph of the rest two colors through a double patterning pattern distribution method, repeating the iterative optimization process until the current optimum solution is not undated for multiple times, and finally, repeatedly calling the above steps and selecting an optimal three-colored result as an output result. According to method, the existing double patterning pattern distribution method is adopted, an optimal strategy obtained through multiple computation is adopted, and a globally optimal solution is searched, so that the purpose of distributing a graph pattern through the triple patterning photoetching technology is realized.
Owner:FUDAN UNIV
Transfer method and transfer apparatus
ActiveCN103358744AAvoid obstructing the positioning processAvoid interferenceTransfer printingPattern printingGraph patternsEngineering
The invention is aimed at providing a positioning processing technique capable of preventing a position mark transferred to a substrate with a transferred object from being hindered in a technique of transferring a transferred object carried by carrier body. A first positioning mark (AM1) formed on a substrate side in advance comprises multiple graph patterns (AP11 to AP14) configured mutually separately and a positioning mark transferring area (TR) is formed and surrounded by the multiple graph patterns (AP11 to AP14). On the rubber blanket of a carrier pattern, a second positioning mark (AM21) formed by pattern forming material is shot as well as the first positioning mark (AM1). The substrate and the rubber blanket are positioned based on the position detecting result of the second positioning mark (AM21) and the first positioning mark (AM1). Then, the second positioning mark (AM21) is positioned at the positioning mark transferring area (TR) and is positioned at a separating position of the graph patterns (AP11 to AP14) and the transferred second positioning mark (AM21) so as to be transferred to the substrate.
Owner:DAINIPPON SCREEN MTG CO LTD
Method and system for semantic publish-subscribe services
A semantic publish-subscribe system, including: a plurality of subscribers; a plurality of publishers; and a server that receives and stores subscriptions that are described in web ontology language (OWL) graph patterns from the plurality of subscribers and that receives events that are described in semantic graphs formed by OWL assertions from the plurality of publishers, wherein when the server receives an event from a publisher, the server expands the OWL assertions of the event using a reasoner to produce an expanded event, the server matches the expanded event to a subscription, and then, the server notifies a subscriber whose interest matches the event.
Owner:SERVICENOW INC
Graph pattern matching method based on multi-source-point parallel exploration
ActiveCN112559807AExact matchOther databases indexingOther databases queryingLevel structureAlgorithm
The invention discloses a graph pattern matching method based on multi-source-point parallel exploration. The graph pattern matching method can be used for graph pattern fuzzy query starting from a determined point in a graph database. According to the invention, the to-be-queried mode graph is decomposed according to the hierarchical structure, graph traversal query is carried out by taking the graph layer as a unit, the exploration depth can be remarkably reduced, and the parallel exploration performance is improved. Concepts of a center mode set and an edge mode set are provided and used for controlling the exploration process, an exploration task is converted from a sub-graph as the center to a point as the center, and an algorithm can be achieved on a universal distributed graph computing platform. According to the matching result refining method for merging the exploration results of the multiple source points, repeated exploration is carried out by specifying the multiple auxiliary source points, constraint on the matching results is enhanced by utilizing layer differences brought by different visual angles, and the matching precision is improved.
Owner:ZHEJIANG BANGSUN TECH CO LTD
Detection of missing entities in a graph schema
ActiveUS10789296B2Improve efficiencyImprove performanceCharacter and pattern recognitionMultiple digital computer combinationsCluster algorithmEntity type
Detecting missing entities in a graph schema is provided. Unlabeled and unstructured data of a particular domain are divided into a plurality of Voronoi cells using a clustering algorithm that is initiated with cluster centroids proportional to a number of entity types corresponding to the particular domain existing in the graph schema. One additional cluster more than the number of entity types corresponding to the particular domain existing in the graph schema is initialized using a cluster initializing formula of the clustering algorithm. It is determined whether the one additional cluster is populated. In response to determining that the one additional cluster is populated, an entity type is determined to be missing from the number of entity types existing in the graph schema. The missing entity type is added to the graph schema.
Owner:INT BUSINESS MASCH CORP
Graph pattern reverse real-time matching method based on event driving
PendingCN111737538ALow matching delayAchieving Response LatencyOther databases indexingSpecial data processing applicationsQuery analysisGraph match
The invention discloses a graph pattern reverse real-time matching method based on event driving. The method comprises the steps of defining a graph pattern, establishing a reverse matching frameworkand adopting a reverse matching method, wherein the graph mode is used for describing a spatial connection relationship between vertexes and edges in the graph and attribute constraints of the spatialconnection relationship in a reverse sequence, and comprises a matching step chain table and a matching context, and reverse real-time matching of the graph mode is realized according to a reverse matching architecture, so that the problem of event-driven sub-graph matching in a real-time scene is solved. According to the method, fixed vertex sub-graph matching can be completed at the second level, effective balance of performance and accuracy is achieved, concurrent matching of a large number of graph modes is supported, the method can be used for enhancing an existing graph calculation engine, and real-time graph matching, query analysis and other scenes in the fields of finance, e-commerce, logistics, public security and the like are supported.
Owner:ZHEJIANG BANGSUN TECH CO LTD
Method for semantic modeling of stream processing components to enable automatic application composition
InactiveUS8098248B2Drawing from basic elementsDigital data information retrievalProgramming languageGraphics
A method for modeling components of a stream processing application, includes: defining an input message pattern of a processing element, wherein the input message pattern includes variables representing data objects that must be included in a message input to the processing element, and a graph pattern that semantically describes the data objects that must be included in the message input to the processing element; and defining an output message pattern of the processing element, wherein the output message pattern includes variables and new data objects, the variables and new data objects representing data objects that must be included in a message output from the processing element, and a graph pattern that semantically describes the data objects in the message output from the processing element.
Owner:INT BUSINESS MASCH CORP
Pre-emptive graph search for guided natural language interactions with connected data systems
ActiveUS20210124782A1Other databases indexingSpecial data processing applicationsData setTheoretical computer science
Techniques are disclosed to provide guided natural language interactions with a connected data system, such as a graph database. In various embodiments, natural language input associated with a graph database query associated with a graph data set is received. The natural language input is processed to generate a set of candidate strings. At least a subset of the candidate strings is mapped to an entity in the graph data set. The entity and data comprising the graph data are used set to determine a candidate graph pattern associated with the graph database query. The candidate graph pattern is used to guide a user associated with the natural language input to refine the graph database query.
Owner:NEO4J SWEDEN AB
Classification of executable files using a digest of a call graph pattern
ActiveUS11157620B2Encryption apparatus with shift registers/memoriesPlatform integrity maintainanceGraph traversalCall graph
A cybersecurity server receives an executable file to be classified. A call graph of the executable file is generated. Functions of the executable file are represented as vertices in the call graph, and a vertex value is generated for each vertex. The vertex values are arranged in traversal order of the call graph to generate a call graph pattern. A digest of the call graph pattern is calculated and compared to one or more malicious digests.
Owner:TREND MICRO INC
Monitoring work support system for an iron and steel plant
ActiveCN110632900AReduce the burden onImprove qualityData processing applicationsTotal factory controlGraph patternsComputer science
A monitoring work support system for an iron and steel plant supports visual confirmation of a data waveform throughout the entire length of a material to be rolled and determines the monitoring workof an operator having an abnormality. The data storage unit stores actual data of full-length data constituted by measured values of predetermined data items at each point in the longitudinal direction of the material to be rolled. The exception graph pattern registration unit registers at least one piece of exception full-length data for the data item. The similarity determination unit determinesthat the waveform is similar when the square root ratio of the mean value of the square of the deviation between D1_dev[i] and D2_dev[i] is smaller than a threshold value. D1_dev [i] is the deviationbetween the value D1[i] of each point i (i=1,..., N) of the actual data and the average value avi1 of the actual data, and D2_dev[i] is the deviation between the value D2[i] of each point [i] of theabnormal full-length data and the average value avi2 of the abnormal full-length data. The message output unit outputs a pre-registered warning message when the similarity determination unit determines that the waveform is similar.
Owner:TOSHIBA MITSUBISHI-ELECTRIC IND SYST CORP
Efficient directed acyclic graph pattern matching to enable code partitioning and execution on heterogeneous processor cores
Methods, devices, and systems for automatically determining how an application program may be partitioned and offloaded for execution by a general purpose applications processor and an auxiliary processor (e.g., a DSP, GPU, etc.) within a mobile device. The mobile device may determine the portions of the application code that are best suited for execution on the auxiliary processor based on pattern-matching of directed acyclic graphs (DAGS). In particular, the mobile device may identify one or more patterns in the code, particularly in a data flow graph of the code, comparing each identified code pattern to predefined graph patterns known to have a certain benefit when executed on the auxiliary processor (e.g., a DSP). The mobile device may determine the costs and / or benefits of executing the potions of code on the auxiliary processor, and may offload portions that have low costs and / or high benefits related to the auxiliary processor.
Owner:QUALCOMM INC
Graphical temporal graph pattern editor
ActiveUS20210194905A1Facilitates temporal pattern encodingEasy to codeOther databases indexingTransmissionGraphicsInteractive editing
An interactive display system enables a user to compose a graph pattern for a temporal graph on a display screen. The system comprises a canvas that provides an interactive editing surface. The editor receives an input a set of user interactions, such as the drawing of lines and boxes, the specifying of attributes, and the like, that together compose a graph pattern. During the graph pattern composition, the user may retrieve other graph patterns (e.g., from a data store) and integrate them into the pattern being composed. Once the graph pattern is composed (or as it is being composed), the system converts the graphical pattern into a text-based representation, such as a computer program in a particular graph programming language, which is then used for subsequent processing and matching in a cybersecurity threat discovery workflow. The pattern (program code) also is stored to disk, from which it may be retrieved and converted back into its graphical view on the screen, e.g., for further editing and revision.
Owner:IBM CORP
Survival prediction method and system based on multi-granularity graph pattern mining
ActiveCN110335679AReduce time complexityImproved loss functionMedical data miningHealth-index calculationGranularityGraph patterns
The invention discloses a survival prediction method and system based on multi-granularity graph mode mining, and the method comprises the steps: receiving the medical history data of insured persons,and carrying out the statistical construction of the statistical features of the insured persons; for each insured person, constructing a heterogeneous information network according to the medical history data of the insured person; mining a medical mode from the heterogeneous information network by adopting a multi-granularity graph mode mining algorithm to serve as a mode feature; evaluating partial regression coefficients of the statistical characteristics and the mode characteristics through a Cox survival prediction model, and calculating the risk of each characteristic based on proportional risk hypothesis to serve as an enhanced characteristic; combining the statistical characteristics, the mode characteristics and the enhanced characteristics as a complete characteristic set, andperforming survival prediction by adding a random forest scoring function for evaluating the deletion data prediction condition.
Owner:SHANDONG UNIV
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 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