WO2007000893A1 - Dispositif, programme, et procede de traitement d'espace d'information - Google Patents

Dispositif, programme, et procede de traitement d'espace d'information Download PDF

Info

Publication number
WO2007000893A1
WO2007000893A1 PCT/JP2006/311903 JP2006311903W WO2007000893A1 WO 2007000893 A1 WO2007000893 A1 WO 2007000893A1 JP 2006311903 W JP2006311903 W JP 2006311903W WO 2007000893 A1 WO2007000893 A1 WO 2007000893A1
Authority
WO
WIPO (PCT)
Prior art keywords
space
information
node
unit
calculation
Prior art date
Application number
PCT/JP2006/311903
Other languages
English (en)
Japanese (ja)
Inventor
Mitsuhiro Tanada
Original Assignee
Mitsuhiro Tanada
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Priority claimed from PCT/JP2005/010856 external-priority patent/WO2005122014A1/fr
Application filed by Mitsuhiro Tanada filed Critical Mitsuhiro Tanada
Priority to JP2007523391A priority Critical patent/JPWO2007000893A1/ja
Publication of WO2007000893A1 publication Critical patent/WO2007000893A1/fr

Links

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/24—Querying
    • G06F16/245—Query processing
    • G06F16/2458—Special types of queries, e.g. statistical queries, fuzzy queries or distributed queries
    • G06F16/2462—Approximate or statistical queries
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/28—Databases characterised by their database models, e.g. relational or object models
    • G06F16/289—Object oriented databases

Definitions

  • the present invention relates to management and retrieval of an information space consisting of knowledge information in a computer program.
  • This invention relates to an information space processing device that performs analysis and sharing.
  • the present invention relates to an information space processing apparatus that manages, searches, analyzes, and shares knowledge information in a computer program using the principle of space superposition.
  • the present invention deals with the meaning of information. As a result, it is possible to obtain convenience beyond simple Word search.
  • Semantic management systems and semantic systematization methods based on meta information include Non-Patent Document 1, Non-Patent Document 2, Non-Patent Document 3, Non-Patent Document 4, Non-Patent Document 5, and Non-Patent Document 9.
  • RDF Resource Description Framework
  • OWL Web Ontology Language
  • Non-Patent Document 6 Non-Patent Document 7
  • Non-Patent Document 8 Research and development of software next-generation file system (code name) WinFS is also progressing as a next-generation information management method for information. This technique is to make the file system accessible as if accessing the Web. This is because meta information about files is stored in a relational database, and advanced query search, cross-sectional search, search speed improvement, search by classification, search refinement of search results, etc. become possible. However, this is also a technique for managing and retrieving meta information of information.
  • Non-Patent Document 1 Jack Park, edited by Sam Hunting, Takeshi Goto, “XMLTopic Maps—Semantic Web in the Era”
  • Non-patent document 3 ISO 13250
  • Non-Patent Document 4 W3C, Resource Description Framework (RDF), [online], [May 2004 search], Internet URL: http: ⁇ www.w3.org/RDF/>
  • Non-Patent Document 5 W3C, OWL Web Ontology Language XML Presentation Syntax, [online], [Search May 20, 2004], Internet http: http www.w3.org/TR/owl-xmlsynt ax />
  • Non-Patent Document 6 By Microsoft Corporation, WinFS, [online], [May 2004 search], Inter 1 ⁇ Not ⁇ URL: http: / 1 msdn.microsoft.com/Longhorn/ understanding / illars / Wm Fb / derault.aspx
  • Non-Patent Document 7 By Microsoft Corporation, WinFS in the Longhorn SDK, [online], [20 May 2004 search], Internet ⁇ URL: http: //longhorn.msdn. Microsoft. Com /? // lon ghorn. msdn. Microsoft.com/lhsdk/winfs/ daovrWelcomeToWinFS.aspx>
  • Non-Patent Document 9 “Computational Intelligence Part 4 Knowledge Engineering Ontology Nikkei Byte February 2004, Nikkei Business Publications, 2004, P. 42-45 Disclosure of Invention
  • the present invention expresses meaning in a different approach rather than using only meta information and uses it for information management.
  • an information space evaluation apparatus applies to one or a plurality of spaces formed by a set of nodes (a group of information) that is a group of information.
  • An information space evaluation device that performs evaluation, a data acquisition unit that acquires information from the space, and an overlap calculation that performs overlay calculation, which is a process of calculating relevance between different spaces based on the acquired information
  • a combination calculation processing unit ; and a data output unit that outputs a result of the overlay calculation by the overlay calculation processing unit.
  • meaning is treated as a space.
  • the meaning is treated as position information that exists in a space other than some defined meta-information, and state information of its existence.
  • this space is particularly referred to as a semantic space.
  • handling this status information plays a major role in handling the ambiguity of meaning.
  • Space superposition processing is a very important concept in the present invention. This is to calculate by comparing the existence of one or more spaces. Of particular importance is the use of equivalence evaluations to compare whether this comparison is the same. Respectively This space expresses some concept. The existence of the same thing in each different space means that the same thing exists in different concepts. In the present invention, it is understood as meaning. Since this existence does not depend on the structure of the space itself or the relationship between information and information, it can give a large degree of freedom to the description of the space. By using superposition processing, it is possible to highlight what exists across multiple spaces.
  • the overlay process can be said to be a process in which information emerges by comparing data bias and characteristics in space.
  • a node in a space that is a set of nodes represents an important meaning.
  • a space is designed using a certain design concept.
  • the existence of a node means that the node satisfies a design philosophy.
  • the fact that it does not exist means that it does not satisfy a certain design philosophy.
  • Projection of space is a useful mechanism for expressing different things while maintaining a uniform structure.
  • uniform data can be handled easily.
  • the application is powerful, such as the Japanese version, the English version, and the Spanish version. By projecting, it is possible to clearly create a coherent space for each aspect while maintaining a specific structure.
  • the layer can provide additional information or processing using the additional information to the space.
  • information about security is usually different from the concept you want to express in space. More specifically, suppose there is a space that expresses a certain test result. Information about the security of this space, such as access permission and disapproval, should not be related to the test score and the test result. In this way, by clearly separating information that is not directly related to the concept of space, each can be handled easily.
  • the present invention is an information space evaluation method that can only be realized as an information space evaluation apparatus as described above, a program that represents the method as steps, and a computer-readable CD-ROM that records the program. It can also be realized as a medium.
  • the invention's effect can only be realized as an information space evaluation apparatus as described above, a program that represents the method as steps, and a computer-readable CD-ROM that records the program. It can also be realized as a medium.
  • Item 2 A device that can perform overlay processing using equivalent evaluation Item 2.1.1.
  • Item 2.1.2 A device that can perform weighting using equivalence evaluation
  • Item 2.2 Device that can perform overlay processing using comparative study Item 2.2.1 ⁇ Weighting processing using comparative study
  • Item 2.3 Devices that can perform integrated calculations
  • Item 2.4 Devices that can perform filtering
  • FIG. 1 is a functional block diagram showing a configuration example of the information space processing device 4000 according to the first embodiment.
  • This information space processing device 4000 is a collection of nodes that are a group of information.
  • This is a device that performs evaluation (analysis, management, search, sharing, etc.) on a plurality of spaces formed by combining the meanings of humans by treating human meaning as state information in the space. It is characterized in that it can be handled, and comprises a data acquisition unit 4210, a processing start unit 4212, a projection unit 4411, an overlay calculation processing unit 4211, a data output unit 4213, and an automatic classification processing unit 4809.
  • the data acquisition unit 4210 further includes a space selection unit 4250 including a link selection unit 4251 and a hierarchy selection unit 4252 and a spatial filtering unit 4253.
  • the overlay calculation processing unit 4211 further includes an arithmetic processing unit 4216 including a logical operation calculation unit 4220, a weighting calculation unit 4221, an integrated calculation calculation unit 4222, a filtering unit 4223, and a force processing unit 4224. Part 4215 and Comparative Study Part 4217.
  • this figure also shows a spatial data section 4201 and the like existing outside the information space processing device 4000.
  • Each component is implemented by one or more programs and Z or hardware.
  • the program may be processed by multiple computers.
  • the overall processing flow uses the processing start unit 4212 and the data acquisition unit 4210 from the spatial data unit 4201 to determine the processing to be performed and the target space. Further, using the determination of the processing start unit 4212 and the data acquisition unit 4210, the overlay calculation processing unit 4211 performs the overlay processing, and the data output unit 4213 outputs the result to the output destination 4214.
  • Spatial data section 4201 is a part where information about space exists, and means a computer-readable recording medium such as a memory or a magnetic disk, or a network itself. To access such information, methods such as reading information from a space realized on a memory or a magnetic disk, or acquiring spatial information from other computers on a network are common.
  • the processing start unit 4212 determines what kind of processing power to perform. This may be an instruction from an external or internal program, or a human may instruct a process. In this part, it is decided which space is the target of processing, what has been taken, and how superposition processing is performed. In performing the processing, the spatial data section 4201 is accessed or information is collected using the data acquisition section 4210 or the like. For example, such processing is often performed when a human determines a search target interactively through a program.
  • the data acquisition unit 4210 is a processing unit that acquires information from the spatial data unit 4201, to acquire information to be used by the processing start unit 4212, or to be used by the overlay calculation processing unit 4211. To do.
  • the data acquisition unit 4210 acquires data to be used for overlay processing using a link selection unit 4251 or a hierarchy selection unit 4252 that is a kind of the space selection unit 4250. If necessary, the data acquisition unit 4210 selects the data to be used by executing the spatial filtering unit 4253 or the like.
  • the overlay calculation processing unit 4211 is a processing unit that performs overlay calculation, which is a process of calculating the relationship between different spaces, based on the information acquired by the data acquisition unit 4210.
  • the data acquisition unit 4210 Based on this information, the arithmetic processing unit 4216 and the equivalent evaluation unit 4215 are used to perform various operations to obtain the truth value of the logical operation, the weighting processing, and the weight (score) of the weighted integration calculation.
  • the calculation of the truth value by the logical operation is implemented by the logical operation calculation unit 4220.
  • the weight calculation unit 4221 obtains a weight (score) for weighting.
  • the equivalence evaluation unit 4215 will be described.
  • the equivalence evaluation unit 4215 is a processing unit that evaluates whether nodes can be regarded as equivalent.
  • all equivalence evaluations can be used, such as synchronization point equivalence evaluation that cannot be used basically, equivalence evaluation using node properties and node type. These can be defined in the script 'program language 4240, or the function of equivalence evaluation can be delegated to the external program 4241.
  • the comparative study unit 4217 performs comparative review processing for comparing and evaluating nodes. Usually, numerical information is obtained by comparison.
  • the comparison process can be defined in the script 'program language 4240, or the function of the comparison process can be delegated to an external program 4241.
  • the arithmetic processing unit 4216 performs comparison calculation for different spaces based on the evaluation by the equivalence evaluation unit 4215 and the comparison examination unit 4217, and calculates the result as the relevance. It is a processing unit.
  • the logical operation calculation unit 4221 calculates the truth value of the logical operation. The calculation is performed using the equivalent evaluation unit 4215 or the comparative study unit 4217. For example, for the evaluation by the equivalent evaluation unit 4215, true / false is determined by determining whether or not a certain condition is satisfied, and the true / false of different spaces is logically calculated. This result is used for the force passed to the data output unit 4213, the true / false value by the filtering unit 4223, or used for the calculation of the filtering unit 4223 and the processing unit 4224.
  • the weight calculation unit 4221 calculates the weight (score) of the weighting process.
  • the calculation is performed using the equivalent evaluation unit 4215. For example, the number of nodes determined to be equivalent by the equivalence evaluation unit 4215 is counted, and a weighting process is performed using a value depending on the counted number as a weight for the space or the node. Normally, this part is used for unique processing, priority adjustment, and various calculations.
  • the integrated calculation calculation unit 4222 calculates the weight (score) of the weighted integrated calculation.
  • the calculation is performed using the equivalence evaluation unit 4215. Normally, this calculation is performed using the result of the weight calculation unit 4221. For example, a comparison calculation for different spaces is performed using the weight obtained by the weight calculation unit 4221.
  • the calculation results of the weighting calculation unit 4221 and the integrated calculation calculation unit 4222 may be output to the data output unit 4213 as they are. However, the filtering unit 4223 may select only specific ones, Using part 4224 to output the adjusted score is also effective.
  • the filter unit 4223 performs a filtering process that is a mechanism for narrowing down results such as a logical operation, a weighting process, or a weighted integration calculation.
  • Information can be narrowed down by applying to the results of the logical operation calculation unit 4220, the weighting calculation unit 4221, and the integrated calculation calculation unit 4222.
  • For narrowing down use the result of the logical operation calculation unit 4220 or use a node judgment formula. It is also effective to further process the result by the processing unit 4224. These results are output to the output destination 4214 by the data output unit 4213.
  • the processing unit 4224 performs processing on weights for weighting processing and weighted integration calculation, and performs processing for weight processing. For processing, use the result of logic operation calculation unit 4220. In general, processing is performed using a node determination formula. It is also effective to further sort the results by the filtering unit 4223. These results are output to the output destination 4214 by the data output unit 4213.
  • the data output unit 4213 receives the result of the overlay calculation process 4211 and outputs it to the output destination 4214.
  • the output destination is a computer-readable recording medium or a network.
  • the results are saved to memory or a magnetic disk, transferred to another computer or program using a network, or output using a display or speakers.
  • the output result can be further arranged using the filtering unit 4223 and the processing unit 4224.
  • the projecting unit 4411 is a processing unit that makes it possible to treat a plurality of versions of space as one concept, that is, a processing unit that projects the space. By using this function, it is possible to prevent information from being distributed. Projection is effective for multilingual design of space and version management of complex programs and documents.
  • the automatic classification processing unit 4809 is a control unit that performs control to automatically and sequentially execute each component included in the information space processing device 4000.
  • the data acquisition unit 4210 acquires information on the space used in the superposition process from the spatial data unit 4201.
  • the obtained space information is subjected to a process of calculating the relevance between the spaces in the overlap calculation unit 4211, and the overlap processing result is obtained.
  • the overlap processing result is output to the output destination 4214 by the data output unit 4213.
  • the “superimposition processing” of the space by the superimposition calculation processing unit 4211 is to extract information from a space composed of one or a plurality of nodes by using comparative evaluation for comparing nodes. There is to do. Any node can be used for the overlay process as long as it can be compared by a computer. In other words, even if a node is information, it can be a program module or device. Anything can be used. In other words, what is calculated as a node depends on the program.
  • the most effective method of using the overlay process is to extract information by comparing a plurality of spaces. As shown in the image diagram of Fig. 5, by superimposing the two spaces, the related parts of the two spaces, 1 13, are highlighted. Extraction of information from space can be said to make information appear as shown in 113 by using superposition processing.
  • the superposition process is used for information retrieval and analysis.
  • the spatial data unit 4201 acquires information on the space used in the superposition process by the data acquisition unit 4210.
  • the acquired space information is subjected to a process of calculating the relevance between the spaces in the overlap calculation unit 4211.
  • the arithmetic processing unit 4216 uses the equivalence evaluation unit 4215 to determine the relationship between the spaces based on the result of the equivalence evaluation that determines whether the acquired nodes in the space are equivalent. calculate.
  • the calculated overlay processing result is output to the output destination 4214 by the data output unit 4213.
  • Information can be extracted from the space by calculating the comparison evaluation used in the superimposition processing by using the equivalent evaluation for determining whether the nodes are the same.
  • the comparison evaluation used in the overlay processing of the space by the overlay calculation processing unit 4211 determines whether the nodes can be regarded as the same by the equivalence evaluation unit 4215.
  • Various information can be acquired.
  • the reason why the overlapping process using equivalence evaluation is effective is that information contained in multiple spaces is likely to be important.
  • the space depends on the design, it is created based on the design philosophy. In other words, what can be regarded as the same in multiple spaces can be regarded as meaningful information that exists in multiple spaces.
  • Item 2.1.1 Device capable of performing logical operations using equivalence evaluation
  • the data acquisition unit 4210 acquires information on the space used in the superposition process from the spatial data unit 4201.
  • the obtained space information is subjected to processing for calculating the relevance between the spaces in the overlap calculation unit 4211.
  • the overlay calculation unit 4211 uses the equivalence evaluation unit 4215 by the operation processing unit 4216 to determine whether the obtained space node is equivalent or not based on the result of the equivalence evaluation. Is calculated.
  • the calculated overlap processing result is output to the output destination 4214 by the data output unit 4213.
  • the logical operation of the superimposition processing using the equivalence evaluation unit 4215 performs logical operation using the space node as a true / false value by using equivalence evaluation for determining whether the node of the space information is the same. Values indicated by logical operations are expressed as true and false and are very easy to handle. Logical operations are AND (logical product), OR (logical sum), XOR (exclusive logical sum), NOT (negative logical product), NAND (negative logical product), NOR (negative logical product), XNOR (exclusive logical sum) All logical operations are possible.
  • Spatial data section 4201 (in this case, the space created to manage the website in Figure 34) and data acquisition section 4210 (generally a web browser or web terminal) obtain information necessary for overlaying
  • the overlay calculation processing unit 4211 (generally a remote server device).
  • the logical operation unit 4220 calculates the logical operation using the equivalence evaluation unit 4215, and finally the result of the logical operation (FIG. 38, FIG. 39, FIG. 40, FIG. 41, FIG. 42). (True / false data as shown in FIG. 43) is output to the output destination 4214 (generally a Web browser or Web terminal).
  • Figure 34 shows a portion of the space created to manage the website.
  • the circles in Fig. 34 are nodes that have numbers assigned to them and are the targets of logical operations.
  • the meaning of the numbers is equivalent numbers that represent equivalents with the same numbers. In this case, the nodes that store the same Web page are equivalent.
  • Figures 35 and 36 show this space as a truth value.
  • Fig. 35 shows space 1800 replaced with a Boolean value
  • Fig. 36 shows space 180 1 replaced with a Boolean value.
  • the true or false value that is, the criterion for deciding whether it is 0 or 1 is converted to true if it is more than the equivalent number power.
  • Figure 37 shows the details of the logical operation method using AND operation. As shown in Fig. 37, anything that does not exist in each space (none) is calculated as false in this implementation. The final AND result is shown in Figure 38. Similarly, the results of logical operations on space 1800 and space 1801 are shown in Figure 39 for the OR operation, Figure 40 for the XOR operation, Figure 41 for the NAND operation, Figure 42 for the NOR operation, and Figure 43 for the XNOR operation. Indicated.
  • the space data unit 4201 acquires information on the space used in the overlay process by the data acquisition unit 4210.
  • the acquired space information is subjected to processing for calculating the relevance between the spaces in the overlap calculation unit 42 11.
  • the weight calculation unit 4221 uses the equivalence evaluation unit 4215 to obtain the weight information for each space based on the result of the equivalence evaluation that determines whether the acquired nodes in the space are equivalent. calculate.
  • the integrated calculation operation unit 4222 integrates the weights and calculates the final weighting processing result.
  • the calculated weighting processing result is output to the output destination 4214 by the data output unit 4213.
  • the reason why the overlay process using the equivalence evaluation is effective is that it can be said that there is a high possibility that the information included in the space is important.
  • a space is created based on the design philosophy. What can be regarded as the same in multiple spaces can be regarded as meaningful information that exists in multiple spaces.
  • the information obtained by superimposing can be used for information retrieval and analysis.
  • the calculation logic of the weighting process using the equivalence evaluation is shown by taking the case in the space for managing the information of the website as an example.
  • the weight calculation unit 4221 uses the equivalence evaluation unit 4215 to determine the weight for each space based on the result of the equivalence evaluation that determines whether the acquired nodes in the space are equivalent. Calculate information. Further, when the weight information for each space is an operation by a plurality of spaces, the weights are integrated in the integrated calculation calculation unit 4222 and the final weighting processing result is calculated.
  • the node in Fig. 45 stores the address of the Web page. Nodes used for equivalence weighting are assigned alphabets such as a and b. Indicates the same web address.
  • weighting calculation unit 4 221 has a space 1910 with a score of 1 in the space 1910, space 1911 has a score of a node with a score of b node 1, and space 1912 has The b-node score is calculated as 3. Furthermore, the integrated calculation operation unit 4222 sets the score of the superposition by adding the three spaces to 2 for the a node and 4 for the b node.
  • the weighting value can be changed according to the situation. This is particularly called priority adjustment.
  • This feature allows for semantic adjustment when using weighting. For example, depending on the space or node, there is an adjustment to change the dependency in determining the power weight of the counted node.
  • the timing at which the priority adjustment is performed is generally a method that is performed when the weighting calculation unit 4221 executes the weighting process.
  • a method in which a user using the information space processing device 4000 designates an explicit priority through the processing start unit 4212 and performs processing in the weighting calculation unit 4221 is also acceptable.
  • the weighting calculation unit 4221 can freely make an original change without using the obtained information as it is. For example, consider a search for books using the Web. At this time, if you are not satisfied with the calculation by the weighting calculation unit 4221, you can use the priority adjustment to change the result, so that you can find something closer to your result.
  • the node of Fig. 45 stores the address of the Web page. Nodes used for equivalence weighting are given alphabets such as a and b. Show. In the process of equivalent weighting for spaces 1910, 1911, and 1912 in Fig. 45, space 1912 force S is important, so if the priority of space 1912 is doubled as an example, Has a score of 6 for the b node. As a result, finally, the calculation result of the equivalent weighting process by addition is as shown in Fig. 48. The a-node score is 2, and the b-node score is 7. As described above, by giving priority to nodes or spaces according to the situation, flexibility can be given to the weighting process.
  • a "distance priority method" that adjusts the priority according to the distance from a specific node and calculates the weight may be effective.
  • information that is close to the space may be important information. For example, in a link space, the closer the link distance is, the closer the relationship may be.
  • Fig. 49 two examples of calculation by the distance priority method will be shown using the figure.
  • the distance priority method shown below is realized by applying a calculation that is smaller than the value originally used in the overlay process, depending on the distance from the reference node. In this case, based on the node 1991, the formula “1 / link distance + 1” is applied as the weight of each space.
  • Fig. 50 shows a method in which 0.25 is subtracted until the link distance increases to 0. In this way, the weight is adjusted in various ways according to the link distance.
  • the distance priority method it is possible to perform overlay processing with higher reliability by changing the weight based on spatial positional information. It can be said that the specific calculation is applied from time to time, so it is desirable that the calculation method can be extended with a program language or a script language.
  • the weight calculation unit 4221 uses the equivalence evaluation unit 4215 to determine the weight for each space based on the result of the equivalence evaluation that determines whether the acquired nodes in the space are equivalent. It is executed when the information is calculated.
  • FIG. 153 stores information about a plurality of individuals. For example, in order to reduce duplication of information for the space 6101 in FIG. 153, assume that the calculation processing is performed with a maximum of two equivalents. Table 6102 in Figure 153 shows the number of nodes in space 6101. The “normal calculation” item is the result of the existing counting.
  • the unique processing by the overlap calculation processing unit 4211 is a type of merge processing, and there are multiple equivalents in each space. This is a process that regards this as a multiple of 1.
  • equivalence evaluation For nodes evaluated as equivalent by part 4215, processing such as counting up as one node in each space is performed. Similar to the merge process, duplication such as unnecessary information can be excluded from the result of the weight calculation process.
  • the calculation logic of the weighting process using uniqueness is shown by taking as an example the case in a space for managing information on a Web site.
  • the weight calculation unit 4221 uses the equivalence evaluation unit 4215, and based on the result of the equivalence evaluation that determines whether or not the nodes of the acquired space are equivalent, It is executed when the weight information is calculated.
  • Fig. 45 shows the counting of overlapping numbers in the three spaces shown in Fig. 45.
  • the three spaces are a collection of favorite website address information, and each node represents a website.
  • the nodes marked with alphabets a and b are selected for retrieval in the weighted search, and those assigned the same number indicate the same Web address.
  • nodes indicating the same Web address are equivalent.
  • the a-nodes 1901 and 1902 ⁇ of each empty space are equivalent to each other, and the b-nodes 1903, 1904, 1905, and 1906 are also equivalent to each other.
  • the results of the weighted search in spaces 1910, 1911, and 1912 are shown in Fig. 47 as the equivalent node ⁇ IJ and weight (score).
  • space 1910 has a-node score of 1
  • space 1911 has a-node scoring power S1
  • space 1912 has 3 b-nodes. It is calculated as one with no duplication of information. That is, the score of the b node in space 1912 is calculated as 1. Therefore, the score of the equivalent weighting process by adding the three spaces is 2 for the a node and 2 for the b node. In this way, the score of the b node is merged with 1 in space 19 12.
  • the weighting calculation unit 4221 can naturally use a combination of normal weighting processing and weighting processing using the unique processing. For example, in the case of FIG. 45, in the case of weighting processing of the space 1910, the space 1911, and the space 1912, the space 1910 and 1911 can be calculated by weighting, and the space 1912 can be calculated by weighting by applying a unique processing. is there.
  • Equivalence evaluation unit implementation [0073] Various implementations can be used for the equivalence evaluation used in the overlay process. Rather, using a variety of implementations can be very effective. Typical implementations are implementations in programming languages and script languages. For example, implementation by an external program.
  • equivalence evaluation unit 4215 performs the equivalence evaluation, it can be realized by using the script and the program language 4240 or the external program 4241 to determine whether or not they are equivalent.
  • Equivalence evaluation can be easily controlled by using a programming language and script language implementation. For example, if a user is not satisfied with the Web address (URL) determination function, the equivalent search function of the Web search system can be replaced with one that performs text matching on the Web page. It becomes.
  • URL Web address
  • the data created by the sorted container creation unit 4226 is used for the calculation of the overlay process using the merge calculation unit 4227.
  • the sorted container creation unit 4226 is used by the logical operation calculation unit 4220 and the weighting calculation unit 4221.
  • the merge calculation unit 4227 is used in the logical operation calculation unit 4220 and the integrated calculation calculation unit 4222.
  • step S101 the node of the space and the node information necessary for the overlay process are stored in the data container. Expand to the sorted state.
  • a data container is a container in the C ++ language and a collection in the Java (registered trademark) language. Usually, the data container has a memory resource area, a list structure, a tree structure, and a hash structure. The data container should be in a sorted state after sorting by storing.
  • a container having a data storage area with a tree structure or hash structure inside may be used so that information can be extracted in a sorted state when stored. This is commonly called an associative container in the C ++ language.
  • the sorted data container is subjected to calculation and merging processing while scanning, and the final result is output.
  • the sort criteria for sorting the data containers may be any forms that are judged to be equivalent in the equivalence evaluation used in the overlay process and are adjacent to each other.
  • FIG. Figure 60 shows the implementation of the algorithm when the three spaces are overlapped.
  • processing 1950 the space node or node information is stored in the data container.
  • Processing 1950 and 1951 can be combined into one if an associative container is used.
  • process 1953 the data container is scanned, the weights are calculated in units of space, and the priority and unique weighting processes are calculated, and the results are combined by a merge process.
  • Figure 61 shows the part from which the calculation results are derived from the two sorted data containers.
  • the numbers in the data container in Fig. 61 mean node or node information, and those with the same number are judged to be equivalent in the equivalence evaluation.
  • the calculation processing is performed while alternately running data container 1 and data container 2, and the result is output.
  • the equivalent nodes or the node information are arranged next to each other. Therefore, if the calculation is performed while scanning and the non-equivalent part is reached in the container, the scan of the merge process is switched. good.
  • the acquired spatial information is expanded, and the logical operation unit 4220 uses the sorted container creation unit 42 26 to sort the sorted data. Create container information. Further, the logical operation unit 4220 uses the merge calculation unit 4227 for the sorted data container information to calculate the true / false while performing the strike.
  • Figure 62 shows how the data container is being scanned. In FIG. 62, the same alphabet means an equivalent node or node information. If two or more equivalents are calculated as true and the others are calculated as false, the table shown in Fig. 63 is obtained.
  • the acquired spatial information is expanded, and the weighted calculation unit 4221 uses the sorted container creation unit 4226 to sort the sorted data container. Create information. Further, the integrated calculation operation unit 4222 uses the merge calculation unit 4227 to calculate the weight while scanning the sorted data container information.
  • Figure 62 shows the scanning of the data container.
  • the spatial data unit 4201 acquires information on the space used in the superposition process by the data acquisition unit 4210.
  • the obtained space information is subjected to a process of calculating the relationship between the spaces in the overlay calculation unit 4211 to obtain the result of the overlay process.
  • the comparison review unit 4217 is used to calculate the weights for the nodes (use either all comparison type, outer comparison type, or inner comparison type), Result.
  • the overlap processing result is output to the output destination 4214 by the data output unit 4213.
  • 4A. 1 and 2 are related to major leagues and are equivalent.
  • the case where the overlay processing using comparative study is particularly effective is when the level of abstraction of the information associated with the node is high. For example, the contents of document data and image data. With such data, it is difficult to determine whether it is the same or not based on the criteria. For example, even if you try to make a decision such as “Image A means the same as Image B”, it is difficult to determine a clear standard.
  • the space data unit 4201 acquires the information of the space used in the superposition process by the data acquisition unit 4210.
  • the obtained space information is subjected to a process of calculating the relationship between the spaces in the overlay calculation unit 4211, and the result of the overlay process is obtained.
  • the weight calculation unit 4221 uses the comparison review unit 4217 to calculate the weight for the node (use either the all comparison type, the external comparison type, or the internal comparison type)
  • the result of superimposition processing is output to the output destination 4214 by the data output ⁇ 4213.
  • the weighting process using the comparative study calculates the similarity by comparing the nodes, and calculates the node weight based on the similarity. By using the weight information, it can be used for information retrieval.
  • the weighting process using the comparative study includes “all comparison type”, “outside comparison type”, and “internal comparison type” depending on the type of comparison.
  • the all comparison type is performed using the entire space used in the weighting process. In other words, all nodes in the space are subject to computation.
  • All comparison type calculation logic will be described by taking as an example a case in a space for managing information on a Web site.
  • the processing is performed when the weight calculation unit 4221 obtains the weight for the node using the comparison study unit 4217.
  • Each node in Fig. 13 8 records the contents of the Web page and its document. Between nodes The connecting link shows the link of the Web page.
  • the comparison comparison weighting process is performed in the two spaces 5001 and 5002 in FIG.
  • Figure 139 shows the correspondence table of scores when comparing each node. For example, the score obtained by comparing node d and node f is “9”.
  • the comparison score can be calculated by comparing the sentences contained in the nodes and calculating the degree of similarity numerically.
  • the result of the calculation is shown in Figure 140 “Score for all comparisons”.
  • the all comparison type compares all the nodes in the space. For example, when considering node a, the score is compiled by comparing with all nodes except a. The specific calculation is based on the comparison with the nodes b, c, d, e, f, g, h, i, j, k, and 1, so it is calculated by adding simple scores. If you do, “3 + 2 + 2 + 4 + 1 + 3 + 9 + 3 + 2 + 1 + 1” and the score is 31.
  • the outer comparison type performs comparison with an external space in the space used in the weighting process. That is, nodes included in the same space are not subject to calculation.
  • All comparison type calculation logic will be described using a case in a space for managing information on a Web site as an example.
  • the processing is performed when the weight calculation unit 4221 obtains the weight for the node using the comparison study unit 4217.
  • external comparison type comparison weighting processing is performed in the two spaces 5001 and 5002 in FIG.
  • the external comparison type performs comparison operations only with the external space. That is, the nodes included in the space 5001 are not compared with other nodes in the space 5001, but are compared only with the nodes in the space 5002. Conversely, the node in space 5002 does not compare with other nodes in space 5002, but compares only with the node in space 5001.
  • the internal comparison type compares with the internal space in the space used in the weighting process.
  • the processing is performed when the weight calculation unit 4221 obtains the weight for the node using the comparison study unit 4217.
  • the internal comparison type comparison weighting process is performed in the two spaces 5001 and 5002 in FIG.
  • the inner comparison type does not compare spaces but compares between nodes in the space. That is, the nodes included in the space 5001 are compared only with the nodes in the space 5001, and the nodes included in the space 5002 are compared only with the nodes in the space 5002. For example, when considering the node a whose result is calculated in the “internal comparison score” in FIG.
  • a is the node a, b, c, d, e, f in the same space 5001. Compare with g. The specific calculation is “3 + 2 + 2 + 4 + 1 + 3” for a simple score calorie calculation, and the score is 15.
  • the weight calculation unit 4221 performs comparison using the entire space. Therefore, characteristic information as a whole is derived as processing.
  • the weight calculation unit 4221 compares only with the external space. For this reason, the external comparison type has the meaning of taking out something important in relation to multiple spaces. For example, as shown in FIG. 138, when comparison weighting processing is performed in a large space 5012 and a small space 5011, the difference in characteristics between the all comparison type and the external comparison type becomes clear. Since all comparison types tend to acquire important information as a whole, the characteristics of a small space may be trapped in a huge space.
  • the characteristic parts of both spaces can be extracted as features. Because the inner comparison type only compares the internal space, it is not affected by other spaces. This can extract the characteristic part of each space. It can be said that the usage method is usually used for the logical operation of comparative study rather than using it as a single unit of the comparative examination weighting process.
  • the space data unit 4201 acquires information on the space used in the superposition process by the data acquisition unit 4210.
  • the obtained space information is subjected to a process of calculating the relevance between the spaces in the overlap calculation unit 4211 to obtain the relevance.
  • the process of calculating relevance is done by grouping together those that can be determined as equivalent by the equivalence evaluation unit 4215 and gnoleating.
  • the weight calculation unit 4221 uses the comparison unit 4217 to determine the weights for the nodes in grouped units (uses all comparison type, outer comparison type, or inner comparison type), and overlaps them. This is the processing result.
  • the overlap processing result is output to the output destination 4214 by the data output unit 4213.
  • the comparative weighting processing by the weight calculation unit 4221 takes a long time to calculate as the space size increases. Assuming that the number of nodes S in a space is S "n”, the comparison weighting process based on the total comparison of the two spaces performs "O (n X n)" comparisons. In other words, the order is the square of n. Furthermore, if the number of spaces is large or the cost of the comparison process itself is high, an even greater calculation cost is required.
  • the weight calculation unit 4221 may perform a comparative study weighting process between nodes determined to be equivalent by dividing the nodes according to the criteria for equivalence evaluation, although there may be a slight decrease in accuracy. It can be said that it is meaningful to increase the calculation speed by using “weighting”.
  • Figure 146 shows the distribution of these equivalents only.
  • space 5405 is "6 X 5 + 2" times
  • space 5406 is “5 X 4/2” times
  • space 5407 is " 6 x 5 + 2 "times.
  • the total is 40 times. In other words, in this case, the cost of classification by equivalence evaluation is incurred, but the number of comparisons is one-third or less of the simple comparison process.
  • the comparative examination logical operation by the comparison examination unit 4217, the weighting calculation unit 4221, and the logical operation unit 4220 will be described.
  • the truth value used in the comparative logic operation means that the score of the comparative evaluation weighting process is used. For example, "Comparison consideration weighting For example, if the processing score is 20 or more and the text data is stored in the node is true, the other is false. If the calculation of a logical operation is a true / false value, the calculation method is equivalent to that of a logical operation using equivalence evaluation.
  • Integrated calculations are often used in weighting processes using equivalence evaluation, but there are many other ways to use them. Integrated calculation can derive new results by integrating the weights associated with space.
  • the weights to be integrated can be performed between various types of weighting processes. For example, a weighting process using equivalence evaluation and a weighting process using comparative study. Further, the integrated weight may be the result of the integration calculation. In short, if the weight information is tied to the node, integrated calculation is possible.
  • the integrated calculation operation unit 4222 uses the equivalence evaluation unit 4215 to determine whether the nodes in the acquired space are equivalent. Based on the above, the weight information of the space is classified. Further, the classified weights are integrated by the integrated calculation calculation unit 4222 to calculate the final weight. The calculated overlay processing result is output to the output destination 4214 by the data output unit 4213.
  • the purpose of the weighted integration calculation is that the advantage of performing the weighted integration calculation can be derived from data that could not be understood by a simple weighting process, so that deeper analysis data can be generated.
  • the score of the weighting process can be regarded as a measure representing importance. By adding scores, it is possible to infer whether a particular node is important for multiple equivalence evaluations and comparative studies. Furthermore, by subtracting with the score of a specific equivalent evaluation, it is possible to give meaning to exclude the equivalent evaluation and comparative study. Furthermore, by combining complex calculations, it is possible to perform integrated calculations with subtle meanings.
  • Integrated calculation is possible even for information stored in the spatial data section 4201. This may be information that is explicitly created as data, or may be information that is stored again in the spatial data section 4201 and read again.
  • the integrated calculation operation unit 4222 When the classified weights are integrated by the integrated calculation operation unit 4222, various integrations are possible by calculating and integrating the weights associated with the nodes as operands of some calculation. In particular, it is effective to calculate weights as operands of four arithmetic operations.
  • the calculation logic of the integrated calculation for calculating the weight by the weight calculation unit 4221 as the operand of the four arithmetic operations will be described as the process in the apparatus of the first embodiment that manages the Web site.
  • Figure 52 shows a summary of the results of equivalent weighting in the spaces 1971, 1972, and 1973 in Fig. 51.
  • Figure 51 consists of a space where computer technology information sites are categorized by category.
  • Space 1971 is a collection of computer technology sites
  • space 1972 is a collection of further development technologies and FAQs
  • space 1973 is an IT technology beginner to intermediate level engineer. It is a site for.
  • the result of superimposing these three is shown in Figure 52.
  • the weight of each space is shown in “score of 1971”, “score of 1972”, “score of 1973”. “Score of 1971” is expressed as operand “x”, “score of 1972” is expressed as operand “y”, and “score of 1971” is expressed as operand “z”.
  • Score of calculation 2 in FIG. 52 is a calculation using the calculation formula of "X + y-z”, and is a calculation formula having the meaning of excluding "z” from "x + '. In other words, it means that sites for beginners and intermediate are excluded.
  • “Calculation 4 score” in Figure 52 is “x + y + z” for nodes with numbers a, b, and c, and the remaining nodes are “X + y + 2 * z ''” This means that websites other than a, b, and c, and those for “beginners and intermediate users” are emphasized.
  • FIG. 65 shows the space used for weighting integration.
  • Fig. 66, Fig. 67, Fig. 68, and Fig. 69 show the space in Fig. 65 by different equivalent evaluations. Among these spaces, those with the same sign are equivalent.
  • the table in Fig. 70 shows the equivalent weighting processing for space 2031 and space 2032 with equivalent evaluation 1
  • Fig. 71 shows the equivalent weighting processing with equivalent evaluation 2.
  • FIG. 72 shows a result table in which the integrated calculation calculation unit 4222 performs an integrated calculation on the results of FIGS. 70 and 71 on the basis of the completely independent equivalent evaluation.
  • completely independent equivalence evaluation is an evaluation that treats all the nodes in the space as different from each other. Since the “equivalent node” item uses a completely independent equivalent evaluation, it treats all spatial nodes as different things.
  • the specific table creation method in Fig. 72 considers 2011 and 2012. In the case of weighting with equivalent evaluation 1, the score is 3 because 2011 is equivalent al, and the score is 2 because 2012 is equivalent bl. . In the case of the weighting of equivalence evaluation 2, the score is 1 because 2011 is equivalent b2, and the score is 2 because 2012 is equivalent a2.
  • the “merge score” in FIG. 72 is obtained by simply adding the “equivalent evaluation 1 score” and the “equivalent evaluation 2 score” in units of nodes by the integrated calculation operation unit 4222.
  • the “equivalence score 1 score” is 3, the “equivalence score 2 score” is 1, the sum of these is 3 + 1, and the answer is 4.
  • the “difference score” in FIG. 72 is obtained by subtracting the “equivalence evaluation 2 score” from the “equivalence evaluation 1 score” by the integrated calculation calculation unit 4222 in units of nodes.
  • the integrated calculation calculation unit 4222 calculates the absolute value of the “difference score”.
  • the result table of FIG. 73 is the result of integrated calculation by the integrated calculation calculation unit 4222 using the equivalent evaluation 3 as a reference for the results of FIGS. 70 and 71.
  • the specific table creation method in Figure 73 is equivalent to a3.
  • the equivalent nodes are 2013 and 2021. Considering the case of equivalent evaluation 1, since the score of 2013 is 3 and the score of 2021 is 2, the score of “score of equivalent evaluation 1” is 5 because “3 + 2”. Considering the case of equivalence evaluation 2, the score of 2013 is 1, and the score of 2021 is 3, so it is “1 + 3”, and the score of “equivalence evaluation 2 score” is 4.
  • the “merge score” item is the sum of the scores of equivalent evaluation 1 and equivalent evaluation 2. Furthermore, “merge score” is divided by “equivalent node” by “score per one”.
  • the weighting used to derive these Fig. 72 or Fig. 73 is simply to obtain a score for existence. It may be a weighting process that uses or a priority added.
  • the "filtering process" of the weighting process by the filtering unit 4223 narrows down the result obtained by the arithmetic processing unit 4216 (logic) under a specific condition and outputs the result as the result of the overlay calculation processing unit 4211.
  • Figure 53 shows an image of the filtering process.
  • Item 2.5 Device capable of processing weights
  • weight processing By using "weight processing" by the processing unit 4224, it is also effective to change the weight on the weighting processing result.
  • This process analyzes the weighted calculation results and makes changes. Changing the weight means adding a value to the weight or using it as an operand of a more complicated arithmetic expression to derive a new result.
  • the node judgment formula that checks whether a node satisfies a specific condition is used to examine the target of addition, or the logical operation is used to add 5 to the weight only for those that become true.
  • various colors can be additionally applied to the weights.
  • weight processing is performed only on nodes that are determined to be “true” as a result of logical operation.
  • Fig. 77 is a space where information about music CDs is represented. Nodes are music CDs and Web site addresses where CD information is described. Nodes with the same alphabet represent the same CD and are in sync. In other words, it is judged to be equivalent when using the synchronization point equivalence evaluation. In FIG. 77, those pointing to the same Web site are judged to be equivalent.
  • Figure 79 lists the weights of each space.
  • the logical operation calculation unit 4220 logical operation is It is This query can be taken as “how many queries exist in space 2051 or in space 2052 and in space 2055. When making such a query,“ As shown in “Calculation results”. Each space is converted to a Boolean value as true if there is more than one. The solution to be obtained is obtained from the result of “(space 2 051 OR space 2052) A205D space 2055”. From the calculation results in Fig. 81, we find that the nodes to be obtained are b and g.
  • weight score 1 The result of adding the weights of the spaces 2051, 2052, and 2054 is shown in "weight score 1" in FIG. This is a superposition of the space representing the CDs recommended by Mr. A, Mr. B, and Mr. D that the performer trusts.
  • the CD with the equivalent number b exists in the spaces 2051, 2052, and 2054, and it can be estimated that the score is the most recommended CD.
  • the equivalence numbers g and h are what the practitioner seeks.
  • weight score 2 The result obtained by subtracting the weight of space 2053 from the power of 2052 and 2054 is “weight score 2” in FIG. In this case, it is slightly different from “weight score 1”. In this case, it is recommended that these two equal weights of equal numbers b and g are recommended.
  • the performer is also interested in popular music. Therefore, a little ingenuity is added to calculation.
  • Sales 1 ⁇ For the 10th place, multiply the space weight by 3 times the "weight score 2" in Figure 80, and for the 11th to 100th place, double the space weight by " Multiply by “weight score 2”. As a result, the sales order information greatly affects the weighting results. Even in this case, the equivalence numbers b and g are important, and i is considered important in the next stage.
  • weight processing by the processing unit 4224 will be specifically described below.
  • the result of “weight score 1” in FIG. 86 which is the addition of the weights of spaces 2051, 2052, and 2054, is processed and analyzed from different viewpoints.
  • the value of “Rock” is 3 times the weight (3 times as an example) and the value is “Pops” "Is doubled (for example, doubled).
  • the weighted integration calculation by the integration calculation operation unit 4222 will be described using a specific example with reference to FIG.
  • the equivalent evaluation used as the standard when using weighted integration calculation shall use the synchronization point equivalent evaluation. This time, we will use the linkage with the weighting process using the equivalence evaluation by the node property.
  • the node in FIG. 78 holds a “music genre” property, and when the equivalent evaluation is used with the value of the “music genre” property, it can be represented in FIG. Fig. 82 shows the equivalent of Fig. 79 divided into groups. From Figure 82, it is highly possible that the genre of recommended and popular music is “pops”.
  • the overlay calculation processor 4211 performs an equivalent overlay process for a space including an independent space node. Weighting is performed for space 1985 and space 1986 in Fig. 56. Nodes with the same annoybet are synchronized with each other. Independent space nodes 1981 and 1982 are synchronized with each other. At this time, the weighting calculation unit 4221 performs weighting processing using equivalence evaluation, in which independent space nodes are synchronized in terms of both node and space, and the results are shown in FIG. 57 and FIG. 58 “addition score” items. Fig. 57 shows the result of expanding the independent space nodes 1981 and 1982 as a space, and Fig. 58 shows the result of searching as a simple node. The part with equivalent number A is the part processed as a node, and the others are the cases processed as a node.
  • FIG. 87 is an explanation in the case where the projection by the projection unit 4411 is specifically used.
  • nodes 2360 and 2361 are projected by the projection unit 4411 to form a multilingual node group.
  • the nodes 2360 and 2361 have four nodes or node information.
  • projection is expressed in two dimensions. It can also be said that the space that can be made into three-dimensional information.
  • Figure 105 is a space that represents a document.
  • space 2481 is about an important document, so it needs to be created in multiple languages.
  • the space design is as shown in Fig. 106.
  • Fig. 106 many spaces for each language version are created.
  • 2481 is for Japanese
  • 2482 is for English
  • 2483 is for French.
  • a new space is created for each different version. This means that the space increases as the version increases.
  • a projected space is created logically as shown in Fig. 107, and different spaces themselves do not increase.
  • each of 2481a, 2481b, and 2481c is a space for one language. Creating different spaces for different versions as shown in Fig. 106 will increase the management cost.
  • a space is a composition that expresses or collects some concept. When changing the concept to be expressed, it is also necessary to change the composition of the space. At this time, if there are simply multiple spaces for each version, changes and additions need to be applied to all spaces. This is a problem that arises because it is implemented as a different space only by the difference in format even though the concept to express is the same, and this becomes a great maintenance cost.
  • the concept to be expressed is distributed as different spaces only by the difference in expression format, it is difficult for third parties to understand the relationship between the concept and space. In this way, projecting to connect concepts to be expressed into one is an important function.
  • FIG. 108 is a diagram for explaining the projection unit 4411 in detail.
  • a functional block diagram of a general program realizing projection is shown. These functions are implemented by one or more programs. Also, the program may be processed by multiple computers.
  • the space corresponding to the projection and the processing are linked.
  • the spatial data section 4201 is controlled by the projection section 4411. Since the spatial data section 4201 or the projection section 4411 can be appropriately accessed through the interface 4413 to the space, it is easy even if the spatial data section 4201 has a special format that is different from the normal space. And can be accessed safely.
  • the projected space data is link projection 4430, node projection 44 31.
  • Data addition projection 4432 or independent space projection 4433 exists. You can access these data directly, but if you perform operations through the interface 4413 to the space, you can reduce the risk of data destruction without having to consider complex internal configurations and specifications.
  • Projection unit 4411 has the following functions: “Single access of projection node”, “Linkage of node generation”, “Linkage of node deletion”, “Cooperation of deformation of space”, “Access of projection space unit”, “Node By performing “access to each projection space”, “creating a space for each projection”, “deleting a space for each projection”, “synchronizing projection”, etc., it fulfills the function of projection.
  • the user 4412 can provide an appropriate function as projection by manipulating the space through the interface 4413 to the space.
  • User 4412 is usually an external, internal program, or human. Humans access the projective space via a user interface.
  • the projected space is particularly called “projection space”, and the projected node is called “projection node”.
  • the projection function is a process that handles multiple spaces as a single space. For example, “single access of projection node”, “linkage of node generation”, “linkage of node deletion”, “space transformation” This refers to “association”, “project space unit access”, “node access for each projection space”, “generation of space for each projection”, “deletion of space for each projection”, and “projection synchronization”. Projection logically has some or all of these functions.
  • the projection function by the projection unit 4411 will be described with reference to the drawings.
  • the space of Fig. 88 as an object force s view 89 for 3 Tsunii Bruno Kagei ⁇ . 2320, 2321, and 2322 are projective projection spaces, and 2301, 2302, and 2303 are the projected nodes.
  • Single access of projection node by the projection unit 4411 accesses a plurality of projected nodes as one in space. In other words, this means that the projected space as shown in Fig. 89 can be handled to access Fig. 88.
  • Linkage of node generation by the projecting unit 4411 is to add a new node to another projection space. For example, when a node is added to the projection space 2320, the node is also created in the corresponding projection spaces 2321 and 2322.
  • Figure 90C is a projection This shows the cooperation of node generation by part 4411. In this case, projective nodes 2311, 2312, and 2313 are generated and created.
  • the "node deletion cooperation" by the projecting unit 4411 is to delete the corresponding node in another projection space when the node is deleted.
  • the projection nodes 2303 and 2305 are also deleted.
  • FIG. 103D shows the projection nodes 2301, 230 3, and 2305 destroyed from FIG. In this case, three projective nodes are destroyed at the same time.
  • Projection node single access, node generation linkage, node deletion linkage, and spatial transformation linkage treat multiple nodes as one in space. That is, the projection nodes 2301, 2302, and 2303 can be handled as one node in space. This force is to treat multiple spaces as one concept.
  • the "projection space unit access" by the projection unit 4411 can be handled as one independent space that divides each projection space into a group of spaces.
  • the projection spaces 2320, 2321, and 2322 can be treated as independent spaces.
  • the “access for each projection space of a node” by the projection unit 4411 is to access a node by designating a projection space. For example, in the case of FIG. 89, a projection node 2301 is designated if the projection space 2320, and a node 2305 is designated if the projection space 2322.
  • Projection space unit access and node-by-project space access are functions that allow the projection space to be treated as an independent space.
  • This function is a function in which, when a space is projected, the projection is applied to the synchronization of the nodes included in the space. For example, the node 2371a and the node 2372a are synchronized in the space of FIG. At this time, when the projection is applied to 2371a, the projection is applied to the space 2372a. In Fig. 95, the 2371b and 2372b forces are projected and leveled.
  • the projected space can treat multiple spaces as one, and treat each as a different object.
  • projection nodes 2301, 2302, and 2303 are actually three nodes, but they are treated as one in space.
  • Link projection is a method of actually creating multiple link structures in the link space and controlling them with a program. This can be said to actually create multiple spaces so that they can be treated as projective spaces by the program functions.
  • Figure 97 shows a link projection of Figure 96. As can be seen in Figure 97, there are two spaces for each link configuration. In this case, a space composed of 2331a and 2332a and a space composed of 2331b and 2332b are generated as projection elements.
  • Node projection is a process of creating a uniform structure in units of nodes constituting a space, and is a method of creating a plurality of each node and controlling them with a program.
  • Figure 98 shows a node projection of Figure 96. This is a structure in which a plurality of nodes or node information is added to each node. In this case, the node 2332 is converted to the node 2332c and transferred to the node 2 331c of the node 2331. That is, each node force S holds node information that is projected.
  • Node projection makes it easier to implement projection in a space that is not configured by links, such as intangible space, and synchronous projection.
  • FIG. 101 shows a case where a node projection is created with a linked list.
  • Node 2380 has a projected node or node information 2381, 2382, 2383 and forms a list.
  • This link can be either a list structure in memory or an instance of an object, or a tag language such as XML or HTML. This link may be a technique used to link nodes.
  • FIG. 102 illustrates an implementation for linking a node to a data group in node projection.
  • the data group of the node 2391 is linked to the node 2390. If this is implemented in memory, it is better to store the projected node or node information in the data container. When saving to a disk storage device, etc., it is better to save them together on the disk in a file format or binary compressed form. In short, it is only necessary to be accessible as a projected node even if it is scattered internally.
  • Data addition projection is a method of linking projection data to a space.
  • FIG. 99 is a force S representing the data added projection of FIG. This includes those that use layers to achieve projection.
  • projection is realized using the additional information 2 333 for the projected space. 2333 contains information about the space. Using this information, it is handled as if there are multiple spaces.
  • Data addition projection will be described with reference to FIG. Figure 103 projects the space composed of nodes 2401, 2402, and 2403.
  • Node 2401 has 2404 power.
  • Node 2402 has 24 05 power, and node 2403 has 2406 power. If 2404, 2405, and 2406 hold information for projection, it will be good.
  • 2404, 2405, 2406 as a whole can be designed with reference to a common resource 2407. In this way, projection is performed by adding data to the space.
  • Independent space projection is a method of realizing a projection by creating a kind of independent space node and holding a plurality of spatial information inside or outside.
  • Figure 100 shows an independent space projection of Figure 96. As long as the projection data in the independent space node 2334 can be handled by the projection function, it is possible to hold multiple spaces in any form, or it may be expressed as a completely different format.
  • a space definition 2418 is connected to the independent space node 2411 outside or inside. 2418 stores three projective spaces: 2412 and 2413, 2414 and 2415, 2416 and 2417.
  • Layers can be applied to nodes, links, and spaces.
  • a layer is a structure in which information is defined in parallel to a node or space, and additional information is given in parallel to a node that does not add information to the node itself.
  • To be defined in parallel means to be defined in a form corresponding to a node or space.
  • Various information can be added to the space by using layers. Also, unlike properties, it does not operate the node itself, making it easier to add information and reducing the risk of data corruption. Furthermore, it can be used in various situations by stacking multiple layers or combining them depending on the situation. Layers can separate things that are different from the concepts that nodes and spaces want to express. Furthermore, it is different from the concept you want to express All information should be included in the layer. Layers can be applied to a single node or to the space, are flexible, and are very useful when adding information to space. Implementation is particularly effective for security, events, and priorities.
  • a layer is usually a data format existing in a node or space of the spatial data section 4201.
  • a layer can give information to each node in the space to which the layer is added, or can give information about the entire space.
  • the structure layer adds a layer to the space structure itself and applies the layer to the node structure.
  • the entity layer attaches a layer to the entity itself, that is, to the node itself. In other words, the node effect is applied to all nodes that have the same synchronization point in the node to which the entity layer is added.
  • the structural layer and the entity layer will be described with reference to FIG. Nodes 3141 and 3142 are synchronized with each other. At this time, even if a structural layer is applied to a node in the space 3140, a layer is added to the node 3141. A layer is not added to the node 3142. However, when an entity layer is added to a node in the space 3140, the entity layer is applied not only to the node 3141 but also to the node 3142.
  • the structural layer will be described with reference to FIG. One space and, Rereru are two structural layers force s definition in Figure 109.
  • 3100, 3101, 3102, 3103, and 3104 are connected by forming a link space with nodes.
  • the structure layer is composed of 3110, 3111, 3112, 3113, and 3114, 3115, 311 6, 3117.
  • two structural layers are connected to the space.
  • the structural layer it is possible to define a layer for the link, but in this case, the structural layer is added only to the nodes in the space.
  • Structural layer 1 is formed up to 3110, 3111, 3112, 3113f, and structural layer 2 is formed up to 3114, 3115, 3116, 3117f, respectively.
  • the straight dashed line shown in Figure 109 shows the correspondence between the nodes and the structural layer, and the circular dashed line means the structural layer.
  • Additional information is provided, and various processes are performed inside or outside the program based on the additional information.
  • a layer exists in parallel with a node Even when a layer is added to a force link space, it does not have to be composed of links like a node.
  • the entity layer will be described with reference to FIG. Node 3150 and node 3152 are synchronized with each other. Nodes 3150, 3151, and 3152 are loaded with physical layer strength S and are released. At this time, the node is connected to 3153 of layer 1, 3150 and node 3152 force S, and 3154 force is connected to node 3151. Similarly, node 3150 and 3152 force node 3151 are connected to 3155 of layer 2 and 3156 are connected. In this way, the entity layer is tied to the node entity, not the spatial structure.
  • a layer is a force that can exist outside or inside a node S, and a layer logically provides information to the node from the outside, so a lot of information is held outside even in implementation. Is desirable.
  • the layer can be implemented on a computer-readable recording medium or on a network. In other words, it can be implemented in any environment where a node can be realized. It can be an entity in memory or it can be formed from XML on disk.
  • the layer gives information from outside the space in theory, it is not good to store all the information inside the node. In other words, it is ideal to store some or all of them outside.
  • FIG. 111 shows a method described in the node itself.
  • Reference numeral 3150 denotes a node or reference information to the node. 3150 stores information on layers. Also, layer 1 3151 stores information for nodes.
  • FIG. 112 shows a case in which the relationship between nodes and layers is described outside. 3155 is a node
  • 3156 means layer
  • 3157 means 3
  • information is usually added as an asynchronous information addition to the node, and the entity layer is usually treated as a synchronous information addition to the node.
  • FIG. 22 The implementation when a layer is added to Fig. 26 and Fig. 27, which is XML representing the link of the node.
  • FIG. 114 An example of implementing a structural layer is shown. Assume that a structural layer is added to nodes 851 and 852 and the link between them. In this case, as shown in Fig. 114 and Fig. 115, a simple structure layer for testing is added to the link definition. in this case,
  • the self-expanding function of a layer refers to a function that applies a layer to a space where a layer is applied, or a node or an added part when a space is added.
  • this function it is also effective to implement space self-expansion in a more flexible manner by using the function of spatial link selection and spatial filtering. This function is mainly applied in the structural layer.
  • the self-expanding function of the layer will be described with reference to the drawings.
  • the nodes 3120, 3121, and 3122f in Fig. 117 form an empty space. Form layers 3130, 3131, 3132f. As shown in FIG. 118, the node 3123 is added to 3122. Then, layer 3133 in FIG. 119 is expanded. [0219] Item 4.5.
  • Security management can be made easier by introducing a security layer in order to realize security that prevents unauthorized access to programs and execution of unauthorized programs. This can be achieved by mapping the security layer to the space.
  • the security layer contains one or more user information and security authority information. This makes it clearer and easier to manage security for each user and the correspondence between authority and space for multiple users.
  • the security layer is a layer with security information added to it.
  • the security layer will be described with reference to FIG. 3215 is a security layer for the user 3201, and 3216 is a security layer for the user 3202. Each security layer masks part of the space.
  • Command 32020 of user 3201 is force S excluded by security layer 3215, command 3222 is applied to 3211 without being affected by the security layer.
  • instruction 3221 applies to node 3210 and instruction 3223 is excluded.
  • Figure 121 shows an example of the implementation of security by the security layer using the step diagram.
  • step S401 an operation on the space is detected.
  • step S402 it is confirmed whether a security layer exists in the operation target space. Analyze the security set in step S403 and decide whether to allow the operation.
  • S404 is executed when the operation is permitted, S405 is not permitted, the operation is invalidated, and the notification process is executed at the same time.
  • An event layer By introducing an event layer with event information as a layer to realize an event, the event can be handled more flexibly.
  • An event basically consists of “reaction” and “notification”. In other words, it is only necessary to record information such as who reacts to what in the event layer and realize the event function from the program.
  • An event layer is a change in space, instructions to space, or time. Event information is added to notify internal or external users of the transition
  • FIG. 122 shows an example of event realization by the event layer using the step diagram.
  • Step 501 means that an event such as an operation or a change in the space occurs.
  • step 502 it is confirmed whether there is an event layer corresponding to the space to be operated or the changed space.
  • step S503 it is confirmed whether there is event information corresponding to the operation or change.
  • step S504 notification processing is performed based on the event information. Information about the event is collected in steps S502 and S503, and actual notification is made in S504.
  • the space in Fig. 123 represents a bug report of a company's software.
  • a security layer is set in this space.
  • the structure layer 3251 is used to add security information that prohibits changes by outsiders throughout the space. Furthermore, it is unnecessary and disgraceful to disclose information about the author to outsiders in the part that classifies bugs by creator.
  • security information should be set in 3252 as a structural layer that makes parts by creator invisible to outsiders.
  • untreated bugs can be dangerous if misused, and should never be disclosed to outsiders. Therefore, security information may be set as a substance layer for the nodes in the 3253 space. In this way, security is applied even when synchronization exists in other spaces. As described above, if layers are used, security settings can be made without direct changes to the space. The information managed in this way is clearly separated and can be easily added and deleted.
  • Fig. 124 shows a functional block diagram of a general program that implements the security layer. . These functions are implemented by one or a plurality of programs. The program may be processed by multiple computers.
  • a user 4802 accesses the spatial data section 4201 through the security gateway 480 3.
  • the security gateway 4803 accesses the security layer information 4804 and permits an operation corresponding to the security level.
  • the automatic classification processing unit 4809 is a processing unit that expands the space by adding nodes that form the space, and acquires the node or information associated with the node.
  • the automatic classification processing start unit 4810 and the automatic classification unit 4811 are configured.
  • the automatic classification unit 4811 has been determined to be appropriate for addition by the determining unit 4813 for determining whether it is appropriate or not when adding a new node to the node that has visited the link in the cyclic unit 4812 that visits the link of the node.
  • the adder 4814 includes a node addition unit 4814.
  • the determination unit 4813 further includes an existence availability condition determination unit 4820 and a cyclic availability determination unit 4821. ⁇ Consists of 4830, synchronous follow-up B4831 and link follow-up B4832 force. For these functions, an outline of the process will be described using Fig. 137 of a functional block diagram of a general program that implements automatic classification processing. These functions are implemented by one or more programs. Also, the program can be processed by multiple computers.
  • This function determines whether or not a newly added node is acceptable by using a presence / absence conditional expression linked to the inside of the node or to the outside while traversing the space. It can be said that the general implementation of the existence condition expression is to be able to describe in the script language and the programming language by using the information of the newly added node.
  • One presence / absence conditional expression may correspond to a plurality of nodes.
  • the automatic classification processing unit 4809 As described above, as a large flow of processing by the automatic classification processing unit 4809, data determination from the automatic classification processing start unit 4810 is received, the automatic classification unit 4811 is executed, and the node of the node to the spatial data unit 4201 is executed. Addition is performed.
  • the automatic classification processing start unit 4810 acquires or generates data for starting the automatic classification processing. This part may be an external or internal program, a change detected outside the program, or a human input.
  • the automatic classification unit 4811 includes a traveling unit 4812, a determination unit 4813, and an addition unit 4814.
  • the traveling unit 4 812 circulates the node of the spatial data unit 4201 and the determination unit 4813 determines that the node can be added
  • the adding unit 4814 adds the node to the spatial data unit 4201.
  • the traveling unit 4812 acquires the information of the spatial data unit 4201 and performs a process of traveling the space or having the same effect as the traveling. While patrolling by the traveling unit 4812, the determination unit 4813 is used to determine whether to add a node or whether to further visit the node.
  • the judgment unit 4813 judges the existence permission condition expression associated with the node and decides whether to add, and the presence / absence condition judgment part 4820 decides whether or not to visit by judging the circulation permission condition expression It consists of a patrol availability condition determination unit 4821.
  • the existence permission conditional expression and the patrol availability conditional expression used in the determination unit 4813 are normally associated with a node using a layer or a similar mechanism like 4815.
  • Existence availability conditional expression 'cyclic availability conditional expression 4815 may use an external program 4842 that is normally defined in script' program language 4841. Actually, when the conditional expression is complicated, it seems to be common to call the function of the internal or external program from the scribble 'program language 4841.
  • the adding unit 4814 performs processing for adding a new node to the spatial data unit 4201. .
  • Individual type automatic addition is realized by using the individual addition unit 4814
  • synchronous type automatic addition is realized by using the synchronization addition unit 4831
  • link type automatic addition is realized by using the link addition unit 4832.
  • "Additional synchronization" implemented in the synchronization adder 4831 means that if the node added after the second is the same as the node added previously, the previously added node is synchronized Say that it will be added in the state. In other words, when nodes that have the property that they can be regarded as the same but differ in space and change in one is also applied to the other are called synchronized states, the node added after the first is the first. It is to be added in a synchronized state with the node added to the node. If this process is not used, it is the same information but not synchronized, so if there is a change in information, it will not be applied to the other, so this process is important because it will be difficult to manage. .
  • the added node is the first one added. It is added in the linked state of the node added to.
  • the space created by using this process can clarify the relationship of information nodes by links.
  • the automatic classification process itself can be extended by adding existence existence conditional expressions when adding nodes in the automatic classification process.
  • Figure 12 shows the case of adding an existence availability condition expression at the same time as adding a node by automatic classification processing.
  • FIG. 131 A description will be given of a case where a node to be selected in automatic classification processing is controlled by a cyclic availability condition expression with reference to the flowchart of FIG. 131.
  • the flow in FIG. 131 is obtained by adding step S5 for determining whether or not a new patrol is possible between step S601 and step S602 in the flow diagram in FIG.
  • conditional expressions can be shared between synchronized nodes.
  • the presence / absence conditional expression and the cyclic availability conditional expression need not correspond to one node. In other words, these expressions may be shared by multiple nodes.
  • the existence availability conditional expression and the cyclic availability conditional expression are mechanisms for generating the concept that the space wants to express, but are not directly related to the space to be expressed. Therefore, it is natural that these are implemented as layers.
  • the conditions to be set in the presence / absence conditional expression and the cyclic availability conditional expression become more complicated, it becomes difficult to express them in a script or a simple programming language.
  • the sentence property of a node is judged by performing complex parsing. Therefore, it is possible to execute processing by an external program to the determination unit 4813, and it is possible to improve the processing speed, development efficiency, and ease of maintenance of the existence availability conditional expression and the cyclic availability conditional expression.
  • FIG. 154 shows an information space device 6000 in the embodiment of the book search system.
  • Spatial book retrieval system 6000 is an implementation of the present invention as a book retrieval system. By combining book information with semantic space, it is possible to use overlay search.
  • the client machine 10 is a PC (personal computer) or a portable information terminal.
  • the HTTP client unit 6011 can obtain and transmit information by accessing the HTTP server 6032 via the information communication network 15 using the HTTP protocol.
  • Information to be acquired includes information on books, book contents, and information on the space in which books are classified.
  • search information is transmitted to the spatial book search system 6000 using the HTTP protocol.
  • the firewall unit 6031 is a part for maintaining security against communication from the outside. Protects against unauthorized access from the information communication network 15 and viruses. When an unauthorized access is detected, the information acquired by the communication is discarded or stored as a log without being transferred to the HTTP server unit 6032.
  • the HTTP server unit 6032 transmits and receives information using the HTTP protocol. It is a function to do.
  • a web server such as Apache (R) is used.
  • the information registration function unit 6034 registers and updates information in the spatial data unit 4210a.
  • the information registration machine 6035 is a terminal for updating information, and uses the information registration function unit 6034 to register and update information.
  • Spatial data section 4210 stores information used by the system.
  • the entity stores information as a relational database or file storage system.
  • the space structure database 6036 holds node and space structure information.
  • the book information database 6037 holds information about books. Information held includes information about books (information about authors, publishers, etc.) and contents of books (text information on the contents of books).
  • the system function part 6021 is a part that holds the system logic of the book search system.
  • the external interface unit 6041 converts the communication from the HTTP server unit 6032 into information for the internal system, and retains the function of converting the data into HTML or the like for transmitting the information for the internal system. If the HTTP client part T11 is a Web browser and the HTTP server part 6032 force SApache (TM), this part is implemented using Java (registered trademark) servlets or JSP Java Server Pages). It is common.
  • the text comparison engine 6045 compares the text information, verifies whether they are equivalent, and calculates the similarity as a numerical value.
  • the entity functions as an external program and is called from the comparison unit 4218 as necessary.
  • the HTTP client unit 6011 transmits an information acquisition message to the spatial book search system 6000 through the information communication network 15.
  • messages are sequentially transferred to the firewall section 6031, the HTTP server section 6032, the external interface section 6041, and the system logic 6042.
  • the system logic unit 6042 determines the content of the message and acquires the information to be acquired from the spatial data unit 4201.
  • the system logic unit 6042 notifies the acquired information via the external interface unit 6041, the HTTP server unit 6032, the firewall unit 6031, the information communication network 15, and the HTTP client unit 6011.
  • an overlay processing message is transmitted from the HTTP client unit 6011 to the spatial book search system 6000 through the information communication network 15.
  • messages are sequentially transferred to the firewall section 6031, the HTTP server section 6032, the external interface section 6041, and the system logic 6042.
  • the overlay processing control unit T42 of the system logic unit 6042 analyzes the contents of the message and uses the data acquisition unit 4210a to obtain information necessary for the overlay process from the book information acquisition unit 6043 and the spatial data unit 4210a. get.
  • the information necessary for the overlay processing is passed to the overlay calculation processing unit 4211 and calculated, and the system logic unit 6042 receives the result of the overlay calculation processing.
  • the external interface unit 6041, the HTTP server unit 6 032, and the firewall unit 6031 The result is notified through the information communication network 15 and the HTTP client unit 6011.
  • the diagram used in the second embodiment shows a space in which book information is stored. Spatial information has been greatly simplified for the purposes of this discussion, but it is actually much larger.
  • the letters a to n assigned are the nodes that hold the book information, and the nodes assigned the same letters are the same books.
  • FIG. 156 shows the result of performing the overlapping process using the equivalent evaluation on the spaces 6102 and 6103 in FIG. From this result, it can be said that the books a and f to be obtained are closest to those to be obtained.
  • a book search is performed by a logical operation using equivalence evaluation.
  • FIG. 157 shows the result of processing this calculation.
  • 1 means true and 0 means false.
  • the powers of space 6102, 6103, and 6104 represented by truth values are assumed to be “true / false of space 6102”, “true / false of space 6103”, and “true / false of space 6104”. Furthermore, the result of AND operation in these three spaces is shown in “Results of logical operation”. In this case, since all of them are false, it is calculated by calculation that there is nothing that satisfies all the conditions of the spaces 6102, 6103, and 6104.
  • Information analysis of the book is performed by weighting processing using comparative study.
  • the newly published book is verified using the apparatus of Embodiment 2 to determine which books are acceptable in the 20s.
  • Space 6101 is a collection of books popular with people in their 20s.
  • Space 6105 is a space that summarizes information about newly published books. It is assumed that the weighting process using the comparative study is performed in the outer comparison type for these two spaces. In addition, the results of the comparative study shall follow the comparison table in Fig. 158. Compared to the weighting process using comparative studies, the comparative type is more likely to have more important elements in multiple spaces. In this case, the result of FIG. 159 is obtained, and it can be determined that the book n is the most easily accepted book in the 20s among the newly published books.
  • the process can be changed by the user using the spatial book search system 6000.
  • This function implements services for members and non-members, but the processing can be clearly separated and maintenance becomes easy.
  • Embodiment 2 the flow of the automatic classification process will be described.
  • the newly registered book information is input from the information registration machine 6035, and the book information is transferred to the information registration function unit 6034. Further, the information registration function unit 6034 transfers the information to the automatic classification processing unit 4809.
  • FIG. 160 shows information space device 4000 according to Embodiment 3 using general-purpose information management software 7000.
  • the general-purpose information management software 7000 is implemented as an application with three layers of functions that are divided into three major parts: the user interface layer, the oral layer, and the data layer.
  • General-purpose information management software can be used as file management software because it can associate file information retention with nodes.
  • the user interface layer 7011 is for drawing on the display screen and the user interface. This is an area where functions for receiving force input are placed.
  • the logic layer 7012 is a part in which functions such as overlay processing are implemented, and is a function responsible for most of the processing of the general-purpose information management software 7000 and the logic of calculation.
  • the data layer 7013 records and acquires information from the spatial data section 4201.
  • the user interface unit 7041 is a functional unit that controls input processing to the screen from the user of the general-purpose information management software 7000 and data output to the screen.
  • Spatial data section 4201 in the third embodiment uses a file system.
  • the data format recorded in the file system uses XML.
  • the intermediate data access unit 7031 is information used when the function of the user interface layer 7011 acquires information about the space.
  • the data access unit 7021 is a function for hiding actual space data and implementation.
  • the spatial data section 4201 uses the file system. This can be done via a network, and changing the data format to something other than XML is a function of the general-purpose information management software 7000. Can change without effect.
  • the data caching unit 7022 can speed up the information acquisition process by storing the information acquired from the spatial data unit 4201 implemented in the file system in a faster temporary memory area. Can do.
  • An operation for input / output device 7050 generates an overlay process instruction.
  • the user interface unit 7041 notifies the processing start unit 4212 according to an instruction from the input / output device 7050.
  • the process start unit 4212 starts the overlay process, and the spatial data unit 4201 acquires the information on the space used in the overlay process via the data access unit 7021 from the data acquisition unit 4210.
  • the acquired space information is overlapped and calculated by the calculating unit 4211 to calculate the relationship between the spaces.
  • the weighting calculation unit 4221 uses the equivalence evaluation unit 4215 to determine the weight information for each space based on the result of the equivalence evaluation that determines whether the acquired nodes in the space are equivalent. Is calculated. Furthermore, when the weight information for each space is an operation by a plurality of spaces, The integrated calculation operation unit 4222 integrates the weights and calculates the final weighting processing result. The calculated weighting processing result is notified to the user interface unit 7041, and is output to the screen 7051 of the input / output device 7050 by the data output unit 4213.
  • the space is represented by the tree view when output to the screen 7051.
  • the general-purpose information management software 7000 is implemented using a hierarchical space linked in a hierarchical manner.
  • the space consists of nodes that store diary information text files from January 1985 to June 2006, and are categorized by various categories such as date and memory.
  • Diary information text files are managed by date, diary information text files of the same date in the space are synchronized, and one change is applied to the other. Diaries store various lessons and memories of life, and it can be said that it is very meaningful to obtain various information from them.
  • the weighting process used in the general-purpose information management software 7000 can use a synchronization process that is equivalent to the weighting processes using the equivalence evaluation.
  • a node 7101 means a structure node that can form structure information
  • a node 7102 means that an arbitrary file can be stored (this time diary information text file).
  • the structure node is information for forming a space (information forming a hierarchical category) that is not the information to be stored, and is therefore excluded from the result of the overlay process.
  • Fig. 163 shows a screen when weighting processing using equivalence evaluation is performed.
  • the space to be searched from the “space tree view” is dropped into the “space search view” by drag and drop.
  • the “search” button is pushed in the “spatial search view”, and the result is processed and shown in the “spatial search result view”.
  • Space Search View is “Diary Information— It is a space that can be called “1990-1994 by date” and a space that can be called “diary information trip by trip”. This means that if you search for “diary of the day you went on a trip abroad between 1990 and 1994”, you would say that.
  • the weighting process is performed, but the space to be processed is a hierarchical selection of the space indicated by the “Spatial Search View”. .
  • the space to be processed is a hierarchical selection of the space indicated by the “Spatial Search View”.
  • child elements of “1990-1994” are “1990”, “1991”, “1992”, “1993”, “1994” Will be selected. Also, the child element “1990” and its child elements are selected.
  • the information space processing device 4000 is realized by a single computer or a plurality of computers.
  • Figure 2 shows a schematic diagram of a typical computer.
  • the present invention can be implemented in any computer and system such as a personal computer, a server computer, a mainframe computer, a network system, a portable information terminal, and an embedded microcomputer. Since the principle of the present invention is relatively simple, it can be implemented on a computer that can be called a stored program method, or on any computer that uses it.
  • the information and communication network 15 includes any Internet, intranet, and wireless communication
  • the user includes not only a person who uses the program but also a program which uses the program.
  • a node is a unit for linking and managing information, or information itself.
  • the node is implemented on a computer-readable recording medium or an information communication network such as the Internet.
  • an information communication network such as the Internet.
  • the present invention which can be a signal flowing through a network, any form can be used as long as it can be identified as a node.
  • information associated with a node and any information can be used for a node.
  • This information includes text such as name and description, numeric data such as ID, data format specific to the application, binary data, specific memory area, XML-created document or schema, file list, file stream (It is a file entity or a reference to the entity, and usually exists on a magnetic disk such as a hard disk or a memory.) It does n’t matter.
  • Information associated with a node by a program or apparatus for executing the present invention Any form may be used as long as it can be determined as a report or a node.
  • FIG. 22 An implementation example when the space shown in the node diagram of Fig. 22 is created in XML format is shown.
  • Each node is a simple node that has only the “name” property but the “type” property (attribute information) .
  • the definition of each node itself is node A in FIG. 23, node B in FIG.
  • the node C is represented in XML in Fig. 25.
  • the link definition when these nodes are network type link spaces is the definition of Fig. 26.
  • Figure 27 This is a representation of parent-child link relationships as XML parent and child elements.
  • An independent space node refers to a node that can be treated as a space or a node in a program that implements the present invention.
  • the information associated with the power node, which is a node is a space that is a set of nodes.
  • the space itself can be treated as a node.
  • 500 and 501 are independent space nodes and are synchronized with each other. 500 and 501 have spatial information inside the force that is linked like a node.
  • a change to node 502 is a change to 503. This is because 500 and 501 are synchronized, so the internal space is also synchronized.
  • a link is a mechanism for connecting nodes. If it is in a form that can be recognized by the program or device as “nodes are connected to each other”, the information on the memory, the information on the hard disk, etc. may be present in some form. Links exist to show relationships such as structuring nodes. Speaking of typical links, HTML hyperlinks are typical. By being structured by links, the space can be treated as a human being.
  • FIG. 9 is a diagram in the case where node link information is stored in the node itself.
  • the node 300 holds the link information to the node 301.
  • 300 and 301 may be a node reference depending on the implementation.
  • FIG. 10 is a diagram showing a case where link information is described outside. Node 310 and node
  • 11 may be a node reference depending on the implementation.
  • a space is a group of one or more nodes, regardless of structure, shape, or state.
  • the link space refers to a space formed by linking nodes.
  • the link space can be structured and systematized, so it has excellent visibility and understanding.
  • Typical implementations in the link space include Web page links.
  • the Web is a space where nodes called Web pages are connected by many links.
  • Figure 6 shows the link space node diagram. There is power S. 210 is a node and 211 is a link. The space formed by the links between nodes is thus a link space.
  • a node having a parent-child relationship is particularly referred to as a "hierarchical space”. Spaces created by parent-child relationships can be systematized easily, and therefore have better learning comprehension than randomly linked spaces.
  • the superiority of hierarchical space is that it is rich in “space predictability”. This means that only a part of the space is recognized and it is easy to predict the space connected to it. This spatial predictability has a great effect on spatial overlay processing.
  • Node 812 is a child node of node 811
  • node 811 is a child node of node 810.
  • a hierarchy consists of a parent-child relationship.
  • the intangible space is a set of nodes that are not structured like a link space. As shown in Fig. 9, unlike the link space, nodes are stored in an unlinked state. 220 is an intangible space and 221 is a node. An intangible space is formed by a simple set of data nodes.
  • Figure 151 is just a list of information.
  • the alphabet and the alphabetical order are simply displayed. However, for this information, “number the alphabets in alphabetical order, and the number that is added is the size, k, d, s, c, f, p, x, a, e, g, m, s, Applying the formula “generate a binary search tree space by inserting elements in the order of v and z” will result in the space shown in Figure 152. However, in this case, it can be said that the nodes and spaces do not exist as actual states until they are calculated. In this way, using the calculation formula, even if it does not actually exist, it can be used for computer-readable recording media or superimposition processing equivalent to the space that actually exists on the information communication network. be able to.
  • FIG. 800 nodes have links to information about the diary. If you try to read the diary of 6 October 2001. Will you search for 801 date-specific nodes or 802 memory-specific nodes? You will try to find a node by date. This is spatial predictability. This means that the composition of the previous space can be predicted by recognizing a part of the space.
  • Link selection is a method of selecting a space from a certain node according to a specific rule in a link space. It is convenient to use the selected space for specifying space for processing and operations, such as space overlay processing, logic rules, and layers.
  • FIG. 29 When the number of links is set to 2 for the node 1500 in FIG. 29 and the number of links is selected, FIG. 30 is obtained. The portion indicated by the broken line in FIG. 30 is the selected space.
  • Hierarchy selection is an effective selection method in a hierarchy space. This method can be used on the assumption that it consists of a link relationship and a lever relationship. When the parent node of the hierarchical space is selected, it is a mechanism that selects up to its child nodes.
  • Hierarchy selection by the hierarchy selection unit 4252 will be described below with reference to FIG.
  • the nodes up to 1520, 1521, 1522, and 1523f in Fig. 43 are empty up to 1510, 1511, 1512, and 1513f.
  • 1510 spaces are selected.
  • 1511 spaces are selected and 1522 nodes are selected.
  • 1512 is selected, and 1512 spaces are selected for 152 nodes.
  • Synchronization will be described.
  • “synchronization” can be regarded as the same, but is different in space.
  • node A1 and node A2 are synchronized with each other. Except for the link, we say that changes to A1 are also applied to A2 are synchronized. If synchronization can be handled as the same thing, it is good.
  • nodes that have the property that they can be considered the same but are different in space and change in one is also applied to the other are called nodes that synchronize with each other.
  • a reference exists as a pointer to an entity (such as an address in memory) if it is in memory, and in an object-oriented environment, it exists as a reference to an object or object. It is common. In other words, it is a method of managing through the path (route or position) to the actual state of the node that actually exists. Things such as externally defined link information can also be called references.
  • Multiplexing operations expresses synchronization by simultaneously applying one command to multiple synchronized nodes.
  • Figure 12 shows the implementation of the instance reference management type.
  • 421 and 422 are references to the entity 420. Therefore, the effects of operations 423 and 424 are both operations on the entity, and synchronization is maintained.
  • Fig. 13 shows an implementation by multiplexing operations.
  • 410 and 411 are different entities, but one operation 412 is duplicated and applied to multiple entities to achieve synchronization.
  • the method of linking information to a node or space depends on the space implementation.
  • synchronous information addition which is the addition of information to nodes including synchronization
  • asynchronous information-added calorie which is the addition of information that does not include synchronization. It is. same Periodic information addition is information that is shared between synchronized ones, but asynchronous with information is that information is not shared between synchronized ones.
  • Figure 14 shows how information is linked in an implementation that implements synchronization by reference management.
  • 440 means the node entity, and 441 and 442 mean the entity reference.
  • Addition 'If Happiness 443, 444, 445 is the internal information of 440, 441, 442 or the external information linked together. Synchronization is achieved by the operation by reference becoming an operation on the entity. Operations on references apply to 440, except for links.
  • it is common to implement the connection to the entity 440 like the additional information 445. It can also be realized by multiplexing the operations for the additional information 443 and 444. That is, this is a method in which the operation for the additional information 443 is also applied to the additional information 444.
  • adding information to the reference provides flexibility in adding information. For example, if this reference is information that defines a space, you can freely add information to a specific space.
  • Figure 15 shows the information linking method in an implementation that realizes synchronization by multiplexing operations.
  • Appendices 433, 434, 435, 436, 437 are information linked to the inside or outside of 431, 432. In this case, if you want to add asynchronous information, you can add information to additional information 433 and 434.
  • When applying synchronous information-added force it can be used by sharing common additional information 437 from 431 and 432.
  • Synchronous information addition can also be realized using additional information 433 and 434. In this case, it can also be realized by a method of multiplexing the operations for the additional information 433 and 434 as the operations for the nodes are multiplexed.
  • Equivalence evaluation used in the equivalence evaluation unit 4215 will be described. Equivalent is the same This means that it is determined whether or not equivalence evaluation is the same. What is equivalent depends on the situation. It is common to evaluate using information related to the node. There are various methods such as comparing information related to nodes to determine whether they are equivalent, and calculating whether they are equivalent by calculating in a programming language or script language.
  • the synchronization point equivalence evaluation in which the objects are synchronized with each other is important. This is because things that are synchronized are essentially the same. It is natural to calculate what is in sync as equivalent, and it is likely that it will be used in many cases. Also, by using the information associated with the node, it is possible to determine whether the information associated with the node is the same.
  • FIG. 33 is a result table showing an example of applying the equivalence evaluation using the synchronization point information and the link information.
  • the condition is “equivalent nodes synchronized with each other”.
  • the same alphabet is in sync with each other. Therefore, it is “Yes” if it is equivalent. In this way, it is possible to perform structural information on nodes and spaces.
  • Completely independent equivalence evaluation is an evaluation that treats all nodes in the space as different from each other.
  • a method of comparing the results of the data associated with the nodes as they are or by calculating them is common.
  • the "comparison study” used in the comparison study unit 4217 will be described.
  • the comparison process compares nodes and shows how much they are similar in terms of relevance. The most common is to return numerical data in a finite range. For example, it returns 10 if they are the same, 0 if they are completely different, 3 if they are slightly similar, and 8 if they are quite similar.
  • Comparison Consideration is relatively easy to describe externally because it is only necessary to pass two nodes or node information to be compared and information for calculation processing. It is desirable that the equivalence evaluation implemented by the equivalence evaluation unit 4215 and the comparison examination mechanism implemented by the comparison study unit 4217 can be extended from inside and outside the apparatus. This is because the equivalence evaluation unit 4215 and the comparison review unit 4217 often need to perform a large amount of complicated calculations when making comparisons using node information. It may also be necessary to switch according to the situation.
  • the most powerful function in using the space is a process using the superposition of the space by the superposition calculation processing unit 4211. This makes it possible to easily convert ambiguous data into more semantically detailed information. It seems to be most effective when used in state-of-the-art technology, medical, legal, information science and other technical databases, and knowledge search and exchange on the Internet. Compared with other information management methods, the effect of the present invention increases as the data is more ambiguous and complicated. In addition, since human sensitive information can be used, it is also effective for art databases such as pictures, movies, and music information. In addition, learning search is possible by superimposition processing of the space by the superimposition calculation processing unit 4211, so a learning search device for educational institutions is also conceivable.
  • FIG. 2 Schematic diagram of a computer used in the present invention
  • FIG. 3 Schematic diagram of the network used in the present invention.
  • Figure 4 Diagram showing cognitive and non-cognitive parts
  • Fig. 14 Diagram of adding data when maintaining synchronization by reference management.
  • Fig. 15 Diagram of adding data when maintaining synchronization by multiplexing operations.
  • FIG.25 Diagram showing another example of node entity expressed in XML
  • FIG. 27 A diagram showing an example of a hierarchical space link expressed in XML
  • FIG. 28 A diagram showing the node information in the memory and the non-volatile recording medium.
  • a node diagram showing the hierarchy selection mechanism 32] Node diagram for explaining equivalence evaluation using link and synchronization point information 33] Result of equivalence evaluation using link and synchronization point information 34] Perform logical operations on space Node diagram
  • FIG.36 A diagram showing an example of replacing space B with a logical table
  • FIG.44 Diagram showing an example of replacing space A with a true / false value when the specified number is 2.
  • Figure 49 showing the results of a weighted search after adjustment by priority weighting.
  • Figure 49 shows an example of adjusting priority based on link distance.
  • FIG. 64 is a diagram showing an example of weighting in the data scribing process
  • FIG.75 Diagram showing the results of pre-processing of integrated calculation with equivalence evaluation 4 as the standard.
  • 76 Diagram showing examples of various integrated calculations with equivalence evaluation 4 as the standard. Node diagram discriminated by evaluation. Sono 78] Node diagram representing music information and distinguished by equivalent evaluation by genre. Sono 79] Score table of music information space
  • Multilingualization node diagram of document when projection is not used [107] Multilingual node diagram of document when projection is used
  • FIG.113 Node diagram of the difference between the structural layer and the entity layer.
  • Sono 114 A diagram showing an example of XML implementation of the structural layer in the link space.
  • Sono 115 A diagram showing an example of XML implementation of the node layer in the hierarchical space.
  • Sono 116 Diagram showing an implementation example of the entity layer
  • FIG.134 Diagram when the second and subsequent nodes are added as links of the first node in the automatic classification process.
  • FIG. 160 Functional block diagram of information management software capable of performing superimposition processing. Sono 161] Screenshot of overall overview of space in information management software. Sono 162] Screenshot of node element explanation in information management software.

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • Databases & Information Systems (AREA)
  • Data Mining & Analysis (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Probability & Statistics with Applications (AREA)
  • Fuzzy Systems (AREA)
  • Mathematical Physics (AREA)
  • Software Systems (AREA)
  • Computational Linguistics (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)

Abstract

La présente invention a trait à un dispositif, un procédé, un programme, et un support d'enregistrement lisible par ordinateur pour la gestion d'information mettant en oeuvre un noeud réalisé dans un espace exprimant un concept et dans un support d'enregistrement lisible par ordinateur ou un réseau existant dans l'espace. Le procédé comprend une étape d'acquisition de données pour l'acquisition d'information à partir de l'espace, une étape de traitement de calcul pour la réalisation de calcul de superposition pour le calcul d'une relation d'information dans une ou des espaces selon l'information acquise, et une étape de sortie de données pour l'émission en sortie de données du résultat de calcul de superposition obtenu par l'unité de traitement de calcul de superposition.
PCT/JP2006/311903 2005-06-14 2006-06-14 Dispositif, programme, et procede de traitement d'espace d'information WO2007000893A1 (fr)

Priority Applications (1)

Application Number Priority Date Filing Date Title
JP2007523391A JPWO2007000893A1 (ja) 2005-06-14 2006-06-14 情報空間処理装置、プログラム、および、方法

Applications Claiming Priority (4)

Application Number Priority Date Filing Date Title
JPPCT/JP2005/010856 2005-06-14
PCT/JP2005/010856 WO2005122014A1 (fr) 2004-06-14 2005-06-14 Dispositif, programme et procede de traitement de l'espace d'information
JP2005-358784 2005-12-13
JP2005358784 2005-12-13

Publications (1)

Publication Number Publication Date
WO2007000893A1 true WO2007000893A1 (fr) 2007-01-04

Family

ID=37595147

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/JP2006/311903 WO2007000893A1 (fr) 2005-06-14 2006-06-14 Dispositif, programme, et procede de traitement d'espace d'information

Country Status (1)

Country Link
WO (1) WO2007000893A1 (fr)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8818930B2 (en) 2009-05-18 2014-08-26 Takatoshi Yanase Knowledge base system, logic operation method, program, and recording medium
CN111868715A (zh) * 2018-03-13 2020-10-30 阿自倍尔株式会社 多变量时间序列数据的同步方法以及多变量时间序列数据处理装置
CN112598906A (zh) * 2020-12-14 2021-04-02 成都易书桥科技有限公司 一种基于时空依赖的预测修正算法

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH096791A (ja) * 1995-06-23 1997-01-10 Canon Inc データ検索方法及びその装置
JPH1031684A (ja) * 1996-04-18 1998-02-03 Nippon Steel Corp 情報検索システム及びそれに用いられるプログラムを記録した記録媒体
WO2005122014A2 (fr) * 2004-06-14 2005-12-22 Mitsuhiro Tanada Dispositif, programme et procede de traitement de l'espace d'information

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH096791A (ja) * 1995-06-23 1997-01-10 Canon Inc データ検索方法及びその装置
JPH1031684A (ja) * 1996-04-18 1998-02-03 Nippon Steel Corp 情報検索システム及びそれに用いられるプログラムを記録した記録媒体
WO2005122014A2 (fr) * 2004-06-14 2005-12-22 Mitsuhiro Tanada Dispositif, programme et procede de traitement de l'espace d'information

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8818930B2 (en) 2009-05-18 2014-08-26 Takatoshi Yanase Knowledge base system, logic operation method, program, and recording medium
CN111868715A (zh) * 2018-03-13 2020-10-30 阿自倍尔株式会社 多变量时间序列数据的同步方法以及多变量时间序列数据处理装置
CN112598906A (zh) * 2020-12-14 2021-04-02 成都易书桥科技有限公司 一种基于时空依赖的预测修正算法
CN112598906B (zh) * 2020-12-14 2024-03-19 成都易书桥科技有限公司 一种基于时空依赖的预测修正算法

Similar Documents

Publication Publication Date Title
Kiryakov et al. Semantic annotation, indexing, and retrieval
Chen Information visualisation and virtual environments
US8972440B2 (en) Method and process for semantic or faceted search over unstructured and annotated data
KR101377389B1 (ko) 다차원 검색 시스템, 다차원 검색을 수행하는 컴퓨터 구현 방법 및 컴퓨터 실행가능 시스템
Gunaratna et al. Gleaning types for literals in rdf triples with application to entity summarization
KR100882582B1 (ko) 시맨틱 웹 기반 연구정보 서비스 시스템 및 그 방법
Lacasta et al. A Web Ontology Service to facilitate interoperability within a Spatial Data Infrastructure: Applicability to discovery
JP5229226B2 (ja) 情報共有システム、情報共有方法、および情報共有プログラム
KR102046692B1 (ko) 다언어 특질 투영된 개체 공간 기반 개체 요약본 생성 방법 및 시스템
Pellegrino et al. GEval: a modular and extensible evaluation framework for graph embedding techniques
Martinez-Rico et al. Can deep learning techniques improve classification performance of vandalism detection in Wikipedia?
EP3249557B1 (fr) Procédé mis en oeuvre et commandé par ordinateur, produit-programme d'ordinateur et plate-forme d'organisation de données pour le traitement et la mémorisation dans un moteur de mémorisation
Jiang et al. Crowdsourced entity markup
WO2007000893A1 (fr) Dispositif, programme, et procede de traitement d'espace d'information
JP2007188469A (ja) 情報空間処理装置、プログラム、および、方法
US20210124871A1 (en) Authoring management method based on relation of electronic documents and authoring management system
JP3778270B2 (ja) 選択履歴管理情報、選択履歴情報、情報記憶媒体、及びユーザーインターフェース補助システム
JPWO2007000893A1 (ja) 情報空間処理装置、プログラム、および、方法
Varanka et al. Topographic mapping data semantics through data conversion and enhancement
WO2005122014A2 (fr) Dispositif, programme et procede de traitement de l'espace d'information
Sánchez-Fernández et al. The Semantic Web: Fundamentals and a brief state-of-the-art
Zou et al. Extracting business execution processes of api services for mashup creation
Rusu et al. Visual analysis of documents with semantic graphs
Drumond Software Architecture by Component Selection
Alby iD Check for Analyzing the Web: Are Top Websites Lists a Good Choice for Research? Tom Alby iD and Robert Jäschke iD Humboldt-Universität zu Berlin, Berlin, Germany

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application
WWE Wipo information: entry into national phase

Ref document number: 2007523391

Country of ref document: JP

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 06766672

Country of ref document: EP

Kind code of ref document: A1