DATA ANALYSIS METHOD, DATA ANALYSIS APPARATUS, AND RECORDING MEDIUM HAVING RECORDED PROGRAM
First Claim
1. A data analysis method that decomposes a fundamental matrix with N rows and M columns indicating relatedness with each of first N objects and each of second M objects into three matrices, and clusters at least the first objects or the second objects, the data analysis method comprising:
- acquiring the fundamental matrix having each element storing a value indicating the relatedness;
setting K indicating a number of clusters of the first N objects and L indicating a number of clusters of the second M objects;
decomposing the fundamental matrix into three matrices which are a first matrix, a second matrix, and a third matrix such that a product of the first matrix, the second matrix, and the third matrix approximates the fundamental matrix, the first matrix having N rows and K columns, the second matrix having K rows and L columns with each element at least one of a particular row and a particular column thereof storing a value falling within a predetermined range, the third matrix having L rows and M columns; and
outputting at least one of clustering results of the first N objects and the second M objects by outputting at least one of the first matrix, the second matrix, and the third matrix.
1 Assignment
0 Petitions
Accused Products
Abstract
A data analysis method decomposes a fundamental matrix with N rows and M columns indicating relatedness with each of first N objects and each of second M objects into three matrices, and clusters at least the first objects or the second objects. The data analysis method includes acquiring the fundamental matrix having each element storing a value indicating the relatedness, setting K indicating a number of clusters of the first N objects and L indicating a number of clusters of the second M objects, decomposing the fundamental matrix into three matrices which are a first matrix, a second matrix, and a third matrix such that a product of the first matrix, the second matrix, and the third matrix approximates the fundamental matrix, and outputting at least one of clustering results of the first objects and the second objects.
6 Citations
12 Claims
-
1. A data analysis method that decomposes a fundamental matrix with N rows and M columns indicating relatedness with each of first N objects and each of second M objects into three matrices, and clusters at least the first objects or the second objects, the data analysis method comprising:
-
acquiring the fundamental matrix having each element storing a value indicating the relatedness; setting K indicating a number of clusters of the first N objects and L indicating a number of clusters of the second M objects; decomposing the fundamental matrix into three matrices which are a first matrix, a second matrix, and a third matrix such that a product of the first matrix, the second matrix, and the third matrix approximates the fundamental matrix, the first matrix having N rows and K columns, the second matrix having K rows and L columns with each element at least one of a particular row and a particular column thereof storing a value falling within a predetermined range, the third matrix having L rows and M columns; and outputting at least one of clustering results of the first N objects and the second M objects by outputting at least one of the first matrix, the second matrix, and the third matrix. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10)
-
-
11. A data analysis apparatus that decomposes a fundamental matrix with N rows and M columns indicating relatedness with each of first N objects and each of second M objects into three matrices, and clusters at least the first objects or the second objects, the data analysis apparatus comprising:
-
an acquirer that acquires the fundamental matrix having each element storing a value indicating the relatedness; a setter that sets K indicating a number of clusters of the first N objects and L indicating a number of clusters of the second M objects; a decomposer that decomposes the fundamental matrix into three matrices which are a first matrix, a second matrix, and a third matrix such that a product of the first matrix, the second matrix, and the third matrix approximates the fundamental matrix, the first matrix having N rows and K columns, the second matrix having K rows and L columns with each element at least one of a particular row and a particular column thereof storing a value falling within a predetermined range, the third matrix having L rows and M columns; and an outputter that outputs at least one of clustering results of the first objects and the second objects by outputting at least one of the first matrix, the second matrix, and the third matrix.
-
-
12. A non-transitory computer-readable recording medium storing a program causing a computer to perform a process that decomposes a fundamental matrix with N rows and M columns indicating relatedness with each of first N objects and each of second M objects into three matrices, and clusters at least the first objects or the second objects, the process comprising:
-
acquiring the fundamental matrix having each element storing a value indicating the relatedness; setting K indicating a number of clusters of the first N objects and L indicating a number of clusters of the second M objects; decomposing the fundamental matrix into three matrices which are a first matrix, a second matrix, and a third matrix such that a product of the first matrix, the second matrix, and the third matrix approximates the fundamental matrix, the first matrix having N rows and K columns, the second matrix having K rows and L columns with each element at least one of a particular row and a particular column thereof storing a value falling within a predetermined range, the third matrix having L rows and M columns; and outputting at least one of clustering results of the first objects and the second objects by outputting at least one of the first matrix, the second matrix, and the third matrix.
-
Specification