Information processing system, information processing device, information processing method, and program

Abstract

To provide technology that allows users to search for rare facilities. [Solution] An information processing system according to one aspect of the present disclosure is an information processing system including a server and a client, wherein the server has a first calculation unit that calculates a first evaluation value that evaluates the rarity of a facility from a predetermined viewpoint, and a creation unit that creates display data including the first evaluation value and information for displaying the facility on a map, and the client has a display control unit that displays the facility on the map based on the display data, and the display control unit searches for the facility on the map based on a value specified by the user for the first evaluation value and the first evaluation value.

Description

Technical Field

[0001] The present disclosure relates to an information processing system, an information processing apparatus, an information processing method, and a program.

Background Art

[0002] Techniques for searching for a desired target have been conventionally known. For example, Patent Document 1 discloses a technique capable of searching for facilities that match the purpose set by the user within a target area set by the user. Also, for example, Patent Document 2 discloses a technique capable of searching for facilities that match the user's preferences and are likely to catch the user's eye.

Prior Art Documents

Patent Documents

[0003] ;

Patent Document 1

Patent Document 2

Summary of the Invention

Problems to be Solved by the Invention

[0004] However, for example, when searching for a predetermined facility, there has been no technique capable of searching for a rare facility.

[0005] The present disclosure has been made in view of the above points, and an object thereof is to provide a technique capable of searching for a rare facility.

Means for Solving the Problems

[0006] An information processing system according to one aspect of the present disclosure is an information processing system including a server and a client, wherein the server has a first calculation unit that calculates a first evaluation value that evaluates the rarity of a facility from a predetermined perspective, and a creation unit that creates display data including the first evaluation value and information for displaying the facility on a map, and the client has a display control unit that displays the facility on the map based on the display data, and the display control unit searches for the facility on the map based on a value specified by a user for the first evaluation value and the first evaluation value. [Effects of the Invention]

[0007] You can search for rare facilities. [Brief explanation of the drawing]

[0008] [Figure 1] This figure shows an example of the overall configuration of the system according to this embodiment. [Figure 2] This figure shows an example of the functional configuration of the server and client according to this embodiment. [Figure 3] This flowchart shows an example of the score setting process according to this embodiment. [Figure 4] This sequence diagram shows an example of the shrine and temple display processing according to this embodiment. [Figure 5] This is a diagram showing an example of a display screen for shrines and temples. [Figure 6] This figure shows an example of display control for shrines and temples based on scarcity scores or visitor flow scores. [Figure 7] This figure shows an example of a computer hardware configuration. [Modes for carrying out the invention]

[0009] Hereinafter, one embodiment of the present invention will be described in detail with reference to the drawings. In the following embodiment, a system 1 capable of searching for rare facilities will be described.

[0010] In the following, as an example, we will focus on shrines and temples as facilities and evaluate their rarity from three perspectives: foot traffic, building area, and difficulty of access. This is because the less foot traffic there is (i.e., the fewer people who visit the shrine or temple), the fewer visitors there are, the less it has been commercialized, and the higher its rarity is considered to be. Also, the smaller the building area, the more likely it is to be a shrine or temple that is not well known to people (e.g., a small shrine or Jizo statue), and therefore the higher its rarity is considered to be. Furthermore, the more difficult it is to access a shrine or temple (e.g., a shrine or temple far from a highway), the fewer visitors there are, and therefore the higher its rarity is considered to be. This makes it possible to search for shrines and temples with high rarity (i.e., shrines and temples with high scarcity). For example, this makes it possible to guide tourists who have a relatively strong interest in shrines and temples (e.g., foreign visitors to Japan who have a relatively strong interest in Japanese culture, including shrines and temples) to shrines and temples with high rarity, and it is expected that this will lead to the revitalization of business activities at surrounding commercial facilities.

[0011] However, the three perspectives mentioned above are merely examples for evaluating the rarity of shrines and temples, and other perspectives (e.g., the history of shrines and temples, the status of shrines and temples, etc.) may also be used. Furthermore, focusing on shrines and temples as facilities is just one example; other facilities (e.g., commercial facilities, schools, structures such as dams, tourist destinations, etc.) may also be included.

[0012] <Example of the overall configuration of System 1> As shown in Figure 1, the system 1 according to this embodiment includes a server 10 and a client 20. The server 10 and the client 20 are connected to each other via a communication network 30, such as the Internet.

[0013] Server 10 sets a score (hereinafter also referred to as the "rarity score") for shrine and temple data, which includes various information such as the names and location information (latitude, longitude, etc.) of the shrines and temples, evaluating the rarity of each shrine or temple from three perspectives: human flow, building area, and difficulty of access. When Server 10 receives a display request sent from Client 20, it returns display data to display the shrines and temples located within the geographical area requested in the display request. Here, the shrine and temple data includes the names of the shrines and temples (hereinafter also referred to as the "shrine / temple names") and location information (latitude, longitude, etc.) of the shrines and temples. The shrine and temple data may also include various other information (e.g., the classification of whether it is a shrine or a temple, the address, the rank of the shrine if it is a shrine, the rank or sect if it is a temple, the building area of ​​the shrine or temple, etc.). Server 10 is implemented by, for example, an information processing device (computer) such as a general-purpose server or a system composed of such devices.

[0014] Client 20 sends a request to Server 10 to display shrines and temples. Based on the display data returned by Server 10 in response to the request, Client 20 displays shrines and temples on the map (more precisely, displays display components such as icons representing shrines and temples). Furthermore, Client 20 controls the display or hiding of shrines and temples on the map (more precisely, controls the display or hiding of display components such as icons representing shrines and temples) based on the rarity score of the shrines and temples that can be displayed on the map. In addition, Client 20 controls the display or hiding of shrines and temples on the map based on the pedestrian flow score, which is an evaluation value of the pedestrian flow to the shrines and temples that can be displayed on the map. Client 20 can be implemented by an information processing device (computer), such as a personal computer, smartphone, tablet terminal, wearable device, or game console.

[0015] Note that the overall configuration of System 1 shown in Figure 1 is just one example and is not limited to this. For example, System 1 may include various devices and equipment other than Server 10 and Client 20.

[0016] <Functional configuration example of server 10 and client 20> <<Functional configuration example of server 10>> As shown in FIG. 2, the server 10 according to the present embodiment includes a first score calculation unit 101, a second score calculation unit 102, a third score calculation unit 103, a fourth score calculation unit 104, a score setting unit 105, and a UI providing unit 106. Each of these units is realized, for example, by a process in which one or more programs installed in the server 10 are executed by an arithmetic device such as a CPU (Central Processing Unit). Further, the server 10 according to the present embodiment has a shrine and temple DB 107. The DB (database) is realized, for example, by a storage area of a storage device such as an HDD (Hard Disk Drive), an SSD (Solid State Drive), or a flash memory. Note that the shrine and temple DB 107 may be realized by a storage area of a storage device (e.g., a storage device of a database server) communicably connected to the server 10.

[0017] The first score calculation unit 101 calculates a flow score, which is an evaluation value of the flow of people in the shrine or temple represented by the shrine or temple data, based on the shrine or temple data stored in the shrine and temple DB 107.

[0018] The second score calculation unit 102 calculates a building area score, which is an evaluation value of the building area of the shrine or temple represented by the shrine or temple data, based on the shrine or temple data stored in the shrine and temple DB 107.

[0019] The third score calculation unit 103 calculates a reachability score, which is an evaluation value of the difficulty of reaching the shrine or temple represented by the shrine or temple data, based on the shrine or temple data stored in the shrine and temple DB 107.

[0020] The fourth score calculation unit 104 calculates a scarcity score representing the rarity of a shrine or temple based on the pedestrian flow score, building area score, and difficulty of access score of the shrine or temple represented by the shrine or temple data stored in the shrine or temple DB 107. For example, the fourth score calculation unit 104 may calculate the rarity score as the average value of the pedestrian flow score, building area score, and difficulty of access score represented by each shrine or temple data. However, this is just one example, and a value other than the average may be calculated as the rarity score. For example, the weighted sum of the pedestrian flow score, building area score, and difficulty of access score may be calculated as the rarity score.

[0021] The score setting unit 105 sets the rarity score and the crowd flow score for the shrine and temple data stored in the shrine and temple DB 107. The score setting unit 105 may set the rarity score and the crowd flow score by, for example, adding the rarity score and the crowd flow score as information included in the shrine and temple data, by attaching the rarity score and the crowd flow score as metadata for the shrine and temple data, or by associating the shrine and temple data with the rarity score and the crowd flow score.

[0022] When the UI provider 106 receives a display request from the client 20, it retrieves data on shrines and temples located within the geographical area requested in the display request from the shrine and temple database 107, and then creates display data to display the shrines and temples on the map based on this data. The UI provider 106 also returns this display data to the client 20 that sent the display request.

[0023] Shrine and Temple Database 107 stores data on shrines and temples that includes at least the name of the shrine or temple and its location information. Specifically, for each shrine or temple, the Database 107 stores data that includes at least the name of the shrine or temple and its location information.

[0024] ≪Example of Client 20 Functional Configuration≫ As shown in Figure 2, the client 20 according to this embodiment has a UI control unit 201. The UI control unit 201 is implemented, for example, by having one or more programs installed on the client 20 (e.g., one or more programs including a web browser or a dedicated application program) execute a process on a processing unit such as a CPU.

[0025] The UI control unit 201 sends a request to the server 10 to display shrines and temples. The UI control unit 201 then displays shrines and temples (more precisely, display components such as icons representing shrines and temples) on the map based on the display data returned from the server 10 in response to the display request. Furthermore, the UI control unit 201 controls the display or hiding of shrines and temples on the map (more precisely, controls the display or hiding of display components such as icons representing shrines and temples) based on the rarity score or pedestrian flow score of the shrines and temples that can be displayed on the map.

[0026] <Example of score setting process> Below, we will explain an example of the scoring process for assigning rarity scores and visitor flow scores to shrine and temple data, referring to Figure 3.

[0027] The first score calculation unit 101 calculates the pedestrian flow score for each shrine and temple, based on the shrine and temple data stored in the shrine and temple DB 107 (step S101). That is, the first score calculation unit 101 calculates the pedestrian flow score for each shrine and temple, for example, by following steps 11 to 18 of the following procedure.

[0028] Step 11: The first score calculation unit 101 acquires map data representing a predetermined area (e.g., all of Japan). The first score calculation unit 101 may acquire map data from an external map database, for example, via a Web API.

[0029] Step 12: The first score calculation unit 101 divides the map represented by the map data acquired in Step 11 into predetermined meshes (e.g., a mesh of approximately 60m x 60m). Hereinafter, a mesh of approximately 60m x 60m will be referred to as a "7th-order regional mesh," and the map represented by the map data acquired in Step 11 will be assumed to be divided into 7th-order regional meshes.

[0030] Step 13: The first score calculation unit 101 acquires pedestrian flow data for the same area as the map data acquired in Step 11 above. The first score calculation unit 101 acquires pedestrian flow data from an external pedestrian flow database, for example, via a Web API. Pedestrian flow data is a collection of time-series data of location information measured using GPS (Global Positioning System), etc. Each time-series data included in the pedestrian flow data represents the trajectory of a person's location information (i.e., the trajectory of that person's movement), and the pedestrian flow data as a whole represents the flow of people. Pedestrian flow data may also be called, for example, pedestrian flow statistics data or congestion statistics data.

[0031] Step 14: The first score calculation unit 101 uses the human flow data obtained in Step 13 to calculate the number of people whose location information is included in each of the seventh-level regional meshes divided in Step 12 during a predetermined period (e.g., the most recent year) as the first human flow count. At this time, the first score calculation unit 101 ensures that the number is not calculated more than once, even if the same person's location information is included in the same seventh-level regional mesh multiple times during the period. In other words, the first score calculation unit 101 calculates the number of unique people in each seventh-level regional mesh during the period as the first human flow count. As a result, the human flow count is calculated for each of the seventh-level regional meshes.

[0032] However, calculating the number of unique individuals in each 7th-level regional mesh during the period as the first human flow figure is merely one example and not limited to this. For example, the first score calculation unit 101 may calculate the number of location information points included in each 7th-level regional mesh during the period as the first human flow figure for that 7th-level regional mesh.

[0033] Step 15: The first score calculation unit 101 identifies, for each shrine and temple data stored in the shrine and temple DB 107, the 7th-order regional mesh that contains the location information included in the shrine and temple data, from among the 7th-order regional meshes divided in Step 12 above. This identifies the 7th-order regional mesh that contains the shrine or temple represented by each of the shrine and temple data.

[0034] Step 16: For each 7th-order regional mesh identified in Step 15 above, the first score calculation unit 101 calculates a second number of visitors to the shrine or temple, using the shrine or temple data stored in the shrine or temple DB 107 and the first number of visitors for that 7th-order regional mesh. At this time, if there is only one shrine or temple included in a certain 7th-order regional mesh, the first score calculation unit 101 uses the first number of visitors for that 7th-order regional mesh as the second number of visitors for that shrine or temple. On the other hand, if there are multiple shrines or temples included in a certain 7th-order regional mesh, the first score calculation unit 101 uses a value obtained by apportioning the first number of visitors for that 7th-order regional mesh as the second number of visitors for each of those multiple shrines or temples. There are various ways to apportion the first number of visitors, but for example, it is possible to apportion the first number of visitors by the building area of ​​each shrine or temple. Specifically, for example, if a certain 7th-order regional mesh has a first pedestrian flow of x and contains three shrines and temples, and the building areas of each shrine and temple are a, b, and c, then the second pedestrian flow of each shrine and temple will be ax / (a+b+c), bx / (a+b+c), and cx / (a+b+c). This allows the second pedestrian flow of each shrine and temple, as represented by the data stored in the Shrine and Temple DB107, to be calculated.

[0035] The building area of ​​shrines and temples may be included in the shrine and temple data, or it may be obtained from an external database via a Web API or similar.

[0036] Procedure 17: The first score calculation unit 101 uses the second number of visitors for each shrine and temple, as represented by the data for each shrine and temple stored in the shrine and temple DB 107, to calculate the standard score of the second number of visitors for each shrine and temple. However, if the standard score exceeds 100, the value is set to 100. As a result, a value between 0 and 100 is calculated as the standard score of the second number of visitors for each shrine and temple.

[0037] Step 18: The first score calculation unit 101 calculates a visitor flow score for each shrine and temple data stored in the shrine and temple DB 107, using the standard score of the second visitor flow for that shrine or temple, by subtracting the standard score from 100. This provides a visitor flow score for each shrine or temple, where the value is closer to 100 the fewer visitors there are, and closer to 0 the more visitors there are.

[0038] The second score calculation unit 102 calculates the building area score for each shrine and temple, based on the shrine and temple data stored in the shrine and temple DB 107 (step S102). That is, the second score calculation unit 102 calculates the building area score for each shrine and temple, for example, by following steps 21 to 23.

[0039] Step 21: The second score calculation unit 102 obtains the building area of ​​each shrine or temple, as represented by the data for each shrine or temple stored in the shrine or temple DB 107. The second score calculation unit 102 should obtain the building area of ​​each shrine or temple in the same way as in step 16 of step S101 above. However, for shrines or temples for which no building area data exists, 0 should be obtained as the building area for that shrine or temple.

[0040] Procedure 22: The second score calculation unit 102 uses the building area of ​​each shrine or temple, as represented by the data stored in the shrine or temple DB 107, to calculate a standard score for the building area of ​​each shrine or temple. However, if the standard score exceeds 100, the value is set to 100. As a result, a value between 0 and 100 is calculated as the standard score for the building area of ​​each shrine or temple.

[0041] Step 23: The second score calculation unit 102 calculates a building area score for each shrine and temple data stored in the shrine and temple DB 107, using the standard score of the building area of ​​that shrine or temple, by subtracting the standard score from 100. This provides a building area score for each shrine or temple, where the smaller the building area, the closer the score is to 100, and the larger the building area, the closer the score is to 0.

[0042] In step S102 above, the building area of ​​each shrine and temple was evaluated, but for example, the site area could be evaluated instead of the building area. In this case, the evaluation value of the site area may be called the site area score.

[0043] The third score calculation unit 103 calculates the difficulty of reaching each shrine or temple, based on the shrine or temple data stored in the shrine or temple DB 107 (step S103). That is, the third score calculation unit 103 calculates the difficulty of reaching each shrine or temple, for example, by following steps 31 to 33.

[0044] Step 31: The third score calculation unit 103 obtains map data that includes road links within a predetermined range (e.g., all of Japan). The third score calculation unit 103 may obtain map data from an external map database, for example, via a Web API.

[0045] Step 32: The third score calculation unit 103 calculates the distance from each shrine or temple data stored in the shrine or temple DB 107 to the nearest road link (hereinafter also referred to as the nearest road distance). However, if the nearest road distance for a particular shrine or temple exceeds a predetermined maximum value (e.g., 500m), the maximum value is calculated as the nearest road distance for that shrine or temple.

[0046] Step 33: The third score calculation unit 103 uses the nearest road distance of each shrine or temple, as represented by the data of each shrine or temple stored in the shrine or temple DB 107, to calculate the standard score of the nearest road distance for each shrine or temple as the difficulty of reaching it. However, if the standard score exceeds 100, the value is set to 100. As a result, for each shrine or temple, a value between 0 and 100 is calculated as the standard score of the nearest road distance, which represents the difficulty of reaching it. Note that the difficulty of reaching it will be closer to 100 as the nearest road distance increases, and closer to 0 as the nearest road distance decreases.

[0047] In step S103 above, the distance to the nearest road link was evaluated for each shrine and temple. However, for example, instead of (or in addition to) the distance to the nearest road link, the distance to the nearest train station may also be evaluated. Alternatively, for example, the distance to the nearest bus stop may also be evaluated.

[0048] The fourth score calculation unit 104 calculates a rarity score for each shrine or temple, based on the shrine or temple data stored in the shrine or temple DB 107 (step S104). Specifically, for each shrine or temple, the fourth score calculation unit 104 calculates the rarity score for that shrine or temple by taking the average of the pedestrian flow score, the building area score, and the difficulty of accessing the shrine or temple.

[0049] The score setting unit 105 sets a rarity score and a visitor flow score for each shrine and temple data stored in the shrine and temple DB 107 (step S105). As a result, for each shrine and temple data stored in the shrine and temple DB 107, a rarity score is set, which evaluates the rarity of the shrine or temple represented by the data from a predetermined perspective, and a visitor flow score is set, which evaluates the number of visitors to the shrine or temple.

[0050] <Example of shrine and temple display processing> The following describes an example of a shrine and temple display process used by a certain client 20 to display shrines and temples on a map and then control the display or hiding of those shrines and temples based on scarcity scores or pedestrian flow scores, with reference to Figure 4. Hereafter, the screen that displays shrines and temples (more precisely, display components such as icons representing shrines and temples) on the map will be referred to as the "shrine and temple display screen."

[0051] The UI control unit 201 of client 20 receives input of a display instruction that represents an instruction to display shrines and temples on the map (step S201). Examples of display instructions include, for example, accessing a web page to display the shrine and temple display screen, and changing the geographical range to be displayed on the shrine and temple display screen (e.g., transitioning the geographical range, changing the map scale).

[0052] The UI control unit 201 of client 20 sends a display request to server 10 (step S202). The display request includes, for example, information representing the geographical area in which shrines and temples are displayed on the shrine and temple display screen, or the geographical area including it (e.g., the latitude and longitude of the center or diagonal vertices of the geographical area and the scale, identification information of the map tiles constituting the geographical area, etc.).

[0053] When the UI provision unit 106 of the server 10 receives the display request sent in step S202 above, it retrieves shrine and temple data from the shrine and temple DB 107 based on the display request (step S203). That is, the UI provision unit 106 retrieves, for example, shrine and temple data from the shrine and temple DB 107 for shrines and temples located within the geographical area represented by the information contained in the display request.

[0054] The UI provision unit 106 of the server 10 creates display data for displaying the shrines and temples represented by the shrine and temple data obtained in step S203 on a map (step S204). The display data includes, for example, the names and location information of the shrines and temples included in the shrine and temple data obtained in step S203, and the rarity score and pedestrian flow score set for that shrine and temple data.

[0055] Furthermore, the data format of the display data can be any format depending on the program that implements the UI control unit 201 of the client 20. For example, if the UI control unit 201 of the client 20 is implemented as a web browser, the display data can be created in a data format used to implement web applications (e.g., HTML (HyperText Markup Language)).

[0056] The UI provision unit 106 of the server 10 sends the display data created in step S204 to the client 20 that sent the display request received in step S203 (step S205).

[0057] When the UI control unit 201 of client 20 receives the display data transmitted in step S205 above, it displays shrines and temples on the map based on the display data (step S206). That is, the UI control unit 201 places the shrine or temple with the name of the shrine or temple on the map at the location indicated by the location information, based on the name and location information of the shrine or temple included in the display data. As a result, for example, the shrine and temple display screen 2000 shown in Figure 5 is displayed. In the shrine and temple display screen 2000 shown in Figure 5, shrine and temple icons 2101 to 2108, which represent shrines or temples, are displayed on the map 2100. In addition, each shrine and temple icon 2101 to 2108 is assigned the name of the shrine or temple that the icon represents. Note that shrine and temple icons 2103, 2104, 2105 and 2107 represent shrines, and shrine and temple icons 2101, 2102, 2106 and 2108 represent temples.

[0058] Users can perform operations to change the geographical range, for example, by dragging on map 2100. Users can also change the map's scale, for example, by using the mouse wheel, pinching in / out gestures on map 2100, or by pressing the scale change button 2200.

[0059] Here, the shrine and temple display screen 2000 shown in Figure 5 includes a slider bar 2301 for controlling the display or hiding of the shrine and temple icons 2101 to 2108 (and the names of the shrines and temples assigned to those icons) based on the rarity score or visitor flow score of the shrines and temples represented by each of the icons 2101 to 2108 displayed on the map 2100. A slider 2302 exists on the slider bar 2301, and by moving the slider 2302 to the left or right on the slider bar 2301, the user can hide each shrine and temple icon 2101 to 2108 (and the names of the shrines and temples assigned to each of the icons 2101 to 2108) or display hidden shrine and temple icons (and the names of the shrines and temples assigned to those icons) according to the rarity score or visitor flow score. This allows users to search for their desired shrines and temples based on their rarity score or visitor flow score (i.e., search for rare shrines and temples). Hereafter, the operation of moving the slider 2302 to the left or right on the slider bar 2301 will be referred to as the "search operation by rarity score or visitor flow score".

[0060] When a user performs a search operation based on rarity score or foot traffic score, the UI control unit 201 controls the display or hiding of each shrine / temple icon 2101 to 2108 based on the search operation and the rarity score or foot traffic score of the shrine / temple represented by each icon 2101 to 2108 (step S207).

[0061] The following describes how to control the display or hiding of shrine and temple icons when a search operation is performed using scarcity score or foot traffic score.

[0062] For example, as shown in Figure 6, when slider 2302 is in the middle position on slider bar 2301, all shrine and temple icons and their names are displayed on the map. In this case, when slider 2302 is moved to the left (Hidden direction) on slider bar 2301, the shrine and temple icons and their names displayed on the map are hidden in order of increasing scarcity score, according to the amount of movement. On the other hand, when slider 2302 is moved to the right (Popular direction) on slider bar 2301, the shrine and temple icons and their names displayed on the map are hidden in order of decreasing pedestrian flow score, according to the amount of movement.

[0063] Furthermore, when slider 2302 is located to the left of the center on slider bar 2301, moving slider 2302 to the right (provided that after the move, slider 2302 is located in the center or to the left of the center) will display hidden shrine and temple icons and their names in order of highest rarity score, according to the amount of movement. On the other hand, when slider 2302 is located to the right of the center on slider bar 2301, moving slider 2302 to the left (provided that after the move, slider 2302 is located in the center or to the right of the center) will display hidden shrine and temple icons and their names in order of highest foot traffic score, according to the amount of movement.

[0064] Here, the relationship between the amount of movement of slider 2302 and the number of shrine and temple icons to display or hide, or their rarity score or foot traffic score, can be arbitrarily set as appropriate.

[0065] For example, if a predetermined unit movement amount is Δ and a predetermined integer of 1 or more is n, then each time the slider 2302 moves by Δ, a predetermined number of n shrine and temple icons and their names can be displayed or hidden.

[0066] Other examples include, for instance, a predetermined unit movement amount Δ, a predetermined positive number s, a first threshold of 0, and a second threshold of 100. Also, m is an integer greater than or equal to 1. In this case, when the slider 2302 is moved mΔ to the left from the center, shrine and temple icons and their names are hidden if the scarcity score is less than the first threshold + ms. Conversely, when the slider 2302 is moved mΔ to the right from the center, shrine and temple icons and their names are hidden if the pedestrian flow score is less than the first threshold + ms. Similarly, when the slider 2302 is moved mΔ to the right from the left end of the slider bar 2301 (provided that the slider 2302 is located to the left of the center of the slider bar 2301), shrine and temple icons and their names are displayed if the score is greater than or equal to the second threshold - ms. On the other hand, when slider 2302 is moved mΔ to the left from the right end of slider bar 2301 (provided that slider 2302 is located to the right of the center of slider bar 2301), shrine and temple icons and their names that are greater than or equal to the second threshold -ms are displayed.

[0067] <Example hardware configuration for Server 10 and Client 20> The server 10 and client 20 according to this embodiment can be implemented, for example, by the hardware of the computer 500 shown in Figure 7.

[0068] The computer 500 shown in Figure 7 includes an input device 501, a display device 502, an external interface 503, a communication interface 504, a RAM (Random Access Memory) 505, a ROM (Read Only Memory) 506, an auxiliary storage device 507, and a processor 508. Each of these hardware components is connected to the others via a bus 509 for communication.

[0069] The input device 501 is, for example, a keyboard, mouse, touch panel, physical buttons, etc. The display device 502 is, for example, a display, display panel, etc. Note that the computer 500 does not necessarily have to have at least one of the input device 501 and the display device 502.

[0070] External I / F 503 is an interface with external devices such as recording media 503a. Examples of recording media 503a include CD (Compact Disc), DVD (Digital Versatile Disk), SD memory card (Secure Digital memory card), and USB (Universal Serial Bus) memory card.

[0071] The communication interface 504 is an interface for connecting to a communication network. The RAM 505 is a volatile semiconductor memory (storage device) that temporarily holds programs and data. The ROM 506 is a non-volatile semiconductor memory (storage device) that can retain programs and data even when the power is turned off. The auxiliary storage device 507 is a non-volatile storage device such as an HDD, SSD, or flash memory. The processor 508 is a processing unit such as a CPU or GPU (Graphic Processing Unit).

[0072] Note that the hardware configuration of computer 500 shown in Figure 7 is just one example and is not limited to it. For example, computer 500 may have multiple auxiliary storage devices 507 or multiple processors 508, it may not have some of the hardware shown, or it may have various other hardware components besides the hardware shown.

[0073] <Summary> As described above, in the system 1 according to this embodiment, the rarity of each facility is evaluated from a predetermined perspective, and then the evaluation value is used to search for each facility (that is, it is possible to search for rare facilities with high evaluation values, or conversely, popular facilities that are visited by many people). Therefore, it becomes possible to present various facilities to the user based on the rarity of the facilities, and for example, it becomes possible to increase the number of visitors to a facility and revitalize the surrounding area as a result.

[0074] The present invention is not limited to the embodiments specifically disclosed above, and various modifications, changes, and combinations with known technologies are possible as long as they do not deviate from the spirit described in the claims. [Explanation of symbols]

[0075] 1 System 10 servers 20 clients 30 Communication Networks 101 First score calculation unit 102 Second score calculation unit 103 Third score calculation unit 104. Fourth score calculation section 105 Score Setting Section 106 UI provision department 107 Shrines and Temples Database 201 UI Control Unit 500 Computers 501 Input device 502 Display device 503 External I / F 503a Recording medium 504 Communication I / F 505 RAM 506 ROM 507 Auxiliary storage 508 Processors Bus 509

Claims

1. An information processing system that includes a server and a client, The aforementioned server, A first calculation unit calculates a first evaluation value that evaluates the rarity of the facility from a predetermined perspective, It has a creation unit that creates display data including the first evaluation value and information for displaying the facility on a map, The aforementioned client, The system includes a display control unit that displays the facilities on the map based on the aforementioned display data, The display control unit, An information processing system that searches for the facility on the map based on the first evaluation value and a value specified by the user for the first evaluation value.

2. The display control unit, The information processing system according to claim 1, which controls the display or hiding of the facility on the map based on a value specified by the user for the first evaluation value and the first evaluation value.

3. The aforementioned server, A second calculation unit calculates a second evaluation value that evaluates the number of visitors to the aforementioned facility, A third calculation unit that calculates a third evaluation value that evaluates the area of ​​the aforementioned facility, It has a fourth calculation unit that calculates a fourth evaluation value that evaluates the difficulty of reaching the aforementioned facility, The first calculation unit is, The information processing system according to claim 1, which calculates the first evaluation value based on the second evaluation value, the third evaluation value, and the fourth evaluation value.

4. The first calculation unit is, The information processing system according to claim 3, wherein the average value or weighted sum of the second evaluation value, the third evaluation value, and the fourth evaluation value is calculated as the first evaluation value.

5. The aforementioned creation unit, Display data is created that includes the first evaluation value, the second evaluation value, and information for displaying the facility on a map. The display control unit, The information processing system according to claim 3 or 4, which searches for the facility on the map based on a value specified by the user for the first evaluation value and the first evaluation value, or based on a value specified by the user for the second evaluation value and the second evaluation value.

6. The information processing system according to claim 5, wherein the facility is a Shinto shrine or Buddhist temple.

7. An information processing device having a display control unit that controls the display or hiding of information representing a facility based on an evaluation value that assesses the rarity of the facility from a predetermined perspective and a value specified by the user in relation to the evaluation value.

8. An information processing method used in an information processing system that includes a server and a client, The aforementioned server, A first calculation procedure for calculating a first evaluation value that assesses the rarity of a facility from a predetermined perspective, The procedure for creating display data that includes the first evaluation value and information for displaying the facility on a map is performed. The aforementioned client, Based on the aforementioned display data, a display control procedure is performed to display the facility on the map, The aforementioned display control procedure is: An information processing method for searching for the facility on the map based on a value specified by the user for the first evaluation value and the first evaluation value.

9. A program used in an information processing system that includes a server and a client, To the aforementioned server, A first calculation procedure for calculating a first evaluation value that assesses the rarity of a facility from a predetermined perspective, The procedure for creating display data that includes the first evaluation value and information for displaying the facility on a map is executed. To the aforementioned client, Based on the aforementioned display data, a display control procedure is executed to display the facility on the map. The aforementioned display control procedure is: A program that searches for the facility on the map based on the first evaluation value and a value specified by the user for the first evaluation value.

Images