JP2005128916A - Method, device and program for presenting menu, and computer readable storage media for storing the program - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To provide search results with larger amounts of information through a small number of times of operation. <P>SOLUTION: The number of hierarchies of an argument of a process request is compared with the stored number of hierarchies, and if the number of hierarchies of the argument is smaller, information on a group of menu items for which individual search conditions present in a database are used as host menu items is calculated. If the numbers are equal, an amount of information is calculated so that the smaller the rate of the number of data matching slave menu items based on the individual search conditions to the number of data matching the host menu items is, the higher value the amount of information will indicate. The menu items present in the same menu hierarchy are rearranged in decreasing order of amount of information. The sum of amounts of information which a predetermined number of menu items with the greater amounts of information have is calculated as the amounts of information which the host menu items of the menu have. <P>COPYRIGHT: (C)2005,JPO&NCIPI

Description

  The present invention relates to a menu presentation method and apparatus, a program, and a computer-readable storage medium storing the menu presentation program, and more particularly, to a menu presentation method and apparatus, program, and menu presentation program for effectively performing information retrieval. The present invention relates to a stored computer-readable storage medium.

  When there is a large amount of information to be searched, a user generally narrows down an object by keyword search or menu search and browses to find information. Regarding menu search, a design method for making the search effective (for example, see Non-Patent Document 1) has been studied. In general, several menu items are presented, and items are selected from the page. Select and find information. For example, in the case of gourmet guidance, the menu of area and dish type is arranged in the order of popularity, so that the average user's request is satisfied.

  While there is a tendency to meet the average user's demand in this way, with the spread of the mobile Internet, the number of users who easily search for information has increased, and information and other search services that take advantage of the user's personality The need for information retrieval is diversifying, such as wanting superior information. In order to perform a search utilizing the personality of the user, keywords are registered in advance (see, for example, Non-Patent Document 2), or an e-mail is sent when the registered conditions are met (for example, non-patent) There are methods such as Reference 3).

  However, in these methods, the user is complicated to register various conditions such as keywords in advance based on the information content. In the actual service, users who register as users and input additional information are a very small part of all users. There is a need for a method that enables a unique search service without requiring additional registration operations.

On the other hand, there has been proposed a method of presenting more menu items that can narrow down the number of search results to the number of items that can be listed on a small display by selecting a menu several times (for example, see Patent Document 1). Specifically, all combinations for the set number of selections are generated from the search condition group, and only the search condition combinations that produce search results that are less than the number of items that can be listed on a small display are extracted. Among them, search conditions with a large number of data that can be searched in the lower hierarchy are presented as a menu preferentially. In this method, since the absolute value of the number of search results that have been narrowed down is used as a reference, the number of search results that can be listed on a small display is guaranteed with a small number of operations. However, this method simply presents more menu items that lead to the number of search results that are less than or equal to a constant number of operations, and there is a study on the meaning of the search results about what kind of search results can be obtained. Not done.
JP 2000-311179, Masaru Miyamoto, Nobuhiko Masui, Nobuyuki Omori, Hideaki Ozawa, Kenya Suzuki, Yoshinobu Tonomura “Data Search Support Method and Apparatus, and Storage Medium Stored with Data Search Support Program” Shneiderman, B. (1986) Designing Menu Selection Systems, Journal of the American Society for Information Science and Technology, vol.37, No.2, pp.57-70. http://my.yahoo.co.jp/ http://www.kakaku.com/

  Therefore, paying attention to the property of information amount indicating the uniqueness of information, a menu presentation method that can obtain a search result with a higher information amount with a small number of operations is studied. The amount of information is a measure of rarity or uniqueness in an arbitrary set.

  In order to select a plurality of search conditions using a menu and perform an AND search, the menu based on the search conditions spans multiple layers. FIG. 11 is an example in which a menu based on search conditions is configured by a plurality of hierarchies in order to narrow down restaurants by a plurality of search conditions. Hereinafter, in the menu based on the search condition, a menu item having a search condition further in the lower hierarchy is called a menu node, and a menu item having no search condition in the lower hierarchy and having a search result is called a menu leaf. In addition, a menu in a lower hierarchy of the menu leaf is called a search result.

  The information amount of the menu leaf can be calculated by applying Shannon's information amount “Akihiko Uchiyama, Shigeichi Hirasawa (1990) Computer Engineering for Science and Engineering, Shosodo”. For example, let us consider a case where two search conditions of “Kannai” (100 items) and “Chinese cuisine” (1000 items) are narrowed down by menu selection in a restaurant database. Here, “Kannai” ∩ “Chinese cuisine” is 90 cases. When “Kannai” → “Chinese cuisine” is selected in this order, 90% of “Kannai” is “Chinese cuisine”, which is “Chinese cuisine”, and shows a low value as the amount of information indicating unusualness. The negative value of the logarithm of this ratio is the Shannon information amount. The lower the ratio, the higher the information amount.

  The amount of information on this menu leaf is affected by the order in which search conditions are determined. In the case of the combination of the search conditions of “Kannai” and “Chinese cuisine” as described above, if “Chinese cuisine” is selected in the order of “Kannai”, 9% of “Chinese cuisine” is “Kannai”. The amount of information is relatively high. Even with the same combination, it is not sufficient to evaluate the information amount according to a part of the fixed order.

  Also, if the information amount of the menu node is the sum of the information amounts of the lower level menu leaves, even if there are a large number of menu leaves with low information amounts, the information amount of the parent menu node is high End up. When such menu nodes are presented with priority, there is a high possibility that search results with a low amount of information will be presented with priority.

  The present invention has been made in view of the above points, and in order to obtain a search result with a high information amount with a small number of operations, a large amount of menus with a low information amount are evaluated while evaluating the information amount of all confirmed orders. An object of the present invention is to provide a menu presentation method and apparatus, a program, and a computer-readable storage medium storing the menu presentation program.

  FIG. 1 is a diagram for explaining the principle of the present invention.

In the present invention, for each data, there is a database expressed by a multidimensional vector composed of binary data that records 1 when an arbitrary search condition is met and 0 when it is not met. In a menu presentation method in a menu search system that presents search conditions as a menu, searches the database by combining selected search condition groups, and presents search results.
The number of menu hierarchies according to the search condition is stored in advance in the number-of-hierarchy storage means before generating the menu (step 1).
In the hierarchy determination means, the number of levels of the menu to be generated by the processing request is compared with the number of hierarchies set in the hierarchy number storage means in advance. Determining that there is a menu according to the search condition, and determining that there is no menu according to the search condition in the lower hierarchy when both are equal (step 2);
In the first information amount calculation means, when the hierarchy determination means determines that a menu based on the search condition exists further in the lower hierarchy, the information of the menu item group having each search condition existing in the database as the parent menu item A process of recursively calling and executing the amount calculation process, and storing the calculated information amount in the menu storage means (step 3);
In the second information amount calculating means, when the hierarchy determining means determines that there is no menu based on the search condition in the lower hierarchy, the child menu items according to the individual search conditions for the number of data corresponding to the parent menu item are displayed. A process of calculating the amount of information indicating a higher value and storing it in the menu storage means as the ratio of the number of corresponding data decreases (step 4);
In the information amount calculation control means, the process of rearranging the menu items existing in the same menu hierarchy of the menu storage means in order of increasing information amount (step 5),
In the information amount calculation control means, among the higher-level menu items existing in the same menu hierarchy of the menu storage means, the total amount of information for a certain number of items is used as the parent menu of the menu hierarchy. A process of calculating the information amount of the item (step 6).

  FIG. 2 is a principle configuration diagram of the present invention.

In the present invention, for each data, there is a database 1 represented by a multi-dimensional vector composed of binary data that records 1 if any search condition is met and 0 if not A menu presenting device in a menu retrieval system for presenting search conditions as a menu, searching the database by combining selected search condition groups, and presenting search results,
Hierarchy number storage means 21 for storing the number of menu hierarchies according to search conditions in advance before generating a menu;
Menu storage means for storing menu items and information amount;
A comparison is made between the number of hierarchies of the menu to be generated by the processing request and the number of hierarchies previously set in the hierarchy number storage means 21, and when the number of hierarchies of the menu to be generated is smaller, the menu according to the search condition is further added to the lower hierarchy. A hierarchy determination unit 24 that determines that a menu based on a search condition does not exist in the lower hierarchy when the two are equal,
A process of calculating the information amount of the menu item group using each search condition existing in the database as a parent menu item when the hierarchy determination unit 24 determines that a menu based on the search condition exists further in the lower hierarchy. A first information amount calculating unit 26 that recursively calls and stores the calculated information amount in the menu storage unit 3;
When the hierarchy determination means 24 determines that there is no menu based on the search condition in the lower hierarchy, the ratio of the number of data corresponding to the child menu item according to the individual search condition to the number of data corresponding to the parent menu item is A second information amount calculating unit 27 that calculates an information amount that indicates a higher value as the number is smaller, and stores the information amount in the menu storage unit 3;
The menu items existing in the same menu hierarchy of the menu storage means 3 are rearranged in descending order of the amount of information, and only a certain number of higher-order menu items existing in the same menu hierarchy have a high number of items. And an information amount calculation control means for calculating the sum of the information amounts as the information amount of the parent menu item of the menu hierarchy.

In the present invention, for each data, there is a database expressed by a multidimensional vector composed of binary data that records 1 when an arbitrary search condition is met and 0 when it is not met. A menu presenting program in a menu retrieval system for presenting search conditions as a menu, searching the database by combining selected search condition groups, and presenting search results,
The computer stores the number of menu hierarchies according to the search condition in advance in the hierarchy number storage means before generating the menu.
When the number of levels of the menu to be generated by the processing request is compared with the number of levels set in the number-of-hierarchy storage unit in advance, if the number of levels of the menu to be generated is smaller, the menu based on the search condition is further added to the lower level. A step of determining that there is no menu based on a search condition in the lower hierarchy when the two are equal,
When it is determined that there is a menu with further search conditions in the lower hierarchy, the calculation process for calculating the information amount of the menu item group using each search condition existing in the database as the parent menu item is recursively calculated. Storing the recorded information amount in a menu storage means for storing the menu item and the information amount;
When it is determined that there is no menu according to the search condition in the lower hierarchy, the lower the ratio of the number of data corresponding to the child menu item according to each search condition to the number of data corresponding to the parent menu item, the higher the value. Calculating the amount of information as shown and storing it in the menu storage means;
Rearranging menu items existing in the same menu hierarchy of the menu storage means in order of increasing information amount;
Of the higher-level menu items that exist in the same menu hierarchy of the menu storage means, the sum of the information quantities for a certain number of items is calculated as the information quantity of the parent menu item in the menu hierarchy. Steps are executed.

In the present invention, for each data, there is a database expressed by a multidimensional vector composed of binary data that records 1 when an arbitrary search condition is met and 0 when it is not met. A computer-readable storage medium storing a menu presentation program in a menu search system for presenting search conditions as a menu, searching the database by combining selected search condition groups, and presenting search results,
The computer stores the number of menu hierarchies according to the search condition in advance in the hierarchy number storage means before generating the menu.
When the number of levels of the menu to be generated by the processing request is compared with the number of levels set in the number-of-hierarchy storage unit in advance, if the number of levels of the menu to be generated is smaller, the menu based on the search condition is further added to the lower level. A step of determining that there is no menu based on a search condition in the lower hierarchy when the two are equal,
When it is determined that there is a menu with further search conditions in the lower hierarchy, the calculation process for calculating the information amount of the menu item group using each search condition existing in the database as the parent menu item is recursively calculated. A stored information amount in a menu storage means for storing the menu item and the information amount;
When it is determined that there is no menu according to the search condition in the lower hierarchy, the lower the ratio of the number of data corresponding to the child menu item according to each search condition to the number of data corresponding to the parent menu item, the higher the value. Calculating the amount of information as shown and storing it in the menu storage means;
Rearranging menu items existing in the same menu hierarchy of the menu storage means in order of increasing information amount;
Of the higher-level menu items that exist in the same menu hierarchy of the menu storage means, the sum of the information quantities for a certain number of items is calculated as the information quantity of the parent menu item in the menu hierarchy. And a program for executing the step.

  According to the present invention, in order to obtain a search result with a higher information amount with a smaller number of operations, it is possible to remove a large amount of menu noise with a low information amount while evaluating the information amount of all the determined orders.

  A menu with a small amount of information has a large number of search results at the same time. For this reason, when there is a possibility that a menu with a low amount of information is preferentially presented, scrolling for browsing search results may occur frequently as shown in FIG. On the other hand, menus with a high amount of information have few search results. Therefore, if a large amount of noise with a low information amount is removed and a menu with a high information amount is preferentially displayed, a result with a high information amount and a small search result is obtained as shown in FIG. Is likely to be. For a terminal with a small screen, such as a mobile phone, the number of data that can be presented at one time also decreases, so it is effective that the amount of information is high and the number of search results is small.

  Hereinafter, embodiments of the present invention will be described with reference to the drawings.

  FIG. 4 shows the configuration of the menu presentation system in one embodiment of the present invention. The system shown in the figure can remove the noise of a large amount of menus with low information amount while evaluating the information amount of all confirmed orders in order to obtain search results with high information amount with a small number of operations. Indicates.

  The system shown in FIG. 1 includes a database 1, a menu generation unit 2, a menu storage unit 3, an input / output unit 4, and an input device 5.

  The database 1 is expressed by a multidimensional vector composed of binary data that records “1” when any search condition is satisfied and “0” when it does not correspond to each data. FIG. 5 shows an example of a restaurant database. For the restaurant, binary data indicating whether or not the search condition for the dish type such as Chinese or Italian or the search condition indicating a feature such as a shop with a beautiful night view is given. When a reference request is received from the processing stack 23 of the menu generation unit 2, which will be described later, the search examination list storage unit 25, and the information amount calculation unit 27 of the menu leaf, corresponding data is returned.

  The menu generation unit 2 includes a hierarchy number storage unit 21, an information amount addition range storage unit 22, a processing stack 23, a hierarchy determination unit 24, a search condition list storage unit 25, a menu node information amount calculation unit 26, and a menu leaf information amount. The calculation unit 27 includes a parent menu node information amount calculation unit 28 and a process activation unit 29.

  The number-of-tiers storage unit 21 is a storage medium such as a disk device, and sets and stores the number of menu layers according to search conditions in advance before generating the menu. In the example of FIG. 11, the number of hierarchies = 2 is recorded. When the reference request is received from the hierarchy determination unit 24, the value of the hierarchy number is returned.

  The information amount addition range storage unit 22 is a storage medium such as a disk device. When calculating the information amount of the menu node, the information amount addition range storage unit 22 stores up to the number of menu items with the higher information amount among the menu items of the lower hierarchy. Before the menu is generated, the number corresponding to the information amount addition range of whether to calculate the sum is set and stored in advance. When a reference request is received from the parent menu node information amount calculation unit 28, the number corresponding to the information amount addition range is returned.

  The processing stack storage unit 23 is a storage medium such as a disk device, and records information related to recursively called processing in a data structure based on a last-in first-out method in order to perform menu generation processing recursively. As shown in FIG. 6, the information regarding the process includes at least a parent menu identifier, the number of layers, a parent menu item, and the number of data of the parent menu.

  The processing stack storage unit 23 is a storage medium such as a disk device. When a processing start request is received from the processing activation unit 29, the processing stack storage unit 23 sets a record of the parent menu identifier = 0 and the number of hierarchies = 1 as an initial value and sets the parent menu item = NULL. , The number of data of the parent menu = total number of data is inserted, and a processing request is issued to the hierarchy determination unit 24 using these as arguments. The total number of data is obtained by referring to the database 1.

  When the processing stack storage unit 23 receives a restart processing request with the number of layers and the parent menu item as arguments from the information amount calculation unit 26 of the menu node, the processing stack storage unit 23 stores the number of data corresponding to the parent menu item in the database 1. Refer to and get new records with these values. At this time, the menu storage unit 3 is referred to request the issuance of a new parent menu identifier that is not used, and the value is inserted into the parent menu identifier of the record. Thereafter, a processing request is issued to the hierarchy determination unit 24 with the added parent menu identifier, hierarchy number, parent menu item, and parent menu data number as arguments.

  When a processing end request is received from the parent menu node information calculation unit 28 using the information amount of the parent menu node as an argument, a new record creation request is issued to the menu storage unit 3 shown in FIG. 7 together with the following six arguments.

(1) Menu identifier = parent menu identifier of the process stack record currently being processed:
(2) Parent menu identifier = parent menu identifier inserted immediately before the processing stack record currently being processed (3) Menu flag = menu node:
(4) Menu item = parent menu item of the process stack record currently being processed:
(5) Number of data = number of data in the parent menu of the process stack record currently being processed:
(6) Information amount = information amount of received parent menu node:
Thereafter, the process stack record currently being processed is deleted, a process request corresponding to the record remaining in the process stack is issued to the hierarchy determination unit 24, and this is repeated until there are no more process stack records.

  When the hierarchy determination unit 24 receives a processing request from the processing stack storage unit 23, the hierarchy determination unit 24 compares the number of layers in the argument with the number of layers in the layer number storage unit 21. A processing request is issued to the information amount calculation unit 26. If the number of layers in the argument and the number of layers in the layer number storage unit 21 are equal, a processing request is issued to the information amount calculation unit 27 of the menu leaf. At this time, the parent menu identifier, the number of layers, the parent menu item, and the number of data of the parent menu are passed as arguments.

  The search condition list storage unit 25 extracts a list of search conditions from the database 1 before generating the menu and stores it as shown in FIG. When a reference request is received from the information amount calculation unit 26 of the menu node and the information amount calculation unit 27 of the menu leaf, a list of search conditions is returned.

  Upon receipt of the processing request from the hierarchy determination unit 24, the menu node information amount calculation unit 26 obtains a list of search conditions from the search condition list storage unit 25, and sets the menu node when each search condition is a menu node. An information amount calculation request is issued to the processing stack storage unit 23. At this time, in order to evaluate the lower-level menu, “layer number = number of argument layers + 1” and “parent menu item = individual search condition” are passed as arguments. After processing all the search conditions, a processing request is issued to the parent menu node information amount calculation unit 28 with the parent menu node identifier as an argument.

  Upon receipt of the processing request from the hierarchy determination unit 24, the menu leaf information amount calculation unit 27 obtains a list of search conditions from the search condition list storage unit 25, and the menu leaf information when the individual search conditions are menu leaves. The amount of information is calculated.

  First, the number of data corresponding to the menu leaf is acquired from the database 1. At this time, the result of the AND search with the search condition of the menu node in the upper hierarchy is used. When the menu leaf “Italian” at the top of FIG. 11 is evaluated, the number of search results of “Kannai” ∩ “Italian” is set as the number of data corresponding to the menu leaf. Further, when the menu node exists in the upper hierarchy, the search condition corresponding to the parent menu node is added to the AND search condition by recursively tracing back to the parent menu node.

The ratio of the number of data corresponding to the menu leaf to the number of data of the parent menu received as an argument is calculated, and a value that increases if this ratio is low is defined as the information amount of the menu leaf. Applying Shannon's amount of information, the following equation 1 is obtained.
Information amount = -log (number of data corresponding to the menu leaf / number of data of the parent menu) ... Equation 1
There are cases where the logarithm is not taken, or where a constant term is added.

  After calculating the amount of information, in order to store the menu leaf and information related to the search result in the menu storage unit 3, a new record creation request is issued to the menu storage unit 3 shown in FIG.

(1) Menu identifier = NULL:
(2) Parent menu identifier = parent menu identifier received by the menu leaf information amount calculation unit 27 as an argument:
(3) Menu flag = Menu leaf:
(4) Menu item = search condition currently being evaluated:
(5) Number of data = Number of data corresponding to the menu leaf:
(6) Information amount = calculated information amount:
After processing all the search conditions, a processing request is issued to the parent menu node information amount calculation unit 28 with the parent menu node identifier as an argument.

  When a processing request is received from the menu node information amount calculation unit 26 or the menu leaf node information amount calculation unit 27 using the parent menu identifier as an argument, the parent menu node information amount calculation unit 28 corresponds to the parent menu identifier. The amount of menu node information is calculated. Specifically, records having the parent menu identifier of the argument are extracted from the menu storage unit 3 shown in FIG. 7, rearranged in descending order of the information amount, and stored again in the menu storage unit 3. Thereafter, the sum total of the information amount is calculated for the number of items set in the information amount addition range storage unit 32 among the higher-level menus with a high information amount. The sum total of the calculated information amounts is set as the information amount of the menu node corresponding to the parent menu identifier. A processing end request is issued to the processing stack storage unit 23 using this amount of information as an argument.

  The process activation unit 29 determines whether the physical operation of the input device 5 such as a keyboard or a mouse is a process activation instruction. If the process activation instruction is determined to be a process activation instruction, the process activation unit 29 issues a process start request to the process stack storage unit 23. put out.

  As shown in FIG. 7, the menu storage unit 3 includes at least a menu identifier, a parent menu identifier, a menu flag, a menu item, the number of data corresponding to the menu item, and an information amount. When a request for issuing a parent menu identifier is received from the processing stack storage unit 23, a new parent menu identifier that is not used is issued and its value is returned.

  Further, the menu storage unit 3 receives (1) a menu identifier, (2) a parent menu identifier, (3) a menu flag, (4) a menu item, ( 5) When a new record request is received together with 6 arguments of the number of data and (6) information amount, a new record is created, and the received argument is substituted into the item of each record. In the case of a request from the menu leaf information amount calculation unit 27, (1) Since menu identifier = NULL, a new menu identifier is created and substituted. Further, in order to record the search results under the menu leaf in the menu storage unit 3, the search result under the menu leaf is acquired from the database 1 and a new record is created for each search result. At this time, a new menu identifier is created. Further, the menu identifier of the menu leaf is substituted for the parent menu identifier. Further, the title of the search result is substituted for the menu item.

  The input / output unit 4 includes a menu operation unit 41 and a menu display unit 42.

  The menu operation unit 41 converts the physical operation of an input device such as a keyboard and a mouse into electrical signals for menu cursor movement and selection. When the cursor is moved, the menu item having the same parent menu identifier is moved, and the result is displayed on the menu display unit. When a menu item is selected, the menu item group having the menu identifier of the selected menu item as the parent menu identifier is displayed in order of increasing information amount, as the parent menu node information amount calculating unit 28 rearranges.

  The menu display unit 42 displays the operation result of the menu operation unit 41. FIG. 9 shows an example of an input / output unit in a mobile phone. A liquid crystal display or the like corresponds to the menu display unit 42. The up and down arrow keys in FIG. 9 and the selection buttons between them correspond to the menu operation unit 41. The result of the operation of the menu operation unit 41 is reflected on the menu display unit 42.

  The input device 5 transmits the physical operation of the input device 5 such as a keyboard and a mouse to the process activation unit 29.

  Next, the menu presentation method in the above configuration will be described.

  FIG. 10 is a flowchart of the menu presentation method according to the embodiment of the present invention, and is a flowchart called recursively in step 102.

  Step 101) When the hierarchy determination unit 24 receives a processing request from the processing stack storage unit 23, the number of layers in the argument is compared with the number of layers in the layer number storage unit 21, and if the number of layers in the argument is smaller Move on to step 102. If the number of layers in the argument is equal to the number of layers in the number-of-layers storage unit 21, the process proceeds to step 103.

  When the process stack storage unit 23 receives a process start request from the process activation unit 29, the first process is started. The initial number of hierarchies is one.

  Step 102) When the information amount calculation unit 26 of the menu node receives a processing request from the hierarchy determination unit 24, it acquires a list of search conditions from the search condition list storage unit 25, and sets each search condition as a menu node. A menu node information amount calculation request is issued to the processing stack storage unit 23. At this time, in order to evaluate the lower-level menu, the number of layers = the layer of the argument + 1, and the parent menu item = the individual search conditions are passed as arguments. Thereafter, the process proceeds to step 104.

  Step 103) When the information amount calculation unit 27 of the menu leaf receives a processing request from the hierarchy determination unit 24, it acquires a list of search conditions from the search condition list storage unit 25, and sets each search condition as a menu leaf. The information amount of the menu leaf is calculated, and the process proceeds to step 104.

  Step 104) It is determined whether the processing in Step 102 and Step 103 has processed all the search conditions in the search condition list storage unit 25. If not, the process proceeds to Step 101. If processed, the process proceeds to Step 101. 105.

  Step 105) When the parent menu node information amount calculation unit 28 receives a processing request using the parent menu identifier as an argument from the information amount calculation unit 26 of the menu node or the information amount calculation unit 27 of the menu leaf, the parent menu of the argument Records having identifiers are extracted from the menu storage unit 3 (FIG. 7), rearranged in descending order of information amount, re-recorded in the menu storage unit 3, and then the process proceeds to step 106.

  Step 106) The parent menu node information amount calculation unit 28 sets the amount of information by the number of items set in the information amount addition range storage unit 32 among the higher-level menus of the menu items rearranged in Step 105. Calculate the sum. The sum of the calculated information amounts is set as the information amount of the menu node corresponding to the parent menu identifier. A processing end request is issued to the processing stack storage unit 23 using this amount of information as an argument.

  When the processing stack storage unit 23 receives a processing end request from the parent menu node information calculation unit 28 using the information amount of the parent menu node as an argument, it issues a new record creation request to the menu storage unit 3 (FIG. 7). Thereafter, the process stack record currently being processed is deleted, a process request corresponding to the record remaining in the process stack is issued to the hierarchy determination unit 24, and this is repeated until there are no more process stack records.

  Further, the procedure of the flowchart shown in FIG. 10 in the above embodiment is constructed as a program, installed in a computer used as a menu presentation device, and executed by a control means such as a CPU, or distributed through a network. It is also possible to make it.

  The constructed program is stored in a portable storage medium such as a hard disk, a flexible disk, or a CD-ROM connected to a computer used as a menu presentation device, and is installed when the present invention is carried out. Is also possible.

  The present invention is not limited to the above-described embodiment, and various modifications and applications can be made within the scope of the claims.

  The present invention can be applied to a menu presentation technique in an information search system.

It is a figure for demonstrating the principle of this invention. It is a principle block diagram of this invention. It is a figure for demonstrating the effect of this invention. 1 is a system configuration diagram according to an embodiment of the present invention. It is an example of the database in one embodiment of this invention. It is an example of the processing stack memory | storage part in one embodiment of this invention. It is an example of the menu memory | storage part in one embodiment of this invention. It is an example of the search condition list memory | storage part in one embodiment of this invention. It is an example of the input-output part in the mobile telephone in one embodiment of this invention. It is a flowchart of the menu presentation method in one embodiment of this invention. This is an example in which a menu based on search conditions is configured in a plurality of layers.

Explanation of symbols

DESCRIPTION OF SYMBOLS 1 Database 2 Menu generation part 3 Menu storage part 4 Input / output part 5 Input device 21 Hierarchy number storage means, hierarchy number storage part 22 Information amount addition range storage part 23 Processing stack storage part 24 Hierarchy determination means, hierarchy determination part 25 Search conditions List storage unit 26 First information amount calculation unit, menu node information amount calculation unit 27 Second information amount calculation unit, menu leaf information amount calculation unit 28 Information amount calculation control unit, parent menu node information amount calculation unit 29 Processing starter

Claims (4)

For each data, there is a database represented by a multidimensional vector composed of binary data that records 1 when an arbitrary search condition is met, and 0 when it is not applicable. In a menu presentation method in a menu search system that presents as a menu, searches the database by combining selected search condition groups, and presents a search result,
Prior to generating the menu, the number of levels of the menu according to the search condition is stored in the number of layers storage means,
In the hierarchy determination means, the number of levels of the menu to be generated for the processing request is compared with the number of levels set in the hierarchy number storage means in advance, and if the number of levels of the menu to be generated is smaller, the lower hierarchy And determining that there is no menu based on the search condition in the lower hierarchy when both are equal to each other,
In the first information amount calculation means, when the hierarchy determination means determines that a menu based on the search condition is further present in the lower hierarchy, the menu item having each search condition existing in the database as a parent menu item Recursively calling the calculation of the information amount of the group, and storing the calculated information amount in the menu storage means for storing the menu item and the information amount;
In the second information amount calculation means, when the hierarchy determination means determines that there is no menu according to the search condition in the lower hierarchy, the child menu according to each search condition for the number of data corresponding to the parent menu item Calculating the amount of information indicating a higher value as the ratio of the number of data corresponding to the item is smaller, and storing it in the menu storage means;
In the information amount calculation control means, the process of rearranging the menu items existing in the same menu hierarchy of the menu storage means in order of increasing information amount;
In the information amount calculation control means, a value obtained by summing the amount of information for a certain number of high-order menu items existing in the same menu hierarchy of the menu storage means for the menu hierarchy. A process of calculating the amount of information of the parent menu item,
A menu presentation method characterized by comprising: For each data, there is a database represented by a multidimensional vector composed of binary data that records 1 when an arbitrary search condition is met, and 0 when it is not applicable. A menu presentation device in a menu search system that presents as a menu, searches the database by combining selected search condition groups, and presents search results,
Hierarchy number storage means for storing the number of menu hierarchies according to search conditions in advance before generating a menu;
Menu storage means for storing the menu identifier and the amount of information;
When the number of hierarchies of the menu to be generated according to the processing request is compared with the number of hierarchies set in the hierarchy number storage unit in advance, if the number of hierarchies of the menu to be generated is smaller, the lower hierarchies further depend on the search condition Hierarchy determination means for determining that a menu exists and determining that a menu based on a search condition does not exist in the lower hierarchy when both are equal;
When the hierarchy determination unit determines that a menu based on a search condition is further present in the lower hierarchy, a process for calculating the information amount of the menu item group using each search condition existing in the database as a parent menu item. First information amount calculation means for recursively calling and calculating, and storing the calculated information amount in the menu storage means;
The ratio of the number of data corresponding to the child menu item according to each search condition to the number of data corresponding to the parent menu item when the hierarchy determination means determines that the menu according to the search condition does not exist in the lower hierarchy The second information amount calculating means for calculating the amount of information that indicates a higher value as the number is smaller, and storing it in the menu storage means;
The menu items existing in the same menu hierarchy of the menu storage means are rearranged in order of increasing information amount, and a certain number of high-order menu items existing in the same menu hierarchy are in a certain number of cases, An information amount calculation control means for calculating a total value of information amounts as an information amount of a parent menu item of the menu hierarchy. For each data, there is a database represented by a multidimensional vector composed of binary data that records 1 when an arbitrary search condition is met, and 0 when it is not applicable. A menu presenting program in a menu search system that presents as a menu, searches the database by combining selected search condition groups, and presents a search result,
The computer stores the number of menu hierarchies according to the search condition in advance in the hierarchy number storage means before generating the menu.
When the number of hierarchies of the menu to be generated according to the processing request is compared with the number of hierarchies set in the hierarchy number storage unit in advance, if the number of hierarchies of the menu to be generated is smaller, the lower hierarchies further depend on the search condition Determining that the menu exists, and determining that the menu based on the search condition does not exist in the lower hierarchy when both are equal;
When it is determined that a menu based on a search condition further exists in the lower hierarchy, the calculation process for calculating the information amount of the menu item group using each search condition existing in the database as a parent menu item is recursively invoked. Storing the calculated information amount in a menu storage means for storing the menu item and the information amount;
When it is determined that the menu according to the search condition does not exist in the lower hierarchy, the smaller the ratio of the number of data corresponding to the child menu item according to each search condition to the number of data corresponding to the parent menu item, the higher the value Calculating the amount of information as shown below and storing it in the menu storage means;
Rearranging menu items existing in the same menu hierarchy of the menu storage means in descending order of information amount;
Of the higher-level menu items existing in the same menu hierarchy of the menu storage means, the total amount of information for a certain number of items is calculated as the information amount of the parent menu item of the menu hierarchy And steps to
A menu presenting program characterized in that For each data, there is a database represented by a multidimensional vector composed of binary data that records 1 when an arbitrary search condition is met, and 0 when it is not applicable. A computer-readable storage medium storing a menu presentation program in a menu search system that presents as a menu, searches the database by combining selected search condition groups, and presents search results,
The computer stores the number of menu hierarchies according to the search condition in advance in the hierarchy number storage means before generating the menu.
When the number of hierarchies of the menu to be generated according to the processing request is compared with the number of hierarchies set in the hierarchy number storage unit in advance, if the number of hierarchies of the menu to be generated is smaller, the lower hierarchies further depend on the search condition Determining that the menu exists, and determining that the menu based on the search condition does not exist in the lower hierarchy when both are equal;
When it is determined that a menu based on a search condition further exists in the lower hierarchy, the calculation process for calculating the information amount of the menu item group using each search condition existing in the database as a parent menu item is recursively invoked. Storing the calculated information amount in a menu storage means for storing the menu item and the information amount;
When it is determined that the menu according to the search condition does not exist in the lower hierarchy, the smaller the ratio of the number of data corresponding to the child menu item according to each search condition to the number of data corresponding to the parent menu item, the higher the value Calculating the amount of information as shown below and storing it in the menu storage means;
Rearranging menu items existing in the same menu hierarchy of the menu storage means in descending order of information amount;
Of the higher-level menu items existing in the same menu hierarchy of the menu storage means, the total amount of information for a certain number of items is calculated as the information amount of the parent menu item of the menu hierarchy And steps to
A computer-readable storage medium storing a menu presenting program, characterized in that a program for executing is stored.

Images