Method of, apparatus for, and computer program for mapping contents having meta-information
First Claim
Patent Images
1. A method of mapping contents comprising:
- providing each item of the contents with classification information comprising a plurality of hierarchical levels;
assigning each item of the contents a concept vector; and
mapping each item of the contents in a predetermined dimensional space based on the provided classification information and the assigned concept vector;
wherein the mapping comprises;
calculating a distance between two items of contents based on the concept vectors assigned thereto;
calculating an adjustment coefficient based on how nearly the classification information of said two items of contents match each other;
adjusting the calculated distance based on the classification information of said two items of contents by multiplying the calculated distance by the adjustment coefficient so that the calculated distance is reduced to such an extent that the closer said two items of the contents are to each other the more nearly the assigned classification information of said two items of contents match each other; and
assigning each item of contents the position information in the predetermined dimensional space based on the adjusted distance,wherein said adjustment coefficient is calculated using a distance matrix of which size is determined by the number of the classification categories in the lowest level down to which classification categories of said two items of contents match.
1 Assignment
0 Petitions
Accused Products
Abstract
A method of mapping a large number of items of contents each having meta-information to a low dimensional space so that the map of the contents reflects the meta-information. The method includes the steps of assigning a concept vector to each item of contents, adjusting the distance between two items of contents so that the closer the classification information of the two items of contents match, the more the distance is reduced, and assigning position information in the low dimensional space to each item of contents based on the adjusted distance.
-
Citations
38 Claims
-
1. A method of mapping contents comprising:
-
providing each item of the contents with classification information comprising a plurality of hierarchical levels; assigning each item of the contents a concept vector; and mapping each item of the contents in a predetermined dimensional space based on the provided classification information and the assigned concept vector; wherein the mapping comprises; calculating a distance between two items of contents based on the concept vectors assigned thereto; calculating an adjustment coefficient based on how nearly the classification information of said two items of contents match each other; adjusting the calculated distance based on the classification information of said two items of contents by multiplying the calculated distance by the adjustment coefficient so that the calculated distance is reduced to such an extent that the closer said two items of the contents are to each other the more nearly the assigned classification information of said two items of contents match each other; and assigning each item of contents the position information in the predetermined dimensional space based on the adjusted distance, wherein said adjustment coefficient is calculated using a distance matrix of which size is determined by the number of the classification categories in the lowest level down to which classification categories of said two items of contents match. - View Dependent Claims (2, 7, 10, 13)
-
-
3. A method of mapping contents comprising:
-
providing each item of the contents with classification information comprising a plurality of hierarchical levels; assigning each item of the contents a concept vector; and mapping each item of the contents in a predetermined dimensional space based on the provided classification information and the assigned concept vector; wherein the mapping comprises; calculating a distance between two items of contents based on the concept vectors assigned thereto; calculating an adjustment coefficient based on how nearly the classification information of said two items of contents match each other; mapping each item of contents in the predetermined dimensional space based on the distance; and adjusting the mapping based on the classification information of said two items of contents by multiplying the calculated distance by the adjustment coefficient so that the distance between two items of the contents is reduced to such an extent that the closer said two items of the contents are to each other the more nearly the assigned classification information of said two items of contents match each other, wherein said adjustment coefficient is calculated using a distance matrix of which size is determined by the number of the classification categories in the lowest level down to which classification categories of said two items of contents match. - View Dependent Claims (4, 5, 8, 11, 14)
-
-
6. A method of mapping contents comprising:
-
providing each item of the contents with classification information comprising a plurality of hierarchical levels; assigning each item of the contents a concept vector; and mapping each item of the contents in a predetermined dimensional space based on the provided classification information and the assigned concept vector; wherein the mapping comprises; calculating a distance between two items of contents based on the concept vectors assigned thereto; calculating an adjustment coefficient based on how nearly the classification information of said two items of contents match each other; adjusting the calculated distance based on the classification information of said two items of contents by multiplying the calculated distance by the adjustment coefficient so that the calculated distance is reduced to such an extent that the closer said two items of the contents are to each other the more closely the assigned classification information of said two items of contents match each other; mapping each item of contents based on the adjusted distance; and further adjusting the mapping based on the classification information of said two items of contents so that the distance between two items of the contents is reduced to such an extent that the two items of the contents are close to each other with respect to the assigned classification information, wherein said adjustment coefficient is calculated using a distance matrix of which size is determined by the number of the classification categories in the lowest level down to which classification categories of said two items of contents match. - View Dependent Claims (9, 12, 15)
-
-
16. An apparatus for mapping contents comprising:
-
means for providing each item of the contents with classification information comprising a plurality of hierarchical levels; means for assigning each item of the contents a concept vector; and means for mapping each item of the contents in a predetermined dimensional space based on the provided classification information and the assigned concept vector; wherein said means for mapping further comprises; means for calculating a distance between two items of contents based on the concept vectors assigned thereto; means for calculating an adjustment coefficient based on how nearly the classification information of said two items of contents match each other; means for adjusting the calculated distance based on the classification information of said two items of contents by multiplying the calculated distance by the adjustment coefficient so that the calculated distance is reduced to such an extent that the closer said two items of the contents are to each other the more nearly the assigned classification information of said two items of contents match each other; and means for assigning each item of contents the position information in the predetermined dimensional space based on the adjusted distance, wherein said adjustment coefficient is calculated using a distance matrix of which size is determined by the number of the classification categories in the lowest level down to which classification categories of said two items of contents match. - View Dependent Claims (17, 18, 19, 24, 27, 30)
-
-
20. An apparatus for mapping contents comprising:
-
means for providing each item of the contents with classification information comprising a plurality of hierarchical levels; means for assigning each item of the contents a concept vector; and means for mapping each item of the contents in a predetermined dimensional space based on the provided classification information and the assigned concept vector; wherein said means for mapping comprises; means for calculating a distance between two items of contents based on the concept vectors assigned thereto; means for calculating an adjustment coefficient based on how nearly the classification information of said two items of contents match each other; means for mapping each item of contents in the predetermined dimensional space based on the distance; and adjusting the mapping based on the classification information of said two items of contents by multiplying the calculated distance by the adjustment coefficient so that the distance between two items of the contents is reduced to such an extent that the closer said two items of the contents are to each other the more nearly the assigned classification information of said two items of contents match each other, wherein said adjustment coefficient is calculated using a distance matrix of which size is determined by the number of the classification categories in the lowest level down to which classification categories of said two items of contents match. - View Dependent Claims (21, 22, 25, 28, 31)
-
-
23. An apparatus for mapping contents comprising:
-
means for providing each item of the contents with classification information comprising a plurality of hierarchical levels; means for assigning each item of the contents a concept vector; and means for mapping each item of the contents in a predetermined dimensional space based on the provided classification information and the assigned concept vector; wherein said means for mapping comprises; means for calculating a distance between two items of contents based on the concept vectors assigned thereto; means for calculating an adjustment coefficient based on how nearly the classification information of said two items of contents match each other; means for adjusting the calculated distance based on the classification information of said two items of contents by multiplying the calculated distance by the adjustment coefficient so that said distance is reduced to such an extent that the closer said two items of the contents are to each other the more nearly the assigned classification information of said two items of contents match each other; means for mapping each item of contents based on the adjusted distance; and means for further adjusting the mapping based on the classification information of said two items of contents so that the distance between two items of the contents is reduced to such an extent that the two items of the contents are close to each other with respect to the assigned classification information, wherein said adjustment coefficient is calculated using a distance matrix of which size is determined by the number of the classification categories in the lowest level down to which classification categories of said two items of contents match. - View Dependent Claims (26, 29, 32)
-
-
33. A computer program that causes a computer to map contents comprising:
-
providing each item of the contents with classification information comprising a plurality of hierarchical levels; assigning each item of the contents a concept vector; and mapping each item of the contents in a predetermined dimensional space based on the provided classification information and the assigned concept vector; wherein the mapping comprises; calculating a distance between two items of contents based on the concept vectors assigned thereto; calculating an adjustment coefficient based on how nearly the classification information of said two items of contents match each other; adjusting the calculated distance based on the classification information of said two items of contents by multiplying the calculated distance by the adjustment coefficient so that the calculated distance is reduced to such an extent that the closer said two items of the contents are to each other the more nearly the assigned classification information of said two items of contents match each other; and assigning each item of contents the position information in the predetermined dimensional space based on the adjusted distance, wherein said adjustment coefficient is calculated using a distance matrix of which size is determined by the number of the classification categories in the lowest level down to which classification categories of said two items of contents match.
-
-
34. A computer program that causes a computer to map contents comprising:
-
providing each item of the contents with classification information comprising a plurality of hierarchical levels; assigning each item of the contents a concept vector; and mapping each item of the contents in a predetermined dimensional space based on the provided classification information and the assigned concept vector; wherein the mapping comprises; calculating a distance between two items of contents based on the concept vectors assigned thereto; calculating an adjustment coefficient based on how nearly the classification information of said two items of contents match each other; mapping each item of contents in the predetermined dimensional space based on the distance; and adjusting the mapping based on the classification information of said two items of contents by multiplying the calculated distance by the adjustment coefficient so that the distance between two items of the contents is reduced to such an extent that the closer said two items of the contents are to each other the more nearly the assigned classification information of said two items of contents match each other, wherein said adjustment coefficient is calculated using a distance matrix of which size is determined by the number of the classification categories in the lowest level down to which classification categories of said two items of contents match.
-
-
35. A computer program that causes a computer to map contents comprising:
-
providing each item of the contents with classification information comprising a plurality of hierarchical levels; assigning each item of the contents a concept vector; and mapping each item of the contents in a predetermined dimensional space based on the provided classification information and the assigned concept vector; wherein the mapping comprises; calculating a distance between two items of contents based on the concept vectors assigned thereto; calculating an adjustment coefficient based on how nearly the classification information of said two items of contents match each other; adjusting the calculated distance based on the classification information of said two items of contents by multiplying the calculated distance by the adjustment coefficient so that the calculated distance is reduced to such an extent that the closer said provided classification information and the assigned the two items of the contents are to each other the more nearly the assigned classification information of said two items of contents match each other; assigning each item of contents the position information in the predetermined dimensional space based on the adjusted distance; and further adjusting the mapping based on the classification information of said two items of contents so that the distance between two items of the contents is reduced to such an extent that the two items of the contents are close to each other with respect to the assigned classification information, wherein said adjustment coefficient is calculated using a distance matrix of which size is determined by the number of the classification categories in the lowest level down to which classification categories of said two items of contents match.
-
-
36. A computer readable recording medium storing thereto a computer program that causes a computer to map contents, comprising:
-
providing each item of the contents with classification information comprising a plurality of hierarchical levels; assigning each item of the contents a concept vector; and mapping each item of the contents in a predetermined dimensional space based on the provided classification information and the assigned concept vector; wherein the mapping comprises; calculating a distance between two items of contents based on the concept vectors assigned thereto; calculating an adjustment coefficient based on how nearly the classification information of said two items of contents match each other; adjusting the calculated distance based on the classification information of said two items of contents by multiplying the calculated distance by the adjustment coefficient so that the calculated distance is reduced to such an extent that the closer said two items of the contents are to each other the more nearly the assigned classification information of said two items of contents match each other; and assigning each item of contents the position information in the predetermined dimensional space based on the adjusted distance, wherein said adjustment coefficient is calculated using a distance matrix of which size is determined by the number of the classification categories in the lowest level down to which classification categories of said two items of contents match.
-
-
37. A computer readable recording medium storing thereto a computer program that causes a computer to map contents, comprising:
-
providing each item of the contents with classification information comprising a plurality of hierarchical levels; assigning each item of the contents a concept vector; and mapping each item of the contents in a predetermined dimensional space based on the provided classification information and the assigned concept vector; wherein the mapping comprises; calculating a distance between two items of contents based on the concept vectors assigned thereto; calculating an adjustment coefficient based on how nearly the classification information of said two items of contents match each other; mapping each item of contents said position information in the predetermined dimensional space based on the distance; and adjusting the mapping based on the classification information of said two items of contents by multiplying the calculated distance by the adjustment coefficient so that the distance between two items of the contents is reduced to such an extent that the closer said two items of the contents are to each other the more closer the assigned classification information of said two items of contents match each other, wherein said adjustment coefficient is calculated using a distance matrix of which size is determined by the number of the classification categories in the lowest level down to which classification categories of said two items of contents match.
-
-
38. A computer readable recording medium storing thereto a computer program that causes a computer to map contents, comprising:
-
providing each item of the contents with classification information comprising a plurality of hierarchical levels; assigning each item of the contents a concept vector; and mapping each item of the contents in a predetermined dimensional space based on the provided classification information and the assigned concept vector; wherein the mapping comprises; calculating a distance between two items of contents based on the concept vectors assigned thereto; calculating an adjustment coefficient based on how nearly the classification information of said two items of contents match each other; adjusting the calculated distance based on the classification information of said two items of contents by multiplying the calculated distance by the adjustment coefficient so that the calculated distance is reduced to such an extent that the closer said two items of the contents are to each other the more nearly the assigned classification information of said two items of contents match each other; assigning each item of contents the position information in a low dimensional space based on the adjusted distance; and adjusting the mapping based on the classification information of said two items of contents so that the distance between two items of the contents is reduced to such an extent that the two items of the contents are close to each other with respect to the assigned classification information, wherein said adjustment coefficient is calculated using a distance matrix of which size is determined by the number of the classification categories in the lowest level down to which classification categories of said two items of contents match.
-
Specification