# US 2022/0277226 A1 · Estimating device, estimating method, and estimating program

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

- Number: US 2022/0277226 A1
- Document ID: US20220277226A1
- Status: Published application
- Kind: A1
- Application number: 17/634,587
- Filed: 2019-08-13
- Published: 2022-09-01
- Earliest claimed: 2019-08-13
- Assignees: Nippon Telegraph and Telephone Corporation
- Applicants: Nippon Telegraph and Telephone Corporation
- Inventors: Masahiro KOJIMA; Masami TAKAHASHI; Takeshi KURASHIMA; Tatsushi MATSUBAYASHI; Hiroyuki TODA
- Web page: https://patentgrep.com/patent/US20220277226A1

## CPC

- G06N 20/00: Machine learning
- G16H 10/00: ICT specially adapted for the handling or processing of patient-related medical or healthcare data (for medical reports G16H15/00; for therapies or health-improving plans G16H20/00; for the handling or processing of medical images G16H30/00)
- G06N 5/01: Dynamic search techniques; Heuristics; Dynamic trees; Branch-and-bound
- G06N: COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G16H: HEALTHCARE INFORMATICS, i.e. INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR THE HANDLING OR PROCESSING OF MEDICAL OR HEALTHCARE DATA

## Abstract

An estimation apparatus includes an estimation unit configured to estimate an acceptability tensor corresponding to an activity tensor representing an activity log without a corresponding acceptability log, by using a result of previously performed learning of a relationship between an activity tensor representing an activity log recording activities of a user, and an acceptability tensor representing an acceptability log recording an acceptability for a time change of the activities of the user.

## Claims

### Claim 1

An estimation apparatus, comprising:
an estimation unit configured to estimate an acceptability tensor corresponding to an activity tensor representing an activity log without a corresponding acceptability log, by using a result of previously performed learning of a relationship between an activity tensor representing an activity log recording activities of a user, and an acceptability tensor representing an acceptability log recording an acceptability for a time change of the activities of the user.

### Claim 2 (depends on 1)

The estimation apparatus according to claim 1, wherein
the activity tensor includes information about the number of times the user switches activities in a predetermined time frame, and
the acceptability tensor includes information representing whether it is acceptable for the user to switch activities in the predetermined time frame.

### Claim 3 (depends on 2)

The estimation apparatus according to claim 2, further comprising a learning unit configured to learn a relationship between the activity tensor and the acceptability tensor by tensor factorization of the activity tensor.

### Claim 4 (depends on 3)

The estimation apparatus according to claim 3, wherein the learning unit learns a relationship between the activity tensor and the acceptability tensor by tensor factorization of the activity tensor using graph Laplacian regularization.

### Claim 5 (depends on 3)

The estimation apparatus according to claim 3, wherein the learning unit learns a relationship between the activity tensor and the acceptability tensor by tensor factorization of the activity tensor using a matrix representing a correspondence relationship between an approximation value of the activity tensor and an approximation value of the acceptability tensor.

### Claim 6 (depends on 1)

The estimation apparatus according to claim 1, further comprising:
a learning unit configured to learn a relationship between the activity tensor and the acceptability tensor by using deep learning.

### Claim 7

An estimation method comprising, at a computer, including:
estimating an acceptability tensor corresponding to an activity tensor representing an activity log without a corresponding acceptability log, by using a result of previously performed learning of a relationship between an activity tensor representing an activity log recording activities of a user, and an acceptability tensor representing an acceptability log recording an acceptability for a time change of the activities of the user.

### Claim 8

A non-transitory computer-readable medium having computer-readable instructions stored thereon, which, when executed, cause a computer including a memory and a processor to execute a set of operations, comprising:
estimating an acceptability tensor corresponding to an activity tensor representing an activity log without a corresponding acceptability log, by using a result of previously performed learning of a relationship between an activity tensor representing an activity log recording activities of a user, and an acceptability tensor representing an acceptability log recording an acceptability for a time change of the activities of the user.

### Claim 9 (depends on 7)

The estimation method according to claim 7, wherein
the activity tensor includes information about the number of times the user switches activities in a predetermined time frame, and
the acceptability tensor includes information representing whether it is acceptable for the user to switch activities in the predetermined time frame.

### Claim 10 (depends on 9)

The estimation method according to claim 9, further comprising:
the learning of the relationship between the activity tensor and the acceptability tensor learns by tensor factorization of the activity tensor.

### Claim 11 (depends on 10)

The estimation method according to claim 10, wherein:
the learning of the relationship between the activity tensor and the acceptability tensor by tensor factorization of the activity tensor uses graph Laplacian regularization.

### Claim 12 (depends on 10)

The estimation method according to claim 10, wherein:
the learning of the relationship between the activity tensor and the acceptability tensor by tensor factorization of the activity tensor uses a matrix representing a correspondence relationship between an approximation value of the activity tensor and an approximation value of the acceptability tensor.

### Claim 13 (depends on 7)

The estimation method according to claim 7, further comprising:
learning the relationship between the activity tensor and the acceptability tensor by using deep learning.

### Claim 14 (depends on 8)

The non-transitory computer-readable medium according to claim 8, wherein
the activity tensor includes information about the number of times the user switches activities in a predetermined time frame, and
the acceptability tensor includes information representing whether it is acceptable for the user to switch activities in the predetermined time frame.

### Claim 15 (depends on 14)

The non-transitory computer-readable medium according to claim 14, wherein the learning of the relationship between the activity tensor and the acceptability tensor learns by tensor factorization of the activity tensor.

### Claim 16 (depends on 15)

The non-transitory computer-readable medium according to claim 15, wherein:
the learning of the relationship between the activity tensor and the acceptability tensor by tensor factorization of the activity tensor uses graph Laplacian regularization.

### Claim 17 (depends on 15)

The non-transitory computer-readable medium according to claim 15, wherein:
the learning of the relationship between the activity tensor and the acceptability tensor by tensor factorization of the activity tensor uses a matrix representing a correspondence relationship between an approximation value of the activity tensor and an approximation value of the acceptability tensor.

### Claim 18 (depends on 8)

The non-transitory computer-readable medium according to claim 8, wherein the set of operations further comprising:
learning the relationship between the activity tensor and the acceptability tensor by using deep learning.
