Log in
Enquire now
‌

US Patent 7809726 Mechanism for unsupervised clustering

Patent 7809726 was granted and assigned to Nokia on October, 2010 by the United States Patent and Trademark Office.

OverviewStructured DataIssuesContributors

Contents

Is a
Patent
Patent

Patent attributes

Current Assignee
Nokia
Nokia
Patent Jurisdiction
United States Patent and Trademark Office
United States Patent and Trademark Office
Patent Number
7809726
Date of Patent
October 5, 2010
Patent Application Number
10506634
Date Filed
March 3, 2003
Patent Primary Examiner
John R. Cottingham
John R. Cottingham
Patent abstract

A computer-implemented method for determining cluster centers in a first data structure, wherein the first data structure comprises a lattice structure of weight vectors that create an approximate representation of a plurality of input data points. The method can include performing a first iterative process for iteratively updating the weight vectors such that they move toward cluster centers; performing a second iterative process for iteratively updating a second data structure utilizing results of the iterative updating of the first data structure; and determining the weight vectors that correspond to cluster centers of the input data points on the basis of the second data structure.

Timeline

No Timeline data yet.

Further Resources

Title
Author
Link
Type
Date
No Further Resources data yet.

References

Find more entities like US Patent 7809726 Mechanism for unsupervised clustering

Use the Golden Query Tool to find similar entities by any field in the Knowledge Graph, including industry, location, and more.
Open Query Tool
Access by API
Golden Query Tool
Golden logo

Company

  • Home
  • Press & Media
  • Blog
  • Careers
  • WE'RE HIRING

Products

  • Knowledge Graph
  • Query Tool
  • Data Requests
  • Knowledge Storage
  • API
  • Pricing
  • Enterprise
  • ChatGPT Plugin

Legal

  • Terms of Service
  • Enterprise Terms of Service
  • Privacy Policy

Help

  • Help center
  • API Documentation
  • Contact Us
By using this site, you agree to our Terms of Service.