JP2011076453A - Apparatus or method for providing great spot information - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To provide an apparatus or method for providing information on great spot spots registered in an information provision site. <P>SOLUTION: A first total search count acquisition means 4 acquires the number of times that each name is retrieved as a search key, from a network-connected retrieval server 20 at predetermined intervals. A second total search count acquisition means 5 acquires the number of times that the name of a predetermined specific sightseeing spot is retrieved as a search key, from the retrieval server 20 at predetermined intervals. A degree-of-rareness arithmetic means 6 obtains a relative value between the number of times that a target sightseeing spot is searched and the number of times that the specific sightseeing spot is searched, in a plurality of sightseeing spots stored in a storage means 3, as a degree of rareness representing that the target sightseeing spot is the great spot. <P>COPYRIGHT: (C)2011,JPO&INPIT

Description

  The present invention relates to a hole location information providing apparatus, and more particularly to generation of hole location information.

  Patent Document 1 discloses a sightseeing spot information providing system.

JP 2005-276036

  However, the above Patent Document 1 has the following problems. Some users may want to visit secret tourist spots that some people recommend even though they are not popular with everyone. However, there was no clear standard for judging whether it was a secret spot.

  Such a problem is not only a tourist spot but also a product sales such as a mail order and a restaurant.

  An object of the present invention is to solve the above-described problems and provide a hole location information providing apparatus or method for providing information that is a hole location among registered locations on an information providing site.

1) A secret spot information providing system according to the present invention is a secret spot information providing system comprising: A) a secret spot information providing computer connected to a search server via a network; and a user terminal connected to the secret spot information providing computer via a network. ,
The hole location information providing computer is configured to B) storage means for storing detailed data including IDs and names for a plurality of recommended tourist spots, and C) the number of searches for each name as a search key at predetermined time intervals. A first search total number acquisition means for acquiring from a search server connected to the network; D) from the search server, the number of specific tourist spot searches for which a name of a predetermined specific tourist spot is searched for every predetermined time as a search key. Second search total number acquisition means to be acquired; E) of a plurality of sightseeing spots stored in the storage means, with respect to a determination target tourist spot for determining a hole spot degree, the search number and the specific tourist spot search number A hole degree calculation means for obtaining a relative value as a hole degree indicating that the determination target tourist spot is a hole, F) a network-connected user From The computer, it is given a particular search request to search criteria and attraction that matches the search criteria, together with the detailed data that beaten path degree, and a beaten path information providing means for providing information to the user.

  As described above, among the plurality of sightseeing spots stored in the storage unit, for the determination target sightseeing spot for which the degree of vacancy is determined, the relative value between the number of searches and the number of specific sightseeing spot searches is determined as the determination target tourism. When a search request specifying a search condition is given as a hole spot degree indicating that the spot is a hole spot, for the tourist spot that matches the search condition, the hole spot degree is provided to the user along with the detailed data. As a result, the hole location information can be provided to the user.

  As a result, the degree of vacancy based on objective data such as the number of searches in the search engine can be obtained. Further, by using the relative value, it is possible to determine the degree of hole location based on a relative relationship that is not known from the absolute value.

  2) The hole location information providing computer according to the present invention includes: A) storage means for storing detailed data including IDs and names for a plurality of specific objects; and B) each name is searched as a search key every predetermined time. First search total number acquisition means for acquiring the number of searches from a search server connected to the network; C) a specific object search number searched for a predetermined specific object name as a search key every predetermined time Second search total number acquisition means to be acquired from the search server; D) the number of searches for the determination object for determining the hole spot degree among the plurality of objects stored in the storage means; and the specific object search There is provided a hole hole degree calculating means for obtaining a relative value with respect to a number as a hole hole degree indicating that the determination object is a hole hole.

  In this way, the relative value is obtained as the degree of hole spot instead of the absolute number of searches for the specific object stored in the storage means. As a result, the degree of vacancy based on objective data such as the number of searches in the search engine can be obtained. Further, by using the relative value, it is possible to determine the degree of hole location based on a relative relationship that is not known from the absolute value.

  3) In the hole location information providing computer according to the present invention, the hole degree calculation means further refers to a time-series variation history of the determination target so as to reduce the number of searches by a predetermined ratio or more. When the number fluctuates, it is determined that the determination target object is a hidden object. Therefore, the degree of holeiness considering the variation history can be obtained.

  4) In the hole location information providing computer according to the present invention, the hole degree determination means further reduces the number of searches by a predetermined ratio or more as compared to the time-series fluctuation history of the number of specific object searches. When the number of searches fluctuates, it is determined that the determination target object is a hidden object. Accordingly, the degree of hole spot considering the time-series fluctuation history of the number of specific object searches is obtained.

  5) In the hole location information providing computer according to the present invention, the predetermined name of the specific object is arbitrarily selected from those having a large number of searches in the search server. Accordingly, the degree of squeezing in relation to names with a large number of searches is obtained in the search server.

  6) In the hole location information providing computer according to the present invention, the predetermined specific object is arbitrarily selected from those having a small number of searches in the search server. Accordingly, the degree of hole spot in relation to names with a small number of searches in the search server is obtained.

  7) In the hole information providing computer according to the present invention, the hole degree calculation means stores a threshold value indicating that it is a hole with respect to a relative value with respect to the number of searches for the specific object, and the obtained relative If the value is less than or equal to the threshold, it is determined that the hole is a hole. Therefore, it is possible to make a hole spot judgment.

  8) In the hole location information providing computer according to the present invention, the hole degree calculation means sets the relative value to the number of searches of the specific object having the large number of searches as 1 in the search server, and the specific object having the small number of searches When the relative value with respect to the number of object searches is set to 0, the interval is divided into a predetermined number of groups, and the number of search for the determination target for performing the hole spot degree determination is smaller than the number of search for the specific target with a small number of searches Is determined to belong to the group corresponding to 0, and the hole spot degree is determined. Therefore, the search server can obtain a degree of squeeze in relation to names with a large number of searches and names with a small number of searches.

  9) In the hole location information providing computer according to the present invention, A) storage means for storing detailed data including IDs and names for a plurality of specific objects, and B) each name is searched as a search key every predetermined time. First search total number acquisition means for acquiring the number of searches performed from a network-connected search server; C) a search for a determination object for determining a hole spot degree among a plurality of objects stored in the storage means When the number of searches is smaller than a predetermined value over a predetermined period with reference to the change history of the number, the determination target object is provided with a hole degree determination means for determining the determination object as a hole object. Therefore, based on this determination, it is possible to provide an objective secret spot object based on the change history.

  10) In the hole location information providing computer according to the present invention, the hole degree determining means normalizes the number of searches and the number of fluctuations of the determination object and makes the determination. Therefore, it is possible to provide hole information in consideration of the change history of a plurality of determination objects.

  11) In the hole location information providing computer according to the present invention, A) storage means for storing detailed data including ID and name for a plurality of specific objects, and B) each of the specific objects acquired from a network-connected search server A relative value between the number of searches in which each name of an object is searched as a search key and the number of specific object searches in which a predetermined name of the specific object is searched as a search key, and the determination target is a secret spot As a hole degree indicating that, a hole degree storage means for storing in association with each specific object, C) When a search request specifying a search condition is given from a networked user computer, from the storage means, The specific object that matches the search condition is extracted, and for the extracted specific object, the hole degree is read from the hole degree storage means, and the hole Rearranged the time order, and a beaten path information providing means for providing information to the user.

  12) The hole location information providing computer according to the present invention includes: A) storage means for storing detailed data including ID and name for a plurality of specific objects; B) among a plurality of objects stored in the storage means; For the determination object for determining the hole spot degree, referring to the fluctuation history of the number of searches, the hole degree storage means for storing a determination object having a predetermined number or more and a small number of searches as a determination object having a high hole degree, C) When a search request specifying a search condition is given from a user computer connected to the network, a specific object that matches the search condition is extracted from the storage means, and the degree of holeiness is extracted for the extracted specific object. There is provided hole information providing means for reading out from the hole degree storage means, rearranging in order of the hole degree, and providing information to the user. Therefore, it is possible to provide an objective target for an objective hole based on the change history.

  13) The hole information providing method according to the present invention is a hole information providing method in which detailed data including IDs and names are stored for a plurality of specific objects in a computer storage medium, and the computer executes the following steps: . A) A step of acquiring the number of searches in which each of the names is searched as a search key at a predetermined time from a search server connected to the network, and B) A name of a predetermined specific object at a predetermined time is a search key. Acquiring from the search server the number of specific object searches retrieved as C, and C) among the plurality of stored objects, the number of searches and the specific object A step of obtaining a relative value with respect to the number of searches as a hole degree indicating that the determination target is a hole.

  Thus, not absolute searches for said specific object, seeking a relative value as the beaten path degree. As a result, the degree of vacancy based on objective data such as the number of searches in the search engine can be obtained. Also, by a relative value, it is possible to determine the beaten path of the relative relationship do not know the absolute value.

  14) A program according to the present invention is a program for causing a computer to function as the following means. A) Storage means for storing detailed data including IDs and names for a plurality of specific objects, and B) obtaining the number of searches for each name as a search key at a predetermined time from a search server connected to the network. First search total number acquisition means for performing, C) second search total number acquisition for acquiring, from the search server, a specific target object search number in which a predetermined specific object name is searched as a search key every predetermined time Means D) of the plurality of objects stored in the storage means, with respect to the determination object for which the hole degree determination is performed, the determination object indicates the relative value between the search number and the specific object search number. A hole degree calculation means for obtaining a hole degree indicating that the hole is a hole.

  Thus, not absolute searches for said specific object, seeking a relative value as the beaten path degree. As a result, the degree of vacancy based on objective data such as the number of searches in the search engine can be obtained. Further, by using the relative value, it is possible to determine the degree of hole location based on a relative relationship that is not known from the absolute value.

It is a functional block diagram of the secret spot information providing system 1. It is a figure which shows an example of the hardware constitutions which implement | achieved the secret spot information provision server 10 using CPU. It is a figure which shows the data structure of a registration spot table. It is a figure which shows the data structure of a similar name table. It is a figure which shows the data structure of a comment table. It is a figure which shows the data structure of a registration spot search number table. It is a figure which shows the data structure of a reference | standard spot search number table. It is a figure which shows the flowchart of the rare degree update process of the main program 26p. It is a figure which shows the screen transition from an initial screen. It is a figure which shows an example of a registration screen. It is a figure which shows the flowchart in a terminal. It is a figure which shows the screen transition from a similar place confirmation. It is a figure which shows the screen transition of the screen of a search process. It is a figure which shows the flowchart of the rare degree update process of the main program 26p. It is a figure which shows the fluctuation | variation of the number of searches.

Embodiments of the present invention will be described below with reference to the drawings.
(1. Functional block diagram)
In FIG. 1, the functional block diagram of the hole location information provision system 1 concerning this embodiment is shown.

  The secret spot information providing system 1 includes a search server 20, a secret spot information providing server 10 connected to the search server 20 via a network, and user terminals 21 a to 21 n connected to the secret spot information providing server 10 via a network.

  The hole location information providing computer 10 includes a storage unit 3, a first search total number acquisition unit 4, a second search total number acquisition unit 5, a hole degree calculation unit 6, and a hole location information provision unit 7.

  The storage means 3 stores detailed data including IDs and names for a plurality of recommended tourist spots. The first total search number acquisition unit 4 acquires the number of searches in which each name is searched as a search key from the search server 20 connected to the network every predetermined time. The second search total number acquisition unit 5 acquires, from the search server 20, the number of specific tourist spot searches that are searched using a predetermined name of a specific tourist spot as a search key every predetermined time.

  The vacancy degree calculating means 6 calculates the relative value between the number of searches and the number of specific sight spot searches for the determination target sight spot for determining the degree of vacancy degree among the plurality of sightseeing spots stored in the storage means 3. It is calculated as a degree of hole spot indicating that the sightseeing spot to be judged is a hole spot.

  When the search request specifying the search condition is given from the network-connected user computers 21a to 21n, the hole location information providing means 7 sets the degree of hole availability together with the detailed data for the tourist spot that matches the search condition. Provide information to users.

  As described above, the cumulative number of searches per unit time in which the registered spot name is searched by the search number server 20 and the cumulative number of searches per unit time in which the name of the reference spot is searched by the search number server 20 are relative. An objective judgment can be made by judging the degree of holeiness according to the relationship.

(2. Hardware configuration)
A hardware configuration of the hole location information providing server 10 illustrated in FIG. 1 will be described with reference to FIG. The figure shows an example of a hardware configuration in which the hole location information providing server 10 is configured using a CPU.

  The hole location information providing server 10 includes a CPU 23, a memory 27, a hard disk 26, a monitor 30, an optical drive 25, an input device 28 (mouse 28 a, keyboard 28 b), and a bus line 29. CPU23 via the bus line 29 in accordance with the program stored in the hard disk 26 to control each unit.

  The hard disk 26 stores an operating system program (hereinafter abbreviated as OS) 26o and a main program 26p. In the present embodiment, LINUX (registered trademark or trademark) is employed as the OS 26o. However, the present invention is not limited to this.

  Each of the above programs is read from the CD-ROM 25a storing the program via the optical drive 25 and installed in the hard disk 26. In addition to the CD-ROM, a program such as a flexible disk (FD) or an IC card may be installed on a hard disk from a computer-readable recording medium. Furthermore, it may be downloaded using a communication line.

  In the present embodiment, the program stored in the CD-ROM is indirectly executed by the computer by installing the program from the CD-ROM to the hard disk 26. However, the present invention is not limited to this, and the program stored in the CD-ROM may be directly executed from the optical drive 25. Note that programs that can be executed by a computer are not only programs that can be directly executed by being installed as they are, but also programs that need to be converted into other forms (for example, those that have been compressed) In addition, those that can be executed in combination with other module parts are also included.

  The data structure of various information in the hard disk 26 will be described. FIG. 3 shows the registered spot table 26t. The registered spot table 26t stores “id”, “name”, “address”, “GPS data”, “recommended degree by the number of people”, and “rare degree today”. Each registered spot is point data registered by the user logging in. The calculation method of “today's rare degree” will be described later.

  FIG. 4 shows the alias table 26r. The alias table 26r is a table for referring to whether there is another specific name such as a common name or a formal name for the registered spot shown in FIG. In this case, it can be seen that “To-ji” with id = 1 in FIG. 3 has names of “Kyogo Gokoku-ji”, “Kobo-san”, and “Maya Hachimanzan Sobu Fugen-in”.

  FIG. 5 shows the comment table 26c. The comment table 26c is a comment when registering the spot.

  FIG. 6 shows a registered spot search number table 26k, and FIG. 7 shows a reference spot search number table 26s. The total number of searches for the corresponding search word is acquired from the search engine 20 and added. In the present embodiment, since one day is adopted as the unit period, the number of searches for each date is stored. FIGS. 6B and 7B are obtained by adding data of 2009/9/5 to FIGS. 6A and 7A, respectively.

  As for the reference spot search number table, names may be stored together.

  Note that the user computer is a personal computer with a normal browser program installed and a mobile phone with a browser function, and thus the description thereof is omitted. The search server 20 is a search server capable of searching on the Internet such as Google (registered trademark).

(3. Flow chart)
Various processes based on the main program 26p of the secret spot information providing server 10 will be described.

3.1 Rare degree update process The CPU 23 of the secret spot information providing server 10 executes the rare degree update process shown in FIG. 8 every predetermined time. In this embodiment, 24 hours is adopted as the predetermined time, but it may be longer or shorter than this.

  The CPU 23 requests the search server 20 (see FIG. 1) to send the total number of searches for today for the names of the spots stored in the registered spot search number table and the reference spot search number table (step S1 in FIG. 8). The search server 20 transmits the total number of searches for each spot to the secret spot information providing server 10.

  The CPU 23 determines whether or not to receive data from the search server 20 (step S3 in FIG. 8). When the data is received, the number of searches is added to the search number table (step S5). Here, as shown in FIGS. 6B and 7B, it is assumed that data of 2009/9/5 has been added.

  The CPU 23 calculates today's rare degree based on the number of searches (step S7). In the present embodiment, the rarity is calculated as follows. First, today's average value AV (k) in the reference spot search number table is obtained, and today's number of searches for each registered spot is divided by the average value AV (k). Classify into multiple classes according to the division value.

  In the present embodiment, when the division value is 0 or more and less than 0.01, class “5”, 0.01 or more and less than 0.05 is class “4”, 0.05 or more and less than 0.15 is class “3”, and 0.15 or more and less than 0.2 is class “3”. Although “2”, 0.2 or higher is class “1”, it is not limited to this.

  In this case, the average value AV (k) = (112,304 + 90,967 + 97,170 + 102,736) /4=100794.25, and the relative value of id “1” is 7339 / 100794.25 = 0.07. 3 ”. Hereinafter, since id “2” is 4170 / 100794.25 = 0.04, today's rarity is class “4”. Similarly, today's rare degree is calculated for each spot.

 The CPU 23 updates the value of “today's rare degree” in the registered spot table (step S9 in FIG. 8).

  In this manner, the “today's rare degree” for each registered spot is determined.

3.2 Use by User Computer Next, a process for providing hole information using the “today's rareness” will be described. Below, the case where the user computer 21n is a mobile phone terminal will be described.

  When accessing the hole location information providing server 10 from the user computer 21n, the CPU 23 transmits a login screen 41 as shown in FIG. 9 to the user computer. When such an image is displayed by the browser program of the user computer 21n and the user performs login processing, the secret spot information providing server 10 transmits the main screen 43 to the user computer 21n. On the main screen 43, selection boxes 43a and 43b for selecting “registration processing” or “search processing” are displayed. Since the screen to be transmitted to the user computer 21n and the process for transmitting it are the same as those of a general WEB server, the description thereof will be omitted.

3.2.1 Registration Process A process when the button 43a is selected on the main screen 43 in FIG. 9 will be described. The secret spot information providing server 10 transmits data for displaying the “registration screen” to the user computer 21n. Details of the “registration screen” are shown in FIG.

  A browser program is installed in the user computer 21n and performs the process shown in FIG. The process shown in FIG. 11 is a process by a normal browser program. Briefly, the screen shown in FIG. 10 is displayed (step S31), and when an event is given, the type of event is determined (step S33). For example, when a character is input to the input box 51 in a state where the “registration screen” shown in FIG. 10 is displayed, the character is input to the selected input box (step S37).

  If the up and down cursor keys are selected, it is determined that the command is a movement command, and selection box change processing is performed (step S35). If the enter key is pressed in the selection box, the corresponding command is executed (step S39).

  That is, the user inputs a place name in the input box 51, inputs an address in the input box 57, inputs a comment in the input box 59, inputs a recommendation level for the number of people in the box 61, and enters the registration button 63. When the cursor is moved and a determination key (not shown) is pressed down, the registered spot input by the user is transmitted to the hole location information providing server 10. When the hole location information providing server 10 receives the registered spot, it adds information to the registered spot table.

  For GPS data, when the GPS acquisition button 55 shown in FIG. 10 is selected and the determination key is pressed, the current location information is acquired by the user computer, so the cursor is moved to the registration button 63 and determined. When the key is pressed, such information is also transmitted to the hole location information providing server 10 together.

  In the present embodiment, “similar place search” is enabled at the time of registration. This is because the same spot may be registered with a different spot name depending on the registrant. In the similar place search process, when the area 53 shown in FIG. 10 is selected and the determination key is pressed, a similar place search process request is made to the hole location information providing server 10.

  The details of the similar place search process in the secret spot information providing server 10 will be described below.

  The CPU 23 extracts a registered spot near the given point. As for the vicinity, when the region 53 is selected and the determination key is pressed, the GPS position data is transmitted to the user computer 21n together, and the CPU 23 of the hole location information providing server 10 A registered spot whose distance is within a predetermined value may be extracted. The CPU 23 generates screen data displaying the extracted spot name and transmits it to the user computer 21n. Thereby, the similar place confirmation screen 70 shown in FIG. 12 is displayed on the user computer 21n.

  The user is looking at the display, if there is likely there is a possibility of the registered spot, this is selected from the box 71. Thereby, the detailed request of the selected place is transmitted from the user computer 21n to the hole information providing server 10. CPU23 of little-known spot information providing server 10 transmits the detailed display screen data of the spot "similar place A" to the user computer 21n. As a result, the similar place content confirmation screen 75 shown in FIG. 12 is displayed on the user computer 21n.

  The user sees such a display, and if the spot is the same as the spot he / she wishes to register, the user can input a comment in the comment input box 72, select the registration button 74, and press down the enter key. As a result, data is transmitted from the user computer 21 n to the hole location information providing server 10. The CPU 23 of the secret spot information providing server 10 adds the given data.

  When the user wants to input after viewing the comment in a state where the similar place content confirmation screen shown in FIG. 12 is displayed on the user computer 21n, the user selects the comment screen display area 76 and presses the enter key. Just do it. As a result, a request for comment display screen data is made, and the comment display screen 77 is displayed on the user computer 21n.

  If there is no spot similar to the spot to be registered when the similar place confirmation screen shown in FIG. 12 is displayed on the user computer, the “registration screen” in FIG. 10 is selected by selecting the button 78. Is transmitted to the user computer, the registration process already described may be performed.

3.2.2 Search Process Next, a process when the button 43b is selected in FIG. 9 will be described. Below, the case where the surrounding hole spot search using GPS data is performed with the user computer 21a is demonstrated as an example.

  In FIG. 9, when “search processing” is selected, the user computer 21 a makes a “search screen” request to the secret spot information providing server 10. The secret spot information providing server 10 transmits display data of the “search screen” to the user computer 21a.

  The user computer 21a performs display processing based on the display data. Thereby, the search screen 80 shown in FIG. 13 is displayed. The user operates the cursor, selects the GPS acquisition button 83, and presses the enter key. The user computer 21a acquires current GPS position data by the GPS unit. The acquired position data is displayed in the input box 81. In this state, the user selects the search button 82 and presses the enter key. Thereby, a search processing request is made to the hole location information providing server 10.

  Search processing in the secret spot information providing server 10 will be described with reference to FIG. The CPU 23 extracts a registered spot near the point of the given position data (step S41 in FIG. 14). Since the registration spot extraction process in the vicinity has already been described, the description thereof will be omitted. The CPU 23 rearranges the extracted registered spots in order of rarity (step S43). CPU23 sends a registration spot data rearranged in rare degree of order to the user computer 21a (step S45). As a result, a “search result display screen” 90 shown in FIG. 13 is displayed on the user computer 21a. In the search result display screen, registered spots that match the search condition (in this case, the vicinity) are rearranged in order of rarity.

  The user can refer to this and select any of the boxes 91 if he wants to know more details. When either one is selected, a detailed screen request is made to the hole location information providing server 10, and the hole location information providing server 10 transmits corresponding content confirmation screen data to the user computer 21a. As a result, a “content confirmation screen” 92 shown in FIG. 13 is displayed on the user computer 21a. The “content confirmation screen” 92 displays detailed map data and today's rareness. The user can acquire the hole location information with reference to the display.

  Note that the comment request area 93 may be selected when it is desired to refer to a comment on the “content confirmation screen”. The details are the same as in the case of FIG.

  In addition, although the case where GPS position data was acquired and a vicinity search was performed was demonstrated, you may make it search by inputting a search character string (for example, an address, an area name, etc.) in the input box 81, and searching. .

3.3 Rare degree calculation processing In the above embodiment, a reference spot where a considerable number of searches can be expected is determined in advance, and the rare degree is determined based on a relative value with the total number of searches within a predetermined period using these as search keys. did. You may make it judge today's rare degree based on the fluctuation | variation of the total number of searches in each registration spot instead of a relative value with this reference | standard spot.

  For example, for the registered spot A, if the number of searches for half a day until noon today is less than or equal to a predetermined value (for example, 1/5), the degree of rareness is judged to be high. Also good.

  At that time, not only the variation of a single registered spot but also the variation of a plurality of registered spots may be taken into consideration. For example, as for the registration spot A, the same applies to the registration spots B and C even if the number of searches for half a day until noon today is less than a predetermined value (for example, 1/5) as compared to the average for one month. If there is a tendency, it may be determined that the degree of rarity is not high.

  By taking into account variations in the number of searches in the plurality of registered spots, it is possible to determine a tendency that is not known when viewing individual spots. For example, the overall tendency is that the number of searches is about ½, but if only a specific spot is ¼, the degree of rareness may be determined to be high. Further, if the overall tendency is that the number of searches is about twice, but the specific spot is ½, the degree of rareness may be determined to be high. As described above, the degree of rarity may be determined based on the relationship with fluctuations in a plurality of registered spots. Furthermore, it may be compared with the average of the fluctuation tendency of all registered spots. At that time, an average value of fluctuation may be obtained for each, and a value normalized by applying a coefficient so that the average values may be matched may be adopted.

  Specifically, the following examples are given. As shown in FIG. 15, the rare degree of the spot “a” is examined on the basis of the three spots S1, S2, and S3.

  Spots S1 at a certain time t, S2, S3 average access speed of the S0 (t) is represented by the formula (1).

(S1 (t) + S2 (t) + S3 (t)) / 3 Formula (1)
The average a0 of the number of accesses over the time period t0 to t1 is obtained by dividing the value obtained by integrating S0 (t) from t0 to t1 by (t1−t0) (hereinafter, S (t) in the time period t0 to t1. The average of (Av (S)).

  However, in this a0, the average of the spot S3 in the example of FIG. 15 is too small compared to the other two, and the overall average is lowered (to calculate by the class definition described in 3.1). It may not be appropriate as a standard. In such a case, each of S2, S3 may be multiplied by a constant so that the average of the other two (S2, S3) matches the maximum (for example, S1) of the averages of S1, S2, S3.

  Further, in this method, the enlargement ratio of S3 is very large, and the fluctuation is also enlarged and evaluated. Therefore, when it is desired to avoid this, the average value of S3 is matched with S1 and the fluctuation of S3 is changed. Should not be enlarged. Specifically, the following may be performed.

  V (t) = S3 (t) −Av (S3) is set (Av (V) = 0).

  In order to examine the variation of S1 and S3 due to t, the standard deviation σ1 of S1 and the standard deviation σ3 of S3 are obtained.

  Let W (t) = V (t) * (σ1 / σ3) + Av (S1). Then, the standard deviation of W (t) is equal to the standard deviation σ1, the average value is also Av (w) = Av (S1), and the variation in the graph is similar to the original S3.

  By using the W thus obtained in place of S3 (similarly converting S2) and obtaining the above-mentioned S0, it is possible to more appropriately evaluate the rare degree of the spot a based on the fluctuations of all the reference points. it can.

  Further, the registration spot and / or the reference spot, may be determined rarity grouped by genre.

  There are also sightseeing spots where the number of searches varies over time. For example, there are spots where many people pay attention in the summer in the summer, but there are few visitors in the winter. When judging based on the change history, if the visitor fluctuates depending on the time as described above, an average value for each season may be used. Even when using a reference point, in consideration of these, it is sufficient to change the reference spot in accordance with the timing.

  In addition, as a seasonal problem, there is a periodic tendency as well as a long-term tendency such as the four seasons. For example, there are cases where there are more or less Saturdays as days of the week. When using the variation in the number of searches, an average value for each day of the week may be used.

  In addition, rather than at the discretion of each day, by limiting the time zone, it is also possible to determine the rarity. For example, it may be compared with the average number of searches for the past month in the morning or from 10:00 to 12:00. Thereby, the rare degree which considered the time slot | zone where the number of searches is unevenly distributed can be calculated | required. In addition, about this time slot | zone, what is necessary is just to select arbitrarily, without being limited to the above.

(4. Other embodiments)
In the above embodiment, a reference spot that can be expected to have a considerable number of searches is determined in advance, and the degree of rarity is high when the value is lower than a predetermined value due to a relative value with the total number of searches in a predetermined period using these as search keys. It was judged. This is because the search processing searched by the search server and the current attention level are considered to have some correlation. Thereby, it is possible to supply information by assuming that a registered spot that is not attracting much attention from the general public is a secret spot.

  For such a reference spot, a minority reference spot that is expected to have a considerable number of searches may be adopted. In this case, it can be determined that the degree of rarity is high when the total number of searches per unit time in each of the obtained registration spots is close to or less than the minority reference spot. For example, in its name in order for general tourism course it does not include a case such as that a small number of searches.

  Alternatively, both the minority reference spot and the majority reference spot may be adopted, and the degree of rarity may be determined based on the distance between the two and the distance between them. In this case, the number of divisions between the two may be determined, and the classification may be performed equally.

  In the above embodiment, the plurality of classes are divided according to the relative value, but the relative value itself may be used as the rare degree.

  Further, it is also possible to make a comprehensive judgment using both the relative value with respect to the average value at the reference spot and the change history. In this case, it may be applied under the and condition, or may be applied under the or condition. As the former, for example, a sample whose relative value with respect to the average value at the reference spot is equal to or smaller than a threshold value is extracted, and only those having a high fluctuation history are extracted. As the latter, a sample having a relative value with respect to the average value in the reference spot is not more than a threshold value, and a sample that is not included but has a high fluctuation history is added.

  In the above embodiment, the reference spot is determined from other than the registered spot, but may be selected from the registered spot. In this case, a flag indicating that the spot is a reference spot may be provided in the registered spot table, and the search may thereby be performed. In this way, by using the registered spot stored in the registered spot table as the reference spot, the rarity can be further corrected. For example, for the registered spot A, by obtaining a coefficient obtained by dividing the average value of the recommended degree of the registered spot A by the average recommended degree of the reference spot for the obtained rare degree, and multiplying the obtained rare degree Can be corrected. As a result, it is possible to determine that a registered spot with a small number of searches although the evaluation is high has a high degree of rareness.

  In addition, the rare degree of demand, rather than the average of the recommendation degree, may be corrected by the number of comments.

  Moreover, comments similarly, it may be corrected using the average value in the registration spot of the same rarity.

  In the present embodiment, a registered spot such as a sightseeing spot has been described as an example. However, the present invention can be similarly applied to information such as books, other products such as music CDs, restaurants, menus in restaurants, and the like.

  In the above embodiment, in order to realize the functions shown in FIG. 1, using a CPU 23, this is achieved by software. However, some or all of them may be realized by hardware such as a logic circuit. Note that a part of the processing of the program may be executed by the OS.

Claims (14)

A secret spot information providing system comprising: a secret spot information providing computer connected to a search server via a network; and a user terminal connected to the secret spot information providing computer via a network,
The hole location information providing computer comprises the following means:
Storage means for storing detailed data including ID and name for a plurality of recommended tourist spots,
First search total number acquisition means for acquiring, from the search server connected to the network, the number of searches in which each of the names is searched as a search key every predetermined time;
Second search total number acquisition means for acquiring, from the search server, a specific tourist spot search number in which a predetermined name of a specific tourist spot is searched as a search key every predetermined time;
Among the plurality of sightseeing spots stored in the storage means, for the determination target tourist spot for determining the degree of vacancy, the relative value between the number of searches and the number of specific tourist spot searches is determined. A hole degree calculation means for obtaining a hole degree representing a certain thing,
When a search request specifying a search condition is given from a network-connected user computer, a hole location information providing means for providing the user with information about the degree of hole availability together with the detailed data for a tourist spot that matches the search condition,
A secret information providing system characterized by Storage means for storing detailed data including ID and name for a plurality of specific objects,
First search total number acquisition means for acquiring, from the search server connected to the network, the number of searches in which each of the names is searched as a search key every predetermined time;
Second search total number acquisition means for acquiring, from the search server, a specific object search number in which a predetermined specific object name is searched as a search key every predetermined time;
Among the plurality of objects stored in the storage means, for the determination object for determining the degree of hole spot, the relative value between the number of searches and the number of specific object searches is determined, and the determination object is a hole Hole hole degree calculating means for obtaining hole hole degree representing
A computer for providing information on a secret spot characterized by comprising: In the hole location information providing computer according to claim 2,
The hole degree calculation means further refers to a time-series fluctuation history of the determination object, and when the number of searches fluctuates in a direction in which the number of searches decreases by a predetermined ratio or more, the determination object is Judging that it is an object,
A secret information providing computer characterized by The computer for providing hole information according to claim 6,
When the number of searches fluctuates in a direction in which the number of searches decreases by a predetermined ratio or more as compared to the time-series fluctuation history of the number of specific target searches, the determination target object is Judging that it is a secret object,
A secret information providing computer characterized by In the hole location information providing computer according to claim 2,
The name of the predetermined specific object is arbitrarily selected from those having a large number of searches in the search server,
A secret information providing computer characterized by In the hole location information providing computer according to claim 2,
The name of the predetermined specific object is arbitrarily selected from those having a small number of searches in the search server,
A secret information providing computer characterized by In the hole location information providing computer according to claim 5 or 6,
The hole degree calculation means stores a threshold value indicating that the hole is a hole with respect to a relative value with respect to the number of searches for the specific object, and when the obtained relative value is equal to or less than the threshold, Judging that there is,
A secret information providing computer characterized by In the hole location information providing computer according to claim 2,
In the search server, the hole degree calculation means sets the relative value for the number of searches for the specific object with a large number of searches as 1, and sets the relative value for the number of searches for the specific object with a small number of searches as 0, If the number of determination objects to be divided into a predetermined number of groups and the determination of the degree of vacancy is smaller than the number of searches for the specific object with a small number of searches, it belongs to the group corresponding to 0, Determining the degree of vacancy,
A secret information providing computer characterized by Storage means for storing detailed data including ID and name for a plurality of specific objects,
First search total number acquisition means for acquiring, from the search server connected to the network, the number of searches in which each of the names is searched as a search key every predetermined time;
Of the plurality of objects stored in the storage means, with respect to the determination object for determining the hole spot degree, with reference to the change history of the number of searches, when the number of searches is less than a predetermined value over a predetermined period , The determination target is a hole degree determination means for determining as a hole target,
A computer for providing information on a secret spot characterized by comprising: The hole location information providing computer according to claim 9,
The hole degree determination means normalizes the number of searches and the number of fluctuations for the determination object, and performs the determination;
A secret information providing computer characterized by Storage means for storing detailed data including ID and name for a plurality of specific objects,
The number of searches in which each name of each specific object acquired from a search server connected to the network is searched as a search key, and the number of specific object searches in which a predetermined name of the specific object is searched as a search key A hole degree storage means for storing the relative value as a hole degree indicating that the determination object is a hole, in association with each specific object,
When a search request specifying a search condition is given from a user computer connected to the network, a specific object that matches the search condition is extracted from the storage means, and the degree of holeiness is extracted for the extracted specific object. Hole location information providing means that reads out from the hole degree storage means, rearranges in order of the hole degree, and provides information to the user;
A computer for providing information on a secret spot characterized by comprising: Storage means for storing detailed data including ID and name for a plurality of specific objects,
Among the plurality of objects stored in the storage means, with respect to the determination object for determining the degree of vacancy, refer to the fluctuation history of the number of searches, and determine a determination object having a number of searches that is equal to or greater than a predetermined value and having a small number of searches. Hole degree storage means for storing as a high judgment object,
When a search request specifying a search condition is given from a user computer connected to the network, a specific object that matches the search condition is extracted from the storage means, and the degree of holeiness is extracted for the extracted specific object. Hole location information providing means that reads out from the hole degree storage means, rearranges in order of the hole degree, and provides information to the user;
A computer for providing information on a secret spot characterized by comprising: A method for providing hole information, wherein detailed data including IDs and names are stored in a computer storage medium, and the computer executes the following steps.
Obtaining a number of searches for each name as a search key for each predetermined time from a network-connected search server;
Acquiring from the search server the number of specific object searches for which a predetermined specific object name is searched as a search key every predetermined time;
Among the plurality of stored objects, for a determination object for determining the degree of hole spot, a relative value between the number of searches and the number of specific object searches is a hole field indicating that the determination object is a hole hole Step to find as a degree. A program for causing a computer to function as the following means.
Storage means for storing detailed data including ID and name for a plurality of specific objects,
First search total number acquisition means for acquiring, from the search server connected to the network, the number of searches in which each of the names is searched as a search key every predetermined time;
Second search total number acquisition means for acquiring, from the search server, a specific object search number in which a predetermined specific object name is searched as a search key every predetermined time;
Among the plurality of objects stored in the storage means, for the determination object for determining the degree of hole spot, the relative value between the number of searches and the number of specific object searches is determined, and the determination object is a hole Hole hole degree calculation means for obtaining the hole hole degree representing

Images