Fast vector quantization with topology learning
First Claim
Patent Images
1. A method for analyzing data comprising:
- receiving data;
partitioning the data and generating a tree based on the partitions;
learning a topology of a distribution of the data; and
finding a best matching unit in the data using the learned topology.
1 Assignment
0 Petitions
Accused Products
Abstract
A new process called a vector approximation graph (VA-graph) leverages a tree based vector quantizer to quickly learn the topological structure of the data. It then uses the learned topology to enhance the performance of the vector quantizer. A method for analyzing data comprises receiving data, partitioning the data and generating a tree based on the partitions, learning a topology of a distribution of the data, and finding a best matching unit in the data using the learned topology.
30 Citations
42 Claims
-
1. A method for analyzing data comprising:
-
receiving data;
partitioning the data and generating a tree based on the partitions;
learning a topology of a distribution of the data; and
finding a best matching unit in the data using the learned topology. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14)
-
-
15. A system for analyzing data comprising:
-
a processor operable to execute computer program instructions;
a memory operable to store computer program instructions executable by the processor; and
computer program instructions stored in the memory and executable to perform the steps of;
receiving data;
partitioning the data and generating a tree based on the partitions;
learning a topology of a distribution of the data; and
finding a best matching unit in the data using the learned topology. - View Dependent Claims (16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28)
-
-
29. A computer program product for analyzing data comprising:
-
a computer readable medium;
computer program instructions, recorded on the computer readable medium, executable by a processor, for performing the steps of receiving data;
partitioning the data and generating a tree based on the partitions;
learning a topology of a distribution of the data; and
finding a best matching unit in the data using the learned topology. - View Dependent Claims (30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42)
-
Specification