JP2015001839A - Computer program summarizing recursive relation between items between plural users, computer readable memory device and information processing method - Google Patents

Abstract

PROBLEM TO BE SOLVED: To provide a content system which enables easy discovery of connection of recursive and indirect relation between items by automatically connecting plural pieces of knowledge and information (especially one in which identification information on items is described in a natural language) about relation between items (other than IDs of users) collected from plural users.SOLUTION: There is provided a computer program for allowing users to input relation between plural items to a computer to make the computer store it. For recursive relation between three or more items identified by using character strings, after a first user inputs relation between a first item and a second item to the computer to make the computer store it, the computer program allows a second user to input the same relation between the second item and a third item to the computer to make the computer store it and expresses the recursive relation between the input first item, second item and third item with display position relation in display on a display device (that may include sound display) connected to the computer.

Description

  The present invention relates to a computer program, a computer readable storage device, and an information processing method for aggregating recursive relationships of items among a plurality of users.

A plurality of users and editors who use a network such as the Internet (also referred to as “browser / poster”, etc., but simply referred to as “users” hereinafter) are Consumer Generated Media (abbreviated as CGM). , Systems (such as bulletin boards, blogs, SNS, Wiki, etc.) that improve the quantity, quality, freshness, etc. of content on a network system through asynchronous communication are known. It has been.
There is a “relationship” between two items (for example, “If the wind is blown”, “Ashiya makes money”, “Coal” is more efficient than “oil”, “Taro” ’s father is“ Yosaku ”, The cause of “boom” is “gradual rise in prices” etc.) and the attributes (such as “binary relationship”) that do not correspond to “relation” (for example, “male”), relationships of 3 or more terms, etc. At the same time, it will be described directly in one or two sentences in natural language or indirectly in a more complicated context or multimedia in the articles constituting the content.

  Among such systems, there are systems that can force the N-term relationship to be described directly in one sentence of a template format, and make formal handling by a computer easier than before (for example, Non-patent document 1) below. In this system, by creating a template for the relationship part instead of the term part, it is possible to prevent the double registration of the relation identification information and the fluctuation of the mark from occurring. In some cases, it has been easier than ever to deal with such a relationship and to find a recursive relationship by a human. However, even in the system of Patent Document 1, normalization of items (values assigned to variables) described in a natural language cannot be performed, and a recursive relationship between items is obtained from a plurality of binary relationships. It is not possible to automatically calculate or display recursive relationships so that it is difficult for computers and humans to find new recursive relationships from the multiple relationships included in the content. Met.

  Also, in some SNS, for friendships between users, etc., the user as an item is identified by a user ID of a predetermined code system instead of a natural language, and a structured database such as a relational database or XML is used. By managing the presence or absence of relationships (friend relationships, etc.) between the user IDs, recursive relationships can be calculated with existing algorithms (such as breadth-first search), and are calculated and displayed. Some other systems can use the recursive connection relationship (graph structure).

That is, in any system, normalization of items expressed in natural language (not relations or user IDs) (specifically, identification information of the items themselves (terms, character strings, sentences, phrase expressions, Etc.), normalization of the relationship (identification information) between those items, and automatic calculation and display of recursive relationships based on both normalizations I was not able to do that.
Therefore, for example, a characteristic factor diagram created by a company's QC activities can be edited not only through a closed meeting of a specific company but also asynchronously and recursively in an open network with all members of the community. It has been difficult to edit and consolidate large-scale contents as contents (for example, a huge tree connecting characteristic factor diagrams (or a network with a Directed AcrylicGraph, a forest having a plurality of roots, etc.)).
In addition, the conventional characteristic factor diagram cannot be systematically edited by the network computer system so as to assign the root of another characteristic factor diagram as a branch (reference link (or copy link)). The idea (factors, causes, influences, etc.) from the QC circle) could be connected efficiently and the causes could be traced back seamlessly, and the seamless ripple effect could not be imagined by the user.
In addition, in those systems and conventional specific factor diagrams, contributions (however, the focus of the present invention is item identification information (character strings, etc.) and identification of relationships among the meaning contents of posted articles etc. Since the unit for evaluating information (character string, etc.) and the assertion of the relationship between two items was an article unit or a characteristic factor diagram unit as represented by “Like”, content that is spam It was difficult to automatically pick up and display only high-value relationships from articles and characteristic factor diagrams while avoiding display of low-value relationships.

vlank.com Knowledge Aggregation Database with Language Equations (VLANK)

  Therefore, the problem to be solved by the present invention is that a plurality of knowledge and information about the relationship between items (other than user IDs) collected from a plurality of users (especially items in which identification information of items is described in a natural language) ) Are automatically connected to provide a content system that makes it easy to find recursive and indirect relationships between items. Moreover, it is normalization of items for that purpose, recursive connection of knowledge, and anti-spam.

This invention is made | formed in view of this subject, Claim 1 is
A computer program for allowing a user to input and store a relationship between a plurality of items other than the user ID,
For recursive relationships between three or more items identified using strings, sounds or images,
After the first user has entered and stored the first relationship between the first item and the second item into the computer, the second user has the second relationship between the second item and the third item. An editing routine that allows a relationship to be entered and stored in a computer;
In a display on a display device (including an audio display) connected to a computer, a recursive relationship about the first relationship between the input first item, second item, and third item There is provided a computer program characterized by having a display position relationship, a graphical connection relationship between items, a display order relationship between items, or an expression routine expressed by a combination thereof.
Thereby, the said subject is solved.
Here, "recursive relationship" means "cause of cause, its further cause ..." (recursive causal relationship), "effect of effect, its further effect ..." (recursive effect) Spillover relationship), “parents, their further parents…” (recursive parent-child relationship), etc. Each relationship between two terms that can be traced back or forth one after another (claims) Each “first relationship” in the section). If the two terms are variable X and variable Y,
“The factor of X is Y” (factor relationship),
“The cause of X is Y” (causality),
“The result of X is Y” (another expression of causality),
“The influence of X is Y” (affected relationship),
“X consists of Y” (relationships that constitute components),
"X's parent is Y" (parent-child relationship),
“X is a kind of Y” (classification relationship),
“X is included in Y” (inclusion relationship),
“X is placed in Y” (placement relationship),
“X is a more than Y” (comparison relationship for fixed viewpoint a),
"X refers to Y" (relationship that is reference information),
Or the relationship which replaced these X and Y, etc. correspond.
In addition, here, “display position relationship, graphical connection relationship between items, display order relationship between items, or a combination thereof” is, for example,
======================
First item | Second item | | Third item
======================
As expressed by the indentation of the display start position of the term,
Furthermore, to express branching from common terms,
======================
1st item | 2nd item | | 3rd item | | 4th item | 5th item | | 6th item
======================
A tree representation like
further,
======================
First item | Second item | | Third item | | Fourth item | Fifth item | | Third item | | First item
======================
As shown above, it is basically a tree representation, but it expresses that the relationship to the same item (here, the third item) is shared (the second item and the fifth item), or mutual recursion (Here the first item is recursive through the fifth item)
Furthermore, although not shown in particular, a graphical representation of the type of relationship (factor / element / parent / child / etc.) By line color, shape, shape or caption (“factor” / “element” / “parent-child / etc.”) Connected items with wiring etc. to make a graph expression,
Furthermore, it means what is expressed in a temporal output order such as audio output indicating the first item → audio output indicating the second item → audio output indicating the third item.

Further, claim 2 is a recursive relationship that expresses simultaneously or sequentially in the expression routine.
Only from certain items,
A computer program according to claim 1 is provided.
This increases the visibility of other items related to the specific item and the relationship with respect to the specific item.
Here, “continuously” means being accommodated in a continuous view with / without scrolling, or outputting continuously (to voice / screen / print / etc.) In time. .

In addition, claim 3
In the expression routine, recursive relationships that are expressed simultaneously or sequentially,
Only for certain relationships
The computer program according to claim 1, wherein the computer program according to claim 1 is provided.
As a result, only a recursive relationship with respect to a predetermined relationship (for example, only “factor”) or a relationship selected by the user (for example, only “element”) can be highlighted and displayed for each system. Facilitates the “discovery” of factors, influences and trends by people and machines (programs).

In addition, claim 4
In the expression routine, recursive relationships that are expressed simultaneously or sequentially,
A computer program according to any one of claims 1 to 3 is provided.
As a result, it is possible to implement a program that does not consider mutual recursion (infinite loop), which contributes to the speeding up of processing, and can be calculated and displayed so that a chain of relationships that are too far away does not become apparent.

In addition, claim 5
In the editing routine,
Allows the user to search and identify a second item stored in the computer using information entered by the user to identify the item,
Duplicate entry of the second item,
Second item notation,
Or
A decrease in the efficiency of calculating the recursive relationship between the first and third items,
To prevent
A computer program according to any one of claims 1 to 4 is provided.
This prevents duplicate input of identification information of the item itself (for example, the character string “Wind blows”, “Tsukuya makes profit”, etc.)), the fluctuation of the title, and the calculation efficiency of recursive relationships. Can do.

In addition, claim 6
Computer program
The first relationship is limited to a “factor” relationship between characteristics in the editing action of two or more users for the purpose of creating a characteristic factor diagram,
Computer program
Displaying the first item as a root or branch in a characteristic factor diagram to be displayed to the first user;
Displaying the second item as a factor of the first item in the characteristic factor diagram for displaying to the first user;
Displaying the second item as a root in the characteristic factor diagram displayed to the second user;
Displaying the third item as a factor of the second item in the characteristic factor diagram for displaying to the second user;
A computer program according to any one of claims 1 to 5 is provided.
This enables logical and recursive connection between different characteristic factor diagrams from a plurality of users, and makes it easy for computers and humans to discover new relationships between characteristics.

In addition, claim 7
7. The recursive relationship can be displayed by mechanically calculating a relationship in which the positioning of the previous term and the subsequent term in the binary relationship is exchanged in the expression routine. A computer program according to any one of the above is provided.
Thereby, for example, not only can the factors be recursively enumerated in the characteristic factor diagram, but also the opposite influence range can be recursively enumerated, thereby improving usability.
The calculation for reversing the positioning, for example, when the relationship DB is implemented with the storage of the relationship, it is only necessary to calculate by replacing the field value from each record, before and after the acquisition even in the case of other data structures It is only necessary to swap the values of the other variables, and in other cases, the tree display may be obtained by a known breadth-first search method (using a queue) as in the case of not replacing (note that the recursion is limited to N stages) If provided, an array for stacking having a height of N stages (a value that can store values for two items in one stage) is prepared, and a depth-first search limited to N stages may be performed).

In addition, claim 8
A ballot acceptance routine that allows multiple users to vote on the assertion of the relationship between items,
The computer program according to any one of claims 1 to 6, further comprising: a sort routine that displays the assertion of the relationship having a large number of votes more prominently.
As a result, the representation of the item itself, the representation of the relationship itself (fixed viewpoint “a” in the above example), and the assertion of the relationship using them (however, two items are used) are not appropriate. (Eg, don't vote for “likes”) Spam-like posts (claims of relationships between items) are displayed inconspicuously (for example, spam-like item identification information with few “likes” or using them) Display routines ("good" that a relationship claim that was not used or inappropriate but not used would be the lower branch in the tree (or subtree) rooted in any other item) It can be realized by sorting by “number” etc.), and the user can efficiently browse the contents.

The present invention also provides a computer readable storage device storing such a computer program.

The present invention also provides
A storage step in which a user inputs and stores the relationship between a plurality of items to a computer,
For recursive relationships between three or more items identified using strings, sounds or images,
After the first user has entered and stored the first relationship between the first item and the second item into the computer, the second user has the second relationship between the second item and the third item. A storage step for allowing a relationship to be entered and stored in a computer;
Display position relationship in display on a display device (including voice display) connected to a computer, the recursive relationship between the input first item, second item, and third item, between items An information processing method comprising: a graphical connection relationship, a display order relationship between items, or an expression step expressed by a combination thereof.

  The effects of the present invention are as described above for each claim.

FIG. 1 is an overall view of a network system that most effectively implements the present invention. Example 1 FIG. 2 is an explanatory diagram showing the hardware configuration of a computer that implements the present invention. Example 1

  The present invention can be implemented in any kind of computer (cloud server, large general-purpose machine, desktop PC, notebook PC, portable terminal, dedicated machine of the present invention) connected / not connected to the network. A description will be given of a form realized by a computer connected to the Internet having a multitask function and a window function, particularly an embodiment in which items and relationships are identified by “character strings”.

  Note that the present invention is not limited to this embodiment, and an embodiment using an image, sound, or the like for item identification is also possible.

FIG. 1 is an overall view of the network system that implements the present invention most effectively. A content management apparatus 1 is a content (items or items between items) handled by the user PC 2 or the user / administrator PC 2. Accepts posts of “Like” votes from each user to a set of relationships and items themselves and relationships between items, and controls PC2 and other while controlling sharing access rights and content provision priority according to a predetermined policy A known file sharing server that distributes content to the user's computer may be used.
For each user, the user PC 2 identifies the identifier of the item to be newly added (represented by a character string) and the binary relationship to be newly defined (signal indicating that the “Like” button has been pressed (identifier) + voting target) The identifier of the item (1 if it is a vote for the item itself, 2 if it is a vote for the relationship between two terms) + the identifier of the relationship), and the relationship between the item itself and the item Voting as a user (signal indicating that the “Like” button has been pressed (identifier) + identifier of the item to be voted (one for voting on the item itself, one for voting on the relationship between two items) 2) + represented by a relationship identifier), and is transmitted to the content management apparatus 1 to be processed by the content management apparatus 1 according to the method of the present invention.

  FIG. 2 is an explanatory diagram showing the hardware configuration of a computer used in the present invention. This is a general computer configuration, and the feature of the present invention is that the CPU 2e uses natural laws in accordance with instructions and descriptions of the program 3 and content data 4 stored in the nonvolatile memory 2h. And the way of the interaction protocol (format) with the user.

  The present invention can also be used to aggregate knowledge socially or company-wide or to discover new relationships from a plurality of existing relationships.

1 Content management device 2 User PC or user / administrator PC
3 Program according to the present invention 4 Content data (a set of items and relations between items and votes from each user for the items themselves and the relations between items)

Claims (10)

A computer program for allowing a user to input and store a relationship between a plurality of items other than the user ID,
For recursive relationships between three or more items identified using strings, sounds or images,
After the first user has entered and stored the first relationship between the first item and the second item into the computer, the second user has the second relationship between the second item and the third item. An editing routine that allows a relationship to be entered and stored in a computer;
Display position relationship in display on a display device (including voice display) connected to a computer, the recursive relationship between the input first item, second item, and third item, between items A computer program comprising: a graphical connection relationship, a display order relationship between items, or an expression routine represented by a combination thereof. In the expression routine, recursive relationships that are expressed simultaneously or sequentially,
Only from certain items,
The computer program according to claim 1, wherein the computer program has a limiting routine. In the expression routine, recursive relationships that are expressed simultaneously or sequentially,
Only for certain relationships
The computer program according to claim 1, further comprising a limiting routine limited to In the expression routine, recursive relationships that are expressed simultaneously or sequentially,
The computer program according to any one of claims 1 to 3, further comprising a limiting routine for limiting to only predetermined N stages. In the editing routine,
Allows the user to search and identify a second item stored in the computer using information entered by the user to identify the item,
Duplicate entry of the second item,
Second item notation,
Or
A decrease in the efficiency of calculating the recursive relationship between the first and third items,
To prevent
The computer program as described in any one of Claim 1 to 4. Computer program
The first relationship is limited to a “factor” relationship between characteristics in the editing action of two or more users for the purpose of creating a characteristic factor diagram,
Computer program
Displaying the first item as a root or branch in a characteristic factor diagram to be displayed to the first user;
Displaying the second item as a factor of the first item in the characteristic factor diagram for displaying to the first user;
Displaying the second item as a root in the characteristic factor diagram displayed to the second user;
Displaying the third item as a factor of the second item in the characteristic factor diagram for displaying to the second user;
A computer program according to any one of claims 1 to 5 is provided. 7. The recursive relationship can be displayed by mechanically calculating a relationship in which the positioning of the previous term and the subsequent term in the binary relationship is exchanged in the expression routine. The computer program as described in any one of.
A computer-readable storage device storing the computer program according to claim 1. A ballot acceptance routine that allows multiple users to vote on the assertion of the relationship between items,
The computer program according to claim 1, further comprising: a sort routine that displays prominently asserted relationships with more votes.   A computer-readable storage device storing the computer program according to claim 1. A storage step in which a user inputs and stores the relationship between a plurality of items to a computer,
For recursive relationships between three or more items identified using strings, sounds or images,
After the first user has entered and stored the first relationship between the first item and the second item into the computer, the second user has the second relationship between the second item and the third item. A storage step for allowing a relationship to be entered and stored in a computer;
Display position relationship in display on a display device (including voice display) connected to a computer, the recursive relationship between the input first item, second item, and third item, between items An information processing method comprising: a graphical connection relationship, a display order relationship between items, or an expression step represented by a combination thereof.

Images