# US 2012/0253792 A1 · Sentiment Classification Based on Supervised Latent N-Gram Analysis

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

- Number: US 2012/0253792 A1
- Document ID: US20120253792A1
- Status: Published application
- Kind: A1
- Application number: 13/424,900
- Filed: 2012-03-20
- Published: 2012-10-04
- Earliest claimed: 2011-03-30
- Assignees: NEC Laboratories America, Inc.
- Inventors: Dmitriy Bespalov; Bing Bai; Yanjun Qi
- Web page: https://patentgrep.com/patent/US20120253792A1

## CPC

- G06F 16/353: into predefined classes
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

A method for sentiment classification of a text document using high-order n-grams utilizes a multilevel embedding strategy to project n-grams into a low-dimensional latent semantic space where the projection parameters are trained in a supervised fashion together with the sentiment classification task. Using, for example, a deep convolutional neural network, the semantic embedding of n-grams, the bag-of-occurrence representation of text from n-grams, and the classification function from each review to the sentiment class are learned jointly in one unified discriminative framework.

## Claims

### Claim 1

A method for determining the sentiment of a text document, the method comprising the steps of:
embedding each word of the document into feature space in a computer process to form word embedding vectors;
linking the word embedding vectors into an n-gram in a computer process to generate a vector;
mapping the vector into latent space in a computer process to generate a plurality of n-gram vectors;
generating a document embedding vector in a computer process using the n-gram vectors; and
classifying the document embedding vector in a computer process to determine the sentiment of the document.

### Claim 2 (depends on 1)

The method of claim 1, wherein the linking step is performed through a sliding window of a predetermined length.

### Claim 3 (depends on 1)

The method of claim 1, wherein the mapping step comprises projecting the vector onto vectors in a matrix.

### Claim 4 (depends on 1)

The method of claim 1, further comprising the step of limiting an output range of the n-gram vectors prior to the generating step.

### Claim 5 (depends on 4)

The method of claim 4, wherein the limiting step is performed with a nonlinear function.

### Claim 6 (depends on 4)

The method of claim 4, wherein the limiting step is performed with a tan h function.

### Claim 7 (depends on 1)

The method of claim 1, wherein the classifying step is performed with a binary classifier.

### Claim 8 (depends on 1)

The method of claim 1, wherein the classifying step is performed with a ordinal classifier.

### Claim 9 (depends on 1)

The method of claim 1, wherein at least one of the embedding, linking, mapping, generating and classifying steps are performed with a layered network.

### Claim 10 (depends on 9)

The method of claim 9, wherein the layered network comprises a neural network.

### Claim 11 (depends on 9)

The method of claim 9, further comprising the step of training the layered network with a set of training samples.

### Claim 12 (depends on 11)

The method of claim 11, wherein the training step is performed by back-propagation.

### Claim 13 (depends on 12)

The method of claim 12, wherein the back-propagation comprises stochastic gradient descent.
