JP3210553B2 - Information presentation method - Google Patents

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to information presentation for collecting and accumulating a user's access history to accumulated information distributed on a network, and displaying it on three-dimensional computer graphics (hereinafter abbreviated as CG). It is about the method.

[0002]

2. Description of the Related Art Conventionally, when accessing information distributed on a network, a logical hyperlink prepared in advance has been followed.

[0003] Alternatively, information is accessed based on a keyword assigned by an information provider.

[0004]

Therefore, the information walk is fixed because the hyperlink is determined in advance, and the information itself is presented only by the static hyperlink. There was a problem that I do not understand.

[0005] Further, with a keyword determined by a certain person,
There was a problem that it was difficult for other people to extract information.

[0006]

In order to solve the above-mentioned problems, the present invention is characterized by using the following means.

(1) In a virtual space constructed on a memory in a computer, a process of taking stored information stored in a storage device of a computer connected to a network into a memory of a computer used by the user using the network; Storing the accumulated information logically linked to the currently referenced accumulated information in the additional information as a hyperlink source of the currently referenced accumulated information.

(2) In a virtual space constructed on a memory in the computer, a process of generating a three-dimensional CG object corresponding to the stored information fetched into the memory in the above (1) on a memory in the computer; Arranging and displaying the three-dimensional CG object using the coordinate system of the virtual space on the memory.

(3) The process of moving the viewpoint in the virtual space to the position of the three-dimensional CG object in the above (1) using a mouse device attached to the computer in the virtual space constructed on the memory of the computer. Selecting a three-dimensional CG object pointed to by a mouse pointer using a switch of a mouse device, and storing the stored information corresponding to the selected three-dimensional CG object in a local computer using a network. Fetching the information into a memory and displaying the accumulated information on a display.

(4) When accessing stored information using a network, information on the memory of its own computer at the time of access and additional information relating to the accessed stored information are transferred to the information indicating the user's access process. As (access history), there is a process that can be collected in the storage device of its own computer.

(5) A process of calculating the coordinates of each three-dimensional CG object in the virtual space using a layout function in the virtual space constructed on the memory in the computer, using the access history of the above (4) as an input. Calculating the coordinates of the three-dimensional CG object in the virtual space based on the hyperlink with the placement function;
Moving the dimensional CG object.

(6) In the virtual space constructed on the memory in the computer, time is measured using the internal clock of the computer, and the coordinates of the three-dimensional CG object in the virtual space are set at regular intervals as described in the above (5). The process of calculating with the placement function of
Using the above-described calculation method at regular intervals, a change in the contents of the access history caused by accessing the stored information is determined at regular intervals measured by using an internal clock of the computer. The method includes a step of updating the position of the object and a step of arranging a three-dimensional CG object that satisfies a part of the content of the access history of the user by this arrangement so as to be apart from one point of the virtual space information by a calculated distance.

(7) In a virtual space constructed on a memory in a computer, a plurality of layout functions (space-dependent layout functions) using access histories are prepared among layout functions for calculating coordinates of a three-dimensional CG object. Corresponding to the process of assigning each to a different virtual space, the process of selecting the assigned virtual space by the user, and
Changing the arrangement of the three-dimensional CG object according to the coordinates calculated by the arrangement function.

As described above, according to the present invention, a user's access history to accumulated information distributed on a network is recorded in a computer, and the record is used to create a three-dimensional CG object corresponding to the accumulated information. Place in virtual space. With this arrangement method, a space suitable for the user's information walk can be dynamically constructed while reflecting the user's own walk history, and the user's information walk is supported.

[0015]

Embodiments of the present invention will be described below in detail with reference to the drawings. FIG. 1 is a block diagram showing an example of a device having a basic configuration for performing the processing of the present invention. A virtual space information display device for input / output with a user, an information access device for realizing access to stored information, an access history collecting device for recording a user's information walking process, and a storage device for storing stored information in an object in a virtual space It comprises an information object generating device 4 to be recreated and an information arranging device 5 for arranging information objects by reflecting the access history of the user.

FIG. 2 is a diagram showing a flow of processing of the information object generating device 4, and FIG. 3 is a diagram showing an example of an attribute interpretation rule of accumulated information. In the present invention, an information object corresponding to accumulated information is generated and displayed in a virtual space. As shown in FIG. 2, the storage information obtained in the network and the access information in the storage device are input (step S).
1) For these pieces of information, attributes are interpreted according to, for example, the attribute interpretation rules of the accumulated information as shown in FIG. 3 (step S2). As a result, an information object is generated on the memory using a three-dimensional CG object such as a cube or a sphere (step S3).

According to the attribute interpretation rule of FIG. 3, for example, the type of information and the three-dimensional CG such as a green diamond if the type of stored information is hypertext, a cube if an image is defined, and a red ball if undefined. It is associated with the object.

FIG. 4 is a diagram showing an example of information collected during a user's strolling process. FIG. 4 shows an example in which User2 follows a hyperlink and accesses object-1. Before this access, object-1 is
It can be seen from the access information on the storage device that the user 10 and the user 9 have been accessed, that is, the user has been accessed a total of 12 times. The access history collection device 3 registers user2 in the access information of object-1 with the current access of user2, sets the access count to 13, and updates the access information of object-1 in the storage device.

FIG. 5 is a diagram showing a flow of processing for initial arrangement of information objects. In the present information presenting device, the access information stored in the storage device is taken out, and the information is generated in accordance with the above-described processing flow of the information object generating device 4.
An information object is generated on the memory using the dimension CG. FIG. 5 shows the flow of the process of initial placement of this information object in the virtual space.

First, the information object generated on the memory is arranged at the origin of the coordinates in the virtual space (step S11). From the next time, the information object is arranged at a distance h from the information object arranged before. This arrangement operation is repeated until all the information objects on the memory are arranged in the virtual space (steps S12 and S13).

FIG. 6 is a diagram showing a processing flow of the information arrangement device 5. First, one is selected from the information objects arranged in the virtual space (step S2).
1). The coordinates of the information object are calculated for the information object using a space-dependent arrangement function (step S22). Next, the information object is moved to the coordinate position in the virtual space (step S23). Next, it is determined whether the selected information object has a hyperlink (step S24). If not, the process from step S21 is applied to other information objects from the beginning. If there is a hyperlink, a hyperlink arrangement function is calculated, and coordinates of the information object in the virtual space are obtained (step S25). An information object is arranged at the coordinate position (step S26).

Next, the distance from the coordinates of the information object whose arrangement has been changed by the arrangement function to the coordinates of another information object is checked, and whether or not the distance is 2h or less is checked (step S27). If the distance is not shorter than 2h, the processing from step S21 is applied to other information objects from the beginning. If it is less than 2h, a repulsion function is calculated for the information object, coordinates in the virtual space are calculated (step S28), and the information object is arranged at that position (step S29).

This processing flow is applied to all information objects on the memory. This process is performed using a computer internal clock, and is performed at regular intervals. FIG.
FIG. 8 is a diagram showing an example of an information object arrangement process.

FIGS. 7A to 7D show examples of the arrangement according to the flow of the initial arrangement processing of the information objects shown in FIG. The information objects generated on the memory are arranged at a distance h.

FIG. 7E shows a hyperlink provided between information objects. Next, this arrangement is changed by the processing method of the information arrangement device 5 shown in FIG. The following hyperlink arrangement function Δr is applied between the information objects a and b (r = | ↑ a− ↑ b |).

Δr = H (↑ a, ↑ b) = − 2A (r−h) The hyperlink placement function is defined as information objects a, b
Potential function h (↑ a, ↑ b) = A (r−h) ²
−B (r = | ｒa− ↑ b |), which is the steepest descent direction. Here, ↑ a and ↑ b represent the position vectors of the objects a and b, respectively.

Using this function, information objects a,
The distance r of b is updated to r + Δr. By repeating this update, the steepest descent method is finally used, as shown in FIG.
Information objects connected by hyperlinks approach each other near the distance h as shown in FIG.

The repulsion function Δr in the arrangement processing of the information arrangement device 5 is Δr = G (＝ a, ↑ b) = C / r ² (r = │ ↑ a- ↑ b│). This arrangement function is an evaluation function g (↑ a, ↑
b) = C / r (where r = | ↑ a− ↑ b |), which is the direction of the steepest descent.

By the calculation of r + Δr, as shown in FIG. 7 (F), the information objects not connected by the hyperlink are separated from each other. FIG. 8 is a diagram illustrating an example of a space-dependent arrangement function of a virtual space.

Further, information objects can be arranged using a space-dependent arrangement function as shown in FIG. For example, there are five types of space-dependent placement functions: user information U, keyword information K, access frequency (for each user) F, access overall rank N, and access rank (for a limited period) M.

Here, the user information U-dependent allocation function is as follows: USER (name, a) = TRUE, U (a, ↑ a) = − 2A (ru), USER (name, a) = FALSE , U (a, ↑ a) = C / r ² . Where USER (name, a) is
If the information object a has been accessed by the user name, it has a value of TRUE; otherwise, it has a value of FALSE. Also, r = | ↑ a |. ↑ a represents the position vector of a.

In the virtual space in which this arrangement function is selected, information objects accessed by the same user gather at a position at a fixed distance u from the origin of coordinates in the virtual space by the steepest descent method. Also, the information objects are arranged on the radiation because they repel each other with the repulsion function described in the process of arranging the information objects.

When Key (word, a) = TRUE, K (a, ↑ a) = − 2A (rk) When Key (word, a) = FALSE, K (a , ↑ a) = C / r ² . Here, Key (word, a) has a value of TRUE if the information object has the keyword word, and FAL otherwise.
Has SE as value. Also, r = | ↑ a |.

In the virtual space in which this arrangement function is selected, information objects having the same keyword are gathered at a position at a fixed distance k from the origin of the coordinates in the virtual space by the steepest descent method. Further, the information objects repel each other by the repulsion function described in the process of arranging the information objects.

The access frequency F-dependent allocation function is as follows: When USER (name, a, times) = TRUE, F (a, ↑ a, times) = − 2 (rf / time)
s) USER (name, a, times) = FALSE
At this time, F (a, ↑ a, times) = C / r ² . Here, USER (name, a, ti
mes) indicates that the information object a has been accessed by the user name, and that times>
If 0, it has the value TRUE, otherwise F
Has ALSE as a value. Also, r = | ↑ a |. ti
mes is the number of times the user name has accessed during the period T measured by the internal clock of the computer. f is a parameter that determines the spread of the object.

In the virtual space in which this placement function is selected, the information object that has been accessed by the user name the most is placed closest to the origin of the coordinates in the virtual space. The smaller the number of accesses, the farther from the origin. The information objects repel each other with the repulsion function described in the process of arranging the information objects.

The access total rank N-dependent allocation function is a function for determining the arrangement of information objects according to the access frequency of each user, whereas the access frequency F-dependent allocation function is a function for determining the information object allocation according to the total access rank of all users. This is a function for determining the arrangement of objects. The access order M-dependent arrangement function is a function for determining the arrangement of information objects according to the order of access frequency for a specific period limited by the user. The format of the function is almost the same as the access frequency F-dependent arrangement function described above.

FIG. 9 is a diagram for explaining an example in which three-dimensional CG objects are rearranged using user names in the case of multi-user. FIG. 9A shows a process in which an information object is accessed by user 1, user 2, user 3, user 4, and user 5.

FIG. 9B shows an example in which the arrangement of information objects has changed as a result of selecting the user information U-dependent arrangement function. The selected user is user 3. Therefore, the placement function calculates U (a, ↑ a) = − 2A (r for an object a for which USER (3, a) = TRUE.
-U) is selected. USER (3, b) = FA
U (b, Ｌb) =
C / r ² and the repulsive force works.

In these arrangement functions, the minimum value of the distance obtained by the steepest descent method is u, and the information accessed by the user 3 is gathered at a position away from the origin by u, and the information other than that is kept away from the origin. It is arranged to try.

FIG. 10 is a diagram for explaining an example in which three-dimensional CG objects are rearranged by utilizing the access frequency of a certain user. FIG. 10A illustrates a trajectory of a certain user strolling the information object in the order of 1, 2, 3, 4, and 5.

In FIG. 10A, when an access frequency F-dependent arrangement function is selected and information objects are rearranged, the result is as shown in FIG. 10B. FIG.
In (B), the information object accessed three times (black rectangle) is arranged near the origin, and the information object accessed twice (hatched rectangle) is arranged at the next closest position. The information object (white rectangle) that has been accessed once is further arranged outside.

In the virtual space constructed on the memory of the computer as described above, the viewpoint in the virtual space is moved to the position of the three-dimensional CG object by using the mouse device attached to the computer, and the mouse device is switched. The user can select a three-dimensional CG object pointed to by the mouse pointer by using. Then, the stored information corresponding to the selected three-dimensional CG object is fetched into the memory of its own computer using the network, and the stored information can be displayed on the display.

[0044]

FIG. 11 shows a three-dimensional C
An embodiment in which G objects are rearranged is shown.

FIG. 11A shows a state in which an information object with a keyword is arranged in a virtual space. For the arrangement shown in FIG. 11A, the keyword “MM” is used using the keyword K-dependent arrangement function.
(Multimedia) ”is an example of the information object arrangement shown in FIG. 11B.

An information object having the keyword “MM (multimedia)”, that is, Key (MM, a) = T
The object a that is a RUE is K (a, ↑ a) = − 2
A (rk) is chosen as the placement function. Key (M
M, b) = FALSE, the information object b other than “MM (multimedia)” is K (b, ｂb) =
C / r ² and the repulsive force works.

In these arrangement functions, the minimum value of the distance obtained by the steepest descent method is k, and the keyword “M
Information having "M (multimedia)" is gathered at a position separated by a certain distance k from the origin, and information that is not so is arranged to move away from the origin.

FIG. 12 shows an embodiment in which three-dimensional CG objects are rearranged using the access frequency of a certain user. FIG. 12A is a diagram showing the arrangement of information objects and the trajectory of a stroll by a user. 0,1,
Reference numerals 2, 3, and 4 represent times of access by one user, and respective curves represent trajectories taken by the user.

FIG. 12B shows an example of the information object arrangement when the access frequency F-dependent arrangement function is selected with respect to FIG. 12A. However, FIG.
In this example, the time after time 1 (T ≧ 1) is targeted. The number given to each information object is shown in FIG.
Indicates the number of times the user has accessed. Here, since the access time 0 does not fall within the period T, it is not a target of this arrangement function.

The information object a accessed three times is
F (a, ↑ a, 3) = − 2 (r− (f / 3)),
Two times, F (b, ↑ b, 2) =-2 (r− (f / 2))
And once (F (c, ↑ c, 1) = − 2 (rf))
Becomes In the case of 0 times, F (d, ↑ d, 0) = C / r ²
And the repulsion works. Therefore, the minimum value of the distance obtained by the steepest descent method is 3 times (f / 3) <2 times (f / 2) <
Once (f / 1) <0, information objects that are frequently accessed are gathered at the origin, and objects that are not frequently accessed are arranged outside.

[0051]

As described above, according to the present invention,
Collecting user's access history to stored information distributed on the network, and using this information to structure and display the stored information in virtual space, to efficiently extract information that users frequently access. Will be able to

The information of the above access process is collected from a plurality of users, and the accumulated information is structured and displayed in the virtual space by using this information, so that the information popular with the public, the latest information, Information that has been updated well can be efficiently extracted.

[Brief description of the drawings]

FIG. 1 is a block diagram showing an example of a device having a basic configuration for realizing the present invention.

FIG. 2 is a diagram showing a flow of processing of the information object generation device.

FIG. 3 is a diagram illustrating an example of an attribute interpretation rule of accumulated information.

FIG. 4 is a diagram showing an example of information collected during a user's strolling process.

FIG. 5 is a diagram showing a flow of a process of initial arrangement of information objects.

FIG. 6 is a diagram showing a flow of processing of the information arrangement device.

FIG. 7 is a diagram showing an example of an information object arrangement process.

FIG. 8 is a diagram illustrating an example of a space-dependent arrangement function of a virtual space.

FIG. 9 shows a case where a user name is used in the case of multi-user.
FIG. 9 is a diagram illustrating an example in which a dimensional CG object is rearranged.

FIG. 10 is a diagram illustrating an example in which three-dimensional CG objects are rearranged using the access frequency of a certain user.

FIG. 11 is a diagram showing an embodiment in which three-dimensional CG objects are rearranged using keywords.

FIG. 12 is a diagram showing an embodiment in which three-dimensional CG objects are rearranged using the access frequency of a certain user.

[Explanation of symbols]

 REFERENCE SIGNS LIST 1 virtual space information display device 2 information access device 3 access history collection device 4 information object generation device 5 information placement device

──────────────────────────────────────────────────続 き Continued on the front page (58) Field surveyed (Int.Cl. ⁷ , DB name) G06F 17/30

Claims (2)

(57) [Claims] 1. A method for displaying an image on three-dimensional computer graphics, wherein a plurality of information and information logically connected to the information are present in an information processing apparatus connected to a network. Storing a hyperlink identifier, a user name and access frequency when the information is accessed by a terminal device connected to the network, and a keyword expressing the information; the terminal device accesses the information processing device; When a request to present a list of information is requested, calculation using a space-dependent allocation function, calculation using a hyperlink function based on the hyperlink identifier, and calculation using a repulsion function are performed, and the plurality of information are displayed in a virtual space formed in the terminal device. An information presentation method characterized by arranging an object of accumulated information. 2. A method for displaying an image on three-dimensional computer graphics, wherein a plurality of information and information logically connected to the information are present in an information processing apparatus connected to a network. And storing a hyperlink identifier, a user name and an access frequency when the information is accessed by a terminal device connected to a network, and a keyword expressing the information.
After the described processing, a virtual space formed in the terminal device based on an arrangement function determined depending on one of user information, a keyword, an access frequency for each user, an overall access rank, or an access rank in a certain period. An information presentation method, wherein an object of the stored information is rearranged above.