Dynamic offset well analysis
US-2024419739-A1 · Dec 19, 2024 · US
Efficient link management for graph clustering
US9529935B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-9529935-B2 |
| Application number | US-201414191224-A |
| Country | US |
| Kind code | B2 |
| Filing date | Feb 26, 2014 |
| Priority date | Feb 26, 2014 |
| Publication date | Dec 27, 2016 |
| Grant date | Dec 27, 2016 |
How to read this patent
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
- Title
What the patent document calls the invention.
- Abstract
A short plain-language summary of the technical disclosure.
- Assignees and inventors
Who owns or filed the patent and who is credited as inventor.
- Key dates
Filing, priority, publication, and grant dates set the timeline.
- First independent claim
The legal scope of protection — read this for what is actually claimed.
- CPC / IPC classifications
Technology tags used to group this patent with similar filings.
- Citations and related patents
Prior art links and similar publications in this corpus.
Abstract
Official abstract text for this publication.
One embodiment of the present invention provides a computing system. The computing system includes a processor and a memory. The memory stores instructions which when executed by the processor cause the processor to perform a method. The method comprises identifying a first vertex and a second vertex in a graph as candidates for a link between the first and the second vertices. The first and second vertices represent elements in a data set. The method further comprises determining a link indicator based on a first link count, which indicates a sum of respective weights of links of a vertex, associated with the first vertex and a second link count associated with the second vertex. The method also includes determining whether to connect the first and second vertices with a link based on the link indicator's conformity with a link threshold, which determines whether to connect two vertices using a link.
First claim
Opening claim text (preview).
What is claimed is: 1. A computer-executable method, comprising: storing in a storage device of a computer a data set comprising a plurality of data elements; determining, by the computer, a type and strength of relationship between a first and a second data elements in the plurality of data elements; representing the first data element as a first vertex and the second data element as a second vertex in a graph; identifying the first vertex and the second vertex as candidate…
Assignees
Inventors
Classifications
- G06F16/9024Primary
Physics · mapped topic
Physics · mapped topic
Physics · mapped topic
- G06F17/30958Primary
Physics · mapped topic
Physics · mapped topic
Patent family
Related publications grouped by family.
External sources
Next steps
Free tools are coming soon. Tell us what you want to track and we'll notify you.
Frequently asked questions
Answers are generated from the same data shown on this page.
- What does patent US9529935B2 cover?
- One embodiment of the present invention provides a computing system. The computing system includes a processor and a memory. The memory stores instructions which when executed by the processor cause the processor to perform a method. The method comprises identifying a first vertex and a second vertex in a graph as candidates for a link between the first and the second vertices. The first and se…
- Who is the assignee on this patent?
- Palo Alto Res Ct Inc
- What technology area does this patent fall under?
- Primary CPC classification G06F16/9024. Mapped technology areas include Physics.
- When was this patent published?
- Publication date Tue Dec 27 2016 00:00:00 GMT+0000 (Coordinated Universal Time) (B2). Legal status and post-grant events are not shown on this page.
- What related patents are in patentsdb?
- We list 8 related publications on this page (citations in our corpus or others sharing the same primary CPC).