# US 2012/0254077 A1 · Data Driven Frequency Mapping for Kernels Used in Support Vector Machines

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2012/0254077 A1
- Document ID: US20120254077A1
- Status: Published application
- Kind: A1
- Application number: 13/076,749
- Filed: 2011-03-31
- Published: 2012-10-04
- Earliest claimed: 2011-03-31
- Assignees: Mitsubishi Electric Research Laboratories, Inc.
- Inventors: Fatih Porikli; Huseyin Ozkan
- Web page: https://patentgrep.com/patent/US20120254077A1

## CPC

- G06N 20/10: using kernel methods, e.g. support vector machines [SVM]
- G06N 20/00: Machine learning
- G06N: COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS

## Abstract

Frequency features to be used for binary classification of data using a linear classifier are selected by determining a set of hypotheses in a d-dimensional space using d-dimensional labeled training data. A mapping function is constructed for each hypothesis. The mapping functions are applied to the training data to generate frequency features, and a subset of the frequency are selecting iteratively. The linear function is then trained using the subset of frequency features and labels of the training data.

## Claims

### Claim 1

A method for selecting frequency features to be used for binary classification of data using a linear classifier, comprising the steps of
determining a set of hypotheses in a d-dimensional space using d-dimensional labeled training data;
constructing a mapping function for each hypothesis;
applying the mapping functions to the training data to generate frequency features;
selecting iteratively a subset of the frequency; and
training the linear classifier using the subset of frequency features and labels of the training data, wherein the steps are performed in a processor.

### Claim 2 (depends on 1)

The method of claim 1, wherein the training data include a first subset of positive training data with positive labels and a second subset of negative training data with negative labels, and basis vectors define a separating boundary between the first and second subsets of training data.

### Claim 3 (depends on 1)

The method of claim 1, wherein each hypothesis is a vector ω for the training data.

### Claim 4 (depends on 1)

The method of claim 1, wherein each hypothesis is a vector normal to a hyperplane separating two classes the training data.

### Claim 5 (depends on 1)

The method of claim 1, wherein a magnitude of each hypothesis vector is a spatial combing frequency.

### Claim 6 (depends on 4)

The method of claim 4, further comprising;
extracting separate probability distribution functions ρ+ and ρ− from the training data, wherein ρ+ is a probability distribution function of the positive labeled data, and ρ− is the probability distribution function of the subset of negative training data points;
sampling M data points for each of distributions to construct point pairs
{(x−,x+)}{1 . . . M}
where x− is a data point from the distribution ρ− and x+ is a data from the distribution ρ+; and
assigning the hypothesis ω as the vector that connects the point pairs.

### Claim 7 (depends on 6)

The method of claim 6, wherein a weighted discriminant constraint is applied while extracting the probability density functions ρ+ and ρ−.

### Claim 8 (depends on 6)

The method of claim 6, wherein a mapping function is defined by
zω(x)=√{square root over (2)}cos(ωTx+b)
where T is a vector transpose operator, and b is a phase-shift parameter.

### Claim 9 (depends on 6)

The method of claim 6, wherein the mapping function from Rd→Rz is defined by
zω(x)=[cos(ωT(x)sin(ωT(x))]T
where T is a vector transpose operator.

### Claim 10 (depends on 8)

The method of claim 8, wherein the phase-shift is b=−ωTx+.

### Claim 11 (depends on 1)

The method of claim 1, wherein the subset of frequency features is selected by a boosting method.

### Claim 12 (depends on 11)

The method of claim 11, wherein the selection is repeated until a desired performance level for the linear classifier is achieved.

### Claim 13 (depends on 11)

The method of claim 11, wherein the selection is repeated until an upper bound on a computational load is reached.

### Claim 14 (depends on 1)

The method of claim 1, wherein the linear classifier is a support vector machine with linear kernel.

### Claim 15 (depends on 1)

The method of claim 1, wherein the set of hypotheses selected by random sampling.

### Claim 16 (depends on 1)

The method of claim 1, wherein the training data has multiple classes.

### Claim 17 (depends on 1)

The method of claim 1, further comprising:
determining the frequency features for test data; and
applying the linear classifier to the frequency features to obtain final labels that classify the test data.
