Self-learning automated information technology change risk prediction
US-2024414064-A1 · Dec 12, 2024 · US
Detecting overlapping clusters
US8949237B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-8949237-B2 |
| Application number | US-201213345593-A |
| Country | US |
| Kind code | B2 |
| Filing date | Jan 6, 2012 |
| Priority date | Jan 6, 2012 |
| Publication date | Feb 3, 2015 |
| Grant date | Feb 3, 2015 |
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.
A technique for identifying overlapping clusters of items in a data set. The technique may be used in connection with a social network or other on-line environment in which users express approval for other users, such as through votes, tags or other inputs. These expressions of approval may be used to form clusters such that entities assigned to a cluster have a higher metric of approval from other entities within the cluster than from outside the cluster. Such clusters may be arrived at through a computationally efficient approach that involves randomly selecting one or more entities as a seed for a cluster. The cluster may be grown by testing other entities, similar to those already in the cluster, to determine whether they are more preferred by those already in the cluster than those outside the cluster. Once a cluster is grown to a desired size, it may be pruned.
First claim
Opening claim text (preview).
What is claimed is: 1. At least one computer-readable memory, which is not a signal, comprising computer-executable instructions that, when executed by at least one processor, perform a method, the method comprising acts of: receiving inputs relating to a plurality of entities in a set, each input indicating approval of an entity in the set for another entity in the set; maintaining a database storing indications of approval associated with each of the plurality of entities in t…
Assignees
Inventors
Classifications
Physics · mapped topic
Physics · mapped topic
- G06Q10/10Primary
Physics · mapped topic
Physics · mapped topic
- G06F16/9536Primary
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 US8949237B2 cover?
- A technique for identifying overlapping clusters of items in a data set. The technique may be used in connection with a social network or other on-line environment in which users express approval for other users, such as through votes, tags or other inputs. These expressions of approval may be used to form clusters such that entities assigned to a cluster have a higher metric of approval from o…
- Who is the assignee on this patent?
- Balcan Maria Florina, Borgs Christian H, Braverman Mark, and 3 more
- What technology area does this patent fall under?
- Primary CPC classification G06Q10/10. Mapped technology areas include Physics.
- When was this patent published?
- Publication date Tue Feb 03 2015 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).