JP2021072052A - Retrieval keyword proposal system, retrieval keyword proposal method, and retrieval keyword proposal program - Google Patents

Abstract

To propose a more appropriate retrieval keyword.SOLUTION: A retrieval keyword proposal system 1 for managing a retrieval keyword set for each management object by each of a plurality of users and a retrieval result obtained by retrieving with the retrieval keyword includes: a first extraction section 12 for extracting a retrieval keyword of a second user with which the same retrieval result as a retrieval result obtained by retrieving with a retrieval keyword set by a first user is retrieved; a second extraction section 13 for extracting a retrieval keyword set by the second user for the management object to which the retrieval keyword extracted by the first extraction section 12 is set; a proposal section 14 for proposing the retrieval keyword extracted by the second extraction section 13 as a retrieval keyword candidate to the first user.SELECTED DRAWING: Figure 1

Description

One aspect of the present disclosure relates to a search keyword proposal system, a search keyword proposal method, and a search keyword proposal program.

The following Patent Document 1 discloses a search system that proposes a related search keyword related to the search keyword.

Japanese Unexamined Patent Publication No. 2014-67095

The above search system preferentially proposes related search keywords with high advertising effectiveness. However, there is a problem that the related search keyword having a high advertising effect is not the search keyword desired by the user. Therefore, it is desired to propose a more appropriate search keyword.

The search keyword proposal system according to one aspect of the present disclosure is a search keyword proposal system that manages search keywords set for each management target by a plurality of users and search results searched by the search keywords. The first extraction unit that extracts the search keyword of the second user and the search keyword extracted by the first extraction unit, which are searched for the same search result as the search result searched by the search keyword set by one user, are The second extraction unit that extracts the search keywords set by the second user for the set management target, and the proposal unit that proposes the search keywords extracted by the second extraction unit to the first user as search keyword candidates. And.

In such an aspect, the search keyword of the second user is extracted and the extracted search keyword is set, in which the same search result as the search result searched by the search keyword set by the first user is searched. The search keyword set by the second user for the managed target is extracted, and the extracted search keyword is proposed to the first user as a search keyword candidate. As a result, for example, the search keyword of the second user who has the same interest as the first user is proposed to the first user, so that a search keyword more useful for the first user is proposed. Become. That is, it is possible to propose a more appropriate search keyword.

According to one aspect of the present disclosure, more appropriate search keywords can be proposed.

It is a figure which shows an example of the functional structure of the search keyword proposal system which concerns on embodiment. It is a figure which shows the table example of the keyword table. It is a figure which shows the table example of the news table. It is a figure which shows the table example of the score table. It is a figure which shows an example of the hardware configuration of the computer used in the search keyword proposal system which concerns on embodiment. It is a flowchart which shows an example of the process executed by the search keyword proposal system which concerns on embodiment. It is a figure which shows the structure of the search keyword proposal program which concerns on embodiment together with the storage medium.

Hereinafter, embodiments of the present disclosure will be described in detail with reference to the drawings. In the description of the drawings, the same elements are designated by the same reference numerals, and duplicate description will be omitted. Further, the embodiments in the present disclosure in the following description are specific examples of the present invention, and are not limited to these embodiments unless otherwise specified to limit the present invention.

The search keyword proposal system 1 according to the embodiment is a computer that manages search keywords set for each management target by a plurality of users and search results searched by the search keywords, and proposes new search keywords to the users. It is a system.

The management target is something that the user manages, for example, a thing, a thing, a person (including a corporation, etc.), information, and the like. In the embodiment, the management target is a customer managed by the user, but the management target is not limited to the customer. The "customer" in the embodiment may be appropriately read as "managed object" or the like.

The search keyword is a keyword (word or phrase, etc.) used for the search, and the search is performed based on the search keyword (by the search keyword proposal system 1 or the like).

The search result is information on the result of a search performed based on the search keyword (by the search keyword proposal system 1 or the like).

In the embodiment, the search keyword is a keyword for searching news sites or the like that the customer is interested in, but the present invention is not limited to this. Further, in the embodiment, the search result is news searched on a news site or the like (information on the content of a web page such as a news site), but the present invention is not limited to this. The "news" in the embodiment may be appropriately read as a "search result" or the like.

When the user uses the search keyword suggestion system 1, it is assumed that the user logs in to the search keyword suggestion system 1. When the user logs in to the search keyword proposal system 1, a user ID and password that identify the user, which are unique to the user, are entered. After the user logs in, the search keyword proposal system 1 identifies that the process based on the user's operation or the like is performed by the user.

By using the search keyword proposal system 1, each of the plurality of users can set a search keyword for each customer, and can refer to the news searched by the search keyword for each customer. As a result, each user can refer to the news that the customer is interested in for each customer without any hassle. Then, for example, when communicating with the customer, each user can talk about the news that he / she referred to, so that it becomes a so-called ice break and can smoothly communicate with the customer.

In the search keyword proposal system 1, the user may be able to set a usefulness indicating the degree of usefulness of the news for the news searched by the search keyword. In the embodiment, the usefulness is a score expressed numerically, but the usefulness is not limited to this. For example, the score is "0", "1", "2" or "3", the smaller the value, the less useful (news is useless), and the larger the value, the more useful (news is useful). ) May be shown. The "score" in the embodiment may be appropriately read as "usefulness" or the like.

FIG. 1 is a diagram showing an example of the functional configuration of the search keyword proposal system 1. As shown in FIG. 1, the search keyword proposal system 1 includes a management unit 10, a storage unit 11, a first extraction unit 12 (first extraction unit), a second extraction unit 13 (second extraction unit), and a proposal unit 14. Consists of.

Each functional block of the search keyword proposal system 1 is assumed to function in the search keyword proposal system 1, but is not limited to this. For example, a part of the functional blocks of the search keyword proposal system 1 is a computer device different from the search keyword proposal system 1, and in the computer device connected to the search keyword proposal system 1 via a network, the search keyword proposal system 1 and the search keyword proposal system 1 It may function while transmitting and receiving information as appropriate. Further, some functional blocks of the search keyword proposal system 1 may be omitted, a plurality of functional blocks may be integrated into one functional block, or one functional block may be decomposed into a plurality of functional blocks. May be good.

Hereinafter, each function of the search keyword proposal system 1 shown in FIG. 1 will be described.

The management unit 10 performs various types of management in the search keyword proposal system 1. Specifically, the management unit 10 manages the search keywords, news, and scores.

[Management of search keywords]
The management unit 10 sets the search keyword specified by the user for the customer specified by the user. For example, after the user logs in to the search keyword proposal system 1, the search keyword proposal system 1 displays a list of customers registered in advance for the user in the search keyword proposal system 1 to the user together with a text box and a setting button. Displayed (via the communication device 1004 or the output device 1006 described later), the user selects one customer from the list of customers, enters the search keyword in the text box, and presses the setting button, the search keyword suggestion system. 1 sets the input search keyword for one selected customer.

The management unit 10 may manage search keywords by using the keyword table stored by the storage unit 11 described later. FIG. 2 is a diagram showing an example of a keyword table. As shown in FIG. 2, the keyword table includes a user ID (used at the time of login) that identifies the user who sets the search keyword, and a keyword ID issued by the search keyword proposal system 1 that identifies the search keyword. , The set date and time which is the date and time when the search keyword is set, the customer ID which identifies the customer who sets the search keyword, and the keyword 1 and the keyword 2 which are the search keywords are associated with each other. In the embodiment, it is assumed that two keywords (keyword 1 and keyword 2 described above) are set for one customer, but the present invention is not limited to this, and one keyword may be set. You may set three or more keywords. When the user receives an input regarding the setting of the search keyword, the management unit 10 refers to the keyword table stored by the storage unit 11 and updates the keyword table based on the input.

[News management]
The management unit 10 searches (web search) based on the set search keyword (news site or the like), and stores the news that is the result of the search. The management unit 10 may search by periodic batch processing (for example, executed at 0 o'clock every day), or may search based on the instruction of the administrator of the search keyword proposal system 1.

The management unit 10 may manage news by using the news table stored by the storage unit 11 described later. FIG. 3 is a diagram showing an example of a news table. As shown in FIG. 3, the news table uses the news ID issued by the search keyword proposal system 1, which identifies the news searched based on the set search keyword, and the date and time when the news was acquired (searched). A certain acquisition date and time, a URL (Uniform Resource Locator) of the news, a title of the news, and an outline of the news (automatically generated based on the content of the news by the search keyword proposal system 1) are associated with each other. ing. The relationship between the user, the search keyword set by the user, and the news searched by the search keyword shall be managed in the score table described later, but is not limited to this, for example, the news table. The relevance may be managed in the news table by further associating the user ID and the keyword ID in.

[Score management]
The management unit 10 sets a score specified by the user for the news specified by the user (searched by the search keyword set by the user). For example, after the user logs in to the search keyword proposal system 1, the search keyword proposal system 1 displays a list of news searched by the search keyword set by the user with scores "0", "1", "2" and. A drop-down list containing "3" and a setting button are displayed to the user (via the communication device 1004 or the output device 1006 described later), and the user selects one news item from the news list and selects one news item from the drop-down list. When one score is selected and the setting button is pressed, the search keyword suggestion system 1 sets the selected score for the selected one news item.

The management unit 10 may manage the search keyword by using the score table stored by the storage unit 11 described later. FIG. 4 is a diagram showing an example of a score table. As shown in FIG. 4, the score table includes a user ID (used at the time of login) that identifies the user who sets the score in the news, and a score ID issued by the search keyword suggestion system 1 that identifies the score. , The set date and time, which is the date and time when the score was set, the news ID that identifies the news, the score indicating the score (value), and the search keyword that searched for the news (the news is searched by the search keyword). Is associated with a keyword ID that identifies the). As described above, in the score table, the user, the search keyword set by the user, the news searched by the search keyword, and the score set by the user for the news are associated with each other.

The storage unit 11 stores arbitrary information. Specifically, the storage unit 11 stores the above-mentioned keyword table, news table, and score table. The storage unit 11 may store various information calculated by each function of the search keyword proposal system 1. Further, the information stored by the storage unit 11 may be appropriately referred to by each function of the search keyword proposal system 1.

The first extraction unit 12 extracts the search keyword of the second user in which the same news as the news searched by the search keyword set by the first user is searched. The first user and the second user are assumed to be different users, but they may be the same user. For example, the first extraction unit 12 refers to the score table stored by the storage unit 11 and corresponds to a record having the same user ID as the user ID of the user (first user) logged in to the search keyword proposal system 1. Extract the attached news ID, refer to the score table again, and enter the keyword ID corresponding to the record with the same news ID as the extracted news ID (and the user ID is other than the user ID of the first user mentioned above). Extract. If a plurality of news IDs are extracted in the first half of the above processing, the second half of the processing is performed for each of the extracted news IDs, and the keyword IDs for each news ID are extracted and all extracted. The keyword ID of is extracted as the final search keyword.

Similarly, in the description of the subsequent processing in the embodiment, when a plurality of information is extracted or acquired in the middle of the processing, in the subsequent processing, each information (of the plurality of information) is (repeatedly). All the result products obtained by performing the treatment and combining the result products obtained by each treatment shall be the final result products. In the following description of the process, the description of the iterative process for each information will be omitted as appropriate.

The score table elements (columns) used in the above processing are only three elements, a user ID, a news ID, and a keyword ID. Therefore, when performing the above processing, the first extraction unit 12 includes only the user ID, the news ID, and the keyword ID, not the score table, and the three elements correspond to each other in the same manner as the score table (for example,). The name is "news search result table", and the management unit 10 may generate the news search result table when the news is searched based on the search keyword set by the user). Similarly, in the subsequent processing in the embodiment, when only a part of the elements included in the keyword table, the news table and the score table is used, a table including the part of the elements is appropriately generated in advance, and instead. The table may be used.

The first extraction unit 12 may be executed by a periodic batch process (for example, executed at 0 o'clock every day), or may be executed based on an instruction of a user or an administrator of the search keyword proposal system 1. The first extraction unit 12 outputs information indicating the extracted search keyword (the above-mentioned extracted keyword ID) to the second extraction unit 13 and the proposal unit 14. The first extraction unit 12 may further output information indicating the second user (user ID corresponding to the above-mentioned extracted keyword ID in the score table) to the second extraction unit 13 and the proposal unit 14. .. Further, the first extraction unit 12 further provides information indicating the date and time when the extracted search keyword is set (the set date and time corresponding to the above-mentioned extracted keyword ID in the keyword table) in the second extraction unit 13 and the proposal unit 14. It may be output to. In addition, the first extraction unit 12 further extracts information indicating the score set for "same news" by the second user (score corresponding to the above-extracted keyword ID in the score table). It may be output to a unit 13 and a proposal unit 14.

Among the search keywords set by the first user, the first extraction unit 12 is searched by a search keyword that has not been set at a predetermined time in the past from the present time or a search keyword for which a predetermined time has passed since the setting. The search keyword of the second user who searched for the same news as the news may be extracted. For example, the first extraction unit 12 first refers to the keyword table stored by the storage unit 11, and has the same user ID as the user ID of the user (first user) who is logged in to the search keyword proposal system 1. , Extract the keyword ID corresponding to the record whose set date and time is not included in the predetermined time in the past from the present time or the current time is more than the predetermined time from the set date and time. The first extraction unit 12 then refers to the score table stored by the storage unit 11 and has the same user ID as the user ID of the user (first user) logged in to the search keyword proposal system 1 and extracts the user ID. Extract the news ID corresponding to the record with the same keyword ID as the keyword ID, refer to the score table again, and refer to the score table again, and the news ID same as the extracted news ID (and the user ID is other than the user ID of the first user described above). ) The keyword ID corresponding to the record is extracted.

The first extraction unit 12 searches for the same news as the news for which a score satisfying a predetermined criterion is set among the news searched by the search keyword set by the first user, and the search keyword of the second user is searched. May be extracted. For example, the first extraction unit 12 refers to the score table stored by the storage unit 11, and has the same user ID as the user ID of the user (first user) logged in to the search keyword proposal system 1, and has a score. Extracts the news ID corresponding to the record of "2" or more (predetermined standard), refers to the score table again, and has the same news ID as the extracted news ID (and the user ID is the above-mentioned first user). Extract the keyword ID corresponding to the record (other than the user ID).

The first extraction unit 12 searches for the same news as the news for which a score satisfying a predetermined criterion is not set at a predetermined time in the past from the present time among the news searched by the search keyword set by the first user. Alternatively, the search keyword of the second user may be extracted. For example, the first extraction unit 12 refers to the score table stored by the storage unit 11, and has the same user ID as the user ID of the user (first user) logged in to the search keyword proposal system 1, and is set. A record whose date and time is not included in the predetermined time in the past from the present time, or the same user ID as the user ID of the user (first user) logged in to the search keyword proposal system 1, and the set date and time is in the past from the present time. The news ID corresponding to the record whose score is less than "2", which is included in the predetermined time of the above, is extracted, the score table is referred to again, and the same news ID as the extracted news ID (and the user ID is described above). Extract the keyword ID corresponding to the record of the first user (other than the user ID of the first user).

The first extraction unit 12 searches for news that is the same as the news searched by the search keyword set by the first user and has a score set by the second user that meets a predetermined criterion. You may extract the search keyword of the user of. For example, the first extraction unit 12 refers to the score table stored by the storage unit 11 and corresponds to a record having the same user ID as the user ID of the user (first user) logged in to the search keyword proposal system 1. The attached news ID is extracted, the score table is referred to again, the news ID is the same as the extracted news ID (and the user ID is other than the user ID of the first user described above), and the score is "2" or more ( The keyword ID corresponding to the record of the predetermined standard) is extracted.

For each variation of the processing of the first extraction unit 12 described above, two or more may be freely combined.

The second extraction unit 13 extracts the search keyword set by the second user for the customer to which the search keyword extracted by the first extraction unit 12 is set. For example, the second extraction unit 13 refers to the keyword table stored by the storage unit 11, extracts the customer ID corresponding to the keyword ID record extracted (input) by the first extraction unit 12, and again. Referencing the keyword table, it is the same user ID as the user ID (second user) input by the first extraction unit 12, and corresponds to the record with the same customer ID as the extracted customer ID (first extraction unit). The keyword ID (different from the keyword ID extracted (input) by 12) is extracted.

The second extraction unit 13 outputs information indicating the extracted search keyword (the above-mentioned extracted keyword ID) to the proposal unit 14. The second extraction unit 13 may further output the set date and time of the extracted search keyword (the set date and time corresponding to the above-mentioned extracted keyword ID in the keyword table) to the proposal unit 14.

The second extraction unit 13 is a search keyword extracted by the first extraction unit 12 among the search keywords set by the second user for the customer for which the search keyword extracted by the first extraction unit 12 is set. The search keyword set after is set may be extracted. For example, the second extraction unit 13 refers to the keyword table stored by the storage unit 11, extracts the customer ID corresponding to the keyword ID record extracted (input) by the first extraction unit 12, and again. Referencing the keyword table, the user ID is the same as the user ID (second user) input by the first extraction unit 12, the customer ID is the same as the extracted customer ID, and the set date and time is set by the first extraction unit 12. The keyword ID corresponding to the record after the extracted (input) set date and time (the date and time when the search keyword extracted by the first extraction unit 12 is set) is extracted.

For each variation of the processing of the second extraction unit 13 described above, two or more may be freely combined.

The proposal unit 14 proposes the search keyword extracted by the second extraction unit 13 to the first user as a search keyword candidate. For example, the proposal unit 14 extracts the keyword 1 and the keyword 2 corresponding to the keyword ID extracted (input) by the second extraction unit 13 in the keyword table stored by the storage unit 11, and the extracted keyword 1 And the keyword 2 is displayed to the logged-in user (first user) (via the communication device 1004 or the output device 1006 described later) to propose to the first user.

The proposal unit 14 may use the search keyword extracted by the second extraction unit 13 as a search keyword candidate and propose it to the first user together with information indicating the timing when the search keyword is set. For example, the proposal unit 14 extracts the keyword 1 and the keyword 2 corresponding to the keyword ID extracted (input) by the second extraction unit 13 in the keyword table stored by the storage unit 11, and the extracted keyword 1 And the keyword 2 and the user (first user) who has logged in the set date and time (information indicating the set timing) input by the second extraction unit 13 (communication device 1004 or output device 1006 described later). Propose to the first user by displaying (via).

The proposal unit 14 may propose a search keyword candidate to the first user based on the score set in the news searched by the search keyword extracted by the first extraction unit 12. More specifically, the proposal unit 14 aggregates the set of the search keyword extracted by the second extraction unit 13 and the score set in the news searched by the search keyword extracted by the first extraction unit 12. The search keyword extracted by the second extraction unit 13 may be proposed to the first user as a search keyword candidate based on the above. The proposal unit 14 may perform weighting based on the set timing of the search keyword extracted by the second extraction unit 13 at the time of aggregation.

For example, the proposal unit 14 first extracts and extracts the keyword 1 and the keyword 2 corresponding to the keyword ID extracted (input) by the second extraction unit 13 in the keyword table stored by the storage unit 11. Keyword 1 and keyword 2 and the score input by the first extraction unit 12 calculated in the pre-processing stage of the second extraction unit 13 are paired [keyword 1 and keyword 2, score], and each first It is totaled by the iterative processing of the extraction unit 12 and each second extraction unit 13. The proposal unit 14 adds up the scores when the keyword 1 and the keyword 2 overlap at the time of aggregation. Further, the proposal unit 14 may weight the score as the set date and time input by the second extraction unit 13 is closer to the present time (the newer the set date and time) at the time of aggregation. Next, the proposal unit 14 transfers the keywords 1 and 2 included in the pair in descending order of the score to the logged-in user (first user) (communication device 1004 or output device described later). Propose to the first user by displaying (via 1006).

The proposal unit 14 may propose a search keyword candidate to the first user based on the aggregation of the search keywords extracted by the second extraction unit 13. The proposal unit 14 may perform weighting based on the set timing of the search keyword extracted by the second extraction unit 13 at the time of aggregation. For example, the proposal unit 14 first extracts and extracts the keyword 1 and the keyword 2 corresponding to the keyword ID extracted (input) by the second extraction unit 13 in the keyword table stored by the storage unit 11. Keyword 1 and keyword 2 and the score "1" are paired [keyword 1 and keyword 2, score], and are totaled by iterative processing of each first extraction unit 12 and each second extraction unit 13. The proposal unit 14 adds up the scores when the keyword 1 and the keyword 2 overlap at the time of aggregation. Further, the proposal unit 14 may weight the score as the set date and time input by the second extraction unit 13 is closer to the present time (the newer the set date and time) at the time of aggregation. Next, the proposal unit 14 transfers the keywords 1 and 2 included in the pair in descending order of the score to the logged-in user (first user) (communication device 1004 or output device described later). Propose to the first user by displaying (via 1006).

For each variation of the processing of the proposal unit 14 described above, two or more may be freely combined.

FIG. 5 is a diagram showing an example of the hardware configuration of the computer used in the search keyword proposal system 1 according to the embodiment of the present disclosure. Physically, as shown in FIG. 5, the search keyword proposal system 1 shown in FIG. 1 includes a processor 1001 which is a CPU, a memory 1002 which is a main storage device, a storage 1003 which is an auxiliary storage device, and a communication device 1004. It is configured as a computer system composed of a computer including an input device 1005, an output device 1006, and the like.

The function of each functional block of the search keyword proposal system 1 shown in FIG. 1 is controlled by the processor 1001 by loading predetermined computer software on the hardware such as the processor 1001 and the memory 1002 shown in FIG. This is realized by operating the storage 1003, the communication device 1004, the input device 1005, and the output device 1006, and reading and writing data in the memory 1002 and the storage 1003.

FIG. 6 is a flowchart showing an example of a process (search keyword proposal method) executed by the search keyword proposal system 1 according to the embodiment. First, the first extraction unit 12 extracts the search keyword of the second user in which the same news as the news searched by the search keyword set by the first user is searched (step S1, first extraction step). .. Next, the second extraction unit 13 extracts the search keyword set by the second user for the customer for which the search keyword extracted in S1 is set (step S2, second extraction step). Next, the proposal unit 14 proposes the search keyword extracted in S2 to the first user as a search keyword candidate (step S3, proposal step).

Subsequently, the search keyword proposal program 100 for causing the computer to execute the processing by the series of search keyword proposal system 1 described above will be described. As shown in FIG. 7, the search keyword proposal program 100 is inserted into a computer and accessed, or is stored in a program storage area 51 formed in a storage medium 50 included in the computer. More specifically, the search keyword proposal program 100 is stored in the program storage area 51 formed in the storage medium 50 included in the search keyword proposal system 1.

The search keyword proposal program 100 includes a management module 101, a storage module 102, a first extraction module 103, a second extraction module 104, and a proposal module 105. The functions realized by executing the management module 101, the storage module 102, the first extraction module 103, the second extraction module 104, and the proposal module 105 are the management unit 10, the storage unit 11, and the above-mentioned search keyword proposal system 1. The functions are the same as those of the first extraction unit 12, the second extraction unit 13, and the proposal unit 14, respectively.

The search keyword proposal program 100 may be configured such that a part or all thereof is transmitted via a transmission medium such as a communication line, received by another device, and stored (including installation). Further, each module of the search keyword proposal program 100 may be installed on any of a plurality of computers instead of one computer. In that case, the above-mentioned series of search keyword proposal program 100 is processed by the computer system by the plurality of computers.

Subsequently, the operation and effect of the search keyword proposal system 1 according to the embodiment will be described.

According to the search keyword proposal system 1 that manages the search keyword set for each customer (managed target) by each of a plurality of users and the news (search result) searched by the search keyword, the first user sets the search keyword. For the first extraction unit 12 that extracts the search keyword of the second user who searched for the same news as the news searched by the search keyword, and the customer for which the search keyword extracted by the first extraction unit 12 is set. It includes a second extraction unit 13 that extracts the search keyword set by the second user, and a proposal unit 14 that proposes the search keyword extracted by the second extraction unit 13 to the first user as a search keyword candidate. .. With this configuration, for example, the search keyword of the second user who has the same interest as the first user is proposed to the first user, so that a search keyword more useful for the first user is proposed. become. That is, it is possible to propose a more appropriate search keyword.

Further, according to the search keyword proposal system 1, the first extraction unit 12 determines among the search keywords set by the first user, search keywords that have not been set at a predetermined time in the past from the present time or after setting. You may extract the search keyword of the second user who searched for the same news as the news searched by the search keyword whose time has passed. With this configuration, it is possible to propose a new search keyword for a search keyword that has not been set (left unattended) by the first user for a certain period of time. As a result, it is possible to propose a more appropriate search keyword for an old search keyword without causing the user to take time and effort.

Further, according to the search keyword proposal system 1, the user can set a score (usefulness) indicating the degree of usefulness of the news for the news searched by the search keyword, and the first extraction unit 12 can set the score (usefulness). , The search keyword of the second user may be extracted from the news searched by the search keyword set by the first user, in which the same news as the news set with the score satisfying a predetermined criterion is searched. .. With this configuration, the same news as the news that the first user finds useful is searched, and the search keywords of the second user are extracted, so that a more appropriate search that is more in line with the interests of the first user. You can suggest keywords.

Further, according to the search keyword proposal system 1, the user can set a score indicating the degree of usefulness of the news for the news searched by the search keyword, and the first extraction unit 12 is the first. Among the news searched by the search keyword set by the user, the search keyword of the second user who searched for the same news as the news for which the score that meets the predetermined criteria is not set at the predetermined time in the past from the present time is selected. It may be extracted. This configuration is not of interest to the first user, as it extracts the search keywords for the second user, who searched for the same news that the first user did not most recently find useful. , You can suggest new search keywords that will allow you to search for news that may be of interest to you.

Further, according to the search keyword proposal system 1, the user can set a score indicating the degree of usefulness of the news for the news searched by the search keyword, and the first extraction unit 12 is the first. Even if the search keyword of the second user is extracted, the news that is the same as the news searched by the search keyword set by the user but the news with the score set by the second user is set to meet the predetermined criteria is searched. Good. With this configuration, the search keyword for which the news that the second user deems useful is searched is extracted, so that a more appropriate search keyword can be proposed.

Further, according to the search keyword proposal system 1, the second extraction unit 13 has the search keywords set by the second user for the customer for which the search keywords extracted by the first extraction unit 12 have been set. The search keyword set after the search keyword extracted by the first extraction unit 12 may be extracted may be extracted. With this configuration, newer search keywords are extracted, so that more appropriate search keywords can be proposed.

Further, according to the search keyword proposal system 1, the proposal unit 14 uses the search keyword extracted by the second extraction unit 13 as a search keyword candidate, and gives the first user information indicating the timing when the search keyword is set. You may make a suggestion. With this configuration, the first user can consider the proposed search keyword including the set timing, so that a more appropriate search keyword can be selected.

Further, according to the search keyword proposal system 1, the user can set a score indicating the degree of usefulness of the news for the news searched by the search keyword, and the proposal unit 14 is the first extraction unit 12. Search keyword candidates may be proposed to the first user based on the score set in the news searched by the search keyword extracted by. Further, the proposal unit 14 is based on the aggregation of the set of the search keyword extracted by the second extraction unit 13 and the score set in the news searched by the search keyword extracted by the first extraction unit 12. The search keyword extracted by the second extraction unit 13 may be proposed to the first user as a search keyword candidate. In addition, the proposal unit 14 may perform weighting based on the set timing of the search keyword extracted by the second extraction unit 13 at the time of aggregation. With this configuration, the search keyword is proposed based on the score (and the timing at which the search keyword is set), so that a more appropriate search keyword can be proposed.

Further, according to the search keyword proposal system 1, the proposal unit 14 may propose a search keyword candidate to the first user based on the aggregation of the search keywords extracted by the second extraction unit 13. In addition, the proposal unit 14 may perform weighting based on the set timing of the search keyword extracted by the second extraction unit 13 at the time of aggregation. With this configuration, the search keyword is proposed based on the aggregation (and the timing at which the search keyword is set), so that a more appropriate search keyword can be proposed.

Customer interests generally develop over time. In order to grasp the latest situation of interest, it is necessary to update the search keyword once set. In addition, expected users such as sales staff are required to maintain good relationships with many customers, and the number of search keywords to be updated increases in proportion to the number of customers. Updating many search keywords is a burden to the user. However, if the update is neglected, the accuracy of the search keyword will deteriorate, the quality of the extracted information will deteriorate, and the added value of the service will decrease. In some cases, new search keywords can be easily set through conversations with customers, but it is not easy to update search keywords for customers who do not talk frequently. Therefore, the issue is whether there is a way to update the keywords while suppressing the burden on the user.

When browsing news on the web of major media, there is a function to present news that is highly relevant to the news, but existing recommendations based on such relevance can adjust the news group viewed by the user. Can not. Searching with a normal web browser requires a lot of operations for each customer, and "filter bubble", that is, the browsing history of the searcher (the user) is reflected in the search results, and it is for the searcher instead of the customer. There is also the problem of being biased.

According to the search keyword proposal system 1 according to the embodiment, since the user can update the search keyword by selecting from the presented options, the burden of updating is significantly suppressed as compared with the resetting from a blank sheet.

In the search keyword proposal system 1 according to the embodiment, when recommending a new search keyword to the first user, the second user who has scored the same news as the first user in the past (actually, the second user). If there are multiple users other than the user, the search keywords set by all of them) will be the target of the proposal. In addition, the search keyword proposal system 1 searches for changes in the search keywords of other people in the news with the same score (listing new ones or totaling old and new ones).

1 ... Search keyword proposal system, 10 ... Management unit, 11 ... Storage unit, 12 ... First extraction unit, 13 ... Second extraction unit, 14 ... Proposal unit, 50 ... Storage medium, 51 ... Program storage area, 100 ... Search Keyword Proposal program, 101 ... Management module, 102 ... Storage module, 103 ... First extraction module, 104 ... Second extraction module, 105 ... Proposal module, 1001 ... Processor, 1002 ... Memory, 1003 ... Storage, 1004 ... Communication device, 1005 ... Input device, 1006 ... Output device.

Claims (13)

It is a search keyword proposal system that manages the search keywords set for each management target by each of a plurality of users and the search results searched by the search keywords.
The first extraction unit that extracts the search keywords of the second user who searched for the same search results as the search results searched by the search keywords set by the first user,
The second extraction unit that extracts the search keyword set by the second user for the management target in which the search keyword extracted by the first extraction unit is set, and the second extraction unit.
A proposal unit that proposes the search keyword extracted by the second extraction unit to the first user as a search keyword candidate, and a proposal unit.
Search keyword suggestion system with. Among the search keywords set by the first user, the first extraction unit is searched by a search keyword that has not been set at a predetermined time in the past from the present time or a search keyword that has been set for a predetermined time. Extract the search keyword of the second user who searched the same search result as the search result,
The search keyword proposal system according to claim 1. The user can set the usefulness indicating the degree of usefulness of the search result for the search result searched by the search keyword.
The first extraction unit searches for the same search results as the search results for which the usefulness satisfying a predetermined criterion is set among the search results searched by the search keyword set by the first user. Extract user search keywords,
The search keyword proposal system according to claim 1 or 2. The user can set the usefulness indicating the degree of usefulness of the search result for the search result searched by the search keyword.
The first extraction unit is the same search result as the search result searched by the search keyword set by the first user, for which the usefulness that satisfies the predetermined criterion is not set at the predetermined time in the past from the present time. Extract the search keywords of the second user whose results were searched,
The search keyword proposal system according to any one of claims 1 to 3. The user can set the usefulness indicating the degree of usefulness of the search result for the search result searched by the search keyword.
The first extraction unit searches for search results that are the same as the search results searched by the search keyword set by the first user and whose usefulness is set by the second user and satisfies a predetermined criterion. Also, extract the search keyword of the second user,
The search keyword proposal system according to any one of claims 1 to 4. The second extraction unit is a search keyword extracted by the first extraction unit among the search keywords set by the second user for the management target in which the search keyword extracted by the first extraction unit is set. Extract the search keywords set after is set,
The search keyword proposal system according to any one of claims 1 to 5. The proposal unit proposes to the first user the search keyword extracted by the second extraction unit as a search keyword candidate together with information indicating the timing when the search keyword is set.
The search keyword proposal system according to any one of claims 1 to 6. The user can set the usefulness indicating the degree of usefulness of the search result for the search result searched by the search keyword.
The proposal unit proposes a search keyword candidate to the first user based on the usefulness set in the search result searched by the search keyword extracted by the first extraction unit.
The search keyword proposal system according to any one of claims 1 to 7. The proposal unit is based on the aggregation of a set of the search keyword extracted by the second extraction unit and the usefulness set in the search result searched by the search keyword extracted by the first extraction unit. The search keyword extracted by the second extraction unit is proposed to the first user as a search keyword candidate.
The search keyword proposal system according to claim 8. The proposal unit proposes a search keyword candidate to the first user based on the aggregation of the search keywords extracted by the second extraction unit.
The search keyword proposal system according to any one of claims 1 to 7. The proposal unit weights the search keywords extracted by the second extraction unit based on the set timing at the time of aggregation.
The search keyword suggestion system according to claim 9 or 10. It is a search keyword proposal method executed by the search keyword proposal system that manages the search keywords set for each management target by each of a plurality of users and the search results searched by the search keywords.
The first extraction step to extract the search keyword of the second user who searched for the same search result as the search result searched by the search keyword set by the first user,
The second extraction step of extracting the search keyword set by the second user for the management target in which the search keyword extracted in the first extraction step is set, and
A proposal step of proposing the search keyword extracted in the second extraction step to the first user as a search keyword candidate, and a proposal step.
Search keyword suggestion method including. A search keyword proposal system that manages the search keywords set for each management target by multiple users and the search results searched by the search keywords.
The first extraction unit that extracts the search keywords of the second user who searched for the same search results as the search results searched by the search keywords set by the first user,
The second extraction unit, which extracts the search keyword set by the second user for the management target in which the search keyword extracted by the first extraction unit is set,
A proposal unit that proposes the search keyword extracted by the second extraction unit to the first user as a search keyword candidate.
Search keyword suggestion program to function as.

Images