Account search device, account search method, and program

Abstract

This account search device uses information of a known account owned by a target user in a first service to identify a plurality of connected users who are connected to the target user in the first service, assigns an order to the plurality of connected users on the basis of pieces of information of accounts respectively owned by the connected users in the first service, and, according to the assigned order, uses the pieces of information of the accounts owned by the connected users in the first service to search for an account of the target user in a second service other than the first service.

Description

Account search device, account search method and program

[0001] The present disclosure relates to an account search device, an account search method, and a program.

[0002] There are various services, such as social networking services (SNS), in which users have their own accounts. A single user may have accounts on multiple services. In this case, even if the accounts belong to the same user, information such as the account name may differ for each service.

[0003] Therefore, technologies for searching for multiple accounts of the same user have been developed. For example, Patent Literature 1 discloses a technology for detecting accounts of the same user based on the account profiles and posted information.

[0004] International Publication No. 2021 / 240791

[0005] When a service has a large number of accounts, it may take a long time to search for the accounts. The present disclosure has been made in consideration of this problem, and one of its objectives is to provide a technology that shortens the time required to search for accounts of a user who has an account in one service in other services.

[0006] The account search device of the present disclosure includes an identification means for identifying multiple connected users who are connected to the target user in a first service using information on known accounts owned by the target user in the first service, a ranking means for assigning a ranking to the multiple connected users based on information on accounts owned by each connected user in the first service, and a search means for searching for the target user's account in a second service other than the first service using information on accounts owned by the connected users in the first service in accordance with the assigned ranking.

[0007] A computer-executed account search method according to the present disclosure includes: an identifying step of identifying a plurality of connected users who are connected to a target user in a first service by using information on known accounts owned by the target user in the first service; a ranking step of assigning a rank to the connected users based on information on accounts owned by each of the connected users in the first service; and a searching step of searching for accounts of the target user in a second service other than the first service by using information on accounts owned by the connected users in the first service in accordance with the assigned ranks.

[0008] The program of the present disclosure causes a computer to execute the following steps: an identification step of identifying multiple connected users who are connected to the target user in a first service using information about known accounts owned by the target user in the first service; a ranking step of assigning a ranking to the multiple connected users based on information about accounts owned by each connected user in the first service; and a search step of searching for accounts of the target user in a second service other than the first service using information about accounts owned by the connected users in the first service in accordance with the assigned rankings.

[0009] According to the present disclosure, a technique is provided that reduces the time required for a user who has an account in one service to search for the user's account in another service.

[0010] FIG. 1 is a diagram illustrating an example of an outline of the operation of an account search device. FIG. 2 is a diagram conceptually showing a search for an unknown account using a connected account. FIG. 3 is a block diagram illustrating an example of the functional configuration of an account search device. FIG. 4 is a block diagram illustrating an example of the hardware configuration of a computer that realizes the account search device. FIG. 5 is a flowchart illustrating an example of the flow of processing executed by the account search device. FIG. 6 is a flowchart illustrating an example of the flow of processing for searching for an unknown account using a connected account.

[0011] Hereinafter, embodiments of the present disclosure will be described in detail with reference to the drawings. In each drawing, the same or corresponding elements are designated by the same reference numerals, and duplicate explanations will be omitted as necessary for clarity. Furthermore, unless otherwise specified, predetermined values ​​such as predetermined values ​​and threshold values ​​are stored in advance in a storage device accessible from a device that uses the values. Furthermore, unless otherwise specified, the storage unit is composed of one or any number of storage devices.

[0012] <Overview> Fig. 1 is a diagram illustrating an example of an overview of the operation of the account search device 2000. Here, Fig. 1 is a diagram for facilitating understanding of the overview of the account search device 2000, and the operation of the account search device 2000 is not limited to the operation shown in Fig. 1.

[0013] The account search device 2000 is used to search for accounts in one or more services for a user who is the target of account search (hereinafter, target user 10). The service is, for example, any SNS.

[0014] A user is any entity that has an account with a service. For example, a user may be an individual or a corporation. Alternatively, a user may be an entity that is not classified as a corporation (e.g., a group of individuals).

[0015] It is assumed that the account of the target user 10 is known in the account search device 2000 for at least one service used by the target user 10. Hereinafter, a service for which the account of the target user 10 is known in the account search device 2000 is also referred to as a first service 50. On the other hand, a service other than the first service 50 is referred to as a second service 60. In addition, the account of the target user 10 in the first service 50 (i.e., the account of the target user 10 that is known in the account search device 2000) is also referred to as a known account 20.

[0016] Here, there may be two or more known accounts 20. That is, the target user 10 may have a known account in each of two or more first services 50.

[0017] The account search device 2000 uses account information of the known accounts 20 to search for unknown accounts of the target user 10. In other words, the account search device 2000 searches for accounts of the target user 10 in one or more second services 60 based on the account information of the known accounts 20. The accounts of the target user 10 in the second services 60 are also called unknown accounts.

[0018] Account information is various information related to an account, such as the account name, the name of the user who owns the account, information about accounts owned by the user on other services (such as the account name and a link to the account's web page), an email address, or a list of connected accounts.

[0019] The account information may include information about actions that have been performed using the account. Actions performed using the account include, for example, posting a post, uploading a photo or video, uploading location information, reacting to a post posted by another account, sending a message to another account, etc. Reactions to a post include, for example, posting a comment on the post, giving a reaction such as a like to the post, or quoting the post.

[0020] The search for unknown accounts is performed using account information of accounts (hereinafter, connected accounts 30) that are connected to known accounts 20 in the first service 50. A user who owns a connected account 30 is called a "connected user 40." The "connection" here may be a connection from one person to another, such as the relationship between a follower and a followee, or a mutual connection, such as a friendship relationship. Alternatively, for example, the "connection" may be a relationship in which one person responded to a post by the other person (i.e., a relationship between a user who posted a post and a user who responded to that post).

[0021] It is considered that users who are connected in one service are likely to be connected in other services as well. Therefore, the account search device 2000 uses account information of the connected account 30 to identify accounts owned by the connected user 40 in one or more second services 60. Then, the account search device 2000 searches for the account of the target user 10 from among the accounts that are connected to the account of the connected user 40 in the second service 60.

[0022] Hereinafter, the account for the first service 50 will also be referred to as a first account. The account for the second service 60 will also be referred to as a second account. The known account 20 can also be said to be the first account of the target user 10. The unknown account can also be said to be the second account of the target user 10. The connected account 30 can also be said to be the first account of the connected user 40.

[0023] 2 is a conceptual diagram illustrating the search for unknown accounts using a connection account 30. In the example of FIG. 2, in a first service 50, a known account 20 is connected to connection accounts 30-1 and 30-2. As a result, in the first service 50-1, a target user 10 is connected to a connection user 40-1 who is the owner of connection account 30-1, and a connection user 40-2 who is the owner of connection account 30-2.

[0024] The connected user 40-1 has a second account 90-1 in the second service 60-1. The second account 90-1 is connected to second accounts 90-2 to 90-N in the second service 60-1. The account search device 2000 then searches for the second account (i.e., an unknown account) of the target user 10 from among the second accounts 90-2 to 90-N.

[0025] On the other hand, the connected user 40-2 has a second account 100-1 in the second service 60-2. The second account 100-1 is connected to the second account 100-2 through the second account 100-M in the second service 60-2. The account search device 2000 then searches for the second account (i.e., an unknown account) of the target user 10 from the second accounts 100-2 through 100-M.

[0026] More specifically, the account search device 2000 identifies a plurality of connected users 40 using account information of the known accounts 20. Furthermore, the account search device 2000 assigns a ranking to each connected user 40 based on the account information of the connected accounts 30 owned by each of the plurality of connected users 40. Then, the account search device 2000 searches for unknown accounts using the account information of the connected accounts 30 owned by the connected users 40 according to the assigned ranking.

[0027] Specifically, the higher the ranking of the connected user 40, the higher the priority of the account information of the connected account 30 owned by that connected user 40. For example, in the example of Figure 2, the rankings of 1 and 2 are assigned to connected user 40-1 and connected user 40-2, respectively. In this case, the account search device 2000 uses the account information of connected account 30-1 in priority to the account information of connected account 30-2 in the search for unknown accounts.

[0028] The ranking of the connected users 40 is determined based on, for example, the cost required to identify the second account of the connected user 40 (hereinafter referred to as the identification cost). As described above, the account search device 2000 uses the second account of the connected user 40 to search for unknown accounts. Therefore, the easier it is to identify the second account of the connected user 40, the more likely it is that the time required to search for the unknown account will be shortened. Therefore, it is preferable that the account information of the connected account 30 of the connected user 40 with the smaller identification cost be used preferentially in searching for the unknown account.

[0029] In another example, the ranking of the connected users 40 is determined based on the degree of intimacy between the target user 10 and the connected users 40. The higher the degree of intimacy between the target user 10 and the connected users 40, the higher the probability that the target user 10 and the connected users 40 are also connected in services other than the first service 50. Therefore, it is considered that the more an unknown account is searched for using account information of the connected accounts 30 of connected users 40 who have a higher degree of intimacy with the target user 10, the higher the probability of detecting the unknown account. Therefore, it is preferable that the account information of the connected accounts 30 of connected users 40 who have a higher degree of intimacy with the target user 10 be used preferentially in searching for the unknown account.

[0030] <Example of Action and Effect> According to the account search device 2000, unknown accounts owned by the target user 10 in services other than the first service 50 are searched for using, as clues, the accounts of connected users 40 who are connected to the target user 10 in the first service 50. In this way, according to a method of using the accounts of connected users 40 as clues in searching for unknown accounts, the time required to search for unknown accounts can be reduced compared to when the accounts of connected users 40 are not used as clues.

[0031] Furthermore, the account search device 2000 assigns a ranking to the connected users 40, and uses the account information of the connected accounts 30 of the connected users 40 in accordance with the assigned ranking to search for unknown accounts. This method can further reduce the time required to search for unknown accounts.

[0032] For example, the ranking of connected users 40 is determined based on the identification cost (the cost required to identify the second account of the connected user 40). The smaller the identification cost of a connected user 40, the easier it is to identify the second account of that connected user 40. Therefore, a search for unknown accounts using the account information of the second account of the connected user 40 can be started sooner. Therefore, by assigning a ranking to connected users 40 based on the identification cost, the time required to search for unknown accounts can be shortened.

[0033] Alternatively, for example, the ranking of the connected users 40 may be determined based on the degree of intimacy between the target user 10 and the connected users 40. The higher the degree of intimacy between the connected users 40 and the target user 10, the higher the probability that the connected users 40 are also connected to the target user 10 in services other than the first service 50. Therefore, by searching for unknown accounts using preferentially the account information of the connected accounts 30 of connected users 40 who have a higher degree of intimacy with the target user 10, the time required to search for unknown accounts can be shortened.

[0034] The account search device 2000 of this embodiment will be described in more detail below.

[0035] <Example of Functional Configuration> Fig. 3 is a block diagram illustrating an example of the functional configuration of the account search device 2000. For example, the account search device 2000 has an identification unit 2020, a ranking unit 2040, and a search unit 2060. The identification unit 2020 identifies a plurality of connected users 40. The ranking unit 2040 assigns a ranking to each connected user 40 using account information of the connected accounts 30 owned by the connected users 40 in the first service 50. The search unit 2060 searches for unknown accounts using the account information of the connected accounts 30 of the connected users 40 according to the assigned rankings.

[0036] <Example of Hardware Configuration> Each functional component of the account search device 2000 may be realized by hardware that realizes the functional component (e.g., a hardwired electronic circuit, etc.), or may be realized by a combination of hardware and software (e.g., a combination of an electronic circuit and a program that controls it, etc.). Below, a case where each functional component of the account search device 2000 is realized by a combination of hardware and software will be further described.

[0037] 4 is a block diagram illustrating an example of the hardware configuration of a computer 1000 that realizes the account search device 2000. The computer 1000 is any computer. For example, the computer 1000 is a stationary computer such as a PC (Personal Computer) or a server machine. Alternatively, the computer 1000 may be a portable computer such as a smartphone or a tablet terminal. The computer 1000 may be a dedicated computer designed to realize the account search device 2000, or may be a general-purpose computer.

[0038] For example, by installing a predetermined application on the computer 1000, each function of the account search device 2000 is realized on the computer 1000. The application is configured as a program for realizing each functional component of the account search device 2000. Note that any method for acquiring the program is possible. For example, the program can be acquired from a storage medium (such as a DVD (Digital Versatile Disc) or a USB (Universal Serial Bus) memory) on which the program is stored. Alternatively, the program can be acquired by downloading the program from a server device that manages the storage device on which the program is stored.

[0039] The computer 1000 has a bus 1020, a processor 1040, a memory 1060, a storage device 1080, an input / output interface 1100, and a network interface 1120. The bus 1020 is a data transmission path for the processor 1040, the memory 1060, the storage device 1080, the input / output interface 1100, and the network interface 1120 to transmit and receive data to and from each other. However, the method of connecting the processor 1040 and the like to each other is not limited to bus connection.

[0040] The processor 1040 is one of various processors, such as a central processing unit (CPU), a graphics processing unit (GPU), a digital signal processor (DSP), or a field-programmable gate array (FPGA). The memory 1060 is a main storage device realized using a random access memory (RAM) or the like. The storage device 1080 is an auxiliary storage device realized using a hard disk, a solid state drive (SSD), a memory card, a read only memory (ROM), or the like.

[0041] The input / output interface 1100 is an interface for connecting the computer 1000 to an input / output device. For example, the input / output interface 1100 is connected to an input device such as a keyboard and an output device such as a display device.

[0042] The network interface 1120 is an interface for connecting the computer 1000 to a network. This network may be a LAN (Local Area Network) or a WAN (Wide Area Network).

[0043] The storage device 1080 stores a program (a program that realizes the above-mentioned application) that realizes each functional component of the account search device 2000. The processor 1040 reads this program into the memory 1060 and executes it, thereby realizing each functional component of the account search device 2000.

[0044] The account search device 2000 may be realized by one computer 1000, or may be realized by multiple computers 1000. In the latter case, the configuration of each computer 1000 does not need to be the same, and can be different from each other.

[0045] 5 is a flowchart illustrating the flow of processing executed by the account search device 2000. The identification unit 2020 identifies multiple related users 40 (S102). The ranking unit 2040 assigns rankings to the related users 40 (S104). The search unit 2060 searches for unknown accounts using account information of the related accounts 30 of the related users 40 according to the assigned rankings (S106).

[0046] <Identifying Related Users 40: S102> The identification unit 2020 identifies a plurality of related users 40 (S102). The related users 40 can be identified by identifying the related accounts 30.

[0047] The identification unit 2020 identifies the connected accounts 30 by referencing the account information of the known account 20. As a premise, the account information of the known account 20 indicates information (e.g., account name) of each account that is connected to the known account 20 in the first service 50. The identification unit 2020 identifies, as connected accounts 30, each account that is indicated as an account that is connected to the known account 20 in the account information of the known account 20.

[0048] The identification unit 2020 uses the account information of the connection account 30 to identify the connection user 40 who owns the connection account 30. For example, the identification unit 2020 identifies the connection user 40 who owns the connection account 30 by the user name indicated in the account information of the connection account 30.

[0049] Here, the identification unit 2020 acquires account information of the known account 20 in order to identify the linked account 30. The method of acquiring the account information of the known account 20 is arbitrary. For example, a user of the account search device 2000 inputs information for identifying the known account 20 to the account search device 2000. The information for identifying the known account 20 is, for example, the account name of the known account 20 or the URL (Uniform Resource Locator) of the web page of the known account 20. The account search device 2000 acquires the account information of the known account 20 using the information input by the user.

[0050] Alternatively, for example, the account information of the known account 20 may be stored in advance in an arbitrary storage unit in a manner accessible from the account search device 2000. In this case, the identification unit 2020 accesses the storage unit and acquires the account information of the known account 20.

[0051] <Rank Assignment: S104> The ranking unit 2040 assigns a rank to the connected user 40 (S104). As described above, the rank of the connected user 40 is determined based on a specific cost, the intimacy with the target user 10, or both. Hereinafter, a detailed description will be given of each of the method using the specific cost and the method using the intimacy with the target user 10.

[0052] <<Method of Using Specific Cost>> The ranking unit 2040 calculates a specific cost for each connected user 40. Then, the ranking unit 2040 assigns a higher rank to the connected user 40 with a smaller specific cost. In other words, the order of the connected users 40 is in ascending order of the specific cost. As described above, the specific cost of the connected user 40 is the cost required to identify the second account of the connected user 40.

[0053] For example, the specific cost is determined based on whether information (hereinafter referred to as hint information) that serves as a clue for identifying the second account of the connected user 40 is included in the account information of the connected account 30 of the connected user 40. When there is hint information for the connected user 40, it is easier to identify the second account of the connected user 40 compared to the case where there is no hint information for the connected user 40.

[0054] Therefore, for example, the specific cost when there is hint information for the connected user 40 is predetermined to be a lower value than the specific cost when there is no hint information for the connected user 40. That is, the specific cost C1 when there is hint information for the connected user 40 and the specific cost C2 when there is no hint information for the connected user 40 are predetermined to satisfy C1 < C2.

[0055] The ranking unit 2040 determines, for each connected user 40, whether or not hint information is included in the account information of the connected account 30 of that connected user 40. If hint information is included in the account information of the connected account 30 of the connected user 40, the ranking unit 2040 sets the specific cost of that connected user 40 to C1. On the other hand, if hint information is not included in the account information of the connected account 30 of the connected user 40, the ranking unit 2040 sets the specific cost of that connected user 40 to C2.

[0056] The hint information may include various information. For example, the hint information may be a link that can refer to the second account of the related user 40. The link may be, for example, a link to a web page of the second account of the related user 40.

[0057] Other examples of the hint information include the name of the second service 60 for which the related user 40 has a second account, or a link to the web page of the second service 60. Other examples of the hint information include the name of the related user 40's second account, or the email address of the related user 40.

[0058] The identification cost may be calculated based on the type of hint information included in the account information of the connected account 30. For example, a predetermined score is assigned in advance to each of multiple types of hint information that may be included in the account information of the connected account 30. Here, the more useful the information is in identifying the second account of the connected user 40, the lower the score assigned. Also, each score is assumed to be a negative value. In this way, the more hint information that is useful in identifying the second account of the connected user 40 exists, the smaller the total score becomes.

[0059] The ranking unit 2040 calculates the specific cost of the connected user 40 based on the type of hint information included in the account information of the connected account 30 of the connected user 40. Specifically, the ranking unit 2040 calculates the total score by adding up the scores of each piece of hint information included in the account information of the connected account 30 of the connected user 40. Then, the ranking unit 2040 calculates the specific score by adding the total score to the initial value of the specific cost. The initial value of the specific score is a predetermined value such as 100.

[0060] As described above, the score assigned to each type of hint information is a negative value. Therefore, the more hint information there is that is useful for identifying the second account of the related user 40, the smaller the identification cost of the related user 40 will be compared to the initial value. On the other hand, if there is no hint information about the related user 40, the identification cost of the related user 40 will remain at the initial value. Therefore, if there is no hint information about the related user 40, the value of the identification cost of the related user 40 will be the largest.

[0061] Here, it is assumed that there are two or more first services 50. In this case, each connected user 40 may own a connected account 30 in each different first service 50. Therefore, each connected user 40 may own multiple connected accounts 30.

[0062] In this case, for example, the ranking unit 2040 calculates the specific cost by the above-described method for each of one or more connection accounts 30 owned by the connection user 40. Then, the ranking unit 2040 treats the calculated statistical value of the specific cost (such as the average value, maximum value, or minimum value) as the specific cost of the connection user 40.

[0063] For example, suppose a connected user 40 has accounts in a first service FS1 and a first service FS2. In this case, the ranking unit 2040 calculates a specific cost Ca based on the account information of the connected account 30 of the connected user 40 in the first service FS1. The ranking unit 2040 also calculates a specific cost Cb using the account information of the connected account 30 of the connected user 40 in the first service FS2. The ranking unit 2040 then calculates the statistical values ​​of Ca and Cb as the specific cost of the connected user 40.

[0064] Note that the connected users 40 to which rankings are assigned may be all connected users 40 or some of the connected users 40. In the latter case, for example, the number of connected users 40 to be assigned rankings (hereinafter referred to as the assigned number) is determined in advance. When the assigned number is P, the ranking assignment unit 2040 assigns rankings to connected users 40 from 1st place to Pth place in order of lowest specific cost. In other words, no rankings are assigned to connected users 40 that are P+1th or later in order of lowest specific cost. In this way, by setting an upper limit on the number of connected users 40 to be assigned rankings, the time required to assign rankings to connected users 40 can be reduced.

[0065] <<Intimacy with Target User 10>> The ranking unit 2040 calculates the intimacy with the target user 10 for each related user 40. A related user 40 with a higher intimacy with the target user 10 is assigned a higher ranking. In other words, the related users 40 are ranked in descending order of intimacy.

[0066] The intimacy between the target user 10 and the connected user 40 is calculated based on one or more factors that represent the intimacy between the target user 10 and the connected user 40 in the first service 50. For example, the factors are (1) the time when the last action was taken between the target user 10 and the connected user 40, (2) the number of actions taken between the target user 10 and the connected user 40, or (3) the number of accounts connected to both the target user 10 and the connected user 40. Hereinafter, (1), (2), and (3) are also expressed as the time of the most recent action, the number of actions, and the number of common connections, respectively.

[0067] Here, actions performed between the target user 10 and the connected user 40 include sending a message from one to the other, or a response from the other to a post by one.

[0068] It can be predicted that the closer the most recent action time of a connected user 40 is to the current time, the higher the intimacy level with the target user 10. Therefore, the closer the most recent action time of a connected user 40 is to the current time, the higher the intimacy level with the target user 10 is set.

[0069] Furthermore, it can be predicted that the more actions a connected user 40 takes, the higher the degree of intimacy with the target user 10. Therefore, the more actions a connected user 40 takes, the higher the degree of intimacy with the target user 10 is set.

[0070] Furthermore, it can be predicted that the more common connections a connected user 40 has, the higher the degree of intimacy with the target user 10. Therefore, the more common connections a connected user 40 has, the higher the degree of intimacy with the target user 10 is set.

[0071] For example, the ranking unit 2040 calculates, for each connected user 40, a first score based on the time of the most recent action, a second score based on the number of actions, and a third score based on the number of common connections. The score for each factor is determined, for example, by the ranking of the connected users 40 for that factor. For example, the first score of a certain connected user 40 is determined by the ranking of the connected users 40 in the order of the most recent action. Furthermore, the second score of a certain connected user 40 is determined by the ranking of the connected users 40 in the order of the most recent number of actions. Furthermore, the third score of a certain connected user 40 is determined by the ranking of the connected users 40 in the order of the most common connections.

[0072] For example, the ranking unit 2040 calculates a score representing the degree of intimacy (hereinafter referred to as the intimacy score) for each connected user 40 based on the first score, second score, and third score calculated for that connected user 40. For example, the intimacy score is the product or sum of the first score, second score, and third score. The sum may be a simple sum or a weighted sum.

[0073] For example, suppose a certain connected user 40 is ranked third in order of latest most recent action, fourth in order of most number of actions, and first in order of most common connections. In this case, the first score, second score, and third score for this connected user 40 are 3, 4, and 1, respectively.

[0074] If the product of the first score, the second score, and the third score is treated as the intimacy score, the intimacy score of this connected user 40 will be 12 (= 3 * 4 * 1). On the other hand, if the sum of the first score, the second score, and the third score is treated as the intimacy score, the intimacy score of this connected user 40 will be 8 (= 3 + 4 + 1).

[0075] When the intimacy score is calculated using the method described above, it can be predicted that the smaller the intimacy score of a connected user 40, the higher the intimacy with the target user 10. Therefore, the ranking assignment unit 2040 assigns a higher ranking to a connected user 40 with a smaller intimacy score.

[0076] The method for calculating scores such as the first score is not limited to the above-described method. For example, to calculate the first score, a first function may be defined in advance that outputs a larger value the smaller the difference between the time of the most recent action and the current time. In this case, the ranking unit 2040 calculates the first score by inputting the difference between the time of the most recent action of the related user 40 and the current time into the first function.

[0077] Similarly, to calculate the second score, a second function that outputs a larger value as the number of actions of the related users 40 increases may be defined in advance. In this case, the ranking unit 2040 calculates the second score by inputting the number of actions of the related users 40 into the second function.

[0078] Similarly, to calculate the third score, a third function that outputs a larger value as the number of common connections between the connected users 40 increases may be defined in advance. In this case, the ranking unit 2040 calculates the third score by inputting the number of common connections between the connected users 40 into the third function.

[0079] When the first to third functions are used, the larger the value of each of the first to third scores, the higher the degree of intimacy between the related user 40 and the target user 10. Therefore, the larger the intimacy score calculated using the first to third scores, the higher the degree of intimacy between the related user 40 and the target user 10. Therefore, the ranking assignment unit 2040 assigns a higher ranking to a related user 40 with a higher intimacy score.

[0080] Note that only one or two of the first score, second score, and third score may be used to calculate the intimacy score. Furthermore, the factors described above are merely examples, and other factors may be used. For example, assume that N factors are used to calculate the intimacy score. In this case, the first score to the Nth score are calculated based on the first factor to the Nth factor. The ranking assignment unit 2040 then calculates the product or sum of the first score to the Nth score as the intimacy score.

[0081] As described above, if there are two or more first services 50, the connected user 40 may own multiple connected accounts 30. Therefore, for example, the ranking unit 2040 calculates the degree of intimacy between the target user 10 and the connected user 40 using the method described above for each of the one or more connected accounts 30 owned by the connected user 40. Then, the ranking unit 2040 treats the calculated statistical value of the intimacy as the degree of intimacy between the target user 10 and the connected user 40.

[0082] For example, suppose that the connected user 40 has accounts in the first service FS1 and the first service FS2. In this case, the ranking unit 2040 calculates the degree of intimacy between the target user 10 and the connected user 40 for each of the first service FS1 and the first service FS2. The ranking unit 2040 then treats the calculated statistical values ​​of the two intimacy degrees as the degree of intimacy between the target user 10 and the connected user 40.

[0083] The intimacy between the target user 10 and the connected user 40 in the first service FS1 is calculated based on, for example, the time of the last action taken between the target user 10 and the connected user 40 in the first service FS1, the number of actions taken between the target user 10 and the connected user 40 in the first service FS1, or the number of accounts connected to both the target user 10 and the connected user 40 in the first service FS1. The same applies to the intimacy between the target user 10 and the connected user 40 in the first service FS2.

[0084] <<Cases where both specific cost and intimacy are used>> The ranking assignment unit 2040 may assign a rank to the related users 40 based on both the specific cost and the intimacy. For example, the ranking assignment unit 2040 calculates a total score based on the specific cost and the intimacy score. For example, the ranking assignment unit 2040 assigns a higher rank to a related user 40 with a smaller total score. In other words, the ranking of the related users 40 is in ascending order of total score.

[0085] For example, the ranking unit 2040 may adjust the scales of the specific cost and the intimacy score, calculate a simple sum or a weighted sum of them, and use the calculated value as the overall score. Alternatively, for example, the ranking unit 2040 may use the product of the specific cost and the intimacy score as the overall score. Here, the intimacy score is a value that indicates that the smaller the intimacy score, the higher the intimacy between the target user 10 and the connection user 40.

[0086] <Searching for Unknown Accounts: S106> The searching unit 2060 searches for unknown accounts using the account information of the connected accounts 30 of the connected users 40 according to the determined ranking (S106). That is, the account information of the connected accounts 30 of the connected users 40 with the highest ranking is used in the search for unknown accounts.

[0087] 6 is a flowchart illustrating a process flow for searching for unknown accounts using connected accounts 30. Steps S202 to S214 constitute a loop process L1. The loop process L1 is executed for each connected user 40 in the order determined by the ranking unit 2040.

[0088] In FIG. 6, i represents the current iteration number (a number indicating the current iteration) in the loop process L1. In the i-th iteration of the loop process L1, the account information of the connection account 30 of the i-th connection user 40 is used. In FIG. 6, the i-th connection user 40 is represented as connection user i. Furthermore, the total number of ranked connection users 40 is represented as P.

[0089] In S202, the search unit 2060 determines whether i is equal to or less than P. If i is greater than P, this means that the loop process L1 has already been executed for all ranked connected users 40. Therefore, if i is greater than P, the loop process L1 ends. On the other hand, if i is equal to or less than P, the search unit 2060 executes the processes from S204 onwards for the connected user i.

[0090] In S204, the search unit 2060 identifies one or more second accounts of the related user i using the account information of the related account 30 of the related user i (S204). S206 to S212 constitute a loop process L2. The loop process L2 is executed for each second account of the related user i.

[0091] In S206, the search unit 2060 determines whether or not the loop process L2 has already been executed for all the second accounts of the related user i. If the loop process L2 has already been executed for all the second accounts of the related user i, the search unit 2060 ends the execution of the loop process L2. When the execution of the loop process L2 ends, the processing by the search unit 2060 transitions to the beginning of the loop process L1 (S202).

[0092] In S206, it is assumed that there is a second account of the related user i that has not yet been subject to the loop process L2. In this case, the search unit 2060 selects one of the second accounts of the related user i that has not yet been subject to the loop process L2. The selected second account is referred to as second account j.

[0093] The search unit 2060 identifies one or more second accounts that are connected to the second account j (S208). The search unit 2060 searches for an unknown account from among the identified second accounts (S210). Since S212 is the end of the loop processing L2, the processing by the search unit 2060 transitions to S206.

[0094] <<Identifying the Second Account of the Related User i: S204>> The searching unit 2060 uses the account information of the related account 30 of the related user i to identify the second account (an account that the related user i owns in a service other than the first service 50) (S204). For example, the searching unit 2060 uses hint information included in the account information of the related account 30 of the related user i to identify the second account of the related user i.

[0095] For example, the search unit 2060 assumes that the hint information of the connected user i includes links to accounts in one or more second services 60. In this case, the search unit 2060 uses the links to identify the second accounts.

[0096] Alternatively, for example, the search unit 2060 may assume that the hint information of the related user i includes the email address of the related user i. In this case, the search unit 2060 searches for an account having the email address indicated in the hint information of the related user i for each of one or more second services 60, thereby identifying one or more second accounts of the related user i.

[0097] The second service 60 to be searched for the second account of the related user i may or may not be predetermined. In the former case, the search unit 2060 searches for the account of the related user i from among the accounts of one or more predetermined second services 60.

[0098] If the target second service 60 is not predetermined, for example, the search unit 2060 searches for information on the Internet using the contents of the hint information of the related user i. The search unit 2060 searches for the second account of the related user i among one or more second services 60 that appear in the search results.

[0099] <<Identifying Second Accounts Connected to Second Account j: S208>> The search unit 2060 identifies one or more second accounts connected to the second account j of the connected user i. Hereinafter, the second service 60 in which the second account j exists will also be referred to as the second service j. The search unit 2060 identifies second accounts connected to the second account j from among the accounts existing in the second service j. This can be done using a method similar to the method used to identify connected accounts 30 connected to the known account 20 for the first service 50.

[0100] <<Searching for Unknown Accounts: S210>> The searching unit 2060 searches for unknown accounts from among the one or more second accounts identified in S208 (S210). That is, the searching unit 2060 determines, for each second account identified in S208, whether the second account is owned by the target user 10.

[0101] There are various methods for determining whether the second account is an account owned by the target user 10. For example, the search unit 2060 calculates the degree of match between the content of the account information of the second account and the content of the account information of the known account 20. If the calculated degree of match is equal to or greater than a threshold, the search unit 2060 determines that the second account is an account owned by the target user 10. In other words, in this case, the second account is detected as an unknown account. On the other hand, if the calculated degree of match is not equal to or greater than the threshold, the search unit 2060 determines that the second account is not an account owned by the target user 10.

[0102] <Output by Account Search Device 2000> The account search device 2000 preferably outputs information indicating the results of the processing (hereinafter, output information). When an unknown account is detected, the output information includes information about the detected unknown account. The information about the unknown account included in the output information may be, for example, the name of the second service 60 in which the unknown account exists, the account name of the unknown account, the username of the unknown account, or the email address of the unknown account. The output information may also include information about the connected users 40 used to detect the unknown account.

[0103] For example, suppose that account A2, which is connected to account A1 of connected user X, is detected as an unknown account in second service S. In this case, the output information includes information about second service S, information about unknown account A2, information about connected user X, etc.

[0104] If no unknown account is detected, for example, the output information includes information indicating that no unknown account is detected.

[0105] Regardless of whether an unknown account is detected, the output information may further include various information used in the processing by the account search device 2000. The information used in the processing by the account search device 2000 includes, for example, information on the ranking assigned to each connected user 40.

[0106] The output information may be output in any manner. For example, the account search device 2000 may store the output information in any storage unit. Alternatively, for example, the account search device 2000 may display the contents of the output information on a display device. Alternatively, for example, the account search device 2000 may transmit the output information to another device (for example, a terminal used by the user of the account search device 2000).

[0107] Although the present disclosure has been described above with reference to the embodiments, the present disclosure is not limited to the above-described embodiments. Various modifications that can be understood by those skilled in the art can be made to the configuration and details of the present disclosure within the scope of the present disclosure. Furthermore, each embodiment can be combined with other embodiments as appropriate.

[0108] Each drawing is merely an example for describing one or more embodiments. Each drawing may not relate to only one particular embodiment, but may also relate to one or more other embodiments. As will be understood by those skilled in the art, various features or steps described with reference to any one drawing can be combined with features or steps shown in one or more other drawings to create, for example, an embodiment not explicitly shown or described. Not all features or steps shown in any one drawing are necessary to describe an exemplary embodiment, and some features or steps may be omitted. The order of steps described in any drawing may be changed as appropriate.

[0109] Some or all of the above embodiments can be described as, but are not limited to, the following supplementary notes. (Supplementary Note 1) An account search device comprising: an identification means for identifying a plurality of connected users who are connected to a target user in a first service by using information of known accounts owned by the target user in the first service; a ranking means for assigning a rank to the plurality of connected users based on information of accounts owned by each of the connected users in the first service; and a search means for searching for an account of the target user in a second service other than the first service by using information of accounts owned by the connected users in the first service in accordance with the assigned rank. (Supplementary Note 2) The account search device according to Supplementary Note 1, wherein the ranking means determines a rank to be assigned to the connected users based on a cost required to identify the accounts of the connected users in the second service, a degree of intimacy between the connected users and the target user, or both. (Supplementary Note 3) The account search device according to Supplementary Note 2, wherein the ranking means calculates the degree of intimacy between the target user and the related user based on the time of the last action taken between the target user and the related user, the number of actions taken between the target user and the related user, the number of connections common between the target user and the related user, or any combination thereof. (Supplementary Note 4) The account search device according to Supplementary Note 2, wherein known accounts of the target user exist in a plurality of first services, and the ranking means calculates the degree of intimacy between the target user and the related user for each of the plurality of first services and ranks the related users using the calculated plurality of intimacy statistical values. (Supplementary Note 5) The account search device according to Supplementary Note 2, wherein the ranking means calculates the cost based on hint information useful for identifying the related user's account in the second service, which is included in information about the related user's account in the first service.(Supplementary Note 6) The account search device according to Supplementary Note 5, wherein a score is assigned to each of a plurality of types of hint information, and the ranking assigning means calculates the cost by adding up scores corresponding to one or more of the hint information included in the account information of the connected user. (Supplementary Note 7) The account search device according to any one of Supplementary Notes 1 to 6, wherein the searching means identifies the account of the connected user in the second service, identifies a user who is connected to the connected user in the second service by using information on the account of the connected user in the second service, and determines whether the identified user is the target user. (Supplementary Note 8) An account search method executed by a computer, comprising: an identification step of identifying a plurality of connected users who are connected to the target user in a first service by using information of known accounts owned by the target user in the first service, a ranking step of assigning a rank to the plurality of connected users based on information of accounts owned by each of the connected users in the first service, and a search step of searching for accounts of the target user in a second service other than the first service by using information of accounts owned by the connected users in the first service in accordance with the assigned ranks. (Supplementary Note 9) The account search method described in Supplementary Note 8, wherein in the ranking step, a rank to be assigned to the connected users is determined based on a cost required to identify the accounts of the connected users in the second service, a degree of intimacy between the connected users and the target user, or both of these.(Supplementary Note 10) A program that causes a computer to execute the following steps: an identification step of identifying multiple connected users who are connected to the target user in a first service using information on known accounts owned by the target user in the first service; a ranking step of assigning a rank to the multiple connected users based on information on accounts owned by each connected user in the first service; and a search step of searching for accounts of the target user in a second service other than the first service using information on accounts owned by the connected users in the first service in accordance with the assigned ranks.

[0110] Some or all of the elements (e.g., configurations and functions) described in Supplementary Notes 3 to 7 that are dependent on Supplementary Note 1 may also be dependent on Supplementary Note 8 in the same dependency relationship as Supplementary Notes 3 to 7. Some or all of the elements (e.g., configurations and functions) described in Supplementary Notes 2 to 7 that are dependent on Supplementary Note 1 may also be dependent on Supplementary Note 10 in the same dependency relationship as Supplementary Notes 2 to 7. Some or all of the elements described in any Supplementary Note may be applicable to various hardware, software, recording means for recording software, systems, and methods.

[0111] This application claims priority based on Japanese Patent Application No. 2024-021878, filed February 16, 2024, the disclosure of which is incorporated herein in its entirety by reference.

[0112] REFERENCE SIGNS LIST 10 target user 20 known account 30 account 40 connected user 50 first service 60 second service 90 second account 100 second account 1000 computer 1020 bus 1040 processor 1060 memory 1080 storage device 1100 input / output interface 1120 network interface 2000 account search device 2020 identification unit 2040 ranking unit 2060 search unit

Claims

1. An account search device having: an identification means for identifying multiple connected users who are connected to the target user in a first service using information on known accounts owned by the target user in the first service; a ranking means for assigning a ranking to the multiple connected users based on information on the accounts owned by each connected user in the first service; and a search means for searching for the target user's account in a second service other than the first service using information on the accounts owned by the connected users in the first service in accordance with the assigned ranking.

2. The account search device of claim 1, wherein the ranking assignment means determines the ranking to be assigned to the connected user based on the cost required to identify the account of the connected user in the second service, the degree of intimacy between the connected user and the target user, or both of these.

3. The account search device of claim 2, wherein the ranking assignment means calculates the degree of intimacy between the target user and the connection user based on the time of the last action taken between the target user and the connection user, the number of actions taken between the target user and the connection user, the number of connections common between the target user and the connection user, or any combination thereof.

4. The account search device described in claim 2, wherein the target user's known accounts exist in multiple first services, and the ranking assignment means calculates the degree of intimacy between the target user and the related users for each of the multiple first services, and assigns a rank to the related users using the calculated statistical values ​​of the multiple intimacy levels.

5. The account search device described in claim 2, wherein the ranking assignment means calculates the cost based on hint information useful for identifying the account of the connected user in the second service, which is contained in information about the account of the connected user in the first service.

6. The account search device of claim 5, wherein a score is assigned to each of the multiple types of hint information, and the ranking assignment means calculates the cost by adding up the scores corresponding to one or more of the hint information included in the account information of the connected user.

7. An account search device described in any one of claims 1 to 6, wherein the search means: identifies the account of the connected user in the second service; uses information of the connected user's account in the second service to identify users who are connected to the connected user in the second service; and determines whether the identified users are the target user.

8. An account search method executed by a computer, comprising: an identification step of identifying multiple connected users who are connected to the target user in a first service using information on known accounts owned by the target user in the first service; a ranking step of assigning a rank to the multiple connected users based on information on accounts owned by each connected user in the first service; and a search step of searching for accounts of the target user in a second service other than the first service using information on accounts owned by the connected users in the first service in accordance with the assigned ranks.

9. An account search method as described in claim 8, wherein in the ranking assignment step, the ranking to be assigned to the connected user is determined based on the cost required to identify the account of the connected user in the second service, the intimacy between the connected user and the target user, or both of these.

10. A program that causes a computer to execute the following steps: an identification step of identifying multiple connected users who are connected to the target user in a first service using information about known accounts owned by the target user in the first service; a ranking step of assigning a rank to the multiple connected users based on information about the accounts owned by each connected user in the first service; and a search step of searching for the target user's account in a second service other than the first service using information about the accounts owned by the connected users in the first service in accordance with the assigned rank.

Images