Method and apparatus for dynamic geo-fencing

CROSS REFERENCE TO RELATED APPLICATIONS

0001The present application is a continuation of U.S. patent application Ser. No. 15/915,908, filed Mar. 8, 2018, now U.S. Pat. No. 11,044,579, which is a continuation of Ser. No. 13/867,025, U.S. Patent Application No. filed Apr. 19, 2013, which claims the benefit of priority from U.S. Provisional Application No. 61/724,295 entitled “Method and Apparatus for Probabilistic User Location,” filed on Nov. 8, 2012, U.S. Provisional Application No. 61/724,298 entitled “Method and Apparatus for Dynamic Fencing,” filed on Nov. 8, 2012, and U.S. Provisional Application No. 61/724,299 entitled “Method and Apparatus for Geographic Document Retrieval,” filed on Nov. 8, 2012. Each of the above applications is incorporated herein by reference in its entirety. The present application is related to commonly assigned U.S. Patent Application entitled “Method and Apparatus for Probabilistic User Location,” filed Apr. 19, 2013, now U.S. Pat. No. 9,049,549, and to U.S. Patent Application entitled “Method and Apparatus for Geographic Document Retrieval,” filed on Apr. 19, 2013, now U.S. Pat. No. 9,210,540, each of which is incorporated herein by reference in its entirety.

FIELD

0002The present disclosure is related to location-based mobile applications, and more particularly to method and system for dynamic geo-fencing.

DESCRIPTION OF THE RELATED ART

0003Hyperlocal advertising is the ability to deliver precise, relevant, and timely advertising to consumers based on estimate of their location at the moment of delivery. Nowadays, with the advent of smartphones and tablets, hyperlocal advertising is becoming increasingly popular among online marketers as a vehicle of choice to deliver their messages to targeted mobile audiences on mobile devices. Various industry experts predict over 1.5 trillion mobile consumer page views a month, translating to hundreds of billions of ad impression opportunities a month, or billions a day. There are currently an estimated 20 million stores and small businesses located in the US alone.

0004Geo-Fencing or location-based targeting involves sending information or push notifications to consumers who enter virtual perimeters set around physical places. Such technologies allow an advertiser to create a virtual “fence” around a point or place of interests. For example, an advertiser can pinpoint a store, and deliver a specific advertisement (“ad”) to anyone who comes within a pre-defined geographic area around that store. Ads delivered through geo-fencing typically yield higher hit rate and better return of investment for advertisers since they're more contextual.

SUMMARY

0005Embodiments of the present disclosure provides apparatus and methods for generating dynamic fences representing geographical regions where advertisement campaigns can take place. The dynamic fences can have arbitrary shapes. In one embodiment, the dynamic fences can include both convex and non-convex corners/curves. In a further embodiment, the shapes and sizes of the dynamic fences can vary over time. The methods according to certain embodiments include a framework and an objective function that combine data from multiple sources to shape the dynamic fences according to goals set by advertising campaigns.

0006In one embodiment, a method for generating dynamic fences derives the shapes of the dynamic fences based on historical and predicted information such as data suggesting optimal allocation of existing inventory, predicted click-through rates and secondary action rates, as well as parameters explicitly specified by advertisement campaigns (e.g. target a specific point of interest or highway). This allows hyperlocal advertising to have the flexibility to fine tune represented areas targeted by a hyperlocal ad campaign.

0007In certain embodiment, the dynamic fences can change over time and in real-time. For examples, within a day, they can change depending on various variables such as intra-day patterns (work versus home); during a week, they can change according to intra week patterns (week day versus weekend). The dynamic fences can also change based on user mobility (commuting, working or at home). The dynamic fences can also change based on historical user behavior such as ad clicks, secondary actions such as secondary actions and maps/directions, as well as other feedback. The changes can be over time periods as rapid as the data flow allows. These aspects of the embodiments help to reduce wasted ad impressions, improving click through rates and secondary action rates.

0008Further embodiments of the present disclosure provide means for an advertiser to interact with a user interface (UI) or application program interface (API) to define and visualize the dynamic fence, to see how it changes during the course of the day, and to make adjustments using the parameters provided through the UI or API. Thus, advertisers are able to tune the dynamic fences based at least in part on criteria such as keywords, categories, demographic targeting, volume of impressions, clicks and secondary actions.

0009Further embodiments of the present disclosure provide business methods that enable advertisers to carry out real-time competitive conquest by targeting regions in a map where users are likely engaged with their competitors in real-time.

0010Further embodiments of the present disclosure provide business methods that enable advertisers to perform real-time point-of-interest targeting by targeting a region in a map associated with a point-of-interest (e.g. a neighborhood, a section of an interstate highway) where their target users are mobile in real-time.

BRIEF DESCRIPTION OF THE DRAWINGS

0011<figref idref="DRAWINGS">FIG. <b>1</b>A</figref> is a block diagram illustrating a computer system that can be used to carry out a method for dynamic fencing according to one embodiment of the present disclosure.

0012<figref idref="DRAWINGS">FIG. <b>1</b>B</figref> is a diagram illustrating a packet-based network via which a mobile device may interact with one or more servers according to one embodiment of the present disclosure.

0013<figref idref="DRAWINGS">FIG. <b>1</b>C</figref> is a block diagram illustrating a few software engines in the computer system of <figref idref="DRAWINGS">FIG. <b>1</b>A</figref> according to one embodiment.

0014<figref idref="DRAWINGS">FIG. <b>1</b>D</figref> is a flowchart illustrating a method for dynamic fencing carried out by the one or more servers in the packet-based network of <figref idref="DRAWINGS">FIG. <b>1</b></figref> according to certain embodiments.

0015<figref idref="DRAWINGS">FIG. <b>1</b>E</figref> is a flowchart illustrating a method for updating dynamic fencing information carried out by the one or more servers in the packet-based network of <figref idref="DRAWINGS">FIG. <b>1</b></figref> according to certain embodiments.

0016<figref idref="DRAWINGS">FIG. <b>2</b>A</figref> is a diagram illustrating an example of dynamic fences and control points showing overlap between dynamic fences and control points.

0017<figref idref="DRAWINGS">FIG. <b>2</b>B</figref> is a diagram illustrating examples of certain naive solutions that use convex polygons (i) around the center of mass of control points (left) and (ii) around the business (right), respectively.

0018<figref idref="DRAWINGS">FIG. <b>3</b></figref> is a diagram illustrating an example of a region with arbitrary shape composed of a few contiguous closed regions.

0019<figref idref="DRAWINGS">FIG. <b>4</b></figref> is a high level logical view illustrating a process for generating dynamic fences according to certain embodiments.

0020<figref idref="DRAWINGS">FIG. <b>5</b>A-<b>5</b>E</figref> are diagrams illustrating an example of a dynamic fence being shaped by an objective function according to embodiments.

0021<figref idref="DRAWINGS">FIG. <b>6</b></figref> is a two-dimensional view of an example of a topological data structure generated using control points, and fences generated via the combination of multiple adjacent faces according to embodiments.

0022<figref idref="DRAWINGS">FIG. <b>7</b></figref> is a screen capture of an example of a user interface (UI) or application program interface (API) that visualizes dynamic fences according to certain embodiments.

DESCRIPTION OF THE EMBODIMENTS

0023According to certain embodiments, geographical representation of objects and/or virtual regions or fences around the objects is generated based on signals from historical events associated with these objects. These regions are generated to capture as much relevant signals as applicable and can change during the course of the day and day after day. The regions so generated represent areas to be targeted in location-based applications, including, but not limited to: <ul id="ul0001" list-style="none"><li id="ul0001-0001" num="0000"><ul id="ul0002" list-style="none"><li id="ul0002-0001" num="0024">Local advertising, where advertisements can be displayed for any kind of business, for both search and display advertising.</li><li id="ul0002-0002" num="0025">Local search, where fences that define area of relevance for any type of business can be computed.</li><li id="ul0002-0003" num="0026">Social, where a fence defining an area in which social connections for a specific individual is more likely to be effective, e.g. the best area to make friends etc.</li></ul></li></ul>

0027A computer system (e.g., a server computer) executing a software program can be used to generate the virtual regions or fences. <figref idref="DRAWINGS">FIG. <b>1</b>A</figref> is a block diagram of an example of such a computer system <b>150</b>, which includes a processor <b>151</b>, a memory <b>152</b>, one or more data stores <b>153</b>, input/output devices <b>154</b> such as keyboard/mouse/touchscreen, one or more display devices <b>155</b>, such as a monitor, a wired and/or wireless connections <b>156</b> to a network, such as a local area network and/or a wide area network (e.g., the Internet <b>120</b>). The software programs can be stored in a computer readable medium (such as a data store <b>153</b> and or other portable computer readable medium that is not shown). When loaded in the memory <b>152</b> and executed by the processor <b>151</b>, the software programs cause the processor to carry out methods for generating dynamic fences described herein. In one embodiment, location-based documents/information and historical, aggregate data collected from many requests from mobile devices are also stored in the data store <b>153</b>. The one or more data stores <b>153</b> can be computer readable media local to the processor <b>151</b> and/or coupled to the processor via a local or wide-area network.

0028<figref idref="DRAWINGS">FIG. <b>1</b>B</figref> illustrates a packet-based network <b>100</b> (referred sometimes herein as “the cloud”), which, in some embodiments, includes part or all of a cellular network <b>110</b>, the Internet <b>120</b>, and computers and servers coupled to the Internet. The computers and servers can be coupled to the Internet <b>120</b> using wired Ethernet and optionally Power over Ethernet (PoE), WiFi, and/or cellular connections. As shown in <figref idref="DRAWINGS">FIG. <b>1</b>B</figref>, a mobile device <b>130</b> such as a smart phone is also coupled to the packet-based network via WiFi or cellular connections. When a WiFi hotspot (such as hotspot <b>104</b>) is available, the mobile device <b>130</b> may connect to the Internet via the WiFi hotspot using its built-in WiFi connection. Mobile device <b>130</b> may also communicate with the cellular network using its built-in cellular connection to connect to the cellular network <b>110</b>, which is coupled to the Internet via an Internet Gateway. Thus, the mobile device may interact with other computers/servers coupled to the Internet.

0029As shown in <figref idref="DRAWINGS">FIG. <b>1</b>B</figref>, the computers/servers coupled to the Internet may include one or more computers/servers <b>150</b> that is used to execute the software programs to carry out methods for generating dynamic fences according to certain embodiments. They may also include one or more computers/servers <b>102</b> associated with a mobile publisher, one or more computers/servers <b>103</b> associated with an on-line marketer, and other computers/servers <b>105</b>.

0030As shown in <figref idref="DRAWINGS">FIG. <b>1</b>C</figref>, in one embodiment, the one or more servers <b>150</b> executing the software programs may provide one or more software engines or application programming interfaces (API) <b>160</b>, including, for example, an interface engine <b>162</b> and a fencing engine <b>166</b>. In a further embodiment, the one or more servers <b>150</b> executing the software programs may also include a location engine <b>164</b> and/or a document retrieval engine <b>168</b>.

0031<figref idref="DRAWINGS">FIG. <b>1</b>D</figref> is a flowchart illustrating a method carried out by the one or more servers executing the software programs according to certain embodiments. As shown in <figref idref="DRAWINGS">FIGS. <b>1</b>C and <b>1</b>D</figref>, according to one embodiment, in the context of on-line advertisements, the fencing engine <b>166</b> is used to carry out the methods for generating <b>171</b> dynamic areas/fences associated with an advertisement campaign based on campaign information, which can be received by the interface engine <b>162</b>. The interface engine <b>162</b> is also used to receive <b>172</b> mobile user information via the connections <b>156</b>. The mobile user information may include location information provided by a mobile publisher, with whom the mobile user has initiated interaction using the mobile device via one or more web services or applications provided by the mobile publisher. The interface engine <b>162</b> forwards the mobile user information to the location engine <b>164</b>, which is used to generate <b>173</b> one or more probable areas where a user of a mobile device (“mobile user”).

0032In one embodiment the one or more probable areas can simply be an area associated with the location information. For example, if the location information includes a zip code, the one or more probable areas can be an area associated with the zip code. In a further embodiment, the location engine is used to carry out a method described in the co-pending commonly owned U.S. patent application entitled “Method and Apparatus for Probabilistic User Location,” filed on even date herewith, and generates the one or more probable areas with their associated weights or probabilities.

0033The document retrieval engine <b>168</b> is configured to compare the one or more probable area with the one or more fenced areas to determine <b>174</b> one or more target areas, and to retrieve <b>175</b> one or more documents (e.g., advertisement), which can be delivered <b>176</b> to the mobile user using the interface engine <b>162</b>. In one embodiment, each target area has an associated probability and the document retrieval engine chooses an advertisement associated with a target area with the highest probability. In another embodiment, the document retrieval engine performs a coin toss using the probabilities associated with the target areas as weight to choose an advertisement for delivery in response to the ad request. In a further embodiment, the document retrieval engine is configured to carry out a method described in the co-pending U.S. patent application entitled “Method and Apparatus for Geographical Document Retrieval,” filed on even date herewith, to retrieve the document. The interface engine <b>162</b>, location engine <b>164</b>, fencing engine <b>166</b> and document retrieval engine <b>168</b> can be provided by one computer/server <b>150</b> or multiple computers/servers <b>150</b>.

0034The fencing engine <b>166</b> can be run separately from the location engine <b>164</b> and/or the document retrieval engine <b>168</b>. In one embodiment, as shown in <figref idref="DRAWINGS">FIG. <b>1</b>E</figref>, the fencing engine <b>166</b> is further configured to provide <b>181</b> a UI or API to allow a local user or a remote on-line marketer <b>102</b> to interact with the fencing engine <b>166</b> via the UI or API locally or over the Internet <b>120</b>. The on-line marketer <b>102</b> or a local user can input campaign information associated with an advertisement to the fencing engine <b>166</b>, which generates <b>182</b> one or more dynamic fences or areas based on the campaign information and delivers <b>183</b> the one or more dynamic areas to the local user or on-line marketer for display on the UI or API. The one or more areas or regions delivered by the fencing engine can be arbitrary (meaning that they are not attached or associated with any prescribed or pre-established boundaries, or restricted to certain shapes) and/or dynamic (meaning that they can change in shapes and sizes depending on the time of the day). Thus, the local user or on-line marketer <b>102</b> can use the results from the fencing engine <b>166</b> to tune the campaign information and compare the dynamic areas generated using different campaign information so as to reach an optimized result for the advertisement campaign.

0035In a further embodiment, as shown in <figref idref="DRAWINGS">FIG. <b>1</b>E</figref>, the fencing engine <b>166</b> is further configured to receive <b>184</b> updated campaign information via the UI or API, generate <b>185</b> one or more updated dynamic fences or areas based on the updated campaign information, and deliver <b>186</b> the one or more updated dynamic fences or areas to the local user or on-line marketer for display on the UI or API.

0036One important characteristic of dynamic fencing is that the shape of the fence may vary depending on the time of the day.

0037Thus, embodiments in the present disclosure provide a dynamic fencing method executed by a computer system to determine the boundaries of a geographical region of arbitrary shape, called dynamic fence, where advertisements for a certain advertisement campaign are displayed on mobile devices. Impressions for an ad campaign enabled with dynamic fencing take place when the location of a user of a mobile device <b>101</b> is inside the fence generated. One important characteristic of dynamic fencing is that the shapes and sizes of the fences may vary over time. Therefore, the dynamic fences are time-dependent and may change in shapes and sizes depending on the time of day, day of the week, day of the month, holidays and/or other time-dependent aspects. One typical example is that the fence for a restaurant may cover larger areas around lunchtime and smaller areas at night. Further more, the dynamic fences may change in real-time based on continuously updated historical data as allowed by data pipelines implemented in the cloud.

0038These and other aspects of the embodiments are described in further details with respect to the following examples: <ul id="ul0003" list-style="none"><li id="ul0003-0001" num="0000"><ul id="ul0004" list-style="none"><li id="ul0004-0001" num="0039">A retail chain uses hyper-local advertising to let consumers in the neighborhood of their physical stores know of in-store sale items hoping to attract them into the stores;</li><li id="ul0004-0002" num="0040">The owner of a fast-food franchise targets users who are commuting down an adjacent highway to promote their new hearty and healthy lunch combo;</li><li id="ul0004-0003" num="0041">A dentist who is new in town wants to acquire new customers in nearby residential areas;</li><li id="ul0004-0004" num="0042">An electronic retailer wants to advertise to customers who are near or in competing retailers in a same area (e.g., a city or shopping mall); and</li><li id="ul0004-0005" num="0043">A sports gear retailer wants to target sports fans in a stadium attending a baseball game, and later in adjacent highways as they leave the game.</li></ul></li></ul>

0044In one embodiment, a business is represented by a data structure B=(B_lat, B_lon, B_cat, B_dem), wherein B_latand B_lonrepresent geographical coordinates of the business' physical presence, B_catrepresents a category of the business, and B_demdefines the business' demographic of target customers. Let b_i,t=(lat_i, lon_i, w_i,t) be a control point of coordinates lat_iand lon_iwhere w_i,tis a number that represents an amount of interest that mobile users that belong to the demographics B_demand are present in the neighborhood of (lat_i, lon_i) at the moment in time t have on a business of category B_catlocated at (B_lat, B_lon). In some embodiments, effective advertising campaigns for businesses in the neighborhood of (B_lat, B_lon) that belong to category B_cathave a maximum effective targeting area ETA_B,t, which is dependent on a few variables, e.g., <br />ETA_B,t=EffectiveArea(<i>t,B</i>_lat<i>,B</i>_lon<i>,B</i>_cat),<br /> and a dynamic fence is generated by calculating a geographic region R_B,twhere advertisements from business B are displayed in mobile devices in a moment in time t, such that <br />Area(<i>R</i>_B,t)≤ETA_B,t,<br /> and that the objective function below is maximized <br />MAX Σ_contains(R_{<sub2>B,t</sub2>}_,b_{<sub2>i,t</sub2>}₎<i>w</i>_i,t.

0045In such embodiments, the dynamic fence defines a region with arbitrary shape whose size can be limited by the ETA. In that sense, the ETA can be an input parameter for dynamic fencing.

0046<figref idref="DRAWINGS">FIG. <b>2</b>A</figref> shows an example of dynamic fences <b>200</b> for a business <b>201</b> that contains several control points with high values of w_i,t. <figref idref="DRAWINGS">FIG. <b>2</b>A</figref> also illustrates an example of overlap between dynamic fences <b>200</b> and control points <b>210</b>.

0047A simple way of generating dynamic fences includes generating convex polygons either around the business location or around the center of mass of the control points. <figref idref="DRAWINGS">FIG. <b>2</b>B</figref> shows examples for such naive solutions that use convex polygons <b>200</b> (i) around the center of mass of control points <b>210</b> (left) and (ii) around the business <b>201</b> (right), respectively. These naïve solutions are limited by the shape of the region generated, a single convex region in both cases. In both cases, the convex region can't extend far enough to encompass key control points because in both cases the convex polygons would have to cover empty areas that would cause the convex polygon to grow beyond the maximum area size (ETA_B). Solution that are not constrained to generate convex regions can outperform such naive processs due to the flexibility they provide to the objective function. Solutions that generates regions with arbitrary shapes are thus more desired. Regions with arbitrary shapes can be composed of disconnected regions and/or non-convex corners/curves and/or holes, as discussed further below.

0048In one embodiment, the fencing engine <b>166</b> takes as input some or all of the following input parameters associated with an advertisement campaign: <ul id="ul0005" list-style="none"><li id="ul0005-0001" num="0000"><ul id="ul0006" list-style="none"><li id="ul0006-0001" num="0049">Location of the business advertised. It can be one of the following: <ul id="ul0007" list-style="none"><li id="ul0007-0001" num="0050">Latitude and longitude coordinates.</li><li id="ul0007-0002" num="0051">Name or address of the business to be advertised.</li><li id="ul0007-0003" num="0052">Location targeted. Optional parameter. The location targeted can be one of the following: <ul id="ul0008" list-style="none"><li id="ul0008-0001" num="0053">Latitude and longitude coordinates.</li><li id="ul0008-0002" num="0054">Name or address of the business or point of interest to be targeted. Example: Times Square, New York</li><li id="ul0008-0003" num="0055">Sequence of coordinates representing a path to be targeted.</li><li id="ul0008-0004" num="0056">Name or description of road or segment of road. Example: El Camino Real between Lawrence Expressway and Mathilda Avenue</li></ul></li></ul></li><li id="ul0006-0002" num="0057">Time. <ul id="ul0009" list-style="none"><li id="ul0009-0001" num="0058">Time of day</li><li id="ul0009-0002" num="0059">Date</li></ul></li><li id="ul0006-0003" num="0060">Volume priority. This is a tuning parameter used by advertisers to increase the number of impressions, regardless of the ratio of the clicks and secondary actions. Possible values are in the [0, 1] range.</li><li id="ul0006-0004" num="0061">Click priority. This is a tuning parameter used by advertisers to increase the focus of the campaign on maximizing the click through rate. Possible values are in the [0, 1] range.</li><li id="ul0006-0005" num="0062">Secondary action priority. This is a tuning parameter used by advertisers to increase the secondary action through rate. Possible values are in the [0, 1] range.</li><li id="ul0006-0006" num="0063">Targeting demographics <ul id="ul0010" list-style="none"><li id="ul0010-0001" num="0064">Age</li><li id="ul0010-0002" num="0065">Gender</li><li id="ul0010-0003" num="0066">Income</li><li id="ul0010-0004" num="0067">Race/Ethnicity</li><li id="ul0010-0005" num="0068">Marital status</li><li id="ul0010-0006" num="0069">Others</li></ul></li><li id="ul0006-0007" num="0070">List of categories and/or keywords related to the ad campaign</li></ul></li></ul>

0071The above data can be input via the UI or API provided by the fencing engine. Advertisers can initiate such interaction via an API call and can tune the advertising campaigns through changes to the values of the above-listed parameters through the UI or API, which can also display the dynamic fence generated, as discussed in further detail below.

0072In one embodiment, the fencing engine <b>166</b> can generate as its output one or more regions of arbitrary shapes. A region with arbitrary shape R may include a set of one or more contiguous closed regions R={r₁, r₂, . . . , r_n} where each contiguous region r_ihas an external boundary e_iand a set of one or more internal boundaries {k_i1, k_i2, . . . , k_im}. Each boundary b, external or internal, can be defined by a sequence of points b=seq{p₁, p₂, . . . , p_n}. A point p can have two coordinates, latitude and longitude.

0073In one embodiment, the external boundaries of two contiguous closed regions that belong to the same arbitrary region can only touch on a single point. Likewise, an internal boundary of a contiguous closed region can only touch another internal boundary on a single point.

0074In a further embodiment, an internal boundary of a contiguous closed region can only touch the external boundary of the region on a single point. <figref idref="DRAWINGS">FIG. <b>3</b></figref> shows one example of a region <b>300</b> with arbitrary shape composed of three contiguous closed regions <b>310</b>, <b>320</b>, and <b>330</b>. Region <b>310</b> has one internal boundary <b>303</b>. The remaining two contiguous closed regions <b>320</b> and <b>330</b> touch at a single point <b>325</b>. As shown in <figref idref="DRAWINGS">FIG. <b>3</b></figref>, these regions <b>310</b>, <b>320</b> and <b>330</b> have arbitrary shapes and can include both convex corners/curves <b>301</b> and non-convex corners/curves <b>302</b>, and can have holes <b>303</b>.

0075<figref idref="DRAWINGS">FIG. <b>4</b></figref> is a high level logical view illustrating a process <b>400</b> for generating dynamic fences according to certain embodiments. As shown in <figref idref="DRAWINGS">FIG. <b>4</b></figref>, process <b>400</b> includes obtaining <b>410</b> a set of control points relevant to the dynamic fence based on input campaign information by retrieving and sampling (randomly picking some of the) points, or geographical coordinates, extracted from historical data or other sources associated with geographical locations. The control points represent locations associated with ad impressions, clicks, and/or secondary actions collected from mobile devices. The choice of control points represents an adaptative approach that uses knowledge about where impressions, clicks and conversions are generated in order to shape the fence. The sampling strategy for control points is a function of tuning parameters provided by advertisers via the API as well as of the level of precision/resolution desired for the dynamic fence.

0076The process <b>400</b> further includes annotating <b>420</b> the control points with data that adds signal from keywords (or categories). For example, if a control point is in the neighborhood of several restaurants, the control point can be annotated with the tuple (category=“restaurants”, signal=0.5). Multiple annotations of the same keyword (or category) to the same control point can be combined into a single annotation.

0077The process <b>400</b> further includes producing <b>430</b> a topological data structure (TDS) using the control points and annotations. The TDS divides a region covered by control points into small regions, called faces. The process <b>400</b> further includes generating <b>440</b> the dynamic fence using the TDS by combining the faces.

0078Certain logical aspects of the process <b>400</b> are described in further detail below. At a high level, according to one embodiment, a dynamic fence can be generated by: (i) subdividing a region into faces; (ii) selecting a subset of faces; and (iii) collapsing the subset of faces to generate the dynamic fence.

0079In one embodiment, to subdivide a geographic region, the neighborhood of a targeted location is divided into small areas, s₁, s₂, . . . , s_n, called faces, such that each control point p_iis associated with a face s_i. An objective function is used to bring as many faces with high weights as possible into a final region.

0080In one embodiment, in a so-called greedy process for calculating a dynamic fence, the density of each face is computed as

0081<maths id="MATH-US-00001" num="00001"><math overflow="scroll"><mrow><mrow><mrow><mi>d</mi><mo>⁡</mo><mrow><mo>(</mo><msub><mi>s</mi><mi>i</mi></msub><mo>)</mo></mrow></mrow><mo>=</mo><mfrac><msub><mi>w</mi><mi>i</mi></msub><mrow><mi>area</mi><mo>⁡</mo><mrow><mo>(</mo><msub><mi>s</mi><mi>i</mi></msub><mo>)</mo></mrow></mrow></mfrac></mrow><mo>,</mo></mrow></math></maths><img file="US11570583B2_D0001.tif" /><img file="US11570583B2_D0002.tif" /><img file="US11570583B2_D0003.tif" /><br /> and all of the faces are sorted in descending order of density. Then the top most dense faces are merged while keeping dynamicFenceArea≤ETA. The complexity of this process is the complexity of the sorting step O(N*log(N)) as the sorting step dominates the process. This greedy process produces optimal results in cases where all of the faces have about the same size.

0082For faces with distinct sizes, the greedy process is not optimal due to, for example, a corner case where the following conditions happen: (i) dynamicFenceArea&lt;ETA and (ii) There is a face s_lnot included in the dynamic fence, with lower density, greater w_land greater area(s_l) that could replace one of the faces included in the dynamic fence, increasing the result of objective function while still keeping dynamicFenceArea≤ETA. In real-life scenarios with dynamic fences with tens of thousands of faces, any processs that attempt to improve the greedy process by reducing the difference (ETA−dynamicFenceArea) would produce negligible improvements. Therefore, it is unnecessary to invest in complex heuristics and expensive combinatorial processs to address such corner cases.

0083<figref idref="DRAWINGS">FIGS. <b>5</b>A-<b>5</b>E</figref> show an example of how the objective function shapes a dynamic fence. <figref idref="DRAWINGS">FIG. <b>5</b>A</figref> shows an example of a set of control points <b>510</b> for a location <b>501</b> targeted for an advertisement campaign. <figref idref="DRAWINGS">FIG. <b>5</b>B</figref> shows how a geographic region <b>520</b> that surrounds the control points is subdivided into eleven faces <b>522</b>. <figref idref="DRAWINGS">FIG. <b>5</b>C</figref> shows signal strength in each face. <figref idref="DRAWINGS">FIG. <b>5</b>D</figref> shows density for each face. <figref idref="DRAWINGS">FIG. <b>5</b>E</figref> shows how the objective function shapes the dynamic fence. Assuming that the ETA is thirteen square units, the objective function selects six top density faces to form the dynamic fence.

0084As shown in <figref idref="DRAWINGS">FIG. <b>4</b></figref>, in certain embodiments of the process <b>400</b>, a set of control points that match location, time, demographics, keywords and categories passed by the API are identified in <b>410</b>. The control points can be a subset of locations from historical data <b>412</b> that are known to be associated with secondary actions, clicks and impressions. Each control point may have some initial annotations, such as the following: <ul id="ul0011" list-style="none"><li id="ul0011-0001" num="0000"><ul id="ul0012" list-style="none"><li id="ul0012-0001" num="0085">(“IMPRESSION”, 0 or 1)</li><li id="ul0012-0002" num="0086">(“CLICK”, 0 or 1)</li><li id="ul0012-0003" num="0087">(“SECONDARY ACTION”, 0 or 1) <br /> where “1” indicates that the control point had a least one impression (click or call) in the past, and “0” indicates otherwise. Only one of the annotations is usually applied to a control point. </li></ul></li></ul>

0088Note that such time dependent approach for control point retrieval can enable dynamic fences to vary in shape depending on the time of day, day of week, day of the month, holidays etc.

0089After control points are generated, in <b>420</b>, a series of annotators <b>422</b> can process the control points and annotate each point with (keywordOrCategory, signalStrength) annotations. Each annotation has a signal strength in the (0 . . . 1] range. The annotator's model that computes the signal strength should consider using the API input parameters as input features. For example, for categories (input parameter) where proximity is correlated with clicks and secondary actions, such as “restaurants” and “gas stations”, the signal strength should decay with the distance between the business location (input parameter) and the control point.

0090A case that requires special attention is when the advertiser targets a business or point-of-interest. In such case, the signal strength should decay with the distance between the business or target location and control point.

0091Annotators <b>422</b> may use historical search, display data and demand data stored in their respective repositories <b>425</b> to generate annotations. In an example in which search data is used to generate annotations, the locations of control points can be joined with nearby historical data for search and display requests. If clicks and secondary actions were generated for a cluster of searches to “restaurants”, the annotators <b>422</b> can annotate nearby control points with the keyword “restaurants.” The signal strength can be a function of the number and density of clicks and conversions for restaurants in the area.

0092The control points can also be annotated using other types of sources. In a high level example, Nielsen PRIZM could be used as an external source annotator. The Nielsen PRIZM is a set of geo-demographic segments for the United States. It assigns segments such as “Money &amp; Brains” to geographical locations. ANielsen PRIZM annotator could annotate control points inside regions marked by Nielsen PRIZM as “Money &amp; Brains” with keywords associated with luxury items such as “Lexus” or “Vacation in Europe.”

0093In certain embodiments, annotations are blended in <b>420</b> using a linear model. For example, let A_w=(w_a_{<sub2>1</sub2>}, . . . , w_a_{<sub2>n</sub2>}) be a vector of weights for annotators 1 . . . n. These weights can be constant per annotator and can be tuned using an offline feedback pipeline. Now let K_w(k, p)=(y_a_{<sub2>1</sub2>}, . . . , y_a_{<sub2>n</sub2>}) be a vector of weights for a control point p and a keyword (or category) k. The following formula computes the final weight W(k, p) which blends annotations for the keyword (or category) k for the control point p:

0094<maths id="MATH-US-00002" num="00002"><math overflow="scroll"><mrow><mrow><mi>W</mi><mo>⁡</mo><mrow><mo>(</mo><mrow><mi>k</mi><mo>,</mo><mi>p</mi></mrow><mo>)</mo></mrow></mrow><mo>=</mo><mrow><munderover><mo>∑</mo><mrow><mi>i</mi><mo>=</mo><mn>1</mn></mrow><mi>n</mi></munderover><mo>⁢</mo><mrow><msub><mi>w</mi><msub><mi>a</mi><mi>i</mi></msub></msub><mo>*</mo><msub><mi>y</mi><msub><mi>a</mi><mi>i</mi></msub></msub></mrow></mrow></mrow></math></maths><img file="US11570583B2_D0004.tif" /><img file="US11570583B2_D0005.tif" /><img file="US11570583B2_D0006.tif" />

0095The vector of annotator weights A_w=(w_a_{<sub2>1</sub2>}, . . . , w_a_{<sub2>n</sub2>}) can be tuned using a gradient descent process. The gradient descent process uses an offline pipeline that aggregates data daily for the gradient descent iterations. The gradient descent process uses an objective function that combines revenue, clicks and call data collected from historical data.

0096Before generating the dynamic fence, the process <b>400</b> generates a topological data structure (TDS) in <b>430</b> to subdivide the neighborhood of the target location into a set of small regions, s₁, s₂, . . . , s_n, i.e, the faces. The build graph component also computes the final signal strength, w_iof each face. Each face s_iin the TDS corresponds to one control point p_i. Each face knows which faces are adjacent to it and also knows the sequence of coordinates that form its boundary.

0097<figref idref="DRAWINGS">FIG. <b>6</b></figref> is a two-dimensional view of topological data structures and fences showing a real example of a topological data structure generated using control points, and fences generated via the combination of multiple adjacent faces.

0098In one embodiment, the weight w_ifor each face is computed as follows. First, a combined weight for the keywords (or categories) associated with the ad campaign is computed using a weighted average function. For example, assuming the process <b>400</b> is trying to draw a dynamic fence for a business associated with “restaurant” and “fast food” keywords, a control point p_iis annotated with W(restaurant, p_i)=0.6 and W(fast food, p_i)=0.3, and the weights for the keywords “restaurant” and “fast food” are W_restaurant=4 and W_fastfood=2. The final value for the weighted average is

0099<maths id="MATH-US-00003" num="00003"><math overflow="scroll"><mrow><mfrac><mrow><mo>(</mo><mrow><mrow><mrow><mn>0</mn><mo>.</mo><mn>6</mn></mrow><mo>*</mo><mn>4</mn></mrow><mo>+</mo><mrow><mn>0.3</mn><mo>*</mo><mn>2</mn></mrow></mrow><mo>)</mo></mrow><mrow><mo>(</mo><mrow><mn>4</mn><mo>+</mo><mn>2</mn></mrow><mo>)</mo></mrow></mfrac><mo>=</mo><mrow><mn>0</mn><mo>.</mo><mn>5</mn><mo>.</mo></mrow></mrow></math></maths><img file="US11570583B2_D0007.tif" /><img file="US11570583B2_D0008.tif" /><img file="US11570583B2_D0009.tif" />

0100In one embodiment, the result of the weighted average is multiplied by the impression, click and secondary action tuning parameters set by the advertisers. For example, assuming that the ad campaign has the priorities 1, 4 and 10 for impressions, clicks and secondary actions, respectively. If p_iis a secondary action, the value of w_iafter the ad campaign priority is applied is: w_i=0.5*10=5.

0101In <b>440</b> of process <b>400</b>, the TDS and the weights associated with each face of the TDS are used to select a subset of faces to shape the dynamic fence. For example, when the greedy process adds a face to the dynamic fence, one of three senarios may happen: <ul id="ul0013" list-style="none"><li id="ul0013-0001" num="0000"><ul id="ul0014" list-style="none"><li id="ul0014-0001" num="0102">The new face is not adjacent to any other face in the dynamic fence. This face becomes a new cluster of faces (with a single face).</li><li id="ul0014-0002" num="0103">The new face is adjacent to one or more faces in one cluster of faces. This face is added to the cluster of faces adjacent to it.</li><li id="ul0014-0003" num="0104">The new face is adjacent to faces in two or more clusters of faces. A new parent cluster is created that contains the new face and references the adjacent clusters as child clusters.</li></ul></li></ul>

0105After the clusters of faces are identified, each hierarchy of clusters should be transformed in a single cluster. A trivial linear process can be used to flatten the hierarchies of clusters. Each final cluster can become a contiguous closed region. Note that the dynamic fence is represented as a collection of contiguous closed regions that form a region with arbitrary shape (see <figref idref="DRAWINGS">FIG. <b>3</b></figref>). The external and internal boundaries of each contiguous closed region are generated in the following way: <ul id="ul0015" list-style="none"><li id="ul0015-0001" num="0000"><ul id="ul0016" list-style="none"><li id="ul0016-0001" num="0106">The boundary between two faces is a line segment represented by two points. Every boundary of a face that is adjacent to a face that does not belong to any cluster is part of either an external boundary or internal boundary. Such line segments are marked as boundary segments.</li><li id="ul0016-0002" num="0107">Adjacent marked line segments are connected in order to form loops that correspond to the external and internal boundaries of each contiguous closed region.</li></ul></li></ul>

0108At this point the boundaries of each contiguous closed region are identified but it is not known yet which boundary is the external boundary. One simple solution is to calculate the area defined by each boundary. The boundary with the greatest area is the external boundary, and the remaining boundaries are internal boundaries.

0109In certain embodiments, external boundaries should be oriented clock-wise and internal boundaries should be oriented counter-clock wise. The orientation may be useful to display the contiguous closed regions.

0110The process discussed so far is linear with the number of faces. Therefore, the complexity of the process remains O (N*log(N)) as previously asserted.

0111Optionally, the following extra steps can be applied for performance reasons: <ul id="ul0017" list-style="none"><li id="ul0017-0001" num="0000"><ul id="ul0018" list-style="none"><li id="ul0018-0001" num="0112">Drop very small contiguous closed regions and small holes.</li><li id="ul0018-0002" num="0113">Simplify the boundaries of contiguous regions, through the replacement of each boundary with a new smaller sequence of points, while minimizing alterations to the geographic region covered. The simplification of boundaries can be a trivial computer graphics process extensively covered in the literature.</li></ul></li></ul>

0114Small contiguous closed regions and small holes can be dropped while minimizing the impact on the result of the ranking function in that all of the faces whose contiguous closed regions fall below a given threshold are moved to a set of faces that are not assigned to any cluster.

0115One possible threshold could be defined as a fraction of the result of the objective function. Contiguous closed regions whose combined sum of w_iis less than the threshold are excluded from the dynamic fence. The threshold should be tuned based on a proper balance between the performance improvement and the negative impact in metrics (clicks and secondary actions).

0116Note that the set of faces that are not assigned to any cluster includes: (i) the faces that belonged to contiguous closed regions that were just recycled and (ii) faces that were never assigned to any contiguous regions.

0117The greedy process that assigns faces to clusters is repeated with one exception, i.e., new clusters cannot be created. Faces can only be assigned to existing clusters or cause clusters to merge. This step is repeated until the maximum area size ETA is reached. Note that the faces don't need to be sorted again. The order set for the first run of the greedy process is reused.

0118In order to eliminate holes, the process should tolerate an increase in the final size of the dynamic fence by a constant factor. Again, such threshold should be tuned based on a proper balance between the performance improvement and the negative impact in metrics (clicks and secondary actions).

0119It is worth mentioning that eliminating small contiguous regions and holes can also help avoiding overfitting. In this context, very small contiguous regions may represent sparse historical signals (e.g. clicks and secondary actions) that may not repeat over time. Larger regions are more likely to be associated with patterns of events that repeat over time.

0120<figref idref="DRAWINGS">FIG. <b>7</b></figref> illustrates an example of a user interface (UI) or application program interface (API) <b>700</b> that visualizes dynamic fences according to certain embodiments. Advertisers or campaign managers can use the UI or API <b>700</b> to tune dynamic fences. In one embodiment, the UI or API <b>700</b> includes a form <b>710</b> and a canvas <b>720</b>. An advertiser can enter parameters that can impact the shape of the dynamic fence using the form <b>710</b>. The canvas <b>720</b> displays one or more resulting fences <b>722</b> and/or an animation that shows how the fences <b>722</b> change over the course of the day. For example, as shown in <figref idref="DRAWINGS">FIG. <b>7</b></figref>, the parameters can include: <ul id="ul0019" list-style="none"><li id="ul0019-0001" num="0000"><ul id="ul0020" list-style="none"><li id="ul0020-0001" num="0121">Keyword or category: this could be a free form text with a drop-down list that offers suggestions as the user types into the field.</li><li id="ul0020-0002" num="0122">Location or targeting location: the problem of how to find a location of a name or address is addressed by multiple geocoding solutions commercially available and is not part of claims in this document. If the name or address provided is ambiguous, the UI may display a window to the user where he chooses one of multiple options. Another alternative is to display in the canvas multiple locations and ask the user to choose one of them.</li><li id="ul0020-0003" num="0123">Volume, click and secondary action priorities: an alternative to the basic keyboard input for numeric values is the use of dials or sliders to capture volume, click and secondary action priority.</li><li id="ul0020-0004" num="0124">Targeting expression: it can be captured as expression typed into the text field or, optionally, each demographic targeting domain could be captured in separate fields.</li></ul></li></ul>

0125The image displayed in the canvas <b>720</b> shows the state of the dynamic fence <b>722</b> at 5 PM. Instead of using an animation, the UI may offer a mechanism such as a slider or dial that the advertiser can use to visualize the dynamic fence at a specific time of day. The UI can also use stop/play buttons to stop and continue the animation on the canvas.

0126In one embodiment, the UI <b>700</b> in <figref idref="DRAWINGS">FIG. <b>7</b></figref> can be used to implement business methods powered by dynamic fences. For example, in a business method of competitive conquest, an advertiser can use the UI <b>700</b> to target regions in a map where users are likely engaged with their competitors. For example, a Macy's department store may want to target users who are in or in the vicinity of a neighboring Bloomindale's. A BMW dealership may want to target users who are in the lot of competing brands such as Mercedes, Lexus, and Audi. In one embodiment, fences can be generated around the target areas based on user input or geographic input (i.e. the boundaries of the block in which a department store is located). Real-time data can adjust the fences generated based on geographic data. For example, intra-week variations such as higher traffic or movement over weekends can be captured

0127Similar to competitive conquest, in a method for real-time point-of-interest (POI) targeting, made possible with time-variant dynamic fences, an advertiser can target a region in a map associated with a POI (e.g. a neighborhood, a section of an interstate highway) where their target users are mobile in real-time.