JP4937300B2 - Introduction device and method using search area information - Google Patents

Description

  The present invention relates to an improvement in technology for introducing a person using a computer.

  2. Description of the Related Art Conventionally, a service that introduces a partner or the like using a computer via the Internet is known (for example, see Non-Patent Document 1). In this type of service, registered members are matched to each other based on the attributes they registered as registration profiles, etc., and the desired conditions requested from the other party, and introduced to the person concerned. As the next basic element, users can register each other's prefectures and search for the other party. There is also a proposal for narrowing down and introducing introduction target persons in geographically close locations based on the position information of the mobile terminals owned by each person (see, for example, Patent Document 1).

Yahoo Japan Corporation, "Yahoo! Partner", [online], [Search May 28, 2009], Internet <URL: http://partner.yahoo.co.jp/>

JP 2001-175718 A

  However, like the above-mentioned prior art, matching limited to the area where you currently live or where you are now does not take into account the areas of potential interest or interest, so there are limited opportunities for expanding relationships. There were challenges. The present invention addresses such a problem, and its purpose is to introduce a partner based on the degree of coincidence of regions included in a search query input to a search system.

  Based on the above object, the introduction device using the search area information which is one aspect of the present invention has access to the place name storage means storing the place name and the corresponding position information in association with each other via the communication network. Each client system receives an input of a phrase as a search query, searches for a website related to the search query and displays it, and one input for each user who wants to introduce. For the above search query, by referring to the information stored in the place name storage means, the place name is detected and the corresponding position information is acquired, and associated with each user in a predetermined point history storage means. And a point recording means for storing the information, and for each user, a polygon including the position information for each user stored in the point history storage means. The polygon specifying means, the area calculating means for calculating the overlapping area between the specified polygons, and the user, with priority given to the user with the large overlapping area calculated for the polygons, The selection introducing means for introducing through any one of the client systems is realized by a computer.

  In this way, by introducing the partner with a large overlapping area between the polygons that include the place name entered as the search query with priority, the place of birth, going beyond the limitation of the current place or current residence area, etc. Matching with other parties who share a potential area of interest or interest, such as the area you want to see or where you lived in the past, can be realized, and opportunities to expand relationships can be effectively expanded.

  According to another aspect of the present invention, in the above aspect, the polygon specifying unit specifies the polygon such that one polygon includes the position information within a predetermined distance. .

  In this way, by limiting the distance between each piece of location information contained in a polygon, users who have searched for a wide range of place names, such as nationwide, will be introduced based on the size of the overlapping area of the polygon. A situation where a certain area is not common can be prevented.

  In addition, if each of the above aspects is grasped as a method, in the introduction method using search area information, processing corresponding to each means in the introduction device using any of the search area information is performed by a computer. To do.

  As a more specific example, an introduction device using search area information realized by a computer, and search area information having place name storage means for storing place names and corresponding position information in association with each other. In the introduction method using the search area information executed by the introduction device using, a phrase is inputted as a search query to each client system accessed via the communication network, and a web related to the search query is received. Searching and displaying a site, and for each user who wishes to introduce, the place name is detected by referring to information stored in the place name storage means for one or more input search queries. The corresponding location information is acquired and stored in a predetermined location history storage means in association with each user; The area for calculating the overlapping area between the specified polygons and the polygon specifying process for specifying the polygons including the position information for each user stored in the point history storage means for each user The computer executes a calculation process and a selection introduction process that preferentially selects a user having a large overlapping area calculated for the polygons and introduces the user through any one of the client systems. It is characterized by.

  Note that the category of the device, method, or program in each of the above aspects is an illustrative example, and the present invention includes other categories not described for each of the above aspects. Further, each specific aspect to be described is included.

  As described above, according to the present invention, different maps can be displayed simultaneously with excellent operability and visibility.

The functional block diagram which shows the structure of embodiment of this invention. The figure which illustrates each information in embodiment of this invention. The flowchart which shows the process sequence in embodiment of this invention. The conceptual diagram which illustrates the overlapping area of the polygon in embodiment of this invention.

  Next, modes for carrying out the present invention (referred to as “embodiments”) will be described with reference to the drawings. It should be noted that assumptions common to those already described in the background art and problems are omitted as appropriate.

[1. Constitution〕
As shown in FIG. 1 (configuration diagram), the present embodiment relates to an introduction device that uses search area information realized as a server device (hereinafter also referred to as “this device”) 1. As a typical computer configuration, at least an arithmetic control unit 5 such as a CPU, a storage device 6 such as an external storage device (HDD or the like) or a main memory, and a communication means (such as the Internet or a mobile phone network) N 7 (such as a LAN adapter). A terminal T (T1, T2, etc.) used by each user who receives an introduction is a personal computer, a mobile phone terminal device, or the like, and accesses the present device 1 with a web browser or the like.

  In the present apparatus 1, a predetermined computer program (not shown) stored (installed) in advance in the storage device 6 controls the arithmetic control unit 5 so that elements (10, 15,...) Shown in FIG. Realize. Among these elements, information storage means can be realized in the storage device 6 in an arbitrary format such as a file, various databases (also referred to as “DB”), variables such as arrays, system setting values, etc. Among them, the place name storage means 22 As illustrated in the conceptual diagram of FIG. 2 (2), place names and corresponding position information (for example, position coordinates such as latitude and longitude) are stored in advance in association with each other.

  Each means other than the storage means is a processing means for realizing and executing an information processing function to be described later. Each means is a group of functions for explanation, and the actual implementation mode is free, such as realizing a plurality of means with a single server device or configuring one means with a plurality of server devices. .

[2. Action)
In the apparatus 1 as described above, the introduction registration means 9 receives an access through a terminal T (T1, T2, etc.) used by each user from a user who wants to introduce a partner or the like by a predetermined introduction service. Registration of profile data such as age, gender, hobbies, etc. is accepted at a predetermined website (referred to as “introduction site”) related to the introduction service, and the profile DB 90 as illustrated in the conceptual diagram of FIG. Remember me.

  On the other hand, the search means 10 accepts input of a phrase as a search query at a predetermined website called a search engine for each terminal T accessed via the communication network N (step S11 in FIG. 3). Then, a website related to the search query is searched (step S12), and the result is displayed as a search result display screen or the like (step S13).

  For example, in the example of FIG. 1, when the search query “Midori Park Pigeon” from Mr. A is received on the input screen of a so-called search engine, the URL of a web page including both “Midori Park” and “Pigeon” is indexed. A search is made from index data stored in advance in the data storage means 15 and displayed as a search result such as a list screen. The index data is obtained by reading (crawling) the data (HTML file, etc.) of each web page from the WWW (World Wide Web) in advance, and each URL and each word included in the web page of the URL. The associated index data.

  Each time the search is performed as described above, the point recording means 20 determines whether the searched user is registered in the introduction service as a user who wishes to introduce, by referring to the profile DB 90 and registers each of the registered items. For the user (step S20: YES), for each input search query, the place name is detected by referring to the place name storage means 22 (step S21), and if the place name is detected (step S22: YES) The position information to be acquired is acquired (step S23) and, as exemplified in the conceptual diagram of FIG. 2 (3), each user is associated with a user ID or the like and stored in a predetermined point history storage means 25 (step S24). .

  Then, at a predetermined timing (for example, nighttime batch processing) (step S25: YES), the polygon identifying unit 30 creates a polygon including each position information stored in the point history storage unit 25 for each user. It is specified (step S30) and stored in the polygon storage means 35 in association with each user (for example, FIG. 2 (4)). Here, for specifying the polygon, any known algorithm such as a packaging method, a Graham scanning method, a sequential composition method, or a divide-and-conquer method may be applied.

  For example, in the example of FIG. 4, when the place name of each position indicated by a black circle is included in the search query of the user A whose user ID is “A123...”, The polygon including the position information group is the triangle A1. , A2, A3. Further, when the place name of each position indicated by a white circle is included in the search query of another user B whose user ID is “B543...”, The polygon including the position information group is a triangle B1, B2, B3. It becomes.

  It is highly desirable for the polygon specifying means 30 to specify a polygon so that one polygon includes position information within a predetermined distance. That is, by restricting the distance between each piece of position information included in the polygon, users who have searched a wide range of place names such as nationwide are introduced based on the area of the overlapping area of the polygon. Can prevent the situation that the area of interest is not common. Here, the criteria for limiting the polygon to include each position information within a predetermined distance is arbitrary. For example, the polygon is determined based on the most recently searched point or the most recently searched point within a predetermined period. For example, the polygon may be specified so as to include each position information within the distance.

  Further, the area calculating means 40 calculates the overlapping area between the polygons specified by the polygon specifying means 30 as described above (step S40) and associates them with two users corresponding to the two polygons. Are stored in the overlapping area storage means 45 (for example, FIG. 2 (5)). Here, for the calculation of the overlapping area between polygons, any known algorithm such as integration calculation such as definite integration, pick theorem, Monte Carlo method, wrapping method, etc. may be applied. For example, in the example of FIG. 4, the overlapping area of the triangles A1, A2, and A3 and the triangles B1, B2, and B3 is a hexagonal shape indicated by hatching.

  Then, the selection introduction means 50 preferentially selects a user with a large overlap area calculated for the polygons by the area calculation means 40 for each user, and through the terminal T of the corresponding user, The other party is introduced by displaying a web page with a hyperlink to the registered profile (step S50). A user who has a large overlapping area with respect to a single user extracts each record of the overlapping area stored in the overlapping area storage means 45 in association with the one user, and sorts the records in descending order. It is obtained as a partner user included in the higher-level record.

[3. effect〕
As described above, in the present embodiment, by preferentially introducing a partner having a large overlapping area between polygons that include a place name input as a search query, it is beyond the limitation such as the current location or the current residence area. Matching with other people who share a potential area of interest, such as your hometown, the area you want to go to, or the place where you lived in the past can be realized, effectively expanding opportunities for human relations.

[4. Other embodiments]
In addition, said each embodiment is only an illustration, and this invention includes what is illustrated below and other embodiment other than that. For example, in the present invention, elements such as each means may be realized by an electronic circuit based on a wired logic or the like without being limited to a computer control unit. Further, each configuration diagram, data diagram, flowchart diagram, and the like are merely examples, and the presence / absence of each element, its order, specific contents, and the like can be appropriately changed. In addition, the present invention may be grasped as a method, a computer program, a system of the present invention including a terminal T (T1, T2, etc.) corresponding to the apparatus 1. Of course, narrowing down not only the size of the overlapping area but also other desired conditions such as age and annual income is desirable.

N communication network T (T1, T2) client terminal 1 server device 5 arithmetic control unit 6 storage device 7 communication means 9 introduction registration means 10 search means 15 index data storage means 20 point recording means 22 place name storage means 25 point history storage means 30 Polygon specifying means 35 Polygon storing means 40 Area calculating means 45 Overlapping area storing means 50 Selection introducing means 90 Profile DB

Claims (3)

A place name storage means for storing a place name and corresponding position information in association with each other;
A search means for receiving and inputting a phrase as a search query for each client system accessed via a communication network, and searching and displaying a website related to the search query;
For each user who wishes to be introduced, for the one or more input search queries, by referring to the information stored in the place name storage means, the place name is detected and the corresponding position information is acquired, Point recording means for storing in a predetermined point history storage means in association with each user;
For each user, a polygon specifying means for specifying a polygon that includes the position information for each user stored in the point history storage means;
An area calculating means for calculating an overlapping area between the specified polygons;
Selection introduction means to preferentially select the user with a large overlap area calculated for the polygons for the user, and introduce through any one of the client systems,
An introductory device using search area information, which is realized by a computer.   2. The introduction device using search area information according to claim 1, wherein the polygon specifying means specifies the polygon such that one polygon includes the position information within a predetermined distance.   An introduction method using search area information, characterized in that processing corresponding to each means in the introduction device using search area information according to claim 1 or 2 is executed by a computer.

Images