KR101805847B1 - Method for matching between identifiers for a user and device for the same - Google Patents

Method for matching between identifiers for a user and device for the same Download PDF

Info

Publication number
KR101805847B1
KR101805847B1 KR1020150174162A KR20150174162A KR101805847B1 KR 101805847 B1 KR101805847 B1 KR 101805847B1 KR 1020150174162 A KR1020150174162 A KR 1020150174162A KR 20150174162 A KR20150174162 A KR 20150174162A KR 101805847 B1 KR101805847 B1 KR 101805847B1
Authority
KR
South Korea
Prior art keywords
identification information
message
type
pair
time
Prior art date
Application number
KR1020150174162A
Other languages
Korean (ko)
Other versions
KR20170067460A (en
Inventor
김승범
Original Assignee
주식회사 온누리디엠씨
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 주식회사 온누리디엠씨 filed Critical 주식회사 온누리디엠씨
Priority to KR1020150174162A priority Critical patent/KR101805847B1/en
Publication of KR20170067460A publication Critical patent/KR20170067460A/en
Application granted granted Critical
Publication of KR101805847B1 publication Critical patent/KR101805847B1/en

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q50/00—Systems or methods specially adapted for specific business sectors, e.g. utilities or tourism
    • G06Q50/10—Services
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
    • G06F21/60—Protecting data
    • G06F21/62—Protecting access to data via a platform, e.g. using keys or access control rules
    • G06F21/6218—Protecting access to data via a platform, e.g. using keys or access control rules to a system of files or objects, e.g. local or distributed file system or database
    • G06F21/6245—Protecting personal data, e.g. for financial or medical purposes
    • G06F21/6263—Protecting personal data, e.g. for financial or medical purposes during internet communication, e.g. revealing personal data from cookies
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q30/00—Commerce
    • G06Q30/02—Marketing; Price estimation or determination; Fundraising
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q50/00—Systems or methods specially adapted for specific business sectors, e.g. utilities or tourism
    • G06Q50/30—Transportation; Communications
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L51/00—User-to-user messaging in packet-switching networks, transmitted according to store-and-forward or real-time protocols, e.g. e-mail
    • H04L51/04—Real-time or near real-time messaging, e.g. instant messaging [IM]

Abstract

A matching method for matching different types of identification information by receiving messages including a specific tuple, the matching method comprising: receiving a first type of trailing identification information and a second type Using the data accumulation process to increase the score of the pair of identification information consisting of the preceding identification information of each of the plurality of identifiers and using the data accumulation process each time a message is received for a predetermined time, Pairs of identification information-pairs by filtering at least some of the plurality of identification information-pairs using scores assigned to the information-pairs.

Description

[0001] DESCRIPTION [0002] METHOD AND APPARATUS FOR MAKING IDENTIFICATION INFORMATION CONTAINING USERS [0003]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a computing technology, and relates to a technique of matching two types of identification information having different types to each other. To a technique for cross-platform re-targeting between Internet Web-browsers and applications in mobile devices.

A cookie, which is a temporary file that is automatically created when a user accesses a web site, may contain various kinds of information of the user. For example, the cookie may include information such as a product, a purchase history, and an IP address of a user viewed from the web site. Such a cookie can be used to track a user's visit to various websites. In addition, cookies that can have domain addresses other than the same Internet address, such as third-party cookies, can track users' site visits more broadly.

In other words, by using the cookie information, when the user searches the site, the web server can immediately know who the user is, what information he / she has mainly searched for, and can know which product he / she is interested in and which field he is interested in.

The operator of the website or a company that wants to advertise can use the cookie information to provide the user with an advertisement for the user's interest field, that is, a personalized advertisement. Thus, the purchase conversion rate of the user can be increased.

These technologies can be widely used in mobile environments. For example, in a mobile web environment of a smartphone, there is known a technology capable of providing a rekitting ad as in a PC web using a third party cookie.

On the other hand, a lot of application software is installed in users' mobile devices, and the application is used for the time spent using the website or for more time. An application program is, for example, a specific program executed under the support of the Google Android operating system or a specific program executed under the support of the operating system of the Apple iPhone, also referred to as the term 'app'. Even if the user is only using application software on the mobile device, if the cookie can be obtained from the server in communication with the mobile device, the application can also provide optimized information to the user. However, since a cookie can be accessed only by using a web browser, when accessing a server using an application (hereinafter referred to as an app) supported by a specific operating system without using a web browser installed in the mobile device, Is unable to access the cookie information used by the mobile device.

In order to solve the above-described problems, the present invention provides a technology for providing personalized advertisements in an application program of a type that can not use cookies, and a technique for generalizing the advertisement. To this end, the present invention provides a technique for matching cookie information stored in a user device with information capable of identifying the user device.

An identification information matching method according to an aspect of the present invention is a matching method for matching messages of different types by receiving messages including a specific tuple, the received messages acquiring identification information of a first type And a second type of message capable of obtaining a first type of message and a second type of identification information. Wherein the matching method comprises the steps of: when receiving a message of any one of the first type message and the second type message, acquiring trailing identification information included in the message of either type; Increasing the score of the pair of identification information consisting of the preceding identification information and the trailing identification information obtained by the last received message of the other type on the basis of the time of receiving the one type of message The method comprising: a first step of using the data accumulation process to perform the data accumulation process each time the messages are received; and a second step of using the scores allocated to the plurality of identification information-pairs provided by the first step, And filtering and selecting at least a portion of the identification information-pairs.

At this time, the step of increasing the score of the identification information-pair is stopped in a section where the reception frequency of the messages having the specific tuple value is larger than a predetermined value, or the reception frequency of the messages having the specific tuple value is And the execution of the data accumulation process may be stopped in a section longer than a predetermined value.

When the frequency of acquiring the specific tuple exceeds a predetermined frequency during a specific time period in which the matching server acquires the specific tuples, the identification information-pair of the specific tuple increased during the specific time period And invalidating the increment of the score of the score.

Here, the first type of identification information may be advertisement identification information, and the second type of identification information may be a cookie stored in a user device.

At this time, the filtering and selecting step may be a step of selecting an identification information pair having the highest score among the plurality of identification information-pairs for a preset unit time.

At this time, the filtering and selecting step may include selecting the number of identification information pairs having the highest score among the plurality of identification information-pairs for a preset unit time, And selecting the number of identification information pairs having the highest score among the plurality of identification information-pairs for the second type of identification information.

According to another aspect of the present invention, an identification information matching method is a matching method for matching messages of different types by receiving messages including a specific tuple, the received messages acquiring identification information of a first type And a second type of message capable of obtaining a first type of message and a second type of identification information. Wherein the matching method comprises the steps of: when receiving a message of any one of the first type message and the second type message, acquiring trailing identification information included in the message of either type; Increasing the score of the pair of identification information consisting of the preceding identification information and the trailing identification information obtained by the last received message of the other type on the basis of the time of receiving the one type of message Thereby performing a data accumulation process.

A computing device according to an aspect of the present invention is a computing device that executes a matching method of receiving messages including a specific tuple and matching different types of identification information with each other, And a second type message capable of obtaining a second type of identification information, wherein the first type of message and the second type of message can be distinguished from each other The method of claim 1, further comprising: when a message of one type is received, acquiring trailing identification information included in the message of any one of the types; And a step of increasing the score of the pair of identification information consisting of the preceding identification information and the trailing identification information obtained by the message of the type It is adapted to perform the emitter accumulation process.

A computer-readable medium according to one aspect of the present invention is a computer-readable medium having stored thereon instructions for causing a computing device to: receive messages comprising a particular tuple; distinguish the types of messages; Obtaining identification information of a first type from a message, obtaining identification information of a second type from a message of a second type that includes the specific tuple, receiving the first type of message and the second type of message The method comprising the steps of: when receiving a message of any one type, acquiring the trailing identification information included in the message of any one of the types; Increasing the score of the pair of identification information consisting of the preceding identification information and the trailing identification information obtained by one type of message And a program for causing a data accumulation process to be executed.

According to the present invention, the cookie information of the user can be matched with the information that can identify the user equipment. As a result, it is possible to provide the personalized advertisement in the application program of the type that can not use the cookie, which is installed in the user device.

1 is a diagram illustrating a configuration of a system according to an embodiment of the present invention.
2 illustrates a relationship between a plurality of terminals and a matching server according to an embodiment of the present invention.
3A shows a table in which the advertisement identification information and the cookie information are identified according to the time of the message type identification unit according to the embodiment of the present invention. FIG. 3B is a table showing the scores of the identification information-pair, According to an embodiment of the present invention, a method for invalidating an increase amount of a score corresponding to the identification information-pair when a specific condition is satisfied is described.
FIG. 4 illustrates a location-based movement of a terminal for each network according to an embodiment of the present invention.
FIG. 5A is a table in which advertisement identification information and cookie information are identified according to a time point of a message type identification unit according to an exemplary embodiment of the present invention, and FIG. 5B is a table showing scores for identification information-pair.
6 is a diagram illustrating a case where a plurality of terminals connect to a network through a WiFi router according to an embodiment of the present invention.
FIG. 7A is a table showing the identification of the advertisement identification information and the cookie information according to the time of the message type identification unit according to the embodiment of the present invention, and FIG. 7B is a table showing the scores of the identification information-pair.
FIG. 8 is a diagram illustrating a configuration of an entire process of a matching server according to an embodiment of the present invention.
9 illustrates an identification information matching method according to an embodiment of the present invention.

Hereinafter, embodiments of the present invention will be described with reference to the accompanying drawings. However, the present invention is not limited to the embodiments described herein, but may be implemented in various other forms. The terminology used herein is for the purpose of understanding the embodiments and is not intended to limit the scope of the present invention. Also, the singular forms as used below include plural forms unless the phrases expressly have the opposite meaning.

1 is a diagram illustrating a configuration of a system according to an embodiment of the present invention.

At a certain point in time, the user can access the web site through the web-browser 11 by using the terminal 10. The web site may be a shopping mall site, an information sharing site, or other site. When the terminal 10 accesses the web site through the web browser 11, the web server 20 can identify and acquire the cookie 13 stored in the terminal 10. The cookie 13 may be information on a specific domain or may be third-party cookies.

At another point in time, the user can execute the app 12 installed in the terminal 10 using the terminal 10. The app 12 may be, for example, an Android app or an Apple app. The app 12 may also be a utility application, a mobile messenger application, a gaming application, an educational application, a news application, a video application, a photo application, a shopping application, and other applications. When the terminal 10 executes the app 12, the app server 30 can identify and obtain the advertisement identification information of the terminal 10 from the terminal 10. The advertisement identification information may mean unique information that can identify the terminal 10. The advertisement identification information may be referred to as an advertisement identifier. For example, the advertisement identification information may be uniquely assigned to each user device supporting the Android operating system, or may be uniquely allocated to each user device supporting the iPhone operating system.

When the user connects to the web server 20 or the app server 30 using the terminal 10, the user can access the terminal through the 3G, 4G, LTE, or the Wifi using the router.

The message transmitted to the web server 20 or the app server 30 includes the IP of the terminal 10 when the user accesses the web server 20 or the app server 30. [

The IP included in the message arriving at the server from different terminals 10 may have different values when the terminals use 3G, 4G, and LTE. However, when a plurality of terminals access the server through one WiFi router, the IPs included in the messages transmitted from the plurality of terminals to the server may be the same. In addition, the IP provided to each terminal 10 can be changed when a handover occurs in a wireless mobile communication environment (when moving the network) as shown in FIG. Therefore, it is not possible to uniquely distinguish a terminal by IP alone.

Hereinafter, a method for distinguishing the terminal 10 and matching cookie 13 information and advertisement identification information stored in the terminal 10 will be described.

When the user accesses the web server 20 or the app server 30 using the terminal 10, the terminal 10 may send a message to the matching server 40 in an embodiment of the present invention. Or in another embodiment of the present invention, instead of the terminal 10, the web server 20 or the app server 30 may send a message to the matching server 40. The transmission of the message to the terminal 10, the web server 20, and the app server 30 may vary depending on the embodiment.

The message may include a particular tuple. In this specification, 'tuple' may refer to a unit of information composed of {IP, model number of terminal, OS version information}. For example, {172.30.2.60, SM-G920K, 5.1.1}. The configuration of the 'tuple' is not limited to {IP, the model number of the terminal, and the OS version information}. In other embodiments, other information may be added or replaced as a configuration of the 'tuple'. That is, any one or more of the model number and the OS version information of the terminal may be replaced by other types of information, or different types of information may be added to the three configurations.

When the terminal 10 is connected to the web server 20, the matching server 40 can obtain information on the cookie of the terminal 10 together with the tuple. Alternatively, when the terminal 10 accesses the app server 30, the matching server 40 may obtain advertisement identification information (ex: GAID) of the terminal 10 together with the tuple.

That is, when the terminal 10 connects to the web server 20, the terminal 10 or the web server 20 includes the information about the cookie 13 together with the tuple information to the matching server 40 Message. When the terminal 10 accesses the app server 30, the terminal 10 or the app server 30 sends tuple information and advertisement identification information (ex: GAID) to the matching server 40 Message can be transmitted. That is, the advertisement identification information and the tuple information may be transmitted together with the message. Alternatively, the cookie and tuple information may be transmitted together with the message.

The matching server 40 may include a message type identification unit 41. [ The message type identification unit 41 can identify whether the message received from the terminal 10 includes information about the cookie 13 and whether it contains the advertisement identification information ex .: GAID. That is, it can be discriminated whether the terminal 10 is using the web server 20 or the app server 30.

2 illustrates a relationship between a plurality of terminals and a matching server according to an embodiment of the present invention.

Each terminal 10, the app server 30, or the web server 20 can transmit the message including the tuple information of the terminal to the matching server 40. [ For example, the terminal 1 of the Galaxy S6 model has the IP address A, the model number is SM-920K, and the OS is the 5.1.1 version. Terminal 2 of the Galaxy Note 3 model has an IP address of B, the model number is SM-N900K, and the OS is version 4.4.2. The terminal k of the Galaxy S6 model has an IP address of A, the model number is SM-920K, and the OS is version 5.1.1. The terminal n of the iPhone 5 model has an IP address of C, the model number is MD297KH / A, and the OS may be the 8.4.1 version.

At this time, the terminal 1 and the terminal k may have the same IP address. In this case, as shown in FIG. 4, when the terminal 1 is handed over to another network cell, when the IP address used by the terminal 1 is assigned to the terminal k . Or when the terminal 1 and the terminal k access the Internet using the same WiFi router.

Since the time at which each terminal, the app server, or the web server transmits the message to the matching server 40 is related to the time when the user uses the web or the app, the transmission time of each message may be the same or different. Therefore, for example, the time when the terminal 1 10 transmits a message to the matching server 40 and the time when the terminal k 10 transmits a message to the matching server 40 may differ from each other using the same IP.

That is, the tuple information of each terminal 10 may be the same or different from each other. If the tuple information is different, it can be judged to be a different terminal.

3A is a table showing that the message type identification unit 41 of the matching server 40 identifies the advertisement identification information (ex: GAID) and the cookie information according to the viewpoint, and FIG. Identification information - The score for pairs is shown in the table.

The left column of FIG. 3A shows the time at which messages are collected from the terminals, and shows the time closer to the further downward. For example, T2 represents time later than T1.

The matching server 40 may collect messages from the terminals. At this time, the matching server 40 can identify the types of messages in the message type identifying unit 41. At this time, the message type identification unit 41 can distinguish the messages including the same tuple from those for obtaining the advertisement identification information (the central column in FIG. 3A) and those for obtaining the cookie (the right column in FIG. 3A) have.

That is, the message type identifying unit 41 can identify the messages as a first type message capable of obtaining the first type identification information and a second type message capable of obtaining the second type identification information . At this time, the first type of identification information may refer to the advertisement identification information, and the second type of identification information may refer to the cookie information.

In the present specification, when the cookie information is received at a specific time point, the received cookie information is defined as 'trailing identification information' for a tuple having a specific value, and the received cookie information is received most recently One advertisement identification information may be defined as " preceding identification information ".

Or the tuple having a specific value in this specification, when the advertisement identification information is received at a specific time, the received advertisement identification information is defined as 'trailing identification information', and before receiving the received advertisement identification information The cookie information that has been received most recently may be defined as " preceding identification information ".

It is possible to define 'identification information-pair' consisting of the above-described 'preceding identification information' and 'following identification information'. When any of the first identification information pair and the second identification information pair defined by the present invention are compared with each other, either of the preceding identification information and the following identification information included in the second identification information- Pair, the first identification information-pair and the second identification information-pair may be considered to be different if they are not included in the information-pair.

The defined 'identification information-pair' can be recorded in the identification information-pair recording part (ex: memory of the server). The recorded 'identification information pair' may be assigned a score (ex: integer). For example, any one of 0 or more integers may be assigned to each 'identification information pair'. That is, when a new identification information-pair is generated, a corresponding new score object may be generated together and initialized to have a value of, for example, 0. The assigned value may be determined by a predetermined rule. These predetermined rules may follow the example described below.

At each time point when a specific tuple is received, an identification-pair composed of the preceding identification information and the trailing identification information can be determined. If the determined identification information-pair does not exist in the identification information-pair recording section, A pair can be generated.

Referring to FIG. 3A, advertisement identification information (ex: GAID information) G1, which is first type identification information, can be obtained from a message received at time T1. The cookie information (C1), which is identification information of the second type, can be obtained from the message received at the time T2. In this case, the advertisement identification information (GID) G1 acquired at the time T1 may be the 'preceding identification information', and the cookie information C1 obtained at the time T2 may be ' Trailing identification information '. (GID) information (G1), which is identification information of the first type most recently received, based on the time point when the cookie information (C1) as the second type identification information is received, that is, (G1-C1) consisting of the identification information-pair (C1). At this time, if the information about the defined identification information-pair (G1-C1) is not present in the identification information-pair recording unit, information about the identification information pair (G1-C1) And the value of the score object corresponding to the pair of identification information-pair (G1-C1) may be initialized to, for example, '0'. Then, +1 points can be accumulated in the score object corresponding to the identification information-pair (G1-C1) at time T2.

Similarly, the advertisement identification information (ex: GAID) information G1, which is identification information of the first type, can be obtained from the received message at the time T3. At this time, the cookie information (C1) which is the second type identification information received at the time T2 is the latest identification information of the second type identification information. Therefore, the cookie information C1 obtained at the time T2 can be regarded as the 'preceding identification information', and the advertisement identification information (ex: GAID) information G1 acquired at the time T3 can be regarded as' Trailing identification information '. Cookie information (C1) (preceding identification information), which is the second type identification information most recently received based on the time point at which the current message is received, i.e., T3, and advertisement identification information (ex: GAID) An identification information-pair G1-C1 can be defined as information G1 (trailing identification information). At this time, since the identification information pair (G1-C1) has already been generated at the time T2, +1 points can be additionally accumulated in the score object corresponding to the identification information-pair (G1-C1).

Scores may be accumulated in the identification information-pair (G1-C1) in the same manner as the time point T4 and the time point T3 at the time point T5.

Cookie information (C2), which is identification information of the second type, can be obtained from the message received at time T6. At this time, the advertisement identification information (ex: GAID) information G1 at the time T5, which is the first type identification information most recently received based on the time point T6 of the first type, may be the preceding identification information, The cookie information C2 obtained at the time T6 may be trailing identification information. Another identification information-pair (G1-C2) composed of the preceding identification information G1 and the trailing identification information C2 can be defined. At this time, if the information on the defined identification information-pair (G1-C2) is not present in the identification information-pair recording unit, information about the identification information pair (G1-C2) The value of the score object corresponding to the pair of identification information-pair (G1-C2) may be initialized to '0', for example. At point T6, +1 points can be accumulated in the newly generated score object corresponding to the identification information-pair (G1-C2). However, the score for the score objects corresponding to other identity-pair pairs other than the identity-pair (G1-C2) may not vary.

From the message received at the time T7, the advertisement identification information (ex: GAID) information G2, which is identification information of the first type. At this time, the cookie information (C2), which is the second type identification information received at the time T6, is the most recently obtained identification information of the second type when viewed from the time T7, The information C2 may be used as the preceding identification information. At this time, the advertisement identification information (ex: GAID) information G2 acquired at the time T7 may be trailing identification information. Another identification information-pair (G2-C2) consisting of the preceding identification information C2 and the trailing identification information G2 can be defined. At this time, if the information on the defined identification information-pair (G2-C2) is not present in the identification information-pair recording section, information on the identification information pair (G2-C2) The value of the score object corresponding to the identification information-pair (G2-C2) may be initialized to '0', for example. At point T7, +1 points may be stored in the newly generated score object corresponding to the identification information-pair (G2-C2). However, the scores for the score objects corresponding to other identity-pair pairs other than the identity-pair (G2-C2) may not vary.

It is possible to increase the score of all the identification-pair pairs defined and generated in the above-described manner.

In FIG. 3B, the total of the identification information-pair scores from the time T1 to the time T12 is 5 points, the score of the pair of identification information-pair (G1-C1) is 1 point , The score of the identification information-pair (G2-C1) is 1, and the score of the identification information-pair (G2-C2) is 4.

In order to determine the cookie information matched with the advertisement identification information G1, if the user selects the one having the highest score among the identification information-pairs including the advertisement identification information G1 as the identification information-pair calculated from the time T1 to the time T12 , The identification information-pair (G1-C1) is selected. Therefore, the cookie information matched with the advertisement identification information G1 can be determined to be the cookie information C1. Therefore, it can be determined that the advertisement identification information G1 and the cookie information C1 are related to the specific terminal 10.

Likewise, in order to discriminate the cookie information matched with the advertisement identification information G2, it is possible to use the one having the highest score among the identification information-pairs including the advertisement identification information G2 as the identification information-pair calculated from the time T1 to the time T12 When selected, the identification information-pair (G2-C2) is selected. Therefore, the cookie information matched with the advertisement identification information G2 can be determined to be the cookie information C2. Therefore, it can be determined that the advertisement identification information G2 and the cookie information C2 are related to another specific terminal 10.

It may be determined that the identification information-pair (G1-C2) and the identification information-pair (G2-C1) missing in the selection process using the score are error information.

The phenomenon as shown in FIG. 3A may be caused, for example, because a terminal having a tuple providing information shown in FIG. 3A performs an inter-cell handover of the mobile communication network. Or two terminals connected to the Internet using one WiFi router. Or by other circumstances not mentioned here.

FIG. 3C is a diagram for explaining a method for invalidating an increase amount of a score corresponding to the identification information-pair when a specific condition is satisfied according to an embodiment of the present invention. .

In this embodiment, during a specific time period during which tuples are acquired in the matching server, in the case of a first condition in which the frequency of acquiring a specific tuple exceeds a predetermined frequency, identification information of the specific tuple that has been increased during the specific time period, The increment of the score of the pair can be invalidated. In one embodiment, for this purpose, values of the particular time periods may be defined and the predetermined frequency may be defined. As shown in FIG. 3C, for example, the size of the specific time period may be defined as a unit time interval 'T', and the predetermined frequency may be defined as [obtaining 10 specific tuples] / [unit time interval T] have.

The occurrence of the first condition may occur, for example, when a plurality of terminals access the network through one WiFi router, or IP handover between cellular terminals occurs very frequently. In this case, it can be easily understood that there is a problem in that the reliability of the result of the method of increasing the score of identification information-pairs obtained in a specific tuple is lowered, as in the embodiment of the present invention described above.

As described above, a method of invalidating some or all of the scores of the identification information-pairs obtained in a specific tuple can be implemented by at least the following two methods.

First, the score is increased in real time. In this case, for example, as shown in FIG. 3C, at time T2, it can be seen that the frequency of acquiring a specific tuple exceeds a predetermined frequency during a specific time period T. FIG. Accordingly, the increment of the score of the identification information-pairs obtained in the specific tuple, which is increased during the specific time period T, can be retrospectively revoked. In this case, it can be easily understood that a method of subtracting the corresponding score from the already increased score can be used. For example, if a total of +6 points are accumulated for the identification information-pair (G1-C1) during the period T in FIG. 3C, the time T2 may be reduced by -6 in real time.

Second, in the case of a tuple collection period that is considerably longer than the specific time interval T, the identification information-pairs obtainable from a particular tuple are obtained in advance, and then the score is increased afterwards. In this case, it can be seen that, for example, during the specific time interval T between time T1 and time T2 as in the case of FIG. 3C, the collection frequency of a specific tuple exceeds a predetermined frequency. Therefore, the task of increasing the score of the above-described identification information-pairs can be designed so as not to occur during the specific time period T. [ That is, in this case, there is no need to retrospectively override the score for pairs of identifiers-pairs acquired during a particular time period T,

FIG. 4 illustrates a location-based movement of a terminal for each network according to an embodiment of the present invention.

The reason why the error information such as the identification information-pair (G1-C2) and the identification information-pair (G2-C1) shown in FIGS. 3A and 3B is generated may be as follows.

The terminal 1 (10, 101) can move to another network cell (50, 502) from the network cell (50, 501) At this time, the terminal 2 (10, 102) can move to the network cell (50, 501) from the network cell (50, 502) At this time, the IP allocated to the terminal 1 (10, 101) can be handed over to the terminal 2 (10, 102).

Thereby, it may happen that the tuples of the terminal 1 and the terminal 2 become the same after a certain time delay. However, the error information can be eliminated by filtering out pairs having a lower score among the scores assigned to the identification information-pairs as described in FIGS. 3A and 3B. Therefore, it is possible to match the cookie with the advertisement identification information (ex: GAID) of the correct terminal.

FIG. 5A is a table showing that the message type identifying unit 41 identifies the advertisement identification information (ex: GAID) and the cookie information according to the time, FIG. 5B is a table showing that the message type identifying unit 41 identifies The scores are shown in the table.

FIGS. 3A and 3B are applied to the moving state of the terminal 10, and FIGS. 5A and 5B may be applied when the terminal 10 is in a certain space, for example, a space such as a house.

The score accumulation of the identification information-pair in FIGS. 5A and 5B can be performed in the same manner as in FIGS. 3A and 3B. In this case, in the case of FIG. 5A, the IP is maintained because there is no network movement of the terminal 10, so that only one identification information-pair can be generated with the identification information-pair G1-C1. Therefore, the advertisement identification information (ex: GAID) as the first type identification information can be matched with the cookie information as the second type identification information.

6 is a diagram illustrating a case where a plurality of terminals connect to a network through a WiFi router according to an embodiment of the present invention.

It may be a case where a plurality of people like the company access the network 50 using the Wifi through the router 60. [ If messages from different terminals are sent to the network via one router 60, the IPs of these messages may be the same. Also, among the many terminals using one router, there may be those using the same terminal model and the same OS of the same version. In this case, the tuples that the server can obtain from the messages transmitted by these terminals may be the same. Since many terminals can simultaneously access the network at this time, the frequency of receiving data having the same specific tuple value at the matching server is very high. Therefore, in this case, there is a high possibility that the invalidation of the score increase of the identification information-pairs described in FIG. 3C is made.

FIG. 7A is a table showing that the message type identification unit 41 identifies the advertisement identification information (ex: GAID) and the cookie information according to the viewpoint, and FIG. The scores are shown in the table.

7A and 7B show an embodiment in which a plurality of terminals are connected to a network using a WiFi router, and in particular, five terminals use a router. In this case, the matching server may collect a plurality of types of first type identification information (advertisement identification information) and a plurality of types of second type identification information (cookie information).

Referring to FIG. 7B, it can be seen that ten identification information-pairs are generated based on the respective time points T2 to T12. As a result of accumulating points in pairs of identification information at each time point, only two pieces of identification information pairs (G1-C2) accumulated, and the other pieces of identification information-pairs accumulated one point each. In this case, it is easy to find that it is difficult to trust the matched identification information-pair even if the winner is extracted and the identification information is matched by performing the score calculation by the method shown in FIG. 3A, FIG. 3B, FIG. 5A, I can understand. From this example, it is possible to understand the development motivation for the invalidation technique of the scoring increment of the identification information-pairs explained with reference to FIG. 3C.

Whether or not such a situation occurs can be determined by the frequency with which the matching server receives a message having a particular tuple. In the case where the frequency with which the matching server receives the message having the specific tuple exceeds the value according to the predetermined rule, the method shown in Figs. 3A, 3B, 5A and 5B can not match the identification information, The identification unit 41 may be configured to stop performing the operation of increasing the score of the identification information-pair. The 'reception frequency of messages' refers to the number of messages including a specific tuple received for a preset unit time.

FIG. 8 illustrates a configuration of an entire process performed in a matching server according to an embodiment of the present invention. Each of the following steps may be performed in the matching server.

In step SlOO, the matching server 40 may receive a message with a particular tuple at a point in time.

In step S101, the message type identification unit 41 can identify the type of the message received at the one point in time.

In step S102, the identification information included in the message received at the one point in time may be defined as 'trailing identification information', so that the trailing identification information can be obtained at the one point in time.

In step S103, the identification information acquired through the message of the other type having been received most recently based on the one time point and having the specific tuple may be defined as the 'preceding identification information'. And the score of the specific identification information-pair consisting of the preceding identification information and the trailing identification information can be increased. If the specific identification information-pair is not yet recorded in the memory, the score may be increased after generating and initializing the specific identification information-pair and a score therefor.

In step S104, identification information matching can be performed using a method of selecting a winner based on the score of the score objects corresponding to the generated identification information-pairs.

Thereafter, the identification information matching may be terminated. At this time, the process composed of steps S101 to S103 may be referred to as a 'data accumulation process'. The data accumulation process may be performed each time a message is received. The step S104 may be performed after performing the data accumulation process a plurality of times.

9 illustrates an identification information matching method according to an embodiment of the present invention.

In step S201, the terminal 10 can access the web server 20 via the web-browser 11. [ At this time, the terminal 10 can transmit the tuple {IP, the model number of the terminal, OS version information} and the cookie to the web server 20.

In step S202, the web server 20 can transmit the access page code to the terminal 10. [ At this time, the code may include an insertion code provided by an affiliate company related to the matching server. For example, when the web server 20 of the NAVER TM is connected, the HTML code of the NAVER display screen may include the insertion code of the affiliated company, and the web server 20 may transmit the affiliate insertion code to the terminal 10, Lt; / RTI >

In step S203, the browser 11 of the terminal 10 can display the screen of the connection page of the web server 20. [

In step S204, the embedded code may cause the terminal 10 to transmit the tuple and cookie of the terminal to the matching server 40.

In step S205, the terminal 10 can access the app server 30 through the app 12. [ At this time, the app 12 can be configured so that tuple {IP, model number of the terminal, OS version information} and advertisement identification information (ex: GAID) can be transmitted to the app server 30.

In step S206, the app server 30 may transmit the tuple and the advertisement identification information (ex: GAID) to the matching server 40. [

In step S207, the matching server 40 may identify the type of message received in step S204.

In step S208, the matching server 40 may obtain the " preceding identification information " from the message identified in step S207.

In step S209, the matching server 40 may identify the type of the message received in step S206.

In step S210, the matching server 40 may acquire 'trailing identification information' for the preceding identification information from the message identified in step S209.

At this time, steps S207 and S209 may be performed in real time according to the transmission time points of step S204 and step S206.

In step S211, the matching server 40 can generate an identification-pair consisting of the preceding identification information and the trailing identification information.

In step S212, the matching server 40 may accumulate a score in the identification information-pair.

Steps S207 to S212 are performed a plurality of times, and may be performed for the number of received messages for a predetermined unit time.

Step S214 may be performed after a predetermined unit time has elapsed.

In step S214, the matching server 40 may filter the identifying information-pair through the score of the identifying information-pair. Through this process, identification information (advertisement identification information) and identification information (cookie) of one terminal can be matched.

It will be apparent to those skilled in the art that various modifications and variations can be made in the present invention without departing from the essential characteristics thereof. The contents of each claim in the claims may be combined with other claims without departing from the scope of the claims.

Claims (9)

A matching method for receiving messages including a specific tuple in a matching server and matching different types of identification information with each other,
The received messages may be classified into a first type message capable of obtaining the first type identification information and a second type message capable of obtaining the second type identification information,
In the matching method,
Acquiring trailing identification information, which is identification information included in the message of any one of the first type message and the second type message when the message is any one of the first type message and the second type message; And
A score assigned to the pair of identification information consisting of the preceding identification information and the trailing identification information included in the other type of message received most recently on the basis of the time of receiving the message of any one type ;
And a data storage process,
A first step of performing the data accumulation process each time the messages are received; And
Selecting at least some of the plurality of identification information-pairs by performing filtering using a plurality of scores assigned to the plurality of identification information-pairs provided by the first step
/ RTI >
Identification information matching method. The method according to claim 1,
The step of increasing the score of the identification information-pair is stopped in a section in which the reception frequency of the messages having the specific tuple value is larger than a predetermined value, or the reception frequency of the messages having the specific tuple value is predetermined The process of stopping the data accumulation process in a period longer than the value
Identification information matching method. 2. The method according to claim 1, further comprising: if the frequency of acquiring the specific tuple exceeds a predetermined frequency during a specific time period during which the matching server obtains the specific tuples, Further comprising invalidating an increment of the score of the identification information-pair. The method of claim 1, wherein the first type of identification information is advertisement identification information, and the second type of identification information is a cookie stored in a user device. 2. The method of claim 1, wherein the filtering and selecting step is to select an identification-pair having the highest score among the plurality of identification information-pairs for a preset unit time.
The method of claim 1, wherein the specific tuple is information including an IP, a model number of the terminal, and OS version information. A matching method for receiving messages including a specific tuple in a matching server and matching different types of identification information with each other,
The received messages may be classified into a first type message capable of obtaining advertisement identification information and a second type message capable of obtaining a cookie,
Acquiring trailing identification information, which is identification information included in the message of any one of the first type message and the second type message when the message is any one of the first type message and the second type message; And
A score assigned to the pair of identification information consisting of the preceding identification information and the trailing identification information included in the other type of message received most recently on the basis of the time of receiving the message of any one type ;
Wherein the data storage process comprises:
Identification information matching method. 1. A computing device for receiving a message including a specific tuple to perform a matching method for matching different types of identification information with each other,
The received messages may be classified into a first type message capable of obtaining advertisement identification information and a second type message capable of obtaining a cookie,
Acquiring trailing identification information, which is identification information included in the message of any one of the first type message and the second type message when the message is any one of the first type message and the second type message; And
A score assigned to the pair of identification information consisting of the preceding identification information and the trailing identification information included in the other type of message received most recently on the basis of the time of receiving the message of any one type ;
Wherein the data storage process comprises:
Computing device. A computing device,
Receiving messages comprising a particular tuple;
Distinguishing the types of messages;
Obtaining advertisement identification information from a first type message including the specific tuple;
Obtaining a cookie from a second type of message comprising the specific tuple;
Acquiring trailing identification information, which is identification information included in the message of any one of the first type message and the second type message when the message is any one of the first type message and the second type message; And
A score assigned to the pair of identification information consisting of the preceding identification information and the trailing identification information included in the other type of message received most recently on the basis of the time of receiving the message of any one type ;
A program for causing a computer to execute a data accumulation process,
Computer-readable medium.
KR1020150174162A 2015-12-08 2015-12-08 Method for matching between identifiers for a user and device for the same KR101805847B1 (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
KR1020150174162A KR101805847B1 (en) 2015-12-08 2015-12-08 Method for matching between identifiers for a user and device for the same

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
KR1020150174162A KR101805847B1 (en) 2015-12-08 2015-12-08 Method for matching between identifiers for a user and device for the same

Publications (2)

Publication Number Publication Date
KR20170067460A KR20170067460A (en) 2017-06-16
KR101805847B1 true KR101805847B1 (en) 2017-12-14

Family

ID=59278729

Family Applications (1)

Application Number Title Priority Date Filing Date
KR1020150174162A KR101805847B1 (en) 2015-12-08 2015-12-08 Method for matching between identifiers for a user and device for the same

Country Status (1)

Country Link
KR (1) KR101805847B1 (en)

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR101547194B1 (en) * 2014-11-25 2015-08-26 주식회사 메조미디어 Method and application for managing cookie-information

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR101547194B1 (en) * 2014-11-25 2015-08-26 주식회사 메조미디어 Method and application for managing cookie-information

Also Published As

Publication number Publication date
KR20170067460A (en) 2017-06-16

Similar Documents

Publication Publication Date Title
EP3219120B1 (en) Contextual deep linking of applications
KR101782810B1 (en) Method, apparatus, and system for determining a location of a terminal
CN104899220B (en) Application program recommendation method and system
US8843463B2 (en) Providing content by using a social network
CN102737019A (en) Machine behavior determining method, webpage browser and webpage server
WO2013181972A1 (en) Method and device for identifying network access behaviour
CN103209116B (en) Multi-platform information issuing method and system
US9948649B1 (en) Internet address filtering based on a local database
CN106534268B (en) Data sharing method and device
JP5841299B2 (en) Method for pushing information and apparatus for pushing information
JP2012190459A (en) Retrieval and analysis method for node of social networking service, and retrieval system
KR20200011443A (en) Matching and Attributes of User Device Events
WO2014149607A1 (en) Ip allocation pools
CN104750760A (en) Application software recommending method and device
EP3382981B1 (en) A user equipment and method for protection of user privacy in communication networks
KR101329034B1 (en) System and method for collecting url information using retrieval service of social network service
JP2018055525A (en) Text extraction device
JP2015170357A (en) Method and server for pushing cellular lexicon
KR101805847B1 (en) Method for matching between identifiers for a user and device for the same
CN106803830B (en) Method, device and system for identifying internet access terminal and User Identity Module (UIM) card
JP4886356B2 (en) Communication management device, communication management method, and communication management program
CN104993999A (en) Information processing method and server
JP5952852B2 (en) System including information generating device and receiving device
CN103634348A (en) Terminal device and method for releasing information
JP6787845B2 (en) Suspected location estimation device and suspected location estimation method

Legal Events

Date Code Title Description
A201 Request for examination
E902 Notification of reason for refusal
E701 Decision to grant or registration of patent right