Variable density-based clustering on data streams

US12536203B2 · US · B2

Patent metadata
FieldValue
Publication numberUS-12536203-B2
Application numberUS-202318301537-A
CountryUS
Kind codeB2
Filing dateApr 17, 2023
Priority dateAug 4, 2021
Publication dateJan 27, 2026
Grant dateJan 27, 2026

How to read this patent

A practical reading order for non-experts. Skip the full description unless you need deep technical detail.

  1. Title

    What the patent document calls the invention.

  2. Abstract

    A short plain-language summary of the technical disclosure.

  3. Assignees and inventors

    Who owns or filed the patent and who is credited as inventor.

  4. Key dates

    Filing, priority, publication, and grant dates set the timeline.

  5. First independent claim

    The legal scope of protection — read this for what is actually claimed.

  6. CPC / IPC classifications

    Technology tags used to group this patent with similar filings.

  7. Citations and related patents

    Prior art links and similar publications in this corpus.

Abstract

Official abstract text for this publication.

In some implementations, a device may receive, from a data stream, a set of data points arranged in a dimensional data space. The device may compare the set of data points to identify one or more clusters using values of a distance parameter for data points included in the set of data points, wherein the values of distance parameter includes different values of the distance parameter for different data points. The device may transmit an indication of the one or more clusters to cause a device to display information associated with the one or more clusters. The device may receive, from the device, feedback information associated with at least one data point, wherein the feedback information indicates that at least one data point is associated with an error. The device may modify a value of the distance parameter associated with the at least one data point to a modified value.

First claim

Opening claim text (preview).

What is claimed is: 1 . A method for variable density-based clustering, comprising: generating, by a device, an updated set of clusters based on: removing a subset of clusters of a set of clusters based on determining whether an amount of time of a cluster, of the subset of clusters, since the cluster was formed or added satisfies a threshold value; identifying, by the device, one or more clusters of the updated set of clusters using a set of data points arranged in a dimensional data space; determining, by the device, if a first radius of a new data point, arranged in the dimensional data space, and a second radius associated with a closest data point to the new data point, in the dimensional data space, intersect, wherein the first radius is defined by a first value of a distance parameter associated with the new data point, and wherein the second radius is defined by a second value of the distance parameter associated with the closest data point; adding, by the device, the new data point to a first cluster, of the one or more clusters, associated with the closest data point if the first radius and the second radius intersect; obtaining, by the device, feedback information associated with at least one data point of the set of data points; modifying, by the device and based on the feedback information, a value of the distance parameter associated with the new data point; linking, by the device, the first cluster and a second cluster with each other in a memory of a clustering system associated with the first cluster and the second cluster, based on receiving feedback that the first cluster and the second cluster are associated with one another; providing, by the device and to at least one of a client device or a cluster application programming interface, information related to the first cluster and the second cluster by treating the first cluster and the second cluster as a single cluster based on the linking; and performing, by the device and based on the linking, one or more actions based on the modified value of the distance parameter. 2 . The method of claim 1 , wherein the feedback information indicates that a cluster, of the one or more clusters, or a data point, of the set of data points, was not correctly clustered. 3 . The method of claim 1 , wherein the feedback information is obtained by a cluster application programming interface. 4 . The method of claim 1 , further comprising: obtaining, via a data stream, the new data point. 5 . The method of claim 1 , further comprising: identifying the new data point as noise based on the first radius and the second radius failing to intersect. 6 . The method of claim 1 , further comprising: determining whether the new data point is noise based on a number of data points near the data point not satisfying a threshold number. 7 . A device, comprising: one or more memories; and one or more processors, coupled to the one or more memories, configured to: generate an updated set of clusters based on: removing a subset of clusters of a set of clusters based on determining whether an amount of time of a cluster, of the subset of clusters, since the cluster was formed or added satisfies a threshold value; identify one or more clusters of the updated set of clusters using a set of data points arranged in a dimensional data space; determine if a first radius of a new data point, arranged in the dimensional data space, and a second radius associated with a closest data point to the new data point, in the dimensional data space, intersect, wherein the first radius is defined by a first value of a distance parameter associated with the new data point, and wherein the second radius is defined by a second value of the distance parameter associated with the closest data point; add the new data point to a first cluster, of the one or more clusters, associated with the closest data point if the first radius and the second radius intersect; obtain feedback information associated with at least one data point of the set of data points; modify, based on the feedback information, a value of the distance parameter associated with the new data point; link the first cluster and a second cluster with each other in a memory of a clustering system associated with the first cluster and the second cluster, based on receiving feedback that the first cluster and the second cluster are associated with one another; provide, to at least one of a client device or a cluster application programming interface, information related to the first cluster and the second cluster by treating the first cluster and the second cluster as a single cluster based on the linking; and perform one or more actions based on the modified value of the distance parameter. 8 . The device of claim 7 , wherein the feedback information indicates that a cluster, of the one or more clusters, or a data point, of the set of data points, was not correctly clustered. 9 . The device of claim 7 , wherein the feedback information is obtained by a cluster application programming interface. 10 . The device of claim 7 , wherein the one or more processors are further configured to: obtain, via a data stream, the new data point. 11 . The device of claim 7 , wherein the one or more processors are further configured to: identify the new data point as noise based on the first radius and the second radius failing to intersect. 12 . The device of claim 7 , wherein the one or more processors are further configured to: determine whether the new data point is noise based on a number of data points near the data point not satisfying a threshold number. 13 . A non-transitory computer-readable medium storing a set of instructions, the set of instructions comprising: one or more instructions that, when executed by one or more processors of a device, cause the device to: generate an updated set of clusters based on: removing a subset of clusters of a set of clusters based on determining whether an amount of time of a cluster, of the subset of clusters, since the cluster was formed or added satisfies a threshold value; identify one or more clusters of the updated set of clusters using a set of data points arranged in a dimensional data space; determine if a first radius of a new data point, arranged in the dimensional data space, and a second radius associated with a closest data point to the new data point, in the dimensional data space, intersect, wherein the first radius is defined by a first value of a distance parameter associated with the new data point, and wherein the second radius is defined by a second value of the distance parameter associated with the closest data point; add the new data point to a first cluster, of the one or more clusters, associated with the closest data point if the first radius and the second radius intersect; obtain feedback information associated with at least one data point of the set of data points; modify, based on the feedback information, a value of the distance parameter associated with the new data point; link the first cluster and a second cluster with each other in a memory of a clustering system associated with the first cluster and the second cluster, based on receiving feedback that the first cluster and the second cluster are associated with one another; provide, to at least one of a client device or a cluster application programming interface, information related to the first cluster and the second cluster by treating the first cluster and the second cluster as a single cluster based on the linking; and perform one or more actions based on the modified va

Assignees

Inventors

Classifications

  • Data stream processing; Continuous queries · CPC title

  • G06F16/287Primary

    Visualization; Browsing · CPC title

  • Non-hierarchical techniques · CPC title

  • based on feedback of a supervisor · CPC title

  • Machine learning · CPC title

Patent family

Related publications grouped by family.

External sources

Frequently asked questions

Answers are generated from the same data shown on this page.

What does patent US12536203B2 cover?
In some implementations, a device may receive, from a data stream, a set of data points arranged in a dimensional data space. The device may compare the set of data points to identify one or more clusters using values of a distance parameter for data points included in the set of data points, wherein the values of distance parameter includes different values of the distance parameter for differ…
Who is the assignee on this patent?
Capital One Services Llc
What technology area does this patent fall under?
Primary CPC classification G06F16/287. Mapped technology areas include Physics.
When was this patent published?
Publication date Tue Jan 27 2026 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 4 related publications on this page (citations in our corpus or others sharing the same primary CPC).