US20120047143A1 - Sparse profile augmentation using a mobile aggregate profiling system - Google Patents
Sparse profile augmentation using a mobile aggregate profiling system Download PDFInfo
- Publication number
- US20120047143A1 US20120047143A1 US12/722,564 US72256410A US2012047143A1 US 20120047143 A1 US20120047143 A1 US 20120047143A1 US 72256410 A US72256410 A US 72256410A US 2012047143 A1 US2012047143 A1 US 2012047143A1
- Authority
- US
- United States
- Prior art keywords
- user
- profile
- keyword
- subject user
- subject
- Prior art date
- Legal status (The legal status 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 status listed.)
- Abandoned
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
- H04W4/02—Services making use of location information
-
- G—PHYSICS
- G01—MEASURING; TESTING
- G01C—MEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
- G01C21/00—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00
- G01C21/26—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00 specially adapted for navigation in a road network
- G01C21/34—Route searching; Route guidance
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N5/00—Computing arrangements using knowledge-based models
- G06N5/04—Inference or reasoning models
-
- 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
- G06Q30/0282—Rating or review of business operators or products
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W12/00—Security arrangements; Authentication; Protecting privacy or anonymity
- H04W12/02—Protecting privacy or anonymity, e.g. protecting personally identifiable information [PII]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
- H04W4/02—Services making use of location information
- H04W4/029—Location-based management or tracking services
Definitions
- the present disclosure relates to augmenting a sparse user profile.
- the user profile of the subject user is augmented based on aggregate profile data for a group of users relevant to a current location of the subject user.
- the group of users is a crowd of users currently located at a location that is relevant to the current location of the subject user.
- the group of users is a number of users historically, or previously, located at locations relevant to the current location of the subject user.
- a profile augmentation function obtains an aggregate profile of a crowd of users currently located at or near the current location of the subject user.
- the aggregate profile of the crowd includes a number of keywords and a number of user matches, or occurrences, of each of the keywords in user profiles of the users in the crowd.
- the profile augmentation function then augments the user profile of the subject user based on the keywords and the number of user matches for the keywords in the aggregate profile of the crowd.
- the profile augmentation function obtains a historical aggregate profile for users previously, or historically, located at or near the current location of the subject user.
- the historical aggregate profile includes a number of keywords and a number of user matches, or occurrences, of each of the keywords in user profiles of the users historically located at or near the current location of the subject user.
- the profile augmentation function then augments the user profile of the subject user based on the keywords and the number of user matches for the keywords in the historical aggregate profile.
- FIG. 1A illustrates a system providing sparse profile augmentation according to a first embodiment of the present disclosure
- FIG. 1B illustrates a system providing sparse profile augmentation according to a second exemplary embodiment of the present disclosure
- FIG. 2 is a block diagram of the MAP server of FIGS. 1A and 1B according to one embodiment of the present disclosure
- FIG. 3 is a block diagram of the MAP client of one of the mobile devices of FIGS. 1A and 1B according to one embodiment of the present disclosure
- FIG. 4 illustrates the operation of the system of FIGS. 1A and 1B to provide user profiles and current locations of the users of the mobile devices to the MAP server according to one embodiment of the present disclosure
- FIG. 5 illustrates the operation of the system of FIGS. 1A and 1B to provide user profiles and current locations of the users of the mobile devices to the MAP server according to another embodiment of the present disclosure
- FIGS. 6 and 7 graphically illustrate bucketization of users according to location for purposes of maintaining a historical record of anonymized user profile data by location according to one embodiment of the present disclosure
- FIG. 8 is a flow chart illustrating the operation of a foreground bucketization process performed by the MAP server to maintain the lists of users for location buckets for purposes of maintaining a historical record of anonymized user profile data by location according to one embodiment of the present disclosure
- FIG. 9 is a flow chart illustrating the anonymization and storage process performed by the MAP server for the location buckets in order to maintain a historical record of anonymized user profile data by location according to one embodiment of the present disclosure
- FIG. 10 graphically illustrates anonymization of a user record according to one embodiment of the present disclosure
- FIG. 11 is a flow chart for a quadtree based storage process that may be used to store anonymized user profile data for location buckets according to one embodiment of the present disclosure
- FIG. 12 is a flow chart illustrating a quadtree algorithm that may be used to process the location buckets for storage of the anonymized user profile data according to one embodiment of the present disclosure
- FIGS. 13A through 13E graphically illustrate the process of FIG. 12 for the generation of a quadtree data structure for one exemplary base quadtree region
- FIG. 14 illustrates the operation of the system of FIGS. 1A and 1B wherein a mobile device is enabled to request and receive historical data from the MAP server according to one embodiment of the present disclosure
- FIG. 15 is a flow chart for a spatial crowd formation process according to one embodiment of the present disclosure.
- FIGS. 16A through 16D graphically illustrate the crowd formation process of FIG. 15 for an exemplary bounding box
- FIGS. 17A through 17D illustrate a flow chart for a spatial crowd formation process according to another embodiment of the present disclosure
- FIGS. 18A through 18D graphically illustrate the crowd formation process of FIGS. 17A through 17D for a scenario where the crowd formation process is triggered by a location update for a user having no old location;
- FIGS. 19A through 19F graphically illustrate the crowd formation process of FIGS. 17A through 17D for a scenario where the new and old bounding boxes overlap;
- FIGS. 20A through 20E graphically illustrate the crowd formation process of FIGS. 17A through 17D in a scenario where the new and old bounding boxes do not overlap;
- FIG. 21 illustrates the operation of the MAP server to process a crowd request according to one embodiment of the present disclosure
- FIG. 22 is a flow chart illustrating the operation of the profile augmentation function of FIGS. 1A and 1B to augment a user profile of a subject user based on an aggregate profile of a crowd at or near a current location of the subject user according to one embodiment of the present disclosure
- FIG. 23 is a more detailed illustration of the augmenting step of FIG. 22 according to one embodiment of the present disclosure.
- FIG. 24 is a flow chart illustrating the operation of the profile augmentation to update a user profile of a subject user according to one embodiment of the present disclosure
- FIG. 25 is a more detailed illustration of the augmenting step of FIG. 22 according to another embodiment of the present disclosure.
- FIG. 26 is a flow chart illustrating the operation of the profile augmentation function of FIG. 1A to augment a user profile of a subject user based on an aggregate profile of a crowd at or near a current location of the subject user according to one embodiment of the present disclosure
- FIG. 27 is a flow chart illustrating the operation of the profile augmentation function of FIG. 1B to augment a user profile of a subject user based on an aggregate profile of a crowd at or near a current location of the subject user according to one embodiment of the present disclosure
- FIG. 28 is a flow chart illustrating the operation of the profile augmentation function of FIGS. 1A and 1B to augment a user profile of a subject user based on a historical aggregate profile for a current location of the subject user according to another embodiment of the present disclosure
- FIG. 29 is more detailed illustration of the augmenting step of FIG. 28 according to one embodiment of the present disclosure.
- FIG. 30 is more detailed illustration of the augmenting step of FIG. 28 according to another embodiment of the present disclosure.
- FIG. 31 is a flow chart illustrating the operation of the profile augmentation function of FIG. 1A to augment a user profile of a subject user based on a historical aggregate profile for a current location of the subject user according to one embodiment of the present disclosure
- FIG. 32 is a flow chart illustrating the operation of the profile augmentation function of FIG. 1B to augment a user profile of a subject user based on a historical aggregate profile for a current location of the subject user according to another embodiment of the present disclosure
- FIG. 33 is a flow chart illustrating the operation of the MAP server to generate a historical aggregate profile for a current location of a subject user in response to a request from the profile augmentation function according to one embodiment of the present disclosure
- FIG. 34 is a block diagram of the MAP server of FIG. 1 according to one embodiment of the present disclosure.
- FIG. 35 is a block diagram of one of the mobile devices of FIG. 1 according to one embodiment of the present disclosure.
- FIG. 36 is a block diagram of the subscriber device of FIG. 1 according to one embodiment of the present disclosure.
- FIG. 37 is a block diagram of the third-party server of FIG. 1 according to one embodiment of the present disclosure.
- FIG. 38 is a block diagram of the profile server of FIG. 1 according to one embodiment of the present disclosure.
- FIG. 1A illustrates a system 10 providing sparse profile augmentation according to a first exemplary embodiment of the present disclosure.
- the system 10 includes a MAP server 12 , one or more profile servers 14 , a location server 16 , a number of mobile devices 18 - 1 through 18 -N having associated users 20 - 1 through 20 -N, a subscriber device 22 having an associated subscriber 24 , and a third-party server 26 communicatively coupled via a network 28 .
- the network 28 may be any type of network or any combination of networks. Specifically, the network 28 may include wired components, wireless components, or both wired and wireless components.
- the network 28 is a distributed public network such as the Internet, where the mobile devices 18 - 1 through 18 -N are enabled to connect to the network 28 via local wireless connections (e.g., WiFi or IEEE 802.11 connections) or wireless telecommunications connections (e.g., 3G or 4G telecommunications connections such as GSM, LTE, W-CDMA, or WiMAX connections).
- local wireless connections e.g., WiFi or IEEE 802.11 connections
- wireless telecommunications connections e.g., 3G or 4G telecommunications connections such as GSM, LTE, W-CDMA, or WiMAX connections.
- the MAP server 12 operates to obtain current locations, including location updates, and user profiles of the users 20 - 1 through 20 -N of the mobile devices 18 - 1 through 18 -N.
- the current locations of the users 20 - 1 through 20 -N can be expressed as positional geographic coordinates such as latitude-longitude pairs, and a height vector (if applicable), or any other similar information capable of identifying a given physical point in space in a two-dimensional or three-dimensional coordinate system.
- the MAP server 12 is enabled to provide a number of features such as, but not limited to, maintaining a historical record of anonymized user profile data by location, generating aggregate profile data over time for a Point of Interest (POI) or Area of Interest (AOI) using the historical record of anonymized user profile data, identifying crowds of users using current locations and/or user profiles of the users 20 - 1 through 20 -N, and generating aggregate profiles for crowds of users at a POI or in an AOI using the current user profiles of users in the crowds. While not essential, for additional information regarding the MAP server 12 , the interested reader is directed to U.S. patent application Ser. No.
- MAP server 12 12/645,560 entitled HANDLING CROWD REQUESTS FOR LARGE GEOGRAPHIC AREAS, all of which were filed on Dec. 23, 2009 and are hereby incorporated herein by reference in their entireties.
- MAP server 12 is illustrated as a single server for simplicity and ease of discussion, it should be appreciated that the MAP server 12 may be implemented as a single physical server or multiple physical servers operating in a collaborative manner for purposes of redundancy and/or load sharing.
- the one or more profile servers 14 operate to store user profiles for a number of persons including the users 20 - 1 through 20 -N of the mobile devices 18 - 1 through 18 -N.
- the one or more profile servers 14 may be servers providing social network services such as the Facebook® social networking service, the MySpace® social networking service, the LinkedIN® social networking service, and/or the like.
- the MAP server 12 is enabled to directly or indirectly obtain the user profiles of the users 20 - 1 through 20 -N of the mobile devices 18 - 1 through 18 -N.
- the location server 16 generally operates to receive location updates from the mobile devices 18 - 1 through 18 -N and make the location updates available to entities such as, for instance, the MAP server 12 .
- the location server 16 is a server operating to provide Yahoo!'s FireEagle service.
- the system 10 of FIG. 1A illustrates an embodiment where the one or more profile servers 14 and the location server 16 are separate from the MAP server 12 , the present disclosure is not limited thereto. In an alternative embodiment, the functionality of the one or more profile servers 14 and/or the location server 16 may be implemented within the MAP server 12 .
- the mobile devices 18 - 1 through 18 -N may be mobile smart phones, portable media player devices, mobile gaming devices, or the like. Some exemplary mobile devices that may be programmed or otherwise configured to operate as the mobile devices 18 - 1 through 18 -N are the Apple® iPhone, the Palm Pre, the Samsung Rogue, the Blackberry Storm, and the Apple® iPod Touch® device. However, this list of exemplary mobile devices is not exhaustive and is not intended to limit the scope of the present disclosure.
- the mobile devices 18 - 1 through 18 -N include MAP clients 30 - 1 through 30 -N, MAP applications 32 - 1 through 32 -N, third-party applications 34 - 1 through 34 -N, and location functions 36 - 1 through 36 -N, respectively.
- the MAP client 30 - 1 is preferably implemented in software.
- the MAP client 30 - 1 is a middleware layer operating to interface an application layer (i.e., the MAP application 32 - 1 and the third-party applications 34 - 1 ) to the MAP server 12 .
- the MAP client 30 - 1 enables the MAP application 32 - 1 and the third-party applications 34 - 1 to request and receive data from the MAP server 12 .
- the MAP client 30 - 1 enables applications, such as the MAP application 32 - 1 and the third-party applications 34 - 1 , to access data from the MAP server 12 .
- the MAP application 32 - 1 is also preferably implemented in software.
- the MAP application 32 - 1 generally provides a user interface component between the user 20 - 1 and the MAP server 12 . More specifically, among other things, the MAP application 32 - 1 enables the user 20 - 1 to initiate historical requests for historical data (e.g., historical aggregate profile data) or crowd requests for crowd data (e.g., aggregate profile data and/or crowd characteristics data) from the MAP server 12 for a POI or AOI.
- the MAP application 32 - 1 also enables the user 20 - 1 to configure various settings.
- the MAP application 32 - 1 may enable the user 20 - 1 to select a desired social networking service (e.g., Facebook, MySpace, LinkedIN, etc.) from which to obtain the user profile of the user 20 - 1 and provide any necessary credentials (e.g., username and password) needed to access the user profile from the social networking service.
- a desired social networking service e.g., Facebook, MySpace, LinkedIN, etc.
- any necessary credentials e.g., username and password
- the third-party applications 34 - 1 are preferably implemented in software.
- the third-party applications 34 - 1 operate to access the MAP server 12 via the MAP client 30 - 1 .
- the third-party applications 34 - 1 may utilize data obtained from the MAP server 12 in any desired manner.
- one of the third party applications 34 - 1 may be a gaming application that utilizes historical aggregate profile data to notify the user 20 - 1 of POIs or AOIs where persons having an interest in the game have historically congregated.
- the location function 36 - 1 may be implemented in hardware, software, or a combination thereof. In general, the location function 36 - 1 operates to determine or otherwise obtain the location of the mobile device 18 - 1 .
- the location function 36 - 1 may be or include a Global Positioning System (GPS) receiver.
- GPS Global Positioning System
- the subscriber device 22 is a physical device such as a personal computer, a mobile computer (e.g., a notebook computer, a netbook computer, a tablet computer, etc.), a mobile smart phone, or the like.
- the subscriber 24 associated with the subscriber device 22 is a person or entity. In general, the subscriber device 22 enables the subscriber 24 to access the MAP server 12 via a web browser 38 to obtain various types of data, preferably for a fee.
- the subscriber 24 may pay a fee to have access to historical aggregate profile data for one or more POIs and/or one or more AOIs, pay a fee to have access to crowd data such as aggregate profiles for crowds located at one or more POIs and/or located in one or more AOIs, pay a fee to track crowds, or the like.
- the web browser 38 is exemplary.
- the subscriber device 22 is enabled to access the MAP server 12 via a custom application.
- the third-party server 26 is a physical server that has access to data from the MAP server 12 such as historical aggregate profile data for one or more POIs or one or more AOIs or crowd data such as aggregate profiles for one or more crowds at one or more POIs or within one or more AOIs. Based on the data from the MAP server 12 , the third-party server 26 operates to provide a service such as, for example, targeted advertising. For example, the third-party server 26 may obtain anonymous aggregate profile data for one or more crowds located at a POI and then provide targeted advertising to known users located at the POI based on the anonymous aggregate profile data. Note that while targeted advertising is mentioned as an exemplary service provided by the third-party server 26 , other types of services may additionally or alternatively be provided. Other types of services that may be provided by the third-party server 26 will be apparent to one of ordinary skill in the art upon reading this disclosure.
- the MAP server 12 includes a profile augmentation function 40 .
- the profile augmentation function 40 is preferably implemented in software, but is not limited thereto. As discussed below in detail, the profile augmentation function 40 operates to augment user profiles of users, such as but not limited to the users 20 - 1 through 20 -N, based on aggregate profile data for crowds of users and/or historical aggregate profile data.
- the profile augmentation function 40 operates to augment the user profile of the user 20 - 1 based on aggregate profiles of crowds of users in which the user 20 - 1 is included, aggregate profiles of crowds of users 20 - 1 that are nearby to the user 20 - 1 , and/or historical aggregate profile data for locations visited by the user 20 - 1 .
- FIG. 1B illustrates the system 10 providing sparse profile augmentation according to a second exemplary embodiment of the present disclosure.
- the system 10 includes a MAP server 12 , one or more profile servers 14 , a location server 16 , a number of mobile devices 18 - 1 through 18 -N having associated users 20 - 1 through 20 -N, a subscriber device 22 having an associated subscriber 24 , and a third-party server 26 communicatively coupled via a network 28 .
- the profile augmentation function 40 is implemented apart from the MAP server 12 .
- the profile augmentation function 40 may be implemented on any network device that is enabled to communicate with the MAP server 12 via the network 28 .
- the profile augmentation function 40 may be implemented on the profile server 14 , one or more of the mobile devices 18 - 1 through 18 -N, the subscriber device 22 , and/or the third-party server 26 .
- the profile augmentation function 40 operates to augment user profiles of system users (i.e., one or more of the users 20 - 1 through 20 -N), third-party users (e.g., one or more users associated with the profile server 14 other than the users 20 - 1 through 20 -N, the subscriber 24 , and/or one or more users associated with the third-party server 26 ), or a combination thereof. More specifically, for a particular user, the profile augmentation function 40 augments the user profile of the user based on aggregate profile data for crowds located at or near the current location of the user and/or historical aggregate profile data for the current location of the user.
- FIG. 2 is a block diagram of the MAP server 12 of FIGS. 1A and 1B according to one embodiment of the present disclosure.
- the MAP server 12 includes an application layer 42 , a business logic layer 44 , and a persistence layer 46 .
- the application layer 42 includes a user web application 48 , a mobile client/server protocol component 50 , and one or more data Application Programming Interfaces (APIs) 52 .
- APIs Application Programming Interfaces
- the user web application 48 is preferably implemented in software and operates to provide a web interface for users, such as the subscriber 24 , to access the MAP server 12 via a web browser.
- the mobile client/server protocol component 50 is preferably implemented in software and operates to provide an interface between the MAP server 12 and the MAP clients 30 - 1 through 30 -N hosted by the mobile devices 18 - 1 through 18 -N.
- the data APIs 52 enable third-party services, such as the third-party server 26 , to access the MAP server 12 .
- the business logic layer 44 includes a profile manager 54 , a location manager 56 , a history manager 58 , a crowd analyzer 60 , and an aggregation engine 62 , each of which is preferably implemented in software.
- the business logic layer 44 also includes the profile augmentation function 40 . Note, however, that in the embodiment of FIG. 1B , the business logic layer 44 does not include the profile augmentation function 40 .
- the profile manager 54 generally operates to obtain the user profiles of the users 20 - 1 through 20 -N directly or indirectly from the one or more profile servers 14 and store the user profiles in the persistence layer 46 .
- the location manager 56 operates to obtain the current locations of the users 20 - 1 through 20 -N including location updates. As discussed below, the current locations of the users 20 - 1 through 20 -N may be obtained directly from the mobile devices 18 - 1 through 18 -N and/or obtained from the location server 16 .
- the history manager 58 generally operates to maintain a historical record of anonymized user profile data by location.
- the crowd analyzer 60 operates to form crowds of users.
- the crowd analyzer 60 utilizes a spatial crowd formation algorithm.
- the crowd analyzer 60 may further characterize crowds to reflect degree of fragmentation, best-case and worst-case degree of separation (DOS), and/or degree of bi-directionality of relationships.
- the crowd analyzer 60 may also operate to track crowds.
- the aggregation engine 62 generally operates to provide aggregate profile data in response to requests from the mobile devices 18 - 1 through 18 -N, the subscriber device 22 , the profile server 14 , and/or the third-party server 26 .
- the aggregate profile data may be historical aggregate profile data for one or more geographic locations (e.g., one or more POIs) or one or more geographic areas (e.g., one or more AOIs) or aggregate profile data for crowd(s) currently at one or more geographic locations or in one or more geographic areas.
- the persistence layer 46 includes an object mapping layer 64 and a datastore 66 .
- the object mapping layer 64 is preferably implemented in software.
- the datastore 66 is preferably a relational database, which is implemented in a combination of hardware (i.e., physical data storage hardware) and software (i.e., relational database software).
- the business logic layer 44 is implemented in an object-oriented programming language such as, for example, Java.
- the object mapping layer 64 operates to map objects used in the business logic layer 44 to relational database entities stored in the datastore 66 .
- data is stored in the datastore 66 in a Resource Description Framework (RDF) compatible format.
- RDF Resource Description Framework
- the datastore 66 may be implemented as an RDF datastore. More specifically, the RDF datastore may be compatible with RDF technology adopted by Semantic Web activities. Namely, the RDF datastore may use the Friend-Of-A-Friend (FOAF) vocabulary for describing people, their social networks, and their interests.
- the MAP server 12 may be designed to accept raw FOAF files describing persons, their friends, and their interests. These FOAF files are currently output by some social networking services such as Livejournal and Facebook. The MAP server 12 may then persist RDF descriptions of the users 20 - 1 through 20 -N as a proprietary extension of the FOAF vocabulary that includes additional properties desired for the system 10 .
- FIG. 3 illustrates the MAP client 30 - 1 of FIGS. 1A and 1B in more detail according to one embodiment of the present disclosure. This discussion is equally applicable to the other MAP clients 30 - 2 through 30 -N.
- the MAP client 30 - 1 includes a MAP access API 68 , a MAP middleware component 70 , and a mobile client/server protocol component 72 .
- the MAP access API 68 is implemented in software and provides an interface by which the MAP client 30 - 1 and the third-party applications 34 - 1 are enabled to access the MAP server 12 .
- the MAP middleware component 70 is implemented in software and performs the operations needed for the MAP client 30 - 1 to operate as an interface between the MAP application 32 - 1 and the third-party applications 34 - 1 at the mobile device 18 - 1 and the MAP server 12 .
- the mobile client/server protocol component 72 enables communication between the MAP client 30 - 1 and the MAP server 12 via a defined protocol.
- FIG. 4 illustrates the operation of the system 10 of FIGS. 1A and 1B to provide the user profile of the user 20 - 1 of the mobile device 18 - 1 to the MAP server 12 according to one embodiment of the present disclosure.
- This discussion is equally applicable to user profiles of the other users 20 - 2 through 20 -N of the other mobile devices 18 - 2 through 18 -N.
- an authentication process is performed (step 1000 ).
- the mobile device 18 - 1 authenticates with the profile server 14 (step 1000 A) and the MAP server 12 (step 1000 B).
- the MAP server 12 authenticates with the profile server 14 (step 1000 C).
- authentication is performed using OpenID or similar technology.
- authentication may alternatively be performed using separate credentials (e.g., username and password) of the user 20 - 1 for access to the MAP server 12 and the profile server 14 .
- the profile server 14 returns an authentication succeeded message to the MAP server 12 (step 1000 D), and the profile server 14 returns an authentication succeeded message to the MAP client 30 - 1 of the mobile device 18 - 1 (step 1000 E).
- a user profile process is performed such that a user profile of the user 20 - 1 is obtained from the profile server 14 and delivered to the MAP server 12 (step 1002 ).
- the MAP client 30 - 1 of the mobile device 18 - 1 sends a profile request to the profile server 14 (step 1002 A).
- the profile server 14 returns the user profile of the user 20 - 1 to the mobile device 18 - 1 (step 1002 B).
- the MAP client 30 - 1 of the mobile device 18 - 1 then sends the user profile of the user 20 - 1 to the MAP server 12 (step 1002 C).
- the MAP client 30 - 1 may filter the user profile of the user 20 - 1 according to criteria specified by the user 20 - 1 .
- the user profile of the user 20 - 1 may include demographic information, general interests, music interests, and movie interests, and the user 20 - 1 may specify that the demographic information or some subset thereof is to be filtered, or removed, before sending the user profile to the MAP server 12 .
- the profile manager 54 of the MAP server 12 Upon receiving the user profile of the user 20 - 1 from the MAP client 30 - 1 of the mobile device 18 - 1 , the profile manager 54 of the MAP server 12 processes the user profile (step 1002 D). More specifically, in the preferred embodiment, the profile manager 54 includes social network handlers for the social network services supported by the MAP server 12 . Thus, for example, if the MAP server 12 supports user profiles from Facebook®, MySpace®, and LinkedIN®, the profile manager 54 may include a Facebook handler, a MySpace handler, and a LinkedIN handler. The social network handlers process user profiles to generate user profiles for the MAP server 12 that include lists of keywords for each of a number of profile categories.
- the profile categories may be the same for each of the social network handlers or different for each of the social network handlers.
- the user profile of the user 20 - 1 is from Facebook.
- the profile manager 54 uses a Facebook handler to process the user profile of the user 20 - 1 to map the user profile of the user 20 - 1 from Facebook to a user profile for the MAP server 12 including lists of keywords for a number of predefined profile categories.
- the profile categories may be a demographic profile category, a social interaction profile category, a general interests profile category, a music interests profile category, and a movie interests profile category.
- the user profile of the user 20 - 1 from Facebook may be processed by the Facebook handler of the profile manager 54 to create a list of keywords such as, for example, liberal, High School graduate, 35-44, College graduate, etc. for the demographic profile category, a list of keywords such as Seeking Friendship for the social interaction profile category, a list of keywords such as politics, technology, photography, books, etc. for the general interests profile category, a list of keywords including music genres, artist names, album names, or the like for the music interests profile category, and a list of keywords including movie titles, actor or actress names, director names, movie genres, or the like for the movie interests profile category.
- the profile manager 54 may use natural language processing or semantic analysis. For example, if the Facebook user profile of the user 20 - 1 states that the user 20 - 1 is 20 years old, semantic analysis may result in the keyword of 18-24 years old being stored in the user profile of the user 20 - 1 for the MAP server 12 .
- the profile manager 54 of the MAP server 12 After processing the user profile of the user 20 - 1 , the profile manager 54 of the MAP server 12 stores the resulting user profile for the user 20 - 1 (step 1002 E). More specifically, in one embodiment, the MAP server 12 stores user records for the users 20 - 1 through 20 -N in the datastore 66 ( FIG. 2 ). The user profile of the user 20 - 1 is stored in the user record of the user 20 - 1 .
- the user record of the user 20 - 1 includes a unique identifier of the user 20 - 1 , the user profile of the user 20 - 1 , and, as discussed below, a current location of the user 20 - 1 . Note that the user profile of the user 20 - 1 may be updated as desired. For example, in one embodiment, the user profile of the user 20 - 1 is updated by repeating step 1002 each time the user 20 - 1 activates the MAP application 32 - 1 .
- the user profiles of the users 20 - 1 through 20 -N may be obtained in any desired manner.
- the user 20 - 1 may identify one or more favorite websites.
- the profile manager 54 of the MAP server 12 may then crawl the one or more favorite websites of the user 20 - 1 to obtain keywords appearing in the one or more favorite websites of the user 20 - 1 . These keywords may then be stored as the user profile of the user 20 - 1 .
- a process is performed such that a current location of the mobile device 18 - 1 and thus a current location of the user 20 - 1 is obtained by the MAP server 12 (step 1004 ).
- the MAP application 32 - 1 of the mobile device 18 - 1 obtains the current location of the mobile device 18 - 1 from the location function 36 - 1 of the mobile device 18 - 1 .
- the MAP application 32 - 1 then provides the current location of the mobile device 18 - 1 to the MAP client 30 - 1
- the MAP client 30 - 1 then provides the current location of the mobile device 18 - 1 to the MAP server 12 (step 1004 A).
- step 1004 A may be repeated periodically or in response to a change in the current location of the mobile device 18 - 1 in order for the MAP application 32 - 1 to provide location updates for the user 20 - 1 to the MAP server 12 .
- the location manager 56 of the MAP server 12 stores the current location of the mobile device 18 - 1 as the current location of the user 20 - 1 (step 1004 B). More specifically, in one embodiment, the current location of the user 20 - 1 is stored in the user record of the user 20 - 1 maintained in the datastore 66 of the MAP server 12 . Note that in the preferred embodiment only the current location of the user 20 - 1 is stored in the user record of the user 20 - 1 . In this manner, the MAP server 12 maintains privacy for the user 20 - 1 since the MAP server 12 does not maintain a historical record of the location of the user 20 - 1 . As discussed below in detail, historical data maintained by the MAP server 12 is anonymized in order to maintain the privacy of the users 20 - 1 through 20 -N.
- the location manager 56 sends the current location of the user 20 - 1 to the location server 16 (step 1004 C).
- the MAP server 12 in return receives location updates for the user 20 - 1 from the location server 16 .
- the MAP application 32 - 1 will not be able to provide location updates for the user 20 - 1 to the MAP server 12 unless the MAP application 32 - 1 is active.
- step 1006 the location server 16 receives a location update for the user 20 - 1 directly or indirectly from another application running on the mobile device 18 - 1 or an application running on another device of the user 20 - 1 (step 1006 A).
- the location server 16 then provides the location update for the user 20 - 1 to the MAP server 12 (step 1006 B).
- the location manager 56 updates and stores the current location of the user 20 - 1 in the user record of the user 20 - 1 (step 1006 C).
- the MAP server 12 is enabled to obtain location updates for the user 20 - 1 even when the MAP application 32 - 1 is not active at the mobile device 18 - 1 .
- FIG. 5 illustrates the operation of the system 10 of FIGS. 1A and 1B to provide the user profile of the user 20 - 1 of the mobile device 18 - 1 according to another embodiment of the present disclosure.
- This discussion is equally applicable to user profiles of the other users 20 - 2 through 20 -N of the other mobile devices 18 - 2 through 18 -N.
- an authentication process is performed (step 1100 ).
- the mobile device 18 - 1 authenticates with the MAP server 12 (step 1100 A), and the MAP server 12 authenticates with the profile server 14 (step 1100 B).
- authentication is performed using OpenID or similar technology.
- authentication may alternatively be performed using separate credentials (e.g., username and password) of the user 20 - 1 for access to the MAP server 12 and the profile server 14 .
- the profile server 14 returns an authentication succeeded message to the MAP server 12 (step 1100 C)
- the MAP server 12 returns an authentication succeeded message to the MAP client 30 - 1 of the mobile device 18 - 1 (step 1100 D).
- a user profile process is performed such that a user profile of the user 20 - 1 is obtained from the profile server 14 and delivered to the MAP server 12 (step 1102 ).
- the profile manager 54 of the MAP server 12 sends a profile request to the profile server 14 (step 1102 A).
- the profile server 14 returns the user profile of the user 20 - 1 to the profile manager 54 of the MAP server 12 (step 1102 B).
- the profile server 14 may return a filtered version of the user profile of the user 20 - 1 to the MAP server 12 .
- the profile server 14 may filter the user profile of the user 20 - 1 according to criteria specified by the user 20 - 1 .
- the user profile of the user 20 - 1 may include demographic information, general interests, music interests, and movie interests, and the user 20 - 1 may specify that the demographic information or some subset thereof is to be filtered, or removed, before sending the user profile to the MAP server 12 .
- the profile manager 54 of the MAP server 12 Upon receiving the user profile of the user 20 - 1 , the profile manager 54 of the MAP server 12 processes the user profile (step 1102 C). More specifically, as discussed above, in the preferred embodiment, the profile manager 54 includes social network handlers for the social network services supported by the MAP server 12 .
- the social network handlers process user profiles to generate user profiles for the MAP server 12 that include lists of keywords for each of a number of profile categories.
- the profile categories may be the same for each of the social network handlers or different for each of the social network handlers.
- the profile manager 54 of the MAP server 12 After processing the user profile of the user 20 - 1 , the profile manager 54 of the MAP server 12 stores the resulting user profile for the user 20 - 1 (step 1102 D). More specifically, in one embodiment, the MAP server 12 stores user records for the users 20 - 1 through 20 -N in the datastore 66 ( FIG. 2 ). The user profile of the user 20 - 1 is stored in the user record of the user 20 - 1 .
- the user record of the user 20 - 1 includes a unique identifier of the user 20 - 1 , the user profile of the user 20 - 1 , and, as discussed below, a current location of the user 20 - 1 . Note that the user profile of the user 20 - 1 may be updated as desired. For example, in one embodiment, the user profile of the user 20 - 1 is updated by repeating step 1102 each time the user 20 - 1 activates the MAP application 32 - 1 .
- the user profiles of the users 20 - 1 through 20 -N may be obtained in any desired manner.
- the user 20 - 1 may identify one or more favorite websites.
- the profile manager 54 of the MAP server 12 may then crawl the one or more favorite websites of the user 20 - 1 to obtain keywords appearing in the one or more favorite websites of the user 20 - 1 . These keywords may then be stored as the user profile of the user 20 - 1 .
- a process is performed such that a current location of the mobile device 18 - 1 and thus a current location of the user 20 - 1 is obtained by the MAP server 12 (step 1104 ).
- the MAP application 32 - 1 of the mobile device 18 - 1 obtains the current location of the mobile device 18 - 1 from the location function 36 - 1 of the mobile device 18 - 1 .
- the MAP application 32 - 1 then provides the current location of the user 20 - 1 of the mobile device 18 - 1 to the location server 16 (step 1104 A).
- step 1104 A may be repeated periodically or in response to changes in the location of the mobile device 18 - 1 in order to provide location updates for the user 20 - 1 to the MAP server 12 .
- the location server 16 then provides the current location of the user 20 - 1 to the MAP server 12 (step 1104 B).
- the location server 16 may provide the current location of the user 20 - 1 to the MAP server 12 automatically in response to receiving the current location of the user 20 - 1 from the mobile device 18 - 1 or in response to a request from the MAP server 12 .
- the location manager 56 of the MAP server 12 stores the current location of the mobile device 18 - 1 as the current location of the user 20 - 1 (step 1104 C). More specifically, in one embodiment, the current location of the user 20 - 1 is stored in the user record of the user 20 - 1 maintained in the datastore 66 of the MAP server 12 . Note that in the preferred embodiment only the current location of the user 20 - 1 is stored in the user record of the user 20 - 1 . In this manner, the MAP server 12 maintains privacy for the user 20 - 1 since the MAP server 12 does not maintain a historical record of the location of the user 20 - 1 . As discussed below in detail, historical data maintained by the MAP server 12 is anonymized in order to maintain the privacy of the users 20 - 1 through 20 -N.
- the use of the location server 16 is particularly beneficial when the mobile device 18 - 1 does not permit background processes, which is the case for the Apple® iPhone.
- the MAP application 32 - 1 will not provide location updates for the user 20 - 1 to the location server 16 unless the MAP application 32 - 1 is active.
- other applications running on the mobile device 18 - 1 may provide location updates to the location server 16 for the user 20 - 1 when the MAP application 32 - 1 is not active.
- step 1106 the location server 16 receives a location update for the user 20 - 1 from another application running on the mobile device 18 - 1 or an application running on another device of the user 20 - 1 (step 1106 A).
- the location server 16 then provides the location update for the user 20 - 1 to the MAP server 12 (step 1106 B).
- the location manager 56 updates and stores the current location of the user 20 - 1 in the user record of the user 20 - 1 (step 1106 C).
- the MAP server 12 is enabled to obtain location updates for the user 20 - 1 even when the MAP application 32 - 1 is not active at the mobile device 18 - 1 .
- the MAP server 12 can provide a number of features.
- a first feature that may be provided by the MAP server 12 is historical storage of anonymized user profile data by location. This historical storage of anonymized user profile data by location is performed by the history manager 58 of the MAP server 12 . More specifically, as illustrated in FIG. 6 , in the preferred embodiment, the history manager 58 maintains lists of users located in a number of geographic regions, or “location buckets.” Preferably, the location buckets are defined by floor(latitude, longitude) to a desired resolution. The higher the resolution, the smaller the size of the location buckets.
- the location buckets are defined by floor(latitude, longitude) to a resolution of 1/10,000 th of a degree such that the lower left-hand corners of the squares illustrated in FIG. 6 are defined by the floor(latitude, longitude) values at a resolution of 1/10,000 th of a degree.
- users are represented as dots, and location buckets 74 through 90 have lists of 1, 3, 2, 1, 1, 2, 1, 2, and 3 users, respectively.
- the history manager 58 makes a copy of the lists of users in the location buckets, anonymizes the user profiles of the users in the lists to provide anonymized user profile data for the corresponding location buckets, and stores the anonymized user profile data in a number of history objects.
- a history object is stored for each location bucket having at least one user.
- a quadtree algorithm is used to efficiently create history objects for geographic regions (i.e., groups of one or more adjoining location buckets).
- FIG. 7 graphically illustrates a scenario where a user moves from one location bucket to another, namely, from the location bucket 76 to the location bucket 78 .
- the user is included on both the list for the location bucket 76 and the list for the location bucket 78 .
- the user is flagged or otherwise marked as inactive for the location bucket 76 and active for the location bucket 78 .
- users flagged as inactive are removed from the lists of users for the location buckets.
- the user remains in the list for the location bucket 76 until the predetermined time interval has expired and the anonymized user profile data is persisted. The user is then removed from the list for the location bucket 76 .
- FIG. 8 is a flow chart illustrating the operation of a foreground “bucketization” process performed by the history manager 58 to maintain the lists of users for location buckets according to one embodiment of the present disclosure.
- the history manager 58 receives a location update for a user (step 1200 ). For this discussion, assume that the location update is received for the user 20 - 1 .
- the history manager 58 determines a location bucket corresponding to the updated location (i.e., the current location) of the user 20 - 1 (step 1202 ).
- the location of the user 20 - 1 is expressed as latitude and longitude coordinates
- the history manager 58 determines the location bucket by determining floor values of the latitude and longitude coordinates, which can be written as floor(latitude, longitude) at a desired resolution.
- the latitude and longitude coordinates for the location of the user 20 - 1 are 32.24267381553987 and ⁇ 111.9249213502935, respectively, and the floor values are to be computed to a resolution of 1/10,000 th of a degree, then the floor values for the latitude and longitude coordinates are 32.2426 and ⁇ 111.9249.
- the floor values for the latitude and longitude coordinates correspond to a particular location bucket.
- the history manager 58 determines whether the user 20 - 1 is new to the location bucket (step 1204 ). In other words, the history manager 58 determines whether the user 20 - 1 is already on the list of users for the location bucket. If the user 20 - 1 is new to the location bucket, the history manager 58 creates an entry for the user 20 - 1 in the list of users for the location bucket (step 1206 ). Returning to step 1204 , if the user 20 - 1 is not new to the location bucket, the history manager 58 updates the entry for the user 20 - 1 in the list of users for the location bucket (step 1208 ). At this point, whether proceeding from step 1206 or 1208 , the user 20 - 1 is flagged as active in the list of users for the location bucket (step 1210 ).
- the history manager 58 determines whether the user 20 - 1 has moved from another location bucket (step 1212 ). More specifically, the history manager 58 determines whether the user 20 - 1 is included in the list of users for another location bucket and is currently flagged as active in that list. If the user 20 - 1 has not moved from another location bucket, the process proceeds to step 1216 . If the user 20 - 1 has moved from another location bucket, the history manager 58 flags the user 20 - 1 as inactive in the list of users for the other location bucket from which the user 20 - 1 has moved (step 1214 ).
- the history manager 58 determines whether it is time to persist (step 1216 ). More specifically, as mentioned above, the history manager 58 operates to persist history objects at a predetermined time interval such as, for example, every 15 minutes. Thus, the history manager 58 determines that it is time to persist if the predetermined time interval has expired. If it is not time to persist, the process returns to step 1200 and is repeated for a next received location update, which will typically be for another user. If it is time to persist, the history manager 58 creates a copy of the lists of users for the location buckets and passes the copy of the lists to an anonymization and storage process (step 1218 ).
- the anonymization and storage process is a separate process performed by the history manager 58 .
- the history manager 58 then removes inactive users from the lists of users for the location buckets (step 1220 ).
- the process then returns to step 1200 and is repeated for a next received location update, which will typically be for another user.
- FIG. 9 is a flow chart illustrating the anonymization and storage process performed by the history manager 58 at the predetermined time interval according to one embodiment of the present disclosure.
- the anonymization and storage process receives the copy of the lists of users for the location buckets passed to the anonymization and storage process by the bucketization process of FIG. 8 (step 1300 ).
- anonymization is performed for each of the location buckets having at least one user in order to provide anonymized user profile data for the location buckets (step 1302 ).
- Anonymization prevents connecting information stored in the history objects stored by the history manager 58 back to the users 20 - 1 through 20 -N or at least substantially increases a difficulty of connecting information stored in the history objects stored by the history manager 58 back to the users 20 - 1 through 20 -N.
- the anonymized user profile data for the location buckets is stored in a number of history objects (step 1304 ).
- a separate history object is stored for each of the location buckets, where the history object of a location bucket includes the anonymized user profile data for the location bucket.
- a quadtree algorithm is used to efficiently store the anonymized user profile data in a number of history objects such that each history object stores the anonymized user profile data for one or more location buckets.
- FIG. 10 graphically illustrates one embodiment of the anonymization process of step 1302 of FIG. 9 .
- anonymization is performed by creating anonymous user records for the users in the lists of users for the location buckets.
- the anonymous user records are not connected back to the users 20 - 1 through 20 -N.
- each user in the lists of users for the location buckets has a corresponding user record 92 .
- the user record 92 includes a unique user identifier (ID) for the user, the current location of the user, and the user profile of the user.
- the user profile includes keywords for each of a number of profile categories, which are stored in corresponding profile category records 94 - 1 through 94 -M.
- Each of the profile category records 94 - 1 through 94 -M includes a user ID for the corresponding user which may be the same user ID used in the user record 92 , a category ID, and a list of keywords for the profile category.
- an anonymous user record 96 is created from the user record 92 .
- the user ID is replaced with a new user ID that is not connected back to the user, which is also referred to herein as an anonymous user ID.
- This new user ID is different than any other user ID used for anonymous user records created from the user record of the user for any previous or subsequent time periods. In this manner, anonymous user records for a single user created over time cannot be linked to one another.
- anonymous profile category records 98 - 1 through 98 -M are created for the profile category records 94 - 1 through 94 -M.
- the user ID is replaced with a new user ID, which may be the same new user ID included in the anonymous user record 96 .
- the anonymous profile category records 98 - 1 through 98 -M include the same category IDs and lists of keywords as the corresponding profile category records 94 - 1 through 94 -M. Note that the location of the user is not stored in the anonymous user record 96 . With respect to location, it is sufficient that the anonymous user record 96 is linked to a location bucket.
- the history manager 58 performs anonymization in a manner similar to that described above with respect to FIG. 10 .
- the profile category records for the group of users in a location bucket, or the group of users in a number of location buckets representing a node in a quadtree data structure may be selectively randomized among the anonymous user records of those users.
- each anonymous user record would have a user profile including a selectively randomized set of profile category records (including keywords) from a cumulative list of profile category records for all of the users in the group.
- the history manager 58 may perform anonymization by storing an aggregate user profile for each location bucket, or each group of location buckets representing a node in a quadtree data structure (see below).
- the aggregate user profile may include a list of all keywords and potentially the number of occurrences of each keyword in the user profiles of the corresponding group of users. In this manner, the data stored by the history manager 58 is not connected back to the users 20 - 1 through 20 -N.
- FIG. 11 is a flow chart illustrating the storing step (step 1304 ) of FIG. 9 in more detail according to one embodiment of the present disclosure.
- the history manager 58 processes the location buckets using a quadtree algorithm to produce a quadtree data structure, where each node of the quadtree data structure includes one or more of the location buckets having a combined number of users that is at most a predefined maximum number of users (step 1400 ).
- the history manager 58 then stores a history object for each node in the quadtree data structure having at least one user (step 1402 ).
- Each history object includes location information, timing information, data, and quadtree data structure information.
- the location information included in the history object defines a combined geographic area of the location bucket(s) forming the corresponding node of the quadtree data structure.
- the location information may be latitude and longitude coordinates for a northeast corner of the combined geographic area of the node of the quadtree data structure and a southwest corner of the combined geographic area for the node of the quadtree data structure.
- the timing information includes information defining a time window for the history object, which may be, for example, a start time for the corresponding time interval and an end time for the corresponding time interval.
- the data includes the anonymized user profile data for the users in the list(s) maintained for the location bucket(s) forming the node of the quadtree data structure for which the history object is stored.
- the data may include a total number of users in the location bucket(s) forming the node of the quadtree data structure.
- the quadtree data structure information includes information defining a quadtree depth of the node in the quadtree data structure.
- FIG. 12 is a flow chart illustrating a quadtree algorithm that may be used to process the location buckets to form the quadtree data structure in step 1400 of FIG. 11 according to one embodiment of the present disclosure.
- a geographic area served by the MAP server 12 is divided into a number of geographic regions, each including multiple location buckets. These geographic regions are also referred to herein as base quadtree regions.
- the geographic area served by the MAP server 12 may be, for example, a city, a state, a country, or the like. Further, the geographic area may be the only geographic area served by the MAP server 12 or one of a number of geographic areas served by the MAP server 12 .
- the base quadtree regions have a size of 2 n ⁇ 2 n location buckets, where n is an integer greater than or equal to 1.
- the history manager 58 determines whether there are any more base quadtree regions to process (step 1500 ). If there are more base quadtree regions to process, the history manager 58 sets a current node to the next base quadtree region to process, which for the first iteration is the first base quadtree region (step 1502 ). The history manager 58 then determines whether the number of users in the current node is greater than a predefined maximum number of users and whether a current quadtree depth is less than a maximum quadtree depth (step 1504 ). In one embodiment, the maximum quadtree depth may be reached when the current node corresponds to a single location bucket. However, the maximum quadtree depth may be set such that the maximum quadtree depth is reached before the current node reaches a single location bucket.
- the history manager 58 creates a number of child nodes for the current node (step 1506 ). More specifically, the history manager 58 creates a child node for each quadrant of the current node. The users in the current node are then assigned to the appropriate child nodes based on the location buckets in which the users are located (step 1508 ), and the current node is then set to the first child node (step 1510 ). At this point, the process returns to step 1504 and is repeated.
- the history manager 58 determines whether the current node has any more sibling nodes (step 1512 ). Sibling nodes are child nodes of the same parent node. If so, the history manager 58 sets the current node to the next sibling node of the current node (step 1514 ), and the process returns to step 1504 and is repeated. Once there are no more sibling nodes to process, the history manager 58 determines whether the current node has a parent node (step 1516 ).
- the history manager 58 determines whether the parent node has any sibling nodes that need to be processed (step 1518 ). If the parent node has any sibling nodes that need to be processed, the history manager 58 sets the next sibling node of the parent node to be processed as the current node (step 1520 ). From this point, the process returns to step 1504 and is repeated. Returning to step 1516 , if the current node does not have a parent node, the process returns to step 1500 and is repeated until there are no more base quadtree regions to process. Once there are no more base quadtree regions to process, the finished quadtree data structure is returned to the process of FIG. 11 such that the history manager 58 can then store the history objects for nodes in the quadtree data structure having at least one user (step 1522 ).
- FIGS. 13A through 13E graphically illustrate the process of FIG. 12 for the generation of the quadtree data structure for one exemplary base quadtree region 100 .
- FIG. 13A illustrates the base quadtree region 100 .
- the base quadtree region 100 is an 8 ⁇ 8 square of location buckets, where each of the small squares represents a location bucket.
- the history manager 58 determines whether the number of users in the base quadtree region 100 is greater than the predetermined maximum number of users. In this example, the predetermined maximum number of users is 3. Since the number of users in the base quadtree region 100 is greater than 3, the history manager 58 divides the base quadtree region 100 into four child nodes 102 - 1 through 102 - 4 , as illustrated in FIG. 13B .
- the history manager 58 determines whether the number of users in the child node 102 - 1 is greater than the predetermined maximum, which again for this example is 3. Since the number of users in the child node 102 - 1 is greater than 3, the history manager 58 divides the child node 102 - 1 into four child nodes 104 - 1 through 104 - 4 , as illustrated in FIG. 13C . The child nodes 104 - 1 through 104 - 4 are children of the child node 102 - 1 . The history manager 58 then determines whether the number of users in the child node 104 - 1 is greater than the predetermined maximum number of users, which again is 3. Since there are more than 3 users in the child node 104 - 1 , the history manager 58 further divides the child node 104 - 1 into four child nodes 106 - 1 through 106 -N, as illustrated in FIG. 13D .
- the history manager 58 determines whether the number of users in the child node 106 - 1 is greater than the predetermined maximum number of users, which again is 3. Since the number of users in the child node 106 - 1 is not greater than the predetermined maximum number of users, the child node 106 - 1 is identified as a node for the finished quadtree data structure, and the history manager 58 proceeds to process the sibling nodes of the child node 106 - 1 , which are the child nodes 106 - 2 through 106 - 4 .
- the child nodes 106 - 2 through 106 - 4 are also identified as nodes for the finished quadtree data structure.
- the history manager 58 identifies the parent node of the child nodes 106 - 1 through 106 - 4 , which in this case is the child node 104 - 1 .
- the history manager 58 then processes the sibling nodes of the child node 104 - 1 , which are the child nodes 104 - 2 through 104 - 4 .
- the number of users in each of the child nodes 104 - 2 through 104 - 4 is less than the predetermined maximum number of users.
- the child nodes 104 - 2 through 104 - 4 are identified as nodes for the finished quadtree data structure.
- the history manager 58 identifies the parent node of the child nodes 104 - 1 through 104 - 4 , which in this case is the child node 102 - 1 .
- the history manager 58 then processes the sibling nodes of the child node 102 - 1 , which are the child nodes 102 - 2 through 102 - 4 . More specifically, the history manager 58 determines that the child node 102 - 2 includes more than the predetermined maximum number of users and, as such, divides the child node 102 - 2 into four child nodes 108 - 1 through 108 - 4 , as illustrated in FIG. 13E .
- the child nodes 108 - 1 through 108 - 4 are identified as nodes for the finished quadtree data structure. Then, the history manager 58 proceeds to process the child nodes 102 - 3 and 102 - 4 . Since the number of users in each of the child nodes 102 - 3 and 102 - 4 is not greater than the predetermined maximum number of users, the child nodes 102 - 3 and 102 - 4 are identified as nodes for the finished quadtree data structure.
- the quadtree data structure for the base quadtree region 100 includes the child nodes 106 - 1 through 106 - 4 , the child nodes 104 - 2 through 104 - 4 , the child nodes 108 - 1 through 108 - 4 , and the child nodes 102 - 3 and 102 - 4 , as illustrated in FIG. 13E .
- the history manager 58 stores a history object for each of the nodes in the quadtree data structure including at least one user.
- the history manager 58 stores history objects for the child nodes 106 - 2 and 106 - 3 , the child nodes 104 - 2 and 104 - 4 , the child nodes 108 - 1 and 108 - 4 , and the child node 102 - 3 .
- no history objects are stored for the nodes that do not have any users (i.e., the child nodes 106 - 1 and 106 - 4 , the child node 104 - 3 , the child nodes 108 - 2 and 108 - 3 , and the child node 102 - 4 ).
- FIG. 14 illustrates the operation of the system 10 of FIGS. 1A and 1B wherein a mobile device is enabled to request and receive historical data from the MAP server 12 according to one embodiment of the present disclosure.
- the MAP server 12 may operate in a similar manner to process requests for historical data from other devices such as the subscriber device 22 , the third-party server 26 , and/or the profile server 14 .
- the MAP application 32 - 1 of the mobile device 18 - 1 sends a historical request to the MAP client 30 - 1 of the mobile device 18 - 1 (step 1600 ).
- the historical request identifies either a POI or an AOI and a time window.
- a POI is a geographic point whereas an AOI is a geographic area.
- the historical request is for a POI and a time window, where the POI is a POI corresponding to the current location of the user 20 - 1 , a POI selected from a list of POIs defined by the user 20 - 1 of the mobile device 18 - 1 , a POI selected from a list of POIs defined by the MAP application 32 - 1 or the MAP server 12 , a POI selected by the user 20 - 1 from a map, a POI implicitly defined via a separate application (e.g., POI is implicitly defined as the location of the nearest Starbucks coffee house in response to the user 20 - 1 performing a Google search for “Starbucks”), or the like.
- a separate application e.g., POI is implicitly defined as the location of the nearest Starbucks coffee house in response to the user 20 - 1 performing a Google search for “Starbucks”
- the list of POIs may include static POIs which may be defined by street addresses or latitude and longitude coordinates, dynamic POIs which may be defined as the current locations of one or more friends of the user 20 - 1 , or both.
- the historical request is for an AOI and a time window
- the AOI may be an AOI of a geographic area of a predefined shape and size centered at the current location of the user 20 - 1 , an AOI selected from a list of AOIs defined by the user 20 - 1 , an AOI selected from a list of AOIs defined by the MAP application 32 - 1 or the MAP server 12 , an AOI selected by the user 20 - 1 from a map, an AOI implicitly defined via a separate application (e.g., AOI is implicitly defined as an area of a predefined shape and size centered at the location of the nearest Starbucks coffee house in response to the user 20 - 1 performing a Google search for “Starbucks”), or the like.
- the list of AOIs may include static AOIs, dynamic AOIs which may be defined as areas of a predefined shape and size centered at the current locations of one or more friends of the user 20 - 1 , or both.
- the POI or AOI of the historical request may be selected by the user 20 - 1 via the MAP application 32 - 1 .
- the MAP application 32 - 1 automatically uses the current location of the user 20 - 1 as the POI or as a center point for an AOI of a predefined shape and size.
- the time window for the historical request may be relative to the current time.
- the time window may be the last hour, the last day, the last week, the last month, or the like.
- the time window may be an arbitrary time window selected by the user 20 - 1 such as, for example, yesterday from 7 pm-9 pm, last Friday, last week, or the like.
- the historical request includes a single POI or AOI and a single time window, the historical request may include multiple POIs or AOIs and/or multiple time windows.
- the historical request is made in response to user input from the user 20 - 1 of the mobile device 18 - 1 .
- the user 20 - 1 selects either a POI or an AOI and a time window and then instructs the MAP application 32 - 1 to make the historical request by, for example, selecting a corresponding button on a graphical user interface.
- the historical request is made automatically in response to some event such as, for example, opening the MAP application 32 - 1 .
- the MAP client 30 - 1 Upon receiving the historical request from the MAP application 32 - 1 , the MAP client 30 - 1 forwards the historical request to the MAP server 12 (step 1602 ). Note that the MAP client 30 - 1 may, in some cases, process the historical request from the MAP application 32 - 1 before forwarding the historical request to the MAP server 12 . For example, if the historical request from the MAP application 32 - 1 is for multiple POIs/AOIs and/or for multiple time windows, the MAP client 30 - 1 may process the historical request from the MAP application 32 - 1 to produce multiple historical requests to be sent to the MAP server 12 . For instance, a separate historical request may be produced for each POI/AOI and time window combination. However, for this discussion, the historical request is for a single POI or AOI for a single time window.
- the MAP server 12 Upon receiving the historical request from the MAP client 30 - 1 , the MAP server 12 processes the historical request (step 1604 ). More specifically, the historical request is processed by the history manager 58 of the MAP server 12 . First, the history manager 58 obtains history objects that are relevant to the historical request from the datastore 66 of the MAP server 12 . The relevant history objects are those recorded for locations relevant to the POI or AOI and the time window for the historical request. The history manager 58 then processes the relevant history objects to provide historical aggregate profile data for the POI or AOI. In this embodiment, the historical aggregate profile data is based on the user profiles of the anonymous user records in the relevant history objects as compared to the user profile of the user 20 - 1 or a select subset thereof.
- the historical aggregate profile data is based on the user profiles of the anonymous user records in the relevant history objects as compared to a target user profile defined or otherwise specified by the user 20 - 1 or as compared to one another.
- FIG. 15 begins a discussion of the operation of the crowd analyzer 60 to form crowds of users according to one embodiment of the present disclosure.
- FIG. 15 is a flow chart for a spatial crowd formation process according to one embodiment of the present disclosure. Note that, in one embodiment, this process is performed in response to a request for crowd data for a POI or an AOI. In another embodiment, this process may be performed proactively by the crowd analyzer 60 as, for example, a background process.
- the crowd analyzer 60 establishes a bounding box for the crowd formation process (step 1700 ).
- a bounding box is used in this example, other geographic shapes may be used to define a bounding region for the crowd formation process (e.g., a bounding circle).
- the bounding box is established based on the POI or the AOI of the request. If the request is for a POI, then the bounding box is a geographic area of a predetermined size centered at the POI. If the request is for an AOI, the bounding box is the AOI. Alternatively, if the crowd formation process is performed proactively, the bounding box is a bounding box of a predefined size.
- the crowd analyzer 60 then creates a crowd for each individual user in the bounding box (step 1702 ). More specifically, the crowd analyzer 60 queries the datastore 66 of the MAP server 12 to identify users currently located within the bounding box. Then, a crowd of one user is created for each user currently located within the bounding box. Next, the crowd analyzer 60 determines the two closest crowds in the bounding box (step 1704 ) and determines a distance between the two crowds (step 1706 ). The distance between the two crowds is a distance between crowd centers of the two crowds. Note that the crowd center of a crowd of one is the current location of the user in the crowd. The crowd analyzer 60 then determines whether the distance between the two crowds is less than an optimal inclusion distance (step 1708 ).
- the optimal inclusion distance is a predefined static distance. If the distance between the two crowds is less than the optimal inclusion distance, the crowd analyzer 60 combines the two crowds (step 1710 ) and computes a new crowd center for the resulting crowd (step 1712 ). The crowd center may be computed based on the current locations of the users in the crowd using a center of mass algorithm. At this point the process returns to step 1704 and is repeated until the distance between the two closest crowds is not less than the optimal inclusion distance. At that point, the crowd analyzer 60 discards any crowds with less than three users (step 1714 ). Note that throughout this disclosure crowds are only maintained if the crowds include three or more users. However, while three users is the preferred minimum number of users in a crowd, the present disclosure is not limited thereto. The minimum number of users in a crowd may be defined as any number greater than or equal to two users.
- FIGS. 16A through 16D graphically illustrate the crowd formation process of FIG. 15 for an exemplary bounding box 110 .
- crowds are noted by dashed circles, and the crowd centers are noted by cross-hairs (+).
- the crowd analyzer 60 creates crowds 112 through 120 for the users in the geographic area, where, at this point, each of the crowds 112 through 120 includes one user.
- the current locations of the users are the crowd centers of the crowds 112 through 120 .
- the crowd analyzer 60 determines the two closest crowds and a distance between the two closest crowds.
- the two closest crowds are crowds 114 and 116 , and the distance between the two closest crowds 114 and 116 is less than the optimal inclusion distance.
- the two closest crowds 114 and 116 are combined by merging crowd 116 into crowd 114 , and a new crowd center (+) is computed for the crowd 114 , as illustrated in FIG. 16B .
- the crowd analyzer 60 again determines the two closest crowds, which are now crowds 112 and 114 .
- the crowd analyzer 60 determines a distance between the crowds 112 and 114 .
- the crowd analyzer 60 combines the two crowds 112 and 114 by merging the crowd 112 into the crowd 114 , and a new crowd center (+) is computed for the crowd 114 , as illustrated in FIG. 16C .
- the crowd analyzer 60 discards crowds having less than three users, which in this example are crowds 118 and 120 .
- the crowd 114 has been formed with three users, as illustrated in FIG. 16D .
- FIGS. 17A through 17D illustrate a flow chart for a spatial crowd formation process according to another embodiment of the present disclosure.
- the spatial crowd formation process is triggered in response to receiving a location update for one of the users 20 - 1 through 20 -N and is preferably repeated for each location update received for the users 20 - 1 through 20 -N.
- the crowd analyzer 60 receives a location update, or a new location, for a user (step 1800 ). Assume that, for this example, the location update is received for the user 20 - 1 .
- the crowd analyzer 60 retrieves an old location of the user 20 - 1 , if any (step 1802 ).
- the old location is the current location of the user 20 - 1 prior to receiving the new location.
- the crowd analyzer 60 then creates a new bounding box of a predetermined size centered at the new location of the user 20 - 1 (step 1804 ) and an old bounding box of a predetermined size centered at the old location of the user 20 - 1 , if any (step 1806 ).
- the predetermined size of the new and old bounding boxes may be any desired size. As one example, the predetermined size of the new and old bounding boxes is 40 meters by 40 meters. Note that if the user 20 - 1 does not have an old location (i.e., the location received in step 1800 is the first location received for the user 20 - 1 ), then the old bounding box is essentially null. Also note that while bounding “boxes” are used in this example, the bounding areas may be of any desired shape.
- the crowd analyzer 60 determines whether the new and old bounding boxes overlap (step 1808 ). If so, the crowd analyzer 60 creates a bounding box encompassing the new and old bounding boxes (step 1810 ). For example, if the new and old bounding boxes are 40 ⁇ 40 meter regions and a 1 ⁇ 1 meter square at the northeast corner of the new bounding box overlaps a 1 ⁇ 1 meter square at the southwest corner of the old bounding box, the crowd analyzer 60 may create a 79 ⁇ 79 meter square bounding box encompassing both the new and old bounding boxes.
- the crowd analyzer 60 determines the individual users and crowds relevant to the bounding box created in step 1810 (step 1812 ).
- the crowds relevant to the bounding box are crowds that are within or overlap the bounding box (e.g., have at least one user located within the bounding box).
- the individual users relevant to the bounding box are users that are currently located within the bounding box and not already part of a crowd.
- the crowd analyzer 60 computes an optimal inclusion distance for individual users based on user density within the bounding box (step 1814 ). More specifically, in one embodiment, the optimal inclusion distance for individuals, which is also referred to herein as an initial optimal inclusion distance, is set according to the following equation:
- initial_optimal ⁇ _inclusion ⁇ _dist a ⁇ A BoundingBox number_of ⁇ _users ,
- a BoundingBox is an area of the bounding box
- number_of_users is the total number of users in the bounding box.
- the total number of users in the bounding box includes both individual users that are not already in a crowd and users that are already in a crowd. In one embodiment, a is 2 ⁇ 3.
- the crowd analyzer 60 then creates a crowd for each individual user within the bounding box that is not already included in a crowd and sets the optimal inclusion distance for the crowds to the initial optimal inclusion distance (step 1816 ).
- the process proceeds to FIG. 17B where the crowd analyzer 60 analyzes the crowds relevant to the bounding box to determine whether any of the crowd members (i.e., users in the crowds) violate the optimal inclusion distance of their crowds (step 1818 ). Any crowd member that violates the optimal inclusion distance of his or her crowd is then removed from that crowd (step 1820 ).
- the crowd analyzer 60 then creates a crowd of one user for each of the users removed from their crowds in step 1820 and sets the optimal inclusion distance for the newly created crowds to the initial optimal inclusion distance (step 1822 ).
- the crowd analyzer 60 determines the two closest crowds for the bounding box (step 1824 ) and a distance between the two closest crowds (step 1826 ).
- the distance between the two closest crowds is the distance between the crowd centers of the two closest crowds.
- the crowd analyzer 60 determines whether the distance between the two closest crowds is less than the optimal inclusion distance of a larger of the two closest crowds (step 1828 ). If the two closest crowds are of the same size (i.e., have the same number of users), then the optimal inclusion distance of either of the two closest crowds may be used.
- the optimal inclusion distances of both of the two closest crowds may be used such that the crowd analyzer 60 determines whether the distance between the two closest crowds is less than the optimal inclusion distances of both of the two closest crowds.
- the crowd analyzer 60 may compare the distance between the two closest crowds to an average of the optimal inclusion distances of the two closest crowds.
- the process proceeds to step 1838 . If the distance between the two closest crowds is less than the optimal inclusion distance, the two closest crowds are combined or merged (step 1830 ), and a new crowd center for the resulting crowd is computed (step 1832 ). Again, a center of mass algorithm may be used to compute the crowd center of a crowd. In addition, a new optimal inclusion distance for the resulting crowd is computed (step 1834 ). In one embodiment, the new optimal inclusion distance for the resulting crowd is computed as:
- the new optimal inclusion distance is computed as the average of the initial optimal inclusion distance and the distances between the users in the crowd and the crowd center plus one standard deviation.
- the crowd analyzer 60 determines whether a maximum number of iterations have been performed (step 1836 ).
- the maximum number of iterations is a predefined number that ensures that the crowd formation process does not indefinitely loop over steps 1818 through 1834 or loop over steps 1818 through 1834 more than a desired maximum number of times. If the maximum number of iterations has not been reached, the process returns to step 1818 and is repeated until either the distance between the two closest crowds is not less than the optimal inclusion distance of the larger crowd or the maximum number of iterations has been reached. At that point, the crowd analyzer 60 discards crowds with less than three users, or members (step 1838 ) and the process ends.
- the process proceeds to FIG. 17C and the bounding box to be processed is set to the old bounding box (step 1840 ).
- the crowd analyzer 60 then processes the old bounding box in much the same manner as described above with respect to steps 1812 through 1838 . More specifically, the crowd analyzer 60 determines the individual users and crowds relevant to the bounding box (step 1842 ).
- the crowds relevant to the bounding box are crowds that are within or overlap the bounding box (e.g., have at least one user located within the bounding box).
- the individual users relevant to the bounding box are users that are currently located within the bounding box and not already part of a crowd.
- the crowd analyzer 60 computes an optimal inclusion distance for individual users based on user density within the bounding box (step 1844 ). More specifically, in one embodiment, the optimal inclusion distance for individuals, which is also referred to herein as an initial optimal inclusion distance, is set according to the following equation:
- initial_optimal ⁇ _inclusion ⁇ _dist a ⁇ A BoundingBox number_of ⁇ _users ,
- a BoundingBox is an area of the bounding box
- number_of_users is the total number of users in the bounding box.
- the total number of users in the bounding box includes both individual users that are not already in a crowd and users that are already in a crowd. In one embodiment, a is 2 ⁇ 3.
- the crowd analyzer 60 then creates a crowd of one user for each individual user within the bounding box that is not already included in a crowd and sets the optimal inclusion distance for the crowds to the initial optimal inclusion distance (step 1846 ).
- the crowd analyzer 60 analyzes the crowds for the bounding box to determine whether any crowd members (i.e., users in the crowds) violate the optimal inclusion distance of their crowds (step 1848 ). Any crowd member that violates the optimal inclusion distance of his or her crowd is then removed from that crowd (step 1850 ).
- the crowd analyzer 60 then creates a crowd of one user for each of the users removed from their crowds in step 1850 and sets the optimal inclusion distance for the newly created crowds to the initial optimal inclusion distance (step 1852 ).
- the crowd analyzer 60 determines the two closest crowds in the bounding box (step 1854 ) and a distance between the two closest crowds (step 1856 ).
- the distance between the two closest crowds is the distance between the crowd centers of the two closest crowds.
- the crowd analyzer 60 determines whether the distance between the two closest crowds is less than the optimal inclusion distance of a larger of the two closest crowds (step 1858 ). If the two closest crowds are of the same size (i.e., have the same number of users), then the optimal inclusion distance of either of the two closest crowds may be used.
- the optimal inclusion distances of both of the two closest crowds may be used such that the crowd analyzer 60 determines whether the distance between the two closest crowds is less than the optimal inclusion distances of both of the two closest crowds.
- the crowd analyzer 60 may compare the distance between the two closest crowds to an average of the optimal inclusion distances of the two closest crowds.
- the two closest crowds are combined or merged (step 1860 ), and a new crowd center for the resulting crowd is computed (step 1862 ).
- a center of mass algorithm may be used to compute the crowd center of a crowd.
- a new optimal inclusion distance for the resulting crowd is computed (step 1864 ). As discussed above, in one embodiment, the new optimal inclusion distance for the resulting crowd is computed as:
- the new optimal inclusion distance is computed as the average of the initial optimal inclusion distance and the distances between the users in the crowd and the crowd center plus one standard deviation.
- the crowd analyzer 60 determines whether a maximum number of iterations have been performed (step 1866 ). If the maximum number of iterations has not been reached, the process returns to step 1848 and is repeated until either the distance between the two closest crowds is not less than the optimal inclusion distance of the larger crowd or the maximum number of iterations has been reached. At that point, the crowd analyzer 60 discards crowds with less than three users, or members (step 1868 ). The crowd analyzer 60 then determines whether the crowd formation process for the new and old bounding boxes is done (step 1870 ). In other words, the crowd analyzer 60 determines whether both the new and old bounding boxes have been processed. If not, the bounding box is set to the new bounding box (step 1872 ), and the process returns to step 1842 and is repeated for the new bounding box. Once both the new and old bounding box have been processed, the crowd formation process ends.
- FIGS. 18A through 18D graphically illustrate the crowd formation process of FIGS. 17A through 17D for a scenario where the crowd formation process is triggered by a location update for a user having no old location.
- the crowd analyzer 60 creates a new bounding box 122 for the new location of the user, and the new bounding box 122 is set as the bounding box to be processed for crowd formation.
- the crowd analyzer 60 identifies all individual users currently located within the bounding box 122 and all crowds located within or overlapping the bounding box.
- crowd 124 is an existing crowd relevant to the bounding box 122 .
- Crowds are indicated by dashed circles, crowd centers are indicated by cross-hairs (+), and users are indicated as dots.
- the crowd analyzer 60 creates crowds 126 through 130 of one user for the individual users, and the optional inclusion distances of the crowds 126 through 130 are set to the initial optimal inclusion distance.
- the initial optimal inclusion distance is computed by the crowd analyzer 60 based on a density of users within the bounding box 122 .
- the crowd analyzer 60 then identifies the two closest crowds 126 and 128 in the bounding box 122 and determines a distance between the two closest crowds 126 and 128 .
- the distance between the two closest crowds 126 and 128 is less than the optimal inclusion distance.
- the two closest crowds 126 and 128 are merged and a new crowd center and new optimal inclusion distance are computed, as illustrated in FIG. 18C .
- the crowd analyzer 60 then repeats the process such that the two closest crowds 126 and 130 in the bounding box 122 are again merged, as illustrated in FIG. 18D .
- the distance between the two closest crowds 124 and 126 is greater than the appropriate optimal inclusion distance.
- the crowd formation process is complete.
- FIGS. 19A through 19F graphically illustrate the crowd formation process of FIGS. 17A through 17D for a scenario where the new and old bounding boxes overlap.
- a user moves from an old location to a new location, as indicated by an arrow.
- the crowd analyzer 60 receives a location update for the user giving the new location of the user.
- the crowd analyzer 60 creates an old bounding box 132 for the old location of the user and a new bounding box 134 for the new location of the user.
- Crowd 136 exists in the old bounding box 132
- crowd 138 exists in the new bounding box 134 .
- the crowd analyzer 60 creates a bounding box 140 that encompasses both the old bounding box 132 and the new bounding box 134 , as illustrated in FIG. 19B .
- the crowd analyzer 60 creates crowds 142 through 148 for individual users currently located within the bounding box 140 .
- the optimal inclusion distances of the crowds 142 through 148 are set to the initial optimal inclusion distance computed by the crowd analyzer 60 based on the density of users in the bounding box 140 .
- the crowd analyzer 60 analyzes the crowds 136 , 138 , and 142 through 148 to determine whether any members of the crowds 136 , 138 , and 142 through 148 violate the optimal inclusion distances of the crowds 136 , 138 , and 142 through 148 .
- the crowd analyzer 60 removes the remaining users from the crowd 136 and creates crowds 150 and 152 of one user each for those users, as illustrated in FIG. 19C .
- the crowd analyzer 60 then identifies the two closest crowds in the bounding box 140 , which in this example are the crowds 146 and 148 .
- the crowd analyzer 60 computes a distance between the two crowds 146 and 148 .
- the distance between the two crowds 146 and 148 is less than the initial optimal inclusion distance and, as such, the two crowds 146 and 148 are combined.
- crowds are combined by merging the smaller crowd into the larger crowd. Since the two crowds 146 and 148 are of the same size, the crowd analyzer 60 merges the crowd 148 into the crowd 146 , as illustrated in FIG. 19D .
- a new crowd center and new optimal inclusion distance are then computed for the crowd 146 .
- the crowd analyzer 60 repeats the process and determines that the crowds 138 and 144 are now the two closest crowds.
- the distance between the two crowds 138 and 144 is less than the optimal inclusion distance of the larger of the two crowds 138 and 144 , which is the crowd 138 .
- the crowd 144 is merged into the crowd 138 and a new crowd center and optimal inclusion distance are computed for the crowd 138 , as illustrated in FIG. 19E .
- the crowd analyzer 60 discards any crowds having less than three members, as illustrated in FIG. 19F .
- the crowds 142 , 146 , 150 , and 152 have less than three members and are therefore removed.
- the crowd 138 has three or more members and, as such, is not removed.
- the crowd formation process is complete.
- FIGS. 20A through 20E graphically illustrate the crowd formation process of FIGS. 17A through 17D in a scenario where the new and old bounding boxes do not overlap.
- the user moves from an old location to a new location.
- the crowd analyzer 60 creates an old bounding box 154 for the old location of the user and a new bounding box 156 for the new location of the user.
- Crowds 158 and 160 exist in the old bounding box 154
- crowd 162 exists in the new bounding box 156 .
- the crowd analyzer 60 processes the old and new bounding boxes 154 and 156 separately.
- the remaining users in the crowd 158 no longer satisfy the optimal inclusion distance for the crowd 158 .
- the remaining users in the crowd 158 are removed from the crowd 158 , and crowds 164 and 166 of one user each are created for the removed users as shown in FIG. 20C .
- no two crowds in the old bounding box 154 are close enough to be combined.
- processing of the old bounding box 154 is complete, and the crowd analyzer 60 proceeds to process the new bounding box 156 .
- processing of the new bounding box 156 begins by the crowd analyzer 60 creating a crowd 168 of one user for the user.
- the crowd analyzer 60 identifies the crowds 162 and 168 as the two closest crowds in the new bounding box 156 and determines a distance between the two crowds 162 and 168 .
- the distance between the two crowds 162 and 168 is less than the optimal inclusion distance of the larger crowd, which is the crowd 162 .
- the crowd analyzer 60 combines the crowds 162 and 168 by merging the crowd 168 into the crowd 162 , as illustrated in FIG. 20E .
- a new crowd center and new optimal inclusion distance are then computed for the crowd 162 .
- the crowd formation process is complete.
- a location accuracy of the location update from the user received in step 1800 is considered. More specifically, in step 1800 , the location update received by the MAP server 12 includes the updated location of the user 20 - 1 as well as a location accuracy for the location of the user 20 - 1 , which may be expressed as, for example, a radius in meters from the location of the user 20 - 1 .
- the location accuracy of the location of the user 20 - 1 may be provided by the GPS receiver or derived from data from the GPS receiver as will be appreciated by one having ordinary skill in the art.
- steps 1802 and 1804 sizes of the new and old bounding boxes centered at the new and old locations of the user 20 - 1 are set as a function of the location accuracy of the new and old locations of the user 20 - 1 . If the new location of the user 20 - 1 is inaccurate, then the new bounding box will be large. If the new location of the user 20 - 1 is accurate, then the new bounding box will be small.
- the length and width of the new bounding box may be set to M times the location accuracy of the new location of the user 20 - 1 , where the location accuracy is expressed as a radius in meters from the new location of the user 20 - 1 .
- the number M may be any desired number. For example, the number M may be 5.
- the location accuracy of the old location of the user 20 - 1 may be used to set the length and width of the old bounding box.
- the location accuracy may be considered when computing the initial optimal inclusion distances used for crowds of one user in steps 1814 and 1844 .
- the initial optimal inclusion distance is computed based on the following equation:
- initial_optimal ⁇ _inclusion ⁇ _dist a ⁇ A BoundingBox number_of ⁇ _users ,
- a BoundingBox is an area of the bounding box
- number_of_users is the total number of users in the bounding box.
- the total number of users in the bounding box includes both individual users that are not already in a crowd and users that are already in a crowd.
- a is 2 ⁇ 3.
- the location accuracy rather than the computed value, is used for the initial optimal inclusion distance for that crowd.
- crowds become larger and more inclusive.
- crowds become smaller and less inclusive.
- the granularity with which crowds are formed is a function of the location accuracy.
- the new optimal inclusion distance may first be computed based on the following equation:
- the new optimal inclusion distance is computed as the average of the initial optimal inclusion distance and the distances between the users in the crowd and the crowd center plus one standard deviation.
- the computed value for the new optimal inclusion distance is less than an average location accuracy of the users in the crowd, the average location accuracy of the users in the crowd, rather than the computed value, is used as the new optimal inclusion distance.
- FIG. 21 illustrates the operation of the system 10 of FIGS. 1A and 1B to enable the mobile devices 18 - 1 through 18 -N to request crowd data for currently formed crowds according to one embodiment of the present disclosure.
- the request is initiated by the MAP application 32 - 1 of the mobile device 18 - 1
- this discussion is equally applicable to the MAP applications 32 - 2 through 32 -N of the other mobile devices 18 - 2 through 18 -N.
- requests may be received from the third-party applications 34 - 1 through 34 -N.
- the MAP server 12 may process crowd requests from other devices such as the subscriber device 22 , the third-party server 26 , and/or the profile server 14 .
- the MAP application 32 - 1 sends a crowd request to the MAP client 30 - 1 (step 1900 ).
- the crowd request is a request for crowd data for crowds currently formed near a specified POI or within a specified AOI.
- the crowd request may be initiated by the user 20 - 1 of the mobile device 18 - 1 via the MAP application 32 - 1 or may be initiated automatically by the MAP application 32 - 1 in response to an event such as, for example, start-up of the MAP application 32 - 1 , movement of the user 20 - 1 , or the like.
- the crowd request is for a POI, where the POI is a POI corresponding to the current location of the user 20 - 1 , a POI selected from a list of POIs defined by the user 20 - 1 , a POI selected from a list of POIs defined by the MAP application 32 - 1 or the MAP server 12 , a POI selected by the user 20 - 1 from a map, a POI implicitly defined via a separate application (e.g., POI is implicitly defined as the location of the nearest Starbucks coffee house in response to the user 20 - 1 performing a Google search for “Starbucks”), or the like.
- a separate application e.g., POI is implicitly defined as the location of the nearest Starbucks coffee house in response to the user 20 - 1 performing a Google search for “Starbucks”
- the list of POIs may include static POIs which may be defined by street addresses or latitude and longitude coordinates, dynamic POIs which may be defined as the current locations of one or more friends of the user 20 - 1 , or both.
- the user 20 - 1 may be enabled to define a POI by selecting a crowd center of a crowd as a POI, where the POI would thereafter remain static at that point and would not follow the crowd.
- the crowd request is for an AOI
- the AOI may be an AOI of a predefined shape and size centered at the current location of the user 20 - 1 , an AOI selected from a list of AOIs defined by the user 20 - 1 , an AOI selected from a list of AOIs defined by the MAP application 32 - 1 or the MAP server 12 , an AOI selected by the user 20 - 1 from a map, an AOI implicitly defined via a separate application (e.g., AOI is implicitly defined as an area of a predefined shape and size centered at the location of the nearest Starbucks coffee house in response to the user 20 - 1 performing a Google search for “Starbucks”), or the like.
- the list of AOIs may include static AOIs, dynamic AOIs which may be defined as areas of a predefined shape and size centered at the current locations of one or more friends of the user 20 - 1 , or both.
- the user 20 - 1 may be enabled to define an AOI by selecting a crowd such that an AOI is created of a predefined shape and size centered at the crowd center of the selected crowd. The AOI would thereafter remain static and would not follow the crowd.
- the POI or the AOI of the crowd request may be selected by the user 20 - 1 via the MAP application 32 - 1 .
- the MAP application 32 - 1 automatically uses the current location of the user 20 - 1 as the POI or as a center point for an AOI of a predefined shape and size.
- the MAP client 30 - 1 Upon receiving the crowd request, the MAP client 30 - 1 forwards the crowd request to the MAP server 12 (step 1902 ). Note that in some embodiments, the MAP client 30 - 1 may process the crowd request before forwarding the crowd request to the MAP server 12 .
- the crowd request may include more than one POI or more than one AOI. As such, the MAP client 30 - 1 may generate a separate crowd request for each POI or each AOI.
- the MAP server 12 identifies one or more crowds relevant to the crowd request (step 1904 ). More specifically, in one embodiment, the crowd analyzer 60 performs a crowd formation process such as that described above in FIG. 15 to form one or more crowds relevant to the POI or the AOI of the crowd request. In another embodiment, the crowd analyzer 60 proactively forms crowds using a process such as that described above in FIGS. 17A through 17D and stores corresponding crowd records in the datastore 66 of the MAP server 12 . Then, rather than forming the relevant crowds in response to the crowd request, the crowd analyzer 60 queries the datastore 66 to identify the crowds that are relevant to the crowd request.
- the crowds relevant to the crowd request may be those crowds within or intersecting a bounding region, such as a bounding box, for the crowd request. If the crowd request is for a POI, the bounding region is a geographic region of a predefined shape and size centered at the POI. If the crowd request is for an AOI, the bounding region is the AOI.
- the MAP server 12 generates crowd data for the identified crowds (step 1906 ).
- the crowd data for the identified crowds may include aggregate profiles for the crowds, information characterizing the crowds, or both.
- the crowd data may include spatial information defining the locations of the crowds, the number of users in the crowds, the amount of time the crowds have been located at or near the POI or within the AOI of the crowd request, or the like.
- the MAP server 12 then returns the crowd data to the MAP client 30 - 1 (step 1908 ).
- the MAP client 30 - 1 Upon receiving the crowd data, the MAP client 30 - 1 forwards the crowd data to the MAP application 32 - 1 (step 1910 ). Note that in some embodiments the MAP client 30 - 1 may process the crowd data before sending the crowd data to the MAP application 32 - 1 . The MAP application 32 - 1 then presents the crowd data to the user 20 - 1 (step 1912 ). The manner in which the crowd data is presented depends on the particular implementation of the MAP application 32 - 1 . In one embodiment, the crowd data is overlaid upon a map. For example, the crowds may be represented by corresponding indicators overlaid on a map. The user 20 - 1 may then select a crowd in order to view additional crowd data regarding that crowd such as, for example, the aggregate profile of that crowd, characteristics of that crowd, or the like.
- the MAP application 32 - 1 may operate to roll-up the aggregate profiles for multiple crowds into a rolled-up aggregate profile for those crowds.
- the rolled-up aggregate profile may be the average of the aggregate profiles of the crowds.
- the MAP application 32 - 1 may roll-up the aggregate profiles for multiple crowds at a POI and present the rolled-up aggregate profile for the multiple crowds at the POI to the user 20 - 1 .
- the MAP application 32 - 1 may provide a rolled-up aggregate profile for an AOI.
- the MAP server 12 may roll-up crowds for a POI or an AOI and provide the rolled-up aggregate profile in addition to or as an alternative to the aggregate profiles for the individual crowds.
- FIGS. 22 through 31 describe the operation of the profile augmentation function 40 of FIGS. 1A and 1B according to several different embodiments of the present disclosure. More specifically, FIG. 22 illustrates the operation of the profile augmentation function 40 to augment a user profile of a subject user based on aggregate profile data for a crowd of users located at or near a current location of the subject user according to one embodiment of the present disclosure.
- the profile augmentation function 40 gets, or obtains, a current location of a subject user (step 2000 ).
- the subject user may be a system-user, which is one of the users 20 - 1 through 20 -N of the mobile devices 18 - 1 through 18 -N or the subscriber 24 of the subscriber device 22 , or a third-party user, which may be a user associated with the profile server 14 or the third-party server 26 that is not one of the system-users.
- the current location of the subject user may be obtained using any suitable technique. For example, if the subject user is user 20 - 1 , the current location of the user 20 - 1 is preferably obtained from the mobile device 18 - 1 or the location server 16 . As another example, if the subject user is a third-party user, the current location of the third-party user may be obtained from a location-aware device of the third-party user.
- the profile augmentation function 40 obtains an aggregate profile for a crowd of users currently located at or near the current location of the subject user (step 2002 ).
- Crowds of users currently located at or near the current location of the subject user are referred to herein as crowds that are currently located at locations that are relevant to the current location of the subject user. More specifically, depending on the particular implementation, the crowd currently located at or near the current location of the subject user is a crowd in which the subject user is included, a crowd closest to the current location of the subject user, or a crowd that is within a geographic region of a predefined shape and size encompassing (e.g., centered at) the current location of the subject user.
- the aggregate profile of the crowd is preferably generated by comparing the user profiles of the users in the crowd to one another, and the aggregate profile of the crowd preferably includes a number of keywords and, for each keyword, a number of user matches, or occurrences, for that keyword in the user profiles of the users in the crowd.
- the profile augmentation function 40 then augments a user profile of the subject user based on the aggregate profile of the crowd (step 2004 ).
- FIG. 23 illustrates step 2004 of FIG. 22 in more detail according to one embodiment of the present disclosure.
- the user profile of the subject user includes a number of keywords and a probability assigned to each of the keywords.
- the probability assigned to a keyword in the user profile of the subject user is a probability that the subject user has an interest in the keyword.
- the user profile of the subject user includes zero or more keywords entered by the subject user, where each of these keywords is assigned a fixed probability of 100%.
- additional keywords are added to the user profile of the subject user and probabilities are assigned to those keywords.
- the probabilities of these additional keywords are determined based on questions asked of the subject user and/or the number of user matches, or occurrences, for the keywords from one or more aggregate profiles of crowds located at or near the subject user.
- the profile augmentation function 40 identifies, or selects, a predetermined number (N MAX ) of keywords from the aggregate profile of the crowd having the highest number of user matches and not having a fixed probability in the user profile of the subject user (step 2100 ).
- Keywords in the user profile of the subject user having fixed probabilities are keywords that have been entered by the subject user into the user profile.
- the keywords having fixed probabilities may also include keywords in which the subject user has expressed an interest or disinterest in response to questions from the profile augmentation function 40 .
- the profile augmentation function 40 selects, at most, the predetermined number (N MAX ) of the keywords from the aggregate profile having the highest number of user matches and not having a fixed probability in the user profile of the subject user.
- N MAX the predetermined number
- the three keywords having the highest number of user matches and not having fixed probabilities in the user profile of the subject user are the keywords Sports, China, and Coffee.
- the keyword Tennis has a fixed probability in the user profile of the subject user and as such is not selected by the profile augmentation function 40 .
- the profile augmentation function 40 generates a question for each of the keywords identified in step 2100 (step 2102 ).
- the questions are automatically generated in order to determine whether the subject user is interested in the identified keywords.
- the profile augmentation function 40 may generate the following questions: “Do you have an interest in sports?,” “Do you have an interest in China?,” and “Do you like coffee?.”
- the questions for the identified keywords may be a list of the identified keywords where the subject user will be enabled to select “Yes” or “No” for each of the identified keywords, or the like.
- the profile augmentation function 40 then provides the questions for the identified keywords to the subject user (step 2104 ), and receives answers to the questions from the subject user ( 2106 ). Note that the subject user may choose to answer all, some, or none of the questions. Lastly, the profile augmentation function 40 updates the user profile of the subject user based on any answers received from the subject user and, in this embodiment, the number of user matches for the keywords in the aggregate profile of the crowd (step 2108 ).
- FIG. 24 illustrates step 2108 of FIG. 23 in more detail according to one embodiment of the present disclosure.
- FIG. 24 illustrates the operation of the profile augmentation function 40 to update the user profile of the subject user based on any answers received from the subject user and the number of user matches for the keywords in the aggregate profile of the crowd.
- the profile augmentation function 40 gets the next keyword from the aggregate profile (step 2200 ). Note that for the first iteration, the next keyword is the first keyword in the aggregate profile.
- the profile augmentation function 40 determines whether a question was asked for the keyword and whether an answer to the question was received from the subject user (step 2202 ). If not, the profile augmentation function 40 determines whether the keyword is already in the user profile of the subject user (step 2204 ).
- the keyword may already be in the user profile if the subject user entered the keyword into the user profile or if the keyword was added to the user profile of the subject user during a previous iteration of the profile augmentation process. If the keyword is not already in the user profile of the subject user, the profile augmentation function 40 computes a probability for the keyword based on the number of user matches for the keyword in the aggregate profile (step 2206 ). In one embodiment, the probability score is computed based on the following equation:
- PROBABILITY USER_MATCHES TOTAL_USER ⁇ _MATCHES ⁇ 100 ,
- the profile augmentation function 40 then adds the keyword and the probability computed for the keyword to the user profile of the subject user (step 2208 ). At this point, the process proceeds to step 2222 , which is described below.
- the profile augmentation function 40 determines whether the keyword has a fixed probability in the user profile of the subject user (step 2210 ).
- the keyword will have a fixed probability if the subject user added the keyword to the user profile or if the subject user previously answered a question for the keyword. More specifically, in this embodiment, the keyword will have a fixed probability of 100% if the subject user previously added the keyword to the user profile, a fixed probability of 100% if the subject user answered a question for the keyword in a previous iteration of the profile augmentation process in a manner that indicated that the subject user has an interest in the keyword, or a fixed probability of 0% if the subject user answered a question for the keyword in a previous iteration of the profile augmentation process in a manner that indicated that the subject user does not have an interest in the keyword.
- the profile augmentation function 40 computes a new probability for the keyword based on the probability for the keyword in the user profile (i.e., the old probability for the keyword) and the number of user matches for the keyword in the aggregate profile (step 2212 ).
- the new probability is computed based on the following equation:
- PROBABILITY NEW AVG(PROBABILITY OLD ,PROBABILITY TEMP ),
- PROBABILITY TEMP USER_MATCHES TOTAL_USER ⁇ _MATCHES ⁇ 100 ,
- PROBABILITY NEW is the new probability for the keyword
- PROBABILITY OLD is the old probability for the keyword
- PROBABILITY TEMP is a temporary probability used for purposes of this exemplary calculation
- USER_MATCHES is the number of user matches for the keyword from the aggregate profile
- TOTAL_USER_MATCHES is the sum of the number of user matches for all of the keywords in the aggregate profile.
- the function AVG(x,y) is the average of the values x and y. Note that other techniques may be used to combine the old probability and the temporary probability to provide the new probability (e.g., summing, weighted averaging, or the like).
- the profile augmentation function 40 then updates the user profile of the subject user to include the new probability for the keyword (step 2214 ). At this point, the process proceeds to step 2222 , which is described below.
- the profile augmentation function 40 determines whether the keyword is already in the user profile of the subject user (step 2216 ). If not, the profile augmentation function 40 adds the keyword to the user profile of the subject user along with a fixed probability for the keyword that reflects the answer given by the subject user to the corresponding question (step 2218 ). In this example, the fixed probability for the keyword is 100% if the subject user gave a positive answer indicating that the subject user has an interest in the keyword. In contrast, the fixed probability for the keyword is 0% if the subject user gave a negative answer indicating that the subject user does not have an interest in the keyword. At this point, the process proceeds to step 2222 , which is described below.
- the profile augmentation function 40 updates the user profile of the subject user with a fixed probability for the keyword that reflects the answer given by the subject user to the corresponding question (step 2220 ).
- the fixed probability for the keyword is 100% if the subject user gave a positive answer indicating that the subject user has an interest in the keyword.
- the fixed probability for the keyword is 0% if the subject user gave a negative answer indicating that the subject user does not have an interest in the keyword. The process then proceeds to step 2222 , which is described below.
- the profile augmentation function 40 determines whether that last keyword in the aggregate profile has been processed (step 2222 ). If not, the process returns to step 2200 and is repeated for the next keyword in the aggregate profile. Once all of the keywords in the aggregate profile have been processed, the process is complete.
- the subject user answered the question for Sports in a manner that indicated that the subject user has an interest in sports, answered the question for Coffee in a manner that indicated that the subject user is not interested in Coffee, and did not answer the question for China.
- the user profile of the subject user is updated as follows:
- an aggregate profile for a new crowd that is at or near the new location of the subject user may be:
- Keyword User Matches Sports 5 Photography 3 Hiking 2 Technology 2 Farming 1 In this example, assuming again that N MAX is 3, then Photography, Hiking, and Technology are selected and corresponding questions are provided to the subject user. For this example, assume that the subject user does not respond to any of the questions. As such, since the keyword Photography is already in the user profile of the subject user, a new probability is computed for the keyword Photography based on the old probability which in this case is 8 and the number of user matches for the keyword Photography in the aggregate profile for the new crowd. The keywords Hiking and Technology are not already in the user profile of the subject user. As such, the keywords Hiking and Technology are added to the user profile of the subject user along with corresponding probabilities computed based on the number of user matches for those keywords in the aggregate profile of the new crowd. As such, the updated user profile of the subject user may then be:
- FIG. 25 illustrates step 2004 of FIG. 22 in more detail according to another embodiment of the present disclosure.
- the user profile of the subject user includes a number of keywords and a probability assigned to each of the keywords. Initially, the user profile of the subject user includes zero or more keywords entered by the subject user, where each of these keywords is assigned a fixed probability of 100%. Over time, as a number of iterations of the profile augmentation process of FIG. 22 are performed, additional keywords are added to the user profile of the subject user. As discussed below, the probabilities of these additional keywords are determined based on questions asked of the subject user and/or the number of user matches for the keywords for aggregate profiles of crowds located at or near the subject user.
- the profile augmentation function 40 first provides a preliminary question to the subject user (step 2300 ).
- the preliminary question is preferably an open-ended question regarding the interests of the subject user.
- the preliminary question may be “What is one of your current topics of interest?.”
- the profile augmentation function 40 then receives an answer from the subject user (step 2302 ).
- the answer from the subject user is referred to herein as a topic of interest.
- the profile augmentation function 40 selects a desired number of keywords from the aggregate profile that have the highest number of user matches, do not have fixed probabilities in the user profile of the subject user, and have the highest affinity to the topic of interest provided by the subject user (step 2304 ).
- Affinity between the topic of interest and the keywords in the aggregate profile may be determined using any suitable technique for determining the affinity between two keywords. For example, an ontology or similar data structure that defines relationships between words and topics may be used to determine the degree of relationship between two keywords (e.g., degrees of separation of the two keywords in the ontology), where the degree of relationship is utilized as the affinity of the two keywords.
- the profile augmentation function 40 selects the Sports keyword because it has the highest number of user matches and is not already included in the user profile of the subject user with a fixed probability.
- the profile augmentation function 40 selects two more keywords from the keywords China, Coffee, and Europe based on the affinities of those keywords to the topic of interest, which is History.
- the profile augmentation function 40 selects the keywords China and Europe because they have higher affinities with the topic of interest than the keyword Coffee.
- the profile augmentation function 40 generates a question for each of the selected keywords (step 2306 ).
- the questions are automatically generated in order to determine whether the subject user is interested in the identified keywords.
- the profile augmentation function 40 may generate the following questions: “Do you have an interest in sports?,” “Do you have an interest in China?,” and “Do you have an interest in Europe?.”
- the questions for the identified keywords may be a list of the identified keywords where the subject user will be enabled to select “Yes” or “No” for each of the identified keywords, or the like.
- the profile augmentation function 40 then provides the questions for the identified keywords to the subject user (step 2308 ), and receives answers to the questions from the subject user ( 2310 ). Note that the subject user may choose to answer all, some, or none of the questions. Lastly, the profile augmentation function 40 updates the user profile of the subject user based on any answers received from the subject user and, in this embodiment, the number of user matches for the keywords in the aggregate profile of the crowd (step 2312 ). More specifically, in one embodiment, the profile augmentation function 40 updates the user profile of the subject user using the process of FIG. 24 described above.
- FIG. 26 illustrates the operation of the profile augmentation function 40 to augment a user profile of a user based on an aggregate profile of a crowd for the embodiment of FIG. 1A wherein the profile augmentation function 40 is implemented on the MAP server 12 .
- the MAP server 12 obtains a user profile of a system user (step 2400 ).
- the system user is one of the users 20 - 1 through 20 -N.
- the MAP server 12 may obtain the user profile of the system user from the profile server 14 , but is not limited thereto.
- the MAP server 12 obtains the current location of the system user in the manner described above and identifies a crowd at or near the current location of the system user (steps 2402 and 2404 ).
- the MAP server 12 may identify the crowd by reactively performing the crowd formation process of FIG. 15 for a geographic region encompassing the current location of the system user. Alternatively, the MAP server 12 may proactively form crowds using the process of FIG. 15 or FIGS. 17A through 17D . In this case, the MAP server 12 identifies the crowd at or near the current location of the system user by querying the datastore 66 of the MAP server 12 .
- the crowd at or near the current location of the system user may be a crowd in which the system user is currently included or a crowd that is closest to the current location of the system user.
- the MAP server 12 obtains an aggregate profile for the crowd (step 2406 ). More specifically, the MAP server 12 compares the user profiles of the users in the crowd to one another to generate the aggregate profile of the crowd.
- the aggregate profile of the crowd preferably includes a number of keywords and, for each keyword, a number of user matches for the keyword in the user profiles of the users in the crowd.
- the profile augmentation function 40 which for this embodiment is implemented on the MAP server 12 , then augments the user profile of the system user based on the aggregate profile of the crowd in the manner described above (step 2408 ).
- the process returns to step 2402 and is periodically or otherwise repeated to further augment the user profile of the system user over time.
- FIG. 27 illustrates the operation of the profile augmentation function 40 for the embodiment of FIG. 1B .
- the profile augmentation function 40 is implemented on the profile server 14 , one of the mobile devices 18 - 1 through 18 -N, the subscriber device 22 , or the third-party server 26 .
- the profile augmentation function 40 sends an aggregate profile request to the MAP server 12 that includes the current location of the subject user (step 2500 ).
- the subject user is a system user (i.e., one of the users 20 - 1 through 20 -N)
- the aggregate profile request may identify the subject user, where the MAP server 12 then obtains the current location of the subject user.
- the subject user may be a system user or a third-party user depending on the particular implementation.
- the MAP server 12 identifies a crowd that is at or near the current location of the subject user (step 2502 ). Again, the crowd may be formed proactively or reactively, as described above.
- the crowd that is at or near the current location of the subject user is preferably a crowd that is at or closest to the current location of the subject user. If the subject user is a system user, the crowd that is at or near the current location of the subject user may be a crowd in which the subject user is included.
- the MAP server 12 then obtains an aggregate profile for the crowd (step 2504 ).
- the MAP server 12 compares the user profiles of the users in the crowd to one another to generate the aggregate profile of the crowd.
- the aggregate profile of the crowd preferably includes a number of keywords and, for each keyword, a number of user matches for the keyword in the user profiles of the users in the crowd.
- the MAP server returns the aggregate profile of the crowd to the profile augmentation function 40 (step 2506 ).
- the profile augmentation function 40 then augments the user profile of the subject user based on the aggregate profile of the crowd in the manner described above (step 2508 ).
- FIGS. 28 through 32 illustrate the operation of the profile augmentation function 40 according to another embodiment of the present disclosure.
- the profile augmentation function 40 augments a user profile of a subject user based on a historical aggregate profile for users historically located at locations relevant to the current location of the subject user.
- the locations relevant to the current location of the subject user are locations that are at or near the current location of the subject user.
- the profile augmentation function 40 may augment the user profile of a subject user based on both an aggregate profile of a crowd at or near the current location of the subject user and a historical aggregate profile for users historically located at or near the current location of the subject user.
- FIG. 28 illustrates the operation of the profile augmentation function 40 to augment a user profile of a subject user based on a historical aggregate profile data for users historically, or previously, located at or near a current location of the subject user according to another embodiment of the present disclosure.
- the profile augmentation function 40 gets, or obtains, a current location of a subject user (step 2600 ).
- the subject user may be a system-user, which is one of the users 20 - 1 through 20 -N of the mobile devices 18 - 1 through 18 -N or the subscriber 24 of the subscriber device 22 , or a third-party user, which may be a user associated with the profile server 14 or the third-party server 26 that is not one of the system-users.
- the current location of the subject user may be obtained using any suitable technique. For example, if the subject user is user 20 - 1 , the current location of the user 20 - 1 is preferably obtained from the mobile device 18 - 1 or the location server 16 . As another example, if the subject user is a third-party user, the current location of the third-party user may be obtained from a location-aware device of the third-party user.
- the profile augmentation function 40 obtains a historical aggregate profile for users historically located at or near the current location of the subject user (step 2602 ).
- the users historically located at or near the current location of the subject user are users that were located at or near the current location of the subject user within one or more defined time windows. Each time window may be a relative time window that is relative to the current time (e.g., past 6 months, past 2 years, or the like) or an absolute time window (e.g., Friday, Feb. 12, 2010 or the like).
- the users historically located at or near the current location of the subject user are users that were historically located within a defined geographic region encompassing (e.g., centered at) the current location of the subject user.
- the historical aggregate profile includes a number of keywords and, for each keyword, a number of user matches, or occurrences, of the keyword in the user profiles of the users historically located at or near the current location of the subject user.
- the profile augmentation function 40 then augments a user profile of the subject user based on the historical aggregate profile (step 2604 ).
- FIG. 29 illustrates step 2604 of FIG. 28 in more detail according to one embodiment of the present disclosure.
- the user profile of the subject user includes a number of keywords and a probability assigned to each of the keywords. Initially, the user profile of the subject user includes zero or more keywords entered by the subject user, where each of these keywords is assigned a fixed probability of 100%. Over time, as a number of iterations of the profile augmentation process of FIG. 28 are performed, additional keywords are added to the user profile of the subject user. As discussed below, the probabilities of these additional keywords are determined based on questions asked of the subject user and/or the number of user matches for the keywords from a historical aggregate profile obtained for the current location of the subject user.
- the profile augmentation function 40 identifies, or selects, a predetermined number (N MAX ) of keywords from the historical aggregate profile having the highest number of user matches and not having a fixed probability in the user profile of the subject user (step 2700 ).
- Keywords in the user profile of the subject user having fixed probabilities are keywords that have been entered by the subject user into the user profile.
- the keywords having fixed probabilities may also include keywords in which the subject user has expressed an interest or disinterest in response to questions from the profile augmentation function 40 .
- the profile augmentation function 40 selects, at most, the predetermined number (N MAX ) of the keywords from the historical aggregate profile having the highest number of user matches and not having a fixed probability in the user profile of the subject user.
- N MAX the predetermined number of the keywords from the historical aggregate profile having the highest number of user matches and not having a fixed probability in the user profile of the subject user.
- N MAX is three (3).
- the three keywords having the highest number of user matches and not having fixed probabilities in the user profile of the subject user are the keywords Books, Photography, and Fishing.
- the keyword Tennis has a fixed probability in the user profile of the subject user.
- the profile augmentation function 40 generates a question for each of the identified keywords (step 2702 ).
- the questions are automatically generated in order to determine whether the subject user is interested in the identified keywords.
- the profile augmentation function 40 may generate the following questions: “Do you have an interest in books?,” “Do you have an interest in photography?,” and “Do you like fishing?.”
- the questions for the identified keywords may be a list of the identified keywords where the subject user will be enabled to select “Yes” or “No” for each of the identified keywords, or the like.
- the profile augmentation function 40 then provides the questions for the identified keywords to the subject user (step 2704 ), and receives answers to the questions from the subject user ( 2706 ). Note that the subject user may choose to answer all, some, or none of the questions. Lastly, the profile augmentation function 40 updates the user profile of the subject user based on any answers received from the subject user and, in this embodiment, the number of user matches for the keywords in the historical aggregate profile (step 2708 ). In one embodiment, the profile augmentation function 40 updates the user profile of the subject user using the process of FIG. 24 described above.
- the updated user profile of the subject user would be:
- FIG. 30 illustrates step 2604 of FIG. 28 in more detail according to another embodiment of the present disclosure.
- the user profile of the subject user includes a number of keywords and a probability assigned to each of the keywords. Initially, the user profile of the subject user includes zero or more keywords entered by the subject user, where each of these keywords is assigned a fixed probability of 100%. Over time, as a number of iterations of the profile augmentation process of FIG. 28 are performed, additional keywords are added to the user profile of the subject user. As discussed below, the probabilities of these additional keywords are determined based on questions asked of the subject user and/or the number of user matches for the keywords in historical aggregate profiles.
- the profile augmentation function 40 first provides a preliminary question to the subject user (step 2800 ).
- the preliminary question is preferably an open-ended question regarding the interests of the subject user.
- the preliminary question may be “What is one of your current topics of interest?.”
- the profile augmentation function 40 then receives an answer from the subject user (step 2802 ).
- the answer from the subject user is referred to herein as a topic of interest.
- the profile augmentation function 40 selects a desired number of keywords from the historical aggregate profile that have the highest number of user matches, do not have fixed probabilities in the user profile of the subject user, and have the highest affinity to the topic of interest provided by the subject user (step 2804 ).
- Affinity between the topic of interest and the keywords in the historical aggregate profile may be determined using any suitable technique for determining the affinity between two keywords. For example, an ontology or similar data structure that defines relationships between words and topics may be used to determine the degree of relationship between two keywords (e.g., degrees of separation of the two keywords in the ontology), where the degree of relationship is utilized as the affinity of the two keywords.
- the profile augmentation function 40 selects Books and Photography because they have the highest number of user matches for keywords that do not have fixed probabilities in the user profile of the subject user.
- the profile augmentation function 40 selects one more keyword from the keywords Coffee, China, Skiing, Europe, and Fishing based on the affinities of those keywords to the topic of interest, which is the Winter Olympics.
- the profile augmentation function 40 selects the keyword Skiing because it has a higher affinity with the topic of interest than the other keywords.
- the profile augmentation function 40 generates a question for each of the selected keywords (step 2806 ).
- the questions are automatically generated in order to determine whether the subject user is interested in the identified keywords.
- the profile augmentation function 40 may generate the following questions: “Do you have an interest in books?,” “Do you have an interest in photography?,” and “Do you have an interest in skiing?.”
- the questions for the identified keywords may be a list of the identified keywords where the subject user will be enabled to select “Yes” or “No” for each of the identified keywords, or the like.
- the profile augmentation function 40 then provides the questions for the identified keywords to the subject user (step 2808 ), and receives answers to the questions from the subject user (step 2810 ). Note that the subject user may choose to answer all, some, or none of the questions. Lastly, the profile augmentation function 40 updates the user profile of the subject user based on any answers received from the subject user and, in this embodiment, the number of user matches for the keywords in the historical aggregate profile for the current location of the subject user (step 2812 ). More specifically, in one embodiment, the profile augmentation function 40 updates the user profile of the subject user using the process of FIG. 24 described above.
- FIG. 31 illustrates the operation of the profile augmentation function 40 to augment a user profile of a subject user based on a historical aggregate profile for the embodiment of FIG. 1A wherein the profile augmentation function 40 is implemented on the MAP server 12 .
- the MAP server 12 obtains a user profile of a system user (step 2900 ).
- the system user is one of the users 20 - 1 through 20 -N.
- the MAP server 12 may obtain the user profile of the system user from the profile server 14 , but is not limited thereto.
- the MAP server 12 obtains the current location of the system user in the manner described above (step 2902 ).
- the MAP server 12 obtains a historical aggregate profile for the current location of the system user (step 2904 ).
- the historical aggregate profile is preferably obtained by the MAP server 12 .
- user profiles of users historically located at or near the current location of the system user during one or more defined time windows are combined to provide the historical aggregate profile.
- the historical aggregate profile preferably includes a number of keywords and, for each keyword, a number of user matches for that keyword in the user profiles of the users historically located at or near the current location of the system user.
- the profile augmentation function 40 which for this embodiment is implemented on the MAP server 12 , then augments the user profile of the system user based on the historical aggregate profile in the manner described above (step 2906 ).
- the process returns to step 2902 and is periodically or otherwise repeated to further augment the user profile of the system user over time.
- FIG. 32 illustrates the operation of the profile augmentation function 40 to perform the profile augmentation process of FIG. 28 for the embodiment of FIG. 1B .
- the profile augmentation function 40 is implemented on the profile server 14 , one of the mobile devices 18 - 1 through 18 -N, the subscriber device 22 , or the third-party server 26 .
- the profile augmentation function 40 sends a historical aggregate profile request to the MAP server 12 that includes the current location of the subject user (step 3000 ).
- the subject user is a system user (i.e., one of the users 20 - 1 through 20 -N)
- the historical aggregate profile request may identify the subject user, where the MAP server 12 then obtains the current location of the subject user.
- the subject user may be a system user or a third-party user depending on the particular implementation details.
- the MAP server 12 generates or otherwise obtains a historical aggregate profile for the current location of the subject user (step 3002 ). Again, the manner in which the historical aggregate profile is preferably generated is described below.
- the MAP server returns the historical aggregate profile to the profile augmentation function 40 (step 3004 ).
- the profile augmentation function 40 then augments the user profile of the subject user based on the historical aggregate profile in the manner described above (step 3006 ).
- FIG. 33 illustrates the operation of the MAP server 12 to generate a historical aggregate profile for a current location of a subject user according to one embodiment of the present disclosure.
- the history manager 58 of the MAP server 12 establishes a bounding box for the historical aggregate profile request based on the current location of the subject user (step 3100 ).
- a bounding box is used in this example, other geographic shapes may be used to define a bounding region for the historical request (e.g., a bounding circle).
- the bounding box is a bounding box of a predefined size centered at the current location of the subject user.
- the history manager 58 establishes a time window for the historical aggregate profile request (step 3102 ).
- the time window is preferably identified in the historical aggregate profile request, but is not limited thereto. For example, if the historical aggregate profile request is for the last week and the current date and time are Sep. 17, 2009 at 10:00 pm, the history manager 58 may generate the time window as Sep. 10, 2009 at 10:00 pm through Sep. 17, 2009 at 10:00 pm. Note that while a single time window is used for this example, any number of one or more time windows may be defined and processed accordingly.
- the history manager 58 obtains history objects relevant to the bounding box and the time window for the historical aggregate profile request from the datastore 66 of the MAP server 12 (step 3104 ).
- the relevant history objects are history objects recorded for time periods within or intersecting the time window and for locations, or geographic areas, within or intersecting the bounding box for the historical aggregate profile request.
- the history manager 58 gets the next history object from the relevant history objects identified in step 3104 (step 3106 ).
- the history manager 58 then generates an aggregate profile for the history object (step 3108 ). In order to generate the aggregate profile for the history object, the history manager 58 compares the user profiles of the anonymous user records stored in the history object to one another.
- the resulting aggregate profile for the history object includes a number of keywords and, for each keyword, a number of user matches for that keyword.
- the history manager 58 determines whether there are more history objects to be processed (step 3110 ). If so, the process returns to step 3106 and is repeated until all of the history objects that are relevant to the historical aggregate profile request have been processed.
- the history manager 58 combines the aggregate profiles of the history objects to provide the historical aggregate profile for the current location of the subject user (step 3112 ). More specifically, in this embodiment, the history manager 58 combines the aggregate profiles of the history objects to provide a list of keywords and, for each keyword, a number of user matches for that keyword over all of the history objects.
- the profile augmentation function 40 utilizes questions asked of the subject user.
- the profile augmentation function 40 is not limited thereto. In another embodiment, no questions are asked of the subject user. Rather, the profile augmentation function 40 operates to update the user profile of the subject user based on the aggregate profile date (i.e., the aggregate profile of the crowd at or near the current location of the subject user or the historical aggregate profile for the current location of the subject user) according to steps 2200 , 2204 - 2214 , and 2222 of FIG. 24 .
- the profile augmentation function 40 may utilize things in addition to the aggregate profile data when augmenting a user profile of a subject user.
- the topic of interest provided by the subject user may be used to identify other keywords identified as being of interest by other users that also provided the same topic of interest.
- the other users may be other users in general or other users currently or previously located at or near the current location of the subject user.
- FIG. 34 is a block diagram of the MAP server 12 according to one embodiment of the present disclosure.
- the MAP server 12 includes a controller 170 connected to memory 172 , one or more secondary storage devices 174 , and a communication interface 176 by a bus 178 or similar mechanism.
- the controller 170 is a microprocessor, digital Application Specific Integrated Circuit (ASIC), Field Programmable Gate Array (FPGA), or the like.
- the controller 170 is a microprocessor, and the application layer 42 , the business logic layer 44 , and the object mapping layer 64 ( FIG. 2 ) are implemented in software and stored in the memory 172 for execution by the controller 170 .
- the datastore 66 FIG.
- the communication interface 176 is a wired or wireless communication interface that communicatively couples the MAP server 12 to the network 28 ( FIGS. 1A and 1B ).
- the communication interface 176 may be an Ethernet interface, local wireless interface such as a wireless interface operating according to one of the suite of IEEE 802.11 standards, or the like.
- FIG. 35 is a block diagram of the mobile device 18 - 1 according to one embodiment of the present disclosure. This discussion is equally applicable to the other mobile devices 18 - 2 through 18 -N.
- the mobile device 18 - 1 includes a controller 180 connected to memory 182 , a communication interface 184 , one or more user interface components 186 , and the location function 36 - 1 by a bus 188 or similar mechanism.
- the controller 180 is a microprocessor, digital ASIC, FPGA, or the like.
- the controller 180 is a microprocessor, and the MAP client 30 - 1 , the MAP application 32 - 1 , and the third-party applications 34 - 1 are implemented in software and stored in the memory 182 for execution by the controller 180 .
- the profile augmentation function 40 is also preferably implemented in software and stored in the memory 182 for execution by the controller 180 .
- the location function 36 - 1 is a hardware component such as, for example, a GPS receiver.
- the communication interface 184 is a wireless communication interface that communicatively couples the mobile device 18 - 1 to the network 28 ( FIGS. 1A and 1B ).
- the communication interface 184 may be a local wireless interface such as a wireless interface operating according to one of the suite of IEEE 802.11 standards, a mobile communications interface such as a cellular telecommunications interface, or the like.
- the one or more user interface components 186 include, for example, a touchscreen, a display, one or more user input components (e.g., a keypad), a speaker, or the like, or any combination thereof.
- FIG. 36 is a block diagram of the subscriber device 22 according to one embodiment of the present disclosure.
- the subscriber device 22 includes a controller 190 connected to memory 192 , one or more secondary storage devices 194 , a communication interface 196 , and one or more user interface components 198 by a bus 200 or similar mechanism.
- the controller 190 is a microprocessor, digital ASIC, FPGA, or the like.
- the controller 190 is a microprocessor, and the web browser 38 ( FIGS. 1A and 1B ) is implemented in software and stored in the memory 192 for execution by the controller 190 .
- the profile augmentation function 40 is also preferably implemented in software and stored in the memory 192 for execution by the controller 190 .
- the one or more secondary storage devices 194 are digital storage devices such as, for example, one or more hard disk drives.
- the communication interface 196 is a wired or wireless communication interface that communicatively couples the subscriber device 22 to the network 28 ( FIGS. 1A and 1B ).
- the communication interface 196 may be an Ethernet interface, local wireless interface such as a wireless interface operating according to one of the suite of IEEE 802.11 standards, a mobile communications interface such as a cellular telecommunications interface, or the like.
- the one or more user interface components 198 include, for example, a touchscreen, a display, one or more user input components (e.g., a keypad), a speaker, or the like, or any combination thereof.
- FIG. 37 is a block diagram of the third-party server 26 according to one embodiment of the present disclosure.
- the third-party server 26 includes a controller 202 connected to memory 204 , one or more secondary storage devices 206 , a communication interface 208 , and one or more user interface components 210 by a bus 212 or similar mechanism.
- the controller 202 is a microprocessor, digital ASIC, FPGA, or the like.
- the controller 202 is a microprocessor, and one or more services provided by the third-party server 26 are implemented in software and stored in the memory 204 for execution by the controller 202 .
- the profile augmentation function 40 is also preferably implemented in software and stored in the memory 204 for execution by the controller 202 .
- the one or more secondary storage devices 206 are digital storage devices such as, for example, one or more hard disk drives.
- the communication interface 208 is a wired or wireless communication interface that communicatively couples the third-party server 26 to the network 28 ( FIGS. 1A and 1B ).
- the communication interface 208 may be an Ethernet interface, local wireless interface such as a wireless interface operating according to one of the suite of IEEE 802.11 standards, a mobile communications interface such as a cellular telecommunications interface, or the like.
- the one or more user interface components 210 include, for example, a touchscreen, a display, one or more user input components (e.g., a keypad), a speaker, or the like, or any combination thereof.
- FIG. 38 is a block diagram of the profile server 14 according to one embodiment of the present disclosure.
- the profile server 14 includes a controller 214 connected to memory 216 , one or more secondary storage devices 218 , a communication interface 220 , and one or more user interface components 222 by a bus 224 or similar mechanism.
- the controller 214 is a microprocessor, digital ASIC, FPGA, or the like.
- the controller 214 is a microprocessor, and one or more services provided by the profile server 14 are implemented in software and stored in the memory 216 for execution by the controller 214 .
- the profile augmentation function 40 is also preferably implemented in software and stored in the memory 216 for execution by the controller 214 .
- the one or more secondary storage devices 218 are digital storage devices such as, for example, one or more hard disk drives.
- the communication interface 220 is a wired or wireless communication interface that communicatively couples the profile server 14 to the network 28 ( FIGS. 1A and 1B ).
- the communication interface 220 may be an Ethernet interface, local wireless interface such as a wireless interface operating according to one of the suite of IEEE 802.11 standards, a mobile communications interface such as a cellular telecommunications interface, or the like.
- the one or more user interface components 222 include, for example, a touchscreen, a display, one or more user input components (e.g., a keypad), a speaker, or the like, or any combination thereof.
Abstract
Description
- This application claims the benefit of provisional patent application Ser. No. 61/163,091, filed Mar. 25, 2009, the disclosure of which is hereby incorporated by reference in its entirety.
- The present disclosure relates to augmenting a sparse user profile.
- Many systems and services rely on user profiles of their users. However, oftentimes, users fail to adequately complete their user profiles, thereby resulting in incomplete or sparse user profiles. In order to increase the effectiveness of systems and services that rely on user profiles, there is a need for a system and method for augmenting sparse user profiles.
- Systems and methods are provided for augmenting a user profile of a subject user. In general, the user profile of the subject user is augmented based on aggregate profile data for a group of users relevant to a current location of the subject user. In one embodiment, the group of users is a crowd of users currently located at a location that is relevant to the current location of the subject user. In another embodiment, the group of users is a number of users historically, or previously, located at locations relevant to the current location of the subject user.
- In one embodiment, a profile augmentation function obtains an aggregate profile of a crowd of users currently located at or near the current location of the subject user. The aggregate profile of the crowd includes a number of keywords and a number of user matches, or occurrences, of each of the keywords in user profiles of the users in the crowd. The profile augmentation function then augments the user profile of the subject user based on the keywords and the number of user matches for the keywords in the aggregate profile of the crowd.
- In another embodiment, the profile augmentation function obtains a historical aggregate profile for users previously, or historically, located at or near the current location of the subject user. In one embodiment, the historical aggregate profile includes a number of keywords and a number of user matches, or occurrences, of each of the keywords in user profiles of the users historically located at or near the current location of the subject user. The profile augmentation function then augments the user profile of the subject user based on the keywords and the number of user matches for the keywords in the historical aggregate profile.
- Those skilled in the art will appreciate the scope of the present invention and realize additional aspects thereof after reading the following detailed description in association with the accompanying drawings.
- The accompanying drawings incorporated in and forming a part of this specification illustrate several aspects of the invention, and together with the description serve to explain the principles of the invention.
-
FIG. 1A illustrates a system providing sparse profile augmentation according to a first embodiment of the present disclosure; -
FIG. 1B illustrates a system providing sparse profile augmentation according to a second exemplary embodiment of the present disclosure; -
FIG. 2 is a block diagram of the MAP server ofFIGS. 1A and 1B according to one embodiment of the present disclosure; -
FIG. 3 is a block diagram of the MAP client of one of the mobile devices ofFIGS. 1A and 1B according to one embodiment of the present disclosure; -
FIG. 4 illustrates the operation of the system ofFIGS. 1A and 1B to provide user profiles and current locations of the users of the mobile devices to the MAP server according to one embodiment of the present disclosure; -
FIG. 5 illustrates the operation of the system ofFIGS. 1A and 1B to provide user profiles and current locations of the users of the mobile devices to the MAP server according to another embodiment of the present disclosure; -
FIGS. 6 and 7 graphically illustrate bucketization of users according to location for purposes of maintaining a historical record of anonymized user profile data by location according to one embodiment of the present disclosure; -
FIG. 8 is a flow chart illustrating the operation of a foreground bucketization process performed by the MAP server to maintain the lists of users for location buckets for purposes of maintaining a historical record of anonymized user profile data by location according to one embodiment of the present disclosure; -
FIG. 9 is a flow chart illustrating the anonymization and storage process performed by the MAP server for the location buckets in order to maintain a historical record of anonymized user profile data by location according to one embodiment of the present disclosure; -
FIG. 10 graphically illustrates anonymization of a user record according to one embodiment of the present disclosure; -
FIG. 11 is a flow chart for a quadtree based storage process that may be used to store anonymized user profile data for location buckets according to one embodiment of the present disclosure; -
FIG. 12 is a flow chart illustrating a quadtree algorithm that may be used to process the location buckets for storage of the anonymized user profile data according to one embodiment of the present disclosure; -
FIGS. 13A through 13E graphically illustrate the process ofFIG. 12 for the generation of a quadtree data structure for one exemplary base quadtree region; -
FIG. 14 illustrates the operation of the system ofFIGS. 1A and 1B wherein a mobile device is enabled to request and receive historical data from the MAP server according to one embodiment of the present disclosure; -
FIG. 15 is a flow chart for a spatial crowd formation process according to one embodiment of the present disclosure; -
FIGS. 16A through 16D graphically illustrate the crowd formation process ofFIG. 15 for an exemplary bounding box; -
FIGS. 17A through 17D illustrate a flow chart for a spatial crowd formation process according to another embodiment of the present disclosure; -
FIGS. 18A through 18D graphically illustrate the crowd formation process ofFIGS. 17A through 17D for a scenario where the crowd formation process is triggered by a location update for a user having no old location; -
FIGS. 19A through 19F graphically illustrate the crowd formation process ofFIGS. 17A through 17D for a scenario where the new and old bounding boxes overlap; -
FIGS. 20A through 20E graphically illustrate the crowd formation process ofFIGS. 17A through 17D in a scenario where the new and old bounding boxes do not overlap; -
FIG. 21 illustrates the operation of the MAP server to process a crowd request according to one embodiment of the present disclosure; -
FIG. 22 is a flow chart illustrating the operation of the profile augmentation function ofFIGS. 1A and 1B to augment a user profile of a subject user based on an aggregate profile of a crowd at or near a current location of the subject user according to one embodiment of the present disclosure; -
FIG. 23 is a more detailed illustration of the augmenting step ofFIG. 22 according to one embodiment of the present disclosure; -
FIG. 24 is a flow chart illustrating the operation of the profile augmentation to update a user profile of a subject user according to one embodiment of the present disclosure; -
FIG. 25 is a more detailed illustration of the augmenting step ofFIG. 22 according to another embodiment of the present disclosure; -
FIG. 26 is a flow chart illustrating the operation of the profile augmentation function ofFIG. 1A to augment a user profile of a subject user based on an aggregate profile of a crowd at or near a current location of the subject user according to one embodiment of the present disclosure; -
FIG. 27 is a flow chart illustrating the operation of the profile augmentation function ofFIG. 1B to augment a user profile of a subject user based on an aggregate profile of a crowd at or near a current location of the subject user according to one embodiment of the present disclosure; -
FIG. 28 is a flow chart illustrating the operation of the profile augmentation function ofFIGS. 1A and 1B to augment a user profile of a subject user based on a historical aggregate profile for a current location of the subject user according to another embodiment of the present disclosure; -
FIG. 29 is more detailed illustration of the augmenting step ofFIG. 28 according to one embodiment of the present disclosure; -
FIG. 30 is more detailed illustration of the augmenting step ofFIG. 28 according to another embodiment of the present disclosure; -
FIG. 31 is a flow chart illustrating the operation of the profile augmentation function ofFIG. 1A to augment a user profile of a subject user based on a historical aggregate profile for a current location of the subject user according to one embodiment of the present disclosure; -
FIG. 32 is a flow chart illustrating the operation of the profile augmentation function ofFIG. 1B to augment a user profile of a subject user based on a historical aggregate profile for a current location of the subject user according to another embodiment of the present disclosure; -
FIG. 33 is a flow chart illustrating the operation of the MAP server to generate a historical aggregate profile for a current location of a subject user in response to a request from the profile augmentation function according to one embodiment of the present disclosure; -
FIG. 34 is a block diagram of the MAP server ofFIG. 1 according to one embodiment of the present disclosure; -
FIG. 35 is a block diagram of one of the mobile devices ofFIG. 1 according to one embodiment of the present disclosure; -
FIG. 36 is a block diagram of the subscriber device ofFIG. 1 according to one embodiment of the present disclosure; -
FIG. 37 is a block diagram of the third-party server ofFIG. 1 according to one embodiment of the present disclosure; and -
FIG. 38 is a block diagram of the profile server ofFIG. 1 according to one embodiment of the present disclosure. - The embodiments set forth below represent the necessary information to enable those skilled in the art to practice the invention and illustrate the best mode of practicing the invention. Upon reading the following description in light of the accompanying drawings, those skilled in the art will understand the concepts of the invention and will recognize applications of these concepts not particularly addressed herein. It should be understood that these concepts and applications fall within the scope of the disclosure and the accompanying claims.
-
FIG. 1A illustrates asystem 10 providing sparse profile augmentation according to a first exemplary embodiment of the present disclosure. In this embodiment, thesystem 10 includes aMAP server 12, one ormore profile servers 14, alocation server 16, a number of mobile devices 18-1 through 18-N having associated users 20-1 through 20-N, asubscriber device 22 having an associatedsubscriber 24, and a third-party server 26 communicatively coupled via anetwork 28. Thenetwork 28 may be any type of network or any combination of networks. Specifically, thenetwork 28 may include wired components, wireless components, or both wired and wireless components. In one exemplary embodiment, thenetwork 28 is a distributed public network such as the Internet, where the mobile devices 18-1 through 18-N are enabled to connect to thenetwork 28 via local wireless connections (e.g., WiFi or IEEE 802.11 connections) or wireless telecommunications connections (e.g., 3G or 4G telecommunications connections such as GSM, LTE, W-CDMA, or WiMAX connections). - As discussed below in detail, the
MAP server 12 operates to obtain current locations, including location updates, and user profiles of the users 20-1 through 20-N of the mobile devices 18-1 through 18-N. The current locations of the users 20-1 through 20-N can be expressed as positional geographic coordinates such as latitude-longitude pairs, and a height vector (if applicable), or any other similar information capable of identifying a given physical point in space in a two-dimensional or three-dimensional coordinate system. Using the current locations and user profiles of the users 20-1 through 20-N, theMAP server 12 is enabled to provide a number of features such as, but not limited to, maintaining a historical record of anonymized user profile data by location, generating aggregate profile data over time for a Point of Interest (POI) or Area of Interest (AOI) using the historical record of anonymized user profile data, identifying crowds of users using current locations and/or user profiles of the users 20-1 through 20-N, and generating aggregate profiles for crowds of users at a POI or in an AOI using the current user profiles of users in the crowds. While not essential, for additional information regarding theMAP server 12, the interested reader is directed to U.S. patent application Ser. No. 12/645,535 entitled MAINTAINING A HISTORICAL RECORD OF ANONYMIZED USER PROFILE DATA BY LOCATION FOR USERS IN A MOBILE ENVIRONMENT, U.S. patent application Ser. No. 12/645,532 entitled FORMING CROWDS AND PROVIDING ACCESS TO CROWD DATA IN A MOBILE ENVIRONMENT, U.S. patent application Ser. No. 12/645,539 entitled ANONYMOUS CROWD TRACKING, U.S. patent application Ser. No. 12/645,544 entitled MODIFYING A USER'S CONTRIBUTION TO AN AGGREGATE PROFILE BASED ON TIME BETWEEN LOCATION UPDATES AND EXTERNAL EVENTS, U.S. patent application Ser. No. 12/645,546 entitled CROWD FORMATION FOR MOBILE DEVICE USERS, U.S. patent application Ser. No. 12/645,556 entitled SERVING A REQUEST FOR DATA FROM A HISTORICAL RECORD OF ANONYMIZED USER PROFILE DATA IN A MOBILE ENVIRONMENT, and U.S. patent application Ser. No. 12/645,560 entitled HANDLING CROWD REQUESTS FOR LARGE GEOGRAPHIC AREAS, all of which were filed on Dec. 23, 2009 and are hereby incorporated herein by reference in their entireties. Note that while theMAP server 12 is illustrated as a single server for simplicity and ease of discussion, it should be appreciated that theMAP server 12 may be implemented as a single physical server or multiple physical servers operating in a collaborative manner for purposes of redundancy and/or load sharing. - In general, the one or
more profile servers 14 operate to store user profiles for a number of persons including the users 20-1 through 20-N of the mobile devices 18-1 through 18-N. For example, the one ormore profile servers 14 may be servers providing social network services such as the Facebook® social networking service, the MySpace® social networking service, the LinkedIN® social networking service, and/or the like. As discussed below, using the one ormore profile servers 14, theMAP server 12 is enabled to directly or indirectly obtain the user profiles of the users 20-1 through 20-N of the mobile devices 18-1 through 18-N. Thelocation server 16 generally operates to receive location updates from the mobile devices 18-1 through 18-N and make the location updates available to entities such as, for instance, theMAP server 12. In one exemplary embodiment, thelocation server 16 is a server operating to provide Yahoo!'s FireEagle service. Before proceeding, it should be noted that while thesystem 10 ofFIG. 1A illustrates an embodiment where the one ormore profile servers 14 and thelocation server 16 are separate from theMAP server 12, the present disclosure is not limited thereto. In an alternative embodiment, the functionality of the one ormore profile servers 14 and/or thelocation server 16 may be implemented within theMAP server 12. - The mobile devices 18-1 through 18-N may be mobile smart phones, portable media player devices, mobile gaming devices, or the like. Some exemplary mobile devices that may be programmed or otherwise configured to operate as the mobile devices 18-1 through 18-N are the Apple® iPhone, the Palm Pre, the Samsung Rogue, the Blackberry Storm, and the Apple® iPod Touch® device. However, this list of exemplary mobile devices is not exhaustive and is not intended to limit the scope of the present disclosure.
- The mobile devices 18-1 through 18-N include MAP clients 30-1 through 30-N, MAP applications 32-1 through 32-N, third-party applications 34-1 through 34-N, and location functions 36-1 through 36-N, respectively. Using the mobile device 18-1 as an example, the MAP client 30-1 is preferably implemented in software. In general, in the preferred embodiment, the MAP client 30-1 is a middleware layer operating to interface an application layer (i.e., the MAP application 32-1 and the third-party applications 34-1) to the
MAP server 12. More specifically, the MAP client 30-1 enables the MAP application 32-1 and the third-party applications 34-1 to request and receive data from theMAP server 12. In addition, the MAP client 30-1 enables applications, such as the MAP application 32-1 and the third-party applications 34-1, to access data from theMAP server 12. - The MAP application 32-1 is also preferably implemented in software. The MAP application 32-1 generally provides a user interface component between the user 20-1 and the
MAP server 12. More specifically, among other things, the MAP application 32-1 enables the user 20-1 to initiate historical requests for historical data (e.g., historical aggregate profile data) or crowd requests for crowd data (e.g., aggregate profile data and/or crowd characteristics data) from theMAP server 12 for a POI or AOI. The MAP application 32-1 also enables the user 20-1 to configure various settings. For example, the MAP application 32-1 may enable the user 20-1 to select a desired social networking service (e.g., Facebook, MySpace, LinkedIN, etc.) from which to obtain the user profile of the user 20-1 and provide any necessary credentials (e.g., username and password) needed to access the user profile from the social networking service. - The third-party applications 34-1 are preferably implemented in software. The third-party applications 34-1 operate to access the
MAP server 12 via the MAP client 30-1. The third-party applications 34-1 may utilize data obtained from theMAP server 12 in any desired manner. As an example, one of the third party applications 34-1 may be a gaming application that utilizes historical aggregate profile data to notify the user 20-1 of POIs or AOIs where persons having an interest in the game have historically congregated. - The location function 36-1 may be implemented in hardware, software, or a combination thereof. In general, the location function 36-1 operates to determine or otherwise obtain the location of the mobile device 18-1. For example, the location function 36-1 may be or include a Global Positioning System (GPS) receiver.
- The
subscriber device 22 is a physical device such as a personal computer, a mobile computer (e.g., a notebook computer, a netbook computer, a tablet computer, etc.), a mobile smart phone, or the like. Thesubscriber 24 associated with thesubscriber device 22 is a person or entity. In general, thesubscriber device 22 enables thesubscriber 24 to access theMAP server 12 via aweb browser 38 to obtain various types of data, preferably for a fee. For example, thesubscriber 24 may pay a fee to have access to historical aggregate profile data for one or more POIs and/or one or more AOIs, pay a fee to have access to crowd data such as aggregate profiles for crowds located at one or more POIs and/or located in one or more AOIs, pay a fee to track crowds, or the like. Note that theweb browser 38 is exemplary. In another embodiment, thesubscriber device 22 is enabled to access theMAP server 12 via a custom application. - The third-
party server 26 is a physical server that has access to data from theMAP server 12 such as historical aggregate profile data for one or more POIs or one or more AOIs or crowd data such as aggregate profiles for one or more crowds at one or more POIs or within one or more AOIs. Based on the data from theMAP server 12, the third-party server 26 operates to provide a service such as, for example, targeted advertising. For example, the third-party server 26 may obtain anonymous aggregate profile data for one or more crowds located at a POI and then provide targeted advertising to known users located at the POI based on the anonymous aggregate profile data. Note that while targeted advertising is mentioned as an exemplary service provided by the third-party server 26, other types of services may additionally or alternatively be provided. Other types of services that may be provided by the third-party server 26 will be apparent to one of ordinary skill in the art upon reading this disclosure. - Lastly, in this embodiment, the
MAP server 12 includes aprofile augmentation function 40. Theprofile augmentation function 40 is preferably implemented in software, but is not limited thereto. As discussed below in detail, theprofile augmentation function 40 operates to augment user profiles of users, such as but not limited to the users 20-1 through 20-N, based on aggregate profile data for crowds of users and/or historical aggregate profile data. Using the user 20-1 as an example, theprofile augmentation function 40 operates to augment the user profile of the user 20-1 based on aggregate profiles of crowds of users in which the user 20-1 is included, aggregate profiles of crowds of users 20-1 that are nearby to the user 20-1, and/or historical aggregate profile data for locations visited by the user 20-1. -
FIG. 1B illustrates thesystem 10 providing sparse profile augmentation according to a second exemplary embodiment of the present disclosure. In this embodiment, thesystem 10 includes aMAP server 12, one ormore profile servers 14, alocation server 16, a number of mobile devices 18-1 through 18-N having associated users 20-1 through 20-N, asubscriber device 22 having an associatedsubscriber 24, and a third-party server 26 communicatively coupled via anetwork 28. However, in this embodiment, theprofile augmentation function 40 is implemented apart from theMAP server 12. Specifically, theprofile augmentation function 40 may be implemented on any network device that is enabled to communicate with theMAP server 12 via thenetwork 28. For example, theprofile augmentation function 40 may be implemented on theprofile server 14, one or more of the mobile devices 18-1 through 18-N, thesubscriber device 22, and/or the third-party server 26. - As discussed below in detail, in this embodiment, the
profile augmentation function 40 operates to augment user profiles of system users (i.e., one or more of the users 20-1 through 20-N), third-party users (e.g., one or more users associated with theprofile server 14 other than the users 20-1 through 20-N, thesubscriber 24, and/or one or more users associated with the third-party server 26), or a combination thereof. More specifically, for a particular user, theprofile augmentation function 40 augments the user profile of the user based on aggregate profile data for crowds located at or near the current location of the user and/or historical aggregate profile data for the current location of the user. - Before describing the operation of the
profile augmentation function 40 in detail,FIGS. 2 through 22 provide a description of some of the features of theMAP server 12 that may be utilized directly or indirectly by theprofile augmentation function 40.FIG. 2 is a block diagram of theMAP server 12 ofFIGS. 1A and 1B according to one embodiment of the present disclosure. As illustrated, theMAP server 12 includes anapplication layer 42, a business logic layer 44, and apersistence layer 46. Theapplication layer 42 includes a user web application 48, a mobile client/server protocol component 50, and one or more data Application Programming Interfaces (APIs) 52. The user web application 48 is preferably implemented in software and operates to provide a web interface for users, such as thesubscriber 24, to access theMAP server 12 via a web browser. The mobile client/server protocol component 50 is preferably implemented in software and operates to provide an interface between theMAP server 12 and the MAP clients 30-1 through 30-N hosted by the mobile devices 18-1 through 18-N.The data APIs 52 enable third-party services, such as the third-party server 26, to access theMAP server 12. - The business logic layer 44 includes a
profile manager 54, alocation manager 56, ahistory manager 58, acrowd analyzer 60, and anaggregation engine 62, each of which is preferably implemented in software. In addition, in the embodiment ofFIG. 1A , the business logic layer 44 also includes theprofile augmentation function 40. Note, however, that in the embodiment ofFIG. 1B , the business logic layer 44 does not include theprofile augmentation function 40. Theprofile manager 54 generally operates to obtain the user profiles of the users 20-1 through 20-N directly or indirectly from the one ormore profile servers 14 and store the user profiles in thepersistence layer 46. Thelocation manager 56 operates to obtain the current locations of the users 20-1 through 20-N including location updates. As discussed below, the current locations of the users 20-1 through 20-N may be obtained directly from the mobile devices 18-1 through 18-N and/or obtained from thelocation server 16. - The
history manager 58 generally operates to maintain a historical record of anonymized user profile data by location. Thecrowd analyzer 60 operates to form crowds of users. In one embodiment, thecrowd analyzer 60 utilizes a spatial crowd formation algorithm. However, the present disclosure is not limited thereto. In addition, thecrowd analyzer 60 may further characterize crowds to reflect degree of fragmentation, best-case and worst-case degree of separation (DOS), and/or degree of bi-directionality of relationships. Still further, thecrowd analyzer 60 may also operate to track crowds. Theaggregation engine 62 generally operates to provide aggregate profile data in response to requests from the mobile devices 18-1 through 18-N, thesubscriber device 22, theprofile server 14, and/or the third-party server 26. The aggregate profile data may be historical aggregate profile data for one or more geographic locations (e.g., one or more POIs) or one or more geographic areas (e.g., one or more AOIs) or aggregate profile data for crowd(s) currently at one or more geographic locations or in one or more geographic areas. - The
persistence layer 46 includes anobject mapping layer 64 and adatastore 66. Theobject mapping layer 64 is preferably implemented in software. Thedatastore 66 is preferably a relational database, which is implemented in a combination of hardware (i.e., physical data storage hardware) and software (i.e., relational database software). In this embodiment, the business logic layer 44 is implemented in an object-oriented programming language such as, for example, Java. As such, theobject mapping layer 64 operates to map objects used in the business logic layer 44 to relational database entities stored in thedatastore 66. Note that, in one embodiment, data is stored in thedatastore 66 in a Resource Description Framework (RDF) compatible format. - In an alternative embodiment, rather than being a relational database, the
datastore 66 may be implemented as an RDF datastore. More specifically, the RDF datastore may be compatible with RDF technology adopted by Semantic Web activities. Namely, the RDF datastore may use the Friend-Of-A-Friend (FOAF) vocabulary for describing people, their social networks, and their interests. In this embodiment, theMAP server 12 may be designed to accept raw FOAF files describing persons, their friends, and their interests. These FOAF files are currently output by some social networking services such as Livejournal and Facebook. TheMAP server 12 may then persist RDF descriptions of the users 20-1 through 20-N as a proprietary extension of the FOAF vocabulary that includes additional properties desired for thesystem 10. -
FIG. 3 illustrates the MAP client 30-1 ofFIGS. 1A and 1B in more detail according to one embodiment of the present disclosure. This discussion is equally applicable to the other MAP clients 30-2 through 30-N. As illustrated, in this embodiment, the MAP client 30-1 includes aMAP access API 68, aMAP middleware component 70, and a mobile client/server protocol component 72. TheMAP access API 68 is implemented in software and provides an interface by which the MAP client 30-1 and the third-party applications 34-1 are enabled to access theMAP server 12. TheMAP middleware component 70 is implemented in software and performs the operations needed for the MAP client 30-1 to operate as an interface between the MAP application 32-1 and the third-party applications 34-1 at the mobile device 18-1 and theMAP server 12. The mobile client/server protocol component 72 enables communication between the MAP client 30-1 and theMAP server 12 via a defined protocol. -
FIG. 4 illustrates the operation of thesystem 10 ofFIGS. 1A and 1B to provide the user profile of the user 20-1 of the mobile device 18-1 to theMAP server 12 according to one embodiment of the present disclosure. This discussion is equally applicable to user profiles of the other users 20-2 through 20-N of the other mobile devices 18-2 through 18-N. First, an authentication process is performed (step 1000). For authentication, in this embodiment, the mobile device 18-1 authenticates with the profile server 14 (step 1000A) and the MAP server 12 (step 1000B). In addition, theMAP server 12 authenticates with the profile server 14 (step 1000C). Preferably, authentication is performed using OpenID or similar technology. However, authentication may alternatively be performed using separate credentials (e.g., username and password) of the user 20-1 for access to theMAP server 12 and theprofile server 14. Assuming that authentication is successful, theprofile server 14 returns an authentication succeeded message to the MAP server 12 (step 1000D), and theprofile server 14 returns an authentication succeeded message to the MAP client 30-1 of the mobile device 18-1 (step 1000E). - At some point after authentication is complete, a user profile process is performed such that a user profile of the user 20-1 is obtained from the
profile server 14 and delivered to the MAP server 12 (step 1002). In this embodiment, the MAP client 30-1 of the mobile device 18-1 sends a profile request to the profile server 14 (step 1002A). In response, theprofile server 14 returns the user profile of the user 20-1 to the mobile device 18-1 (step 1002B). The MAP client 30-1 of the mobile device 18-1 then sends the user profile of the user 20-1 to the MAP server 12 (step 1002C). Note that while in this embodiment the MAP client 30-1 sends the complete user profile of the user 20-1 to theMAP server 12, in an alternative embodiment, the MAP client 30-1 may filter the user profile of the user 20-1 according to criteria specified by the user 20-1. For example, the user profile of the user 20-1 may include demographic information, general interests, music interests, and movie interests, and the user 20-1 may specify that the demographic information or some subset thereof is to be filtered, or removed, before sending the user profile to theMAP server 12. - Upon receiving the user profile of the user 20-1 from the MAP client 30-1 of the mobile device 18-1, the
profile manager 54 of theMAP server 12 processes the user profile (step 1002D). More specifically, in the preferred embodiment, theprofile manager 54 includes social network handlers for the social network services supported by theMAP server 12. Thus, for example, if theMAP server 12 supports user profiles from Facebook®, MySpace®, and LinkedIN®, theprofile manager 54 may include a Facebook handler, a MySpace handler, and a LinkedIN handler. The social network handlers process user profiles to generate user profiles for theMAP server 12 that include lists of keywords for each of a number of profile categories. The profile categories may be the same for each of the social network handlers or different for each of the social network handlers. Thus, for this example assume that the user profile of the user 20-1 is from Facebook. Theprofile manager 54 uses a Facebook handler to process the user profile of the user 20-1 to map the user profile of the user 20-1 from Facebook to a user profile for theMAP server 12 including lists of keywords for a number of predefined profile categories. For example, for the Facebook handler, the profile categories may be a demographic profile category, a social interaction profile category, a general interests profile category, a music interests profile category, and a movie interests profile category. As such, the user profile of the user 20-1 from Facebook may be processed by the Facebook handler of theprofile manager 54 to create a list of keywords such as, for example, liberal, High School Graduate, 35-44, College Graduate, etc. for the demographic profile category, a list of keywords such as Seeking Friendship for the social interaction profile category, a list of keywords such as politics, technology, photography, books, etc. for the general interests profile category, a list of keywords including music genres, artist names, album names, or the like for the music interests profile category, and a list of keywords including movie titles, actor or actress names, director names, movie genres, or the like for the movie interests profile category. In one embodiment, theprofile manager 54 may use natural language processing or semantic analysis. For example, if the Facebook user profile of the user 20-1 states that the user 20-1 is 20 years old, semantic analysis may result in the keyword of 18-24 years old being stored in the user profile of the user 20-1 for theMAP server 12. - After processing the user profile of the user 20-1, the
profile manager 54 of theMAP server 12 stores the resulting user profile for the user 20-1 (step 1002E). More specifically, in one embodiment, theMAP server 12 stores user records for the users 20-1 through 20-N in the datastore 66 (FIG. 2 ). The user profile of the user 20-1 is stored in the user record of the user 20-1. The user record of the user 20-1 includes a unique identifier of the user 20-1, the user profile of the user 20-1, and, as discussed below, a current location of the user 20-1. Note that the user profile of the user 20-1 may be updated as desired. For example, in one embodiment, the user profile of the user 20-1 is updated by repeatingstep 1002 each time the user 20-1 activates the MAP application 32-1. - Note that the while the discussion herein focuses on an embodiment where the user profiles of the users 20-1 through 20-N are obtained from the one or
more profile servers 14, the user profiles of the users 20-1 through 20-N may be obtained in any desired manner. For example, in one alternative embodiment, the user 20-1 may identify one or more favorite websites. Theprofile manager 54 of theMAP server 12 may then crawl the one or more favorite websites of the user 20-1 to obtain keywords appearing in the one or more favorite websites of the user 20-1. These keywords may then be stored as the user profile of the user 20-1. - At some point, a process is performed such that a current location of the mobile device 18-1 and thus a current location of the user 20-1 is obtained by the MAP server 12 (step 1004). In this embodiment, the MAP application 32-1 of the mobile device 18-1 obtains the current location of the mobile device 18-1 from the location function 36-1 of the mobile device 18-1. The MAP application 32-1 then provides the current location of the mobile device 18-1 to the MAP client 30-1, and the MAP client 30-1 then provides the current location of the mobile device 18-1 to the MAP server 12 (
step 1004A). Note thatstep 1004A may be repeated periodically or in response to a change in the current location of the mobile device 18-1 in order for the MAP application 32-1 to provide location updates for the user 20-1 to theMAP server 12. - In response to receiving the current location of the mobile device 18-1, the
location manager 56 of theMAP server 12 stores the current location of the mobile device 18-1 as the current location of the user 20-1 (step 1004B). More specifically, in one embodiment, the current location of the user 20-1 is stored in the user record of the user 20-1 maintained in thedatastore 66 of theMAP server 12. Note that in the preferred embodiment only the current location of the user 20-1 is stored in the user record of the user 20-1. In this manner, theMAP server 12 maintains privacy for the user 20-1 since theMAP server 12 does not maintain a historical record of the location of the user 20-1. As discussed below in detail, historical data maintained by theMAP server 12 is anonymized in order to maintain the privacy of the users 20-1 through 20-N. - In addition to storing the current location of the user 20-1, the
location manager 56 sends the current location of the user 20-1 to the location server 16 (step 1004C). In this embodiment, by providing location updates to thelocation server 16, theMAP server 12 in return receives location updates for the user 20-1 from thelocation server 16. This is particularly beneficial when the mobile device 18-1 does not permit background processes, which is the case for the Apple® iPhone. As such, if the mobile device 18-1 is an Apple® iPhone or similar device that does not permit background processes, the MAP application 32-1 will not be able to provide location updates for the user 20-1 to theMAP server 12 unless the MAP application 32-1 is active. - Therefore, when the MAP application 32-1 is not active, other applications running on the mobile device 18-1 (or some other device of the user 20-1) may directly or indirectly provide location updates to the
location server 16 for the user 20-1. This is illustrated instep 1006 where thelocation server 16 receives a location update for the user 20-1 directly or indirectly from another application running on the mobile device 18-1 or an application running on another device of the user 20-1 (step 1006A). Thelocation server 16 then provides the location update for the user 20-1 to the MAP server 12 (step 1006B). In response, thelocation manager 56 updates and stores the current location of the user 20-1 in the user record of the user 20-1 (step 1006C). In this manner, theMAP server 12 is enabled to obtain location updates for the user 20-1 even when the MAP application 32-1 is not active at the mobile device 18-1. -
FIG. 5 illustrates the operation of thesystem 10 ofFIGS. 1A and 1B to provide the user profile of the user 20-1 of the mobile device 18-1 according to another embodiment of the present disclosure. This discussion is equally applicable to user profiles of the other users 20-2 through 20-N of the other mobile devices 18-2 through 18-N. First, an authentication process is performed (step 1100). For authentication, in this embodiment, the mobile device 18-1 authenticates with the MAP server 12 (step 1100A), and theMAP server 12 authenticates with the profile server 14 (step 1100B). Preferably, authentication is performed using OpenID or similar technology. However, authentication may alternatively be performed using separate credentials (e.g., username and password) of the user 20-1 for access to theMAP server 12 and theprofile server 14. Assuming that authentication is successful, theprofile server 14 returns an authentication succeeded message to the MAP server 12 (step 1100C), and theMAP server 12 returns an authentication succeeded message to the MAP client 30-1 of the mobile device 18-1 (step 1100D). - At some point after authentication is complete, a user profile process is performed such that a user profile of the user 20-1 is obtained from the
profile server 14 and delivered to the MAP server 12 (step 1102). In this embodiment, theprofile manager 54 of theMAP server 12 sends a profile request to the profile server 14 (step 1102A). In response, theprofile server 14 returns the user profile of the user 20-1 to theprofile manager 54 of the MAP server 12 (step 1102B). Note that while in this embodiment theprofile server 14 returns the complete user profile of the user 20-1 to theMAP server 12, in an alternative embodiment, theprofile server 14 may return a filtered version of the user profile of the user 20-1 to theMAP server 12. Theprofile server 14 may filter the user profile of the user 20-1 according to criteria specified by the user 20-1. For example, the user profile of the user 20-1 may include demographic information, general interests, music interests, and movie interests, and the user 20-1 may specify that the demographic information or some subset thereof is to be filtered, or removed, before sending the user profile to theMAP server 12. - Upon receiving the user profile of the user 20-1, the
profile manager 54 of theMAP server 12 processes the user profile (step 1102C). More specifically, as discussed above, in the preferred embodiment, theprofile manager 54 includes social network handlers for the social network services supported by theMAP server 12. The social network handlers process user profiles to generate user profiles for theMAP server 12 that include lists of keywords for each of a number of profile categories. The profile categories may be the same for each of the social network handlers or different for each of the social network handlers. - After processing the user profile of the user 20-1, the
profile manager 54 of theMAP server 12 stores the resulting user profile for the user 20-1 (step 1102D). More specifically, in one embodiment, theMAP server 12 stores user records for the users 20-1 through 20-N in the datastore 66 (FIG. 2 ). The user profile of the user 20-1 is stored in the user record of the user 20-1. The user record of the user 20-1 includes a unique identifier of the user 20-1, the user profile of the user 20-1, and, as discussed below, a current location of the user 20-1. Note that the user profile of the user 20-1 may be updated as desired. For example, in one embodiment, the user profile of the user 20-1 is updated by repeatingstep 1102 each time the user 20-1 activates the MAP application 32-1. - Note that while the discussion herein focuses on an embodiment where the user profiles of the users 20-1 through 20-N are obtained from the one or
more profile servers 14, the user profiles of the users 20-1 through 20-N may be obtained in any desired manner. For example, in one alternative embodiment, the user 20-1 may identify one or more favorite websites. Theprofile manager 54 of theMAP server 12 may then crawl the one or more favorite websites of the user 20-1 to obtain keywords appearing in the one or more favorite websites of the user 20-1. These keywords may then be stored as the user profile of the user 20-1. - At some point, a process is performed such that a current location of the mobile device 18-1 and thus a current location of the user 20-1 is obtained by the MAP server 12 (step 1104). In this embodiment, the MAP application 32-1 of the mobile device 18-1 obtains the current location of the mobile device 18-1 from the location function 36-1 of the mobile device 18-1. The MAP application 32-1 then provides the current location of the user 20-1 of the mobile device 18-1 to the location server 16 (
step 1104A). Note thatstep 1104A may be repeated periodically or in response to changes in the location of the mobile device 18-1 in order to provide location updates for the user 20-1 to theMAP server 12. Thelocation server 16 then provides the current location of the user 20-1 to the MAP server 12 (step 1104B). Thelocation server 16 may provide the current location of the user 20-1 to theMAP server 12 automatically in response to receiving the current location of the user 20-1 from the mobile device 18-1 or in response to a request from theMAP server 12. - In response to receiving the current location of the mobile device 18-1, the
location manager 56 of theMAP server 12 stores the current location of the mobile device 18-1 as the current location of the user 20-1 (step 1104C). More specifically, in one embodiment, the current location of the user 20-1 is stored in the user record of the user 20-1 maintained in thedatastore 66 of theMAP server 12. Note that in the preferred embodiment only the current location of the user 20-1 is stored in the user record of the user 20-1. In this manner, theMAP server 12 maintains privacy for the user 20-1 since theMAP server 12 does not maintain a historical record of the location of the user 20-1. As discussed below in detail, historical data maintained by theMAP server 12 is anonymized in order to maintain the privacy of the users 20-1 through 20-N. - As discussed above, the use of the
location server 16 is particularly beneficial when the mobile device 18-1 does not permit background processes, which is the case for the Apple® iPhone. As such, if the mobile device 18-1 is an Apple® iPhone or similar device that does not permit background processes, the MAP application 32-1 will not provide location updates for the user 20-1 to thelocation server 16 unless the MAP application 32-1 is active. However, other applications running on the mobile device 18-1 (or some other device of the user 20-1) may provide location updates to thelocation server 16 for the user 20-1 when the MAP application 32-1 is not active. This is illustrated instep 1106 where thelocation server 16 receives a location update for the user 20-1 from another application running on the mobile device 18-1 or an application running on another device of the user 20-1 (step 1106A). Thelocation server 16 then provides the location update for the user 20-1 to the MAP server 12 (step 1106B). In response, thelocation manager 56 updates and stores the current location of the user 20-1 in the user record of the user 20-1 (step 1106C). In this manner, theMAP server 12 is enabled to obtain location updates for the user 20-1 even when the MAP application 32-1 is not active at the mobile device 18-1. - Using the current locations of the users 20-1 through 20-N and the user profiles of the users 20-1 through 20-N, the
MAP server 12 can provide a number of features. A first feature that may be provided by theMAP server 12 is historical storage of anonymized user profile data by location. This historical storage of anonymized user profile data by location is performed by thehistory manager 58 of theMAP server 12. More specifically, as illustrated inFIG. 6 , in the preferred embodiment, thehistory manager 58 maintains lists of users located in a number of geographic regions, or “location buckets.” Preferably, the location buckets are defined by floor(latitude, longitude) to a desired resolution. The higher the resolution, the smaller the size of the location buckets. For example, in one embodiment, the location buckets are defined by floor(latitude, longitude) to a resolution of 1/10,000th of a degree such that the lower left-hand corners of the squares illustrated inFIG. 6 are defined by the floor(latitude, longitude) values at a resolution of 1/10,000th of a degree. In the example ofFIG. 6 , users are represented as dots, andlocation buckets 74 through 90 have lists of 1, 3, 2, 1, 1, 2, 1, 2, and 3 users, respectively. - As discussed below in detail, at a predetermined time interval such as, for example, 15 minutes, the
history manager 58 makes a copy of the lists of users in the location buckets, anonymizes the user profiles of the users in the lists to provide anonymized user profile data for the corresponding location buckets, and stores the anonymized user profile data in a number of history objects. In one embodiment, a history object is stored for each location bucket having at least one user. In another embodiment, a quadtree algorithm is used to efficiently create history objects for geographic regions (i.e., groups of one or more adjoining location buckets). -
FIG. 7 graphically illustrates a scenario where a user moves from one location bucket to another, namely, from thelocation bucket 76 to thelocation bucket 78. As discussed below in detail, assuming that the movement occurs during the time interval between persistence of the historical data by thehistory manager 58, the user is included on both the list for thelocation bucket 76 and the list for thelocation bucket 78. However, the user is flagged or otherwise marked as inactive for thelocation bucket 76 and active for thelocation bucket 78. As discussed below, after making a copy of the lists for the location buckets to be used to persist the historical data, users flagged as inactive are removed from the lists of users for the location buckets. Thus, in sum, once a user moves from thelocation bucket 76 to thelocation bucket 78, the user remains in the list for thelocation bucket 76 until the predetermined time interval has expired and the anonymized user profile data is persisted. The user is then removed from the list for thelocation bucket 76. -
FIG. 8 is a flow chart illustrating the operation of a foreground “bucketization” process performed by thehistory manager 58 to maintain the lists of users for location buckets according to one embodiment of the present disclosure. First, thehistory manager 58 receives a location update for a user (step 1200). For this discussion, assume that the location update is received for the user 20-1. Thehistory manager 58 then determines a location bucket corresponding to the updated location (i.e., the current location) of the user 20-1 (step 1202). In the preferred embodiment, the location of the user 20-1 is expressed as latitude and longitude coordinates, and thehistory manager 58 determines the location bucket by determining floor values of the latitude and longitude coordinates, which can be written as floor(latitude, longitude) at a desired resolution. As an example, if the latitude and longitude coordinates for the location of the user 20-1 are 32.24267381553987 and −111.9249213502935, respectively, and the floor values are to be computed to a resolution of 1/10,000th of a degree, then the floor values for the latitude and longitude coordinates are 32.2426 and −111.9249. The floor values for the latitude and longitude coordinates correspond to a particular location bucket. - After determining the location bucket for the location of the user 20-1, the
history manager 58 determines whether the user 20-1 is new to the location bucket (step 1204). In other words, thehistory manager 58 determines whether the user 20-1 is already on the list of users for the location bucket. If the user 20-1 is new to the location bucket, thehistory manager 58 creates an entry for the user 20-1 in the list of users for the location bucket (step 1206). Returning to step 1204, if the user 20-1 is not new to the location bucket, thehistory manager 58 updates the entry for the user 20-1 in the list of users for the location bucket (step 1208). At this point, whether proceeding fromstep - The
history manager 58 then determines whether the user 20-1 has moved from another location bucket (step 1212). More specifically, thehistory manager 58 determines whether the user 20-1 is included in the list of users for another location bucket and is currently flagged as active in that list. If the user 20-1 has not moved from another location bucket, the process proceeds to step 1216. If the user 20-1 has moved from another location bucket, thehistory manager 58 flags the user 20-1 as inactive in the list of users for the other location bucket from which the user 20-1 has moved (step 1214). - At this point, whether proceeding from
step history manager 58 determines whether it is time to persist (step 1216). More specifically, as mentioned above, thehistory manager 58 operates to persist history objects at a predetermined time interval such as, for example, every 15 minutes. Thus, thehistory manager 58 determines that it is time to persist if the predetermined time interval has expired. If it is not time to persist, the process returns to step 1200 and is repeated for a next received location update, which will typically be for another user. If it is time to persist, thehistory manager 58 creates a copy of the lists of users for the location buckets and passes the copy of the lists to an anonymization and storage process (step 1218). In this embodiment, the anonymization and storage process is a separate process performed by thehistory manager 58. Thehistory manager 58 then removes inactive users from the lists of users for the location buckets (step 1220). The process then returns to step 1200 and is repeated for a next received location update, which will typically be for another user. -
FIG. 9 is a flow chart illustrating the anonymization and storage process performed by thehistory manager 58 at the predetermined time interval according to one embodiment of the present disclosure. First, the anonymization and storage process receives the copy of the lists of users for the location buckets passed to the anonymization and storage process by the bucketization process ofFIG. 8 (step 1300). Next, anonymization is performed for each of the location buckets having at least one user in order to provide anonymized user profile data for the location buckets (step 1302). Anonymization prevents connecting information stored in the history objects stored by thehistory manager 58 back to the users 20-1 through 20-N or at least substantially increases a difficulty of connecting information stored in the history objects stored by thehistory manager 58 back to the users 20-1 through 20-N. Lastly, the anonymized user profile data for the location buckets is stored in a number of history objects (step 1304). In one embodiment, a separate history object is stored for each of the location buckets, where the history object of a location bucket includes the anonymized user profile data for the location bucket. In another embodiment, as discussed below, a quadtree algorithm is used to efficiently store the anonymized user profile data in a number of history objects such that each history object stores the anonymized user profile data for one or more location buckets. -
FIG. 10 graphically illustrates one embodiment of the anonymization process ofstep 1302 ofFIG. 9 . In this embodiment, anonymization is performed by creating anonymous user records for the users in the lists of users for the location buckets. The anonymous user records are not connected back to the users 20-1 through 20-N. More specifically, as illustrated inFIG. 10 , each user in the lists of users for the location buckets has acorresponding user record 92. Theuser record 92 includes a unique user identifier (ID) for the user, the current location of the user, and the user profile of the user. The user profile includes keywords for each of a number of profile categories, which are stored in corresponding profile category records 94-1 through 94-M. Each of the profile category records 94-1 through 94-M includes a user ID for the corresponding user which may be the same user ID used in theuser record 92, a category ID, and a list of keywords for the profile category. - For anonymization, an
anonymous user record 96 is created from theuser record 92. In theanonymous user record 96, the user ID is replaced with a new user ID that is not connected back to the user, which is also referred to herein as an anonymous user ID. This new user ID is different than any other user ID used for anonymous user records created from the user record of the user for any previous or subsequent time periods. In this manner, anonymous user records for a single user created over time cannot be linked to one another. - In addition, anonymous profile category records 98-1 through 98-M are created for the profile category records 94-1 through 94-M. In the anonymous profile category records 98-1 through 98-M, the user ID is replaced with a new user ID, which may be the same new user ID included in the
anonymous user record 96. The anonymous profile category records 98-1 through 98-M include the same category IDs and lists of keywords as the corresponding profile category records 94-1 through 94-M. Note that the location of the user is not stored in theanonymous user record 96. With respect to location, it is sufficient that theanonymous user record 96 is linked to a location bucket. - In another embodiment, the
history manager 58 performs anonymization in a manner similar to that described above with respect toFIG. 10 . However, in this embodiment, the profile category records for the group of users in a location bucket, or the group of users in a number of location buckets representing a node in a quadtree data structure (see below), may be selectively randomized among the anonymous user records of those users. In other words, each anonymous user record would have a user profile including a selectively randomized set of profile category records (including keywords) from a cumulative list of profile category records for all of the users in the group. - In yet another embodiment, rather than creating
anonymous user records 96 for the users in the lists maintained for the location buckets, thehistory manager 58 may perform anonymization by storing an aggregate user profile for each location bucket, or each group of location buckets representing a node in a quadtree data structure (see below). The aggregate user profile may include a list of all keywords and potentially the number of occurrences of each keyword in the user profiles of the corresponding group of users. In this manner, the data stored by thehistory manager 58 is not connected back to the users 20-1 through 20-N. -
FIG. 11 is a flow chart illustrating the storing step (step 1304) ofFIG. 9 in more detail according to one embodiment of the present disclosure. First, thehistory manager 58 processes the location buckets using a quadtree algorithm to produce a quadtree data structure, where each node of the quadtree data structure includes one or more of the location buckets having a combined number of users that is at most a predefined maximum number of users (step 1400). Thehistory manager 58 then stores a history object for each node in the quadtree data structure having at least one user (step 1402). - Each history object includes location information, timing information, data, and quadtree data structure information. The location information included in the history object defines a combined geographic area of the location bucket(s) forming the corresponding node of the quadtree data structure. For example, the location information may be latitude and longitude coordinates for a northeast corner of the combined geographic area of the node of the quadtree data structure and a southwest corner of the combined geographic area for the node of the quadtree data structure. The timing information includes information defining a time window for the history object, which may be, for example, a start time for the corresponding time interval and an end time for the corresponding time interval. The data includes the anonymized user profile data for the users in the list(s) maintained for the location bucket(s) forming the node of the quadtree data structure for which the history object is stored. In addition, the data may include a total number of users in the location bucket(s) forming the node of the quadtree data structure. Lastly, the quadtree data structure information includes information defining a quadtree depth of the node in the quadtree data structure.
-
FIG. 12 is a flow chart illustrating a quadtree algorithm that may be used to process the location buckets to form the quadtree data structure instep 1400 ofFIG. 11 according to one embodiment of the present disclosure. Initially, a geographic area served by theMAP server 12 is divided into a number of geographic regions, each including multiple location buckets. These geographic regions are also referred to herein as base quadtree regions. The geographic area served by theMAP server 12 may be, for example, a city, a state, a country, or the like. Further, the geographic area may be the only geographic area served by theMAP server 12 or one of a number of geographic areas served by theMAP server 12. Preferably, the base quadtree regions have a size of 2n×2n location buckets, where n is an integer greater than or equal to 1. - In order to form the quadtree data structure, the
history manager 58 determines whether there are any more base quadtree regions to process (step 1500). If there are more base quadtree regions to process, thehistory manager 58 sets a current node to the next base quadtree region to process, which for the first iteration is the first base quadtree region (step 1502). Thehistory manager 58 then determines whether the number of users in the current node is greater than a predefined maximum number of users and whether a current quadtree depth is less than a maximum quadtree depth (step 1504). In one embodiment, the maximum quadtree depth may be reached when the current node corresponds to a single location bucket. However, the maximum quadtree depth may be set such that the maximum quadtree depth is reached before the current node reaches a single location bucket. - If the number of users in the current node is greater than the predefined maximum number of users and the current quadtree depth is less than a maximum quadtree depth, the
history manager 58 creates a number of child nodes for the current node (step 1506). More specifically, thehistory manager 58 creates a child node for each quadrant of the current node. The users in the current node are then assigned to the appropriate child nodes based on the location buckets in which the users are located (step 1508), and the current node is then set to the first child node (step 1510). At this point, the process returns to step 1504 and is repeated. - Once the number of users in the current node is not greater than the predefined maximum number of users or the maximum quadtree depth has been reached, the
history manager 58 determines whether the current node has any more sibling nodes (step 1512). Sibling nodes are child nodes of the same parent node. If so, thehistory manager 58 sets the current node to the next sibling node of the current node (step 1514), and the process returns to step 1504 and is repeated. Once there are no more sibling nodes to process, thehistory manager 58 determines whether the current node has a parent node (step 1516). If so, since the parent node has already been processed, thehistory manager 58 determines whether the parent node has any sibling nodes that need to be processed (step 1518). If the parent node has any sibling nodes that need to be processed, thehistory manager 58 sets the next sibling node of the parent node to be processed as the current node (step 1520). From this point, the process returns to step 1504 and is repeated. Returning to step 1516, if the current node does not have a parent node, the process returns to step 1500 and is repeated until there are no more base quadtree regions to process. Once there are no more base quadtree regions to process, the finished quadtree data structure is returned to the process ofFIG. 11 such that thehistory manager 58 can then store the history objects for nodes in the quadtree data structure having at least one user (step 1522). -
FIGS. 13A through 13E graphically illustrate the process ofFIG. 12 for the generation of the quadtree data structure for one exemplarybase quadtree region 100.FIG. 13A illustrates thebase quadtree region 100. As illustrated, thebase quadtree region 100 is an 8×8 square of location buckets, where each of the small squares represents a location bucket. First, thehistory manager 58 determines whether the number of users in thebase quadtree region 100 is greater than the predetermined maximum number of users. In this example, the predetermined maximum number of users is 3. Since the number of users in thebase quadtree region 100 is greater than 3, thehistory manager 58 divides thebase quadtree region 100 into four child nodes 102-1 through 102-4, as illustrated inFIG. 13B . - Next, the
history manager 58 determines whether the number of users in the child node 102-1 is greater than the predetermined maximum, which again for this example is 3. Since the number of users in the child node 102-1 is greater than 3, thehistory manager 58 divides the child node 102-1 into four child nodes 104-1 through 104-4, as illustrated inFIG. 13C . The child nodes 104-1 through 104-4 are children of the child node 102-1. Thehistory manager 58 then determines whether the number of users in the child node 104-1 is greater than the predetermined maximum number of users, which again is 3. Since there are more than 3 users in the child node 104-1, thehistory manager 58 further divides the child node 104-1 into four child nodes 106-1 through 106-N, as illustrated inFIG. 13D . - The
history manager 58 then determines whether the number of users in the child node 106-1 is greater than the predetermined maximum number of users, which again is 3. Since the number of users in the child node 106-1 is not greater than the predetermined maximum number of users, the child node 106-1 is identified as a node for the finished quadtree data structure, and thehistory manager 58 proceeds to process the sibling nodes of the child node 106-1, which are the child nodes 106-2 through 106-4. Since the number of users in each of the child nodes 106-2 through 106-4 is less than the predetermined maximum number of users, the child nodes 106-2 through 106-4 are also identified as nodes for the finished quadtree data structure. - Once the
history manager 58 has finished processing the child nodes 106-1 through 106-4, thehistory manager 58 identifies the parent node of the child nodes 106-1 through 106-4, which in this case is the child node 104-1. Thehistory manager 58 then processes the sibling nodes of the child node 104-1, which are the child nodes 104-2 through 104-4. In this example, the number of users in each of the child nodes 104-2 through 104-4 is less than the predetermined maximum number of users. As such, the child nodes 104-2 through 104-4 are identified as nodes for the finished quadtree data structure. - Once the
history manager 58 has finished processing the child nodes 104-1 through 104-4, thehistory manager 58 identifies the parent node of the child nodes 104-1 through 104-4, which in this case is the child node 102-1. Thehistory manager 58 then processes the sibling nodes of the child node 102-1, which are the child nodes 102-2 through 102-4. More specifically, thehistory manager 58 determines that the child node 102-2 includes more than the predetermined maximum number of users and, as such, divides the child node 102-2 into four child nodes 108-1 through 108-4, as illustrated inFIG. 13E . Because the number of users in each of the child nodes 108-1 through 108-4 is not greater than the predetermined maximum number of users, the child nodes 108-1 through 108-4 are identified as nodes for the finished quadtree data structure. Then, thehistory manager 58 proceeds to process the child nodes 102-3 and 102-4. Since the number of users in each of the child nodes 102-3 and 102-4 is not greater than the predetermined maximum number of users, the child nodes 102-3 and 102-4 are identified as nodes for the finished quadtree data structure. Thus, at completion, the quadtree data structure for thebase quadtree region 100 includes the child nodes 106-1 through 106-4, the child nodes 104-2 through 104-4, the child nodes 108-1 through 108-4, and the child nodes 102-3 and 102-4, as illustrated inFIG. 13E . - As discussed above, the
history manager 58 stores a history object for each of the nodes in the quadtree data structure including at least one user. As such, in this example, thehistory manager 58 stores history objects for the child nodes 106-2 and 106-3, the child nodes 104-2 and 104-4, the child nodes 108-1 and 108-4, and the child node 102-3. However, no history objects are stored for the nodes that do not have any users (i.e., the child nodes 106-1 and 106-4, the child node 104-3, the child nodes 108-2 and 108-3, and the child node 102-4). -
FIG. 14 illustrates the operation of thesystem 10 ofFIGS. 1A and 1B wherein a mobile device is enabled to request and receive historical data from theMAP server 12 according to one embodiment of the present disclosure. Note that theMAP server 12 may operate in a similar manner to process requests for historical data from other devices such as thesubscriber device 22, the third-party server 26, and/or theprofile server 14. As illustrated, in this embodiment, the MAP application 32-1 of the mobile device 18-1 sends a historical request to the MAP client 30-1 of the mobile device 18-1 (step 1600). In one embodiment, the historical request identifies either a POI or an AOI and a time window. A POI is a geographic point whereas an AOI is a geographic area. In one embodiment, the historical request is for a POI and a time window, where the POI is a POI corresponding to the current location of the user 20-1, a POI selected from a list of POIs defined by the user 20-1 of the mobile device 18-1, a POI selected from a list of POIs defined by the MAP application 32-1 or theMAP server 12, a POI selected by the user 20-1 from a map, a POI implicitly defined via a separate application (e.g., POI is implicitly defined as the location of the nearest Starbucks coffee house in response to the user 20-1 performing a Google search for “Starbucks”), or the like. If the POI is selected from a list of POIs, the list of POIs may include static POIs which may be defined by street addresses or latitude and longitude coordinates, dynamic POIs which may be defined as the current locations of one or more friends of the user 20-1, or both. - In another embodiment, the historical request is for an AOI and a time window, where the AOI may be an AOI of a geographic area of a predefined shape and size centered at the current location of the user 20-1, an AOI selected from a list of AOIs defined by the user 20-1, an AOI selected from a list of AOIs defined by the MAP application 32-1 or the
MAP server 12, an AOI selected by the user 20-1 from a map, an AOI implicitly defined via a separate application (e.g., AOI is implicitly defined as an area of a predefined shape and size centered at the location of the nearest Starbucks coffee house in response to the user 20-1 performing a Google search for “Starbucks”), or the like. If the AOI is selected from a list of AOIs, the list of AOIs may include static AOIs, dynamic AOIs which may be defined as areas of a predefined shape and size centered at the current locations of one or more friends of the user 20-1, or both. Note that the POI or AOI of the historical request may be selected by the user 20-1 via the MAP application 32-1. In yet another embodiment, the MAP application 32-1 automatically uses the current location of the user 20-1 as the POI or as a center point for an AOI of a predefined shape and size. - The time window for the historical request may be relative to the current time. For example, the time window may be the last hour, the last day, the last week, the last month, or the like. Alternatively, the time window may be an arbitrary time window selected by the user 20-1 such as, for example, yesterday from 7 pm-9 pm, last Friday, last week, or the like. Note that while in this example the historical request includes a single POI or AOI and a single time window, the historical request may include multiple POIs or AOIs and/or multiple time windows.
- In one embodiment, the historical request is made in response to user input from the user 20-1 of the mobile device 18-1. For instance, in one embodiment, the user 20-1 selects either a POI or an AOI and a time window and then instructs the MAP application 32-1 to make the historical request by, for example, selecting a corresponding button on a graphical user interface. In another embodiment, the historical request is made automatically in response to some event such as, for example, opening the MAP application 32-1.
- Upon receiving the historical request from the MAP application 32-1, the MAP client 30-1 forwards the historical request to the MAP server 12 (step 1602). Note that the MAP client 30-1 may, in some cases, process the historical request from the MAP application 32-1 before forwarding the historical request to the
MAP server 12. For example, if the historical request from the MAP application 32-1 is for multiple POIs/AOIs and/or for multiple time windows, the MAP client 30-1 may process the historical request from the MAP application 32-1 to produce multiple historical requests to be sent to theMAP server 12. For instance, a separate historical request may be produced for each POI/AOI and time window combination. However, for this discussion, the historical request is for a single POI or AOI for a single time window. - Upon receiving the historical request from the MAP client 30-1, the
MAP server 12 processes the historical request (step 1604). More specifically, the historical request is processed by thehistory manager 58 of theMAP server 12. First, thehistory manager 58 obtains history objects that are relevant to the historical request from thedatastore 66 of theMAP server 12. The relevant history objects are those recorded for locations relevant to the POI or AOI and the time window for the historical request. Thehistory manager 58 then processes the relevant history objects to provide historical aggregate profile data for the POI or AOI. In this embodiment, the historical aggregate profile data is based on the user profiles of the anonymous user records in the relevant history objects as compared to the user profile of the user 20-1 or a select subset thereof. In another embodiment, the historical aggregate profile data is based on the user profiles of the anonymous user records in the relevant history objects as compared to a target user profile defined or otherwise specified by the user 20-1 or as compared to one another. Once theMAP server 12 has processed the historical request, theMAP server 12 returns the resulting historical aggregate profile data to the MAP client 30-1 (step 1606). Upon receiving the historical aggregate profile data, the MAP client 30-1 passes the historical aggregate profile data to the MAP application 32-1 (step 1608). The MAP application 32-1 then presents the historical aggregate profile data to the user 20-1 (step 1610). -
FIG. 15 begins a discussion of the operation of thecrowd analyzer 60 to form crowds of users according to one embodiment of the present disclosure. Specifically,FIG. 15 is a flow chart for a spatial crowd formation process according to one embodiment of the present disclosure. Note that, in one embodiment, this process is performed in response to a request for crowd data for a POI or an AOI. In another embodiment, this process may be performed proactively by thecrowd analyzer 60 as, for example, a background process. - First, the
crowd analyzer 60 establishes a bounding box for the crowd formation process (step 1700). Note that while a bounding box is used in this example, other geographic shapes may be used to define a bounding region for the crowd formation process (e.g., a bounding circle). In one embodiment, if crowd formation is performed in response to a specific request, the bounding box is established based on the POI or the AOI of the request. If the request is for a POI, then the bounding box is a geographic area of a predetermined size centered at the POI. If the request is for an AOI, the bounding box is the AOI. Alternatively, if the crowd formation process is performed proactively, the bounding box is a bounding box of a predefined size. - The
crowd analyzer 60 then creates a crowd for each individual user in the bounding box (step 1702). More specifically, thecrowd analyzer 60 queries thedatastore 66 of theMAP server 12 to identify users currently located within the bounding box. Then, a crowd of one user is created for each user currently located within the bounding box. Next, thecrowd analyzer 60 determines the two closest crowds in the bounding box (step 1704) and determines a distance between the two crowds (step 1706). The distance between the two crowds is a distance between crowd centers of the two crowds. Note that the crowd center of a crowd of one is the current location of the user in the crowd. Thecrowd analyzer 60 then determines whether the distance between the two crowds is less than an optimal inclusion distance (step 1708). In this embodiment, the optimal inclusion distance is a predefined static distance. If the distance between the two crowds is less than the optimal inclusion distance, thecrowd analyzer 60 combines the two crowds (step 1710) and computes a new crowd center for the resulting crowd (step 1712). The crowd center may be computed based on the current locations of the users in the crowd using a center of mass algorithm. At this point the process returns to step 1704 and is repeated until the distance between the two closest crowds is not less than the optimal inclusion distance. At that point, thecrowd analyzer 60 discards any crowds with less than three users (step 1714). Note that throughout this disclosure crowds are only maintained if the crowds include three or more users. However, while three users is the preferred minimum number of users in a crowd, the present disclosure is not limited thereto. The minimum number of users in a crowd may be defined as any number greater than or equal to two users. -
FIGS. 16A through 16D graphically illustrate the crowd formation process ofFIG. 15 for anexemplary bounding box 110. InFIGS. 16A through 16D , crowds are noted by dashed circles, and the crowd centers are noted by cross-hairs (+). As illustrated inFIG. 16A , initially, thecrowd analyzer 60 createscrowds 112 through 120 for the users in the geographic area, where, at this point, each of thecrowds 112 through 120 includes one user. The current locations of the users are the crowd centers of thecrowds 112 through 120. Next, thecrowd analyzer 60 determines the two closest crowds and a distance between the two closest crowds. In this example, at this point, the two closest crowds arecrowds closest crowds closest crowds crowd 116 intocrowd 114, and a new crowd center (+) is computed for thecrowd 114, as illustrated inFIG. 16B . Next, thecrowd analyzer 60 again determines the two closest crowds, which are now crowds 112 and 114. Thecrowd analyzer 60 then determines a distance between thecrowds crowd analyzer 60 combines the twocrowds crowd 112 into thecrowd 114, and a new crowd center (+) is computed for thecrowd 114, as illustrated inFIG. 16C . At this point, there are no more crowds separated by less than the optimal inclusion distance. As such, thecrowd analyzer 60 discards crowds having less than three users, which in this example arecrowds crowd 114 has been formed with three users, as illustrated inFIG. 16D . -
FIGS. 17A through 17D illustrate a flow chart for a spatial crowd formation process according to another embodiment of the present disclosure. In this embodiment, the spatial crowd formation process is triggered in response to receiving a location update for one of the users 20-1 through 20-N and is preferably repeated for each location update received for the users 20-1 through 20-N. As such, first, thecrowd analyzer 60 receives a location update, or a new location, for a user (step 1800). Assume that, for this example, the location update is received for the user 20-1. In response, thecrowd analyzer 60 retrieves an old location of the user 20-1, if any (step 1802). The old location is the current location of the user 20-1 prior to receiving the new location. Thecrowd analyzer 60 then creates a new bounding box of a predetermined size centered at the new location of the user 20-1 (step 1804) and an old bounding box of a predetermined size centered at the old location of the user 20-1, if any (step 1806). The predetermined size of the new and old bounding boxes may be any desired size. As one example, the predetermined size of the new and old bounding boxes is 40 meters by 40 meters. Note that if the user 20-1 does not have an old location (i.e., the location received instep 1800 is the first location received for the user 20-1), then the old bounding box is essentially null. Also note that while bounding “boxes” are used in this example, the bounding areas may be of any desired shape. - Next, the
crowd analyzer 60 determines whether the new and old bounding boxes overlap (step 1808). If so, thecrowd analyzer 60 creates a bounding box encompassing the new and old bounding boxes (step 1810). For example, if the new and old bounding boxes are 40×40 meter regions and a 1×1 meter square at the northeast corner of the new bounding box overlaps a 1×1 meter square at the southwest corner of the old bounding box, thecrowd analyzer 60 may create a 79×79 meter square bounding box encompassing both the new and old bounding boxes. - The
crowd analyzer 60 then determines the individual users and crowds relevant to the bounding box created in step 1810 (step 1812). The crowds relevant to the bounding box are crowds that are within or overlap the bounding box (e.g., have at least one user located within the bounding box). The individual users relevant to the bounding box are users that are currently located within the bounding box and not already part of a crowd. Next, thecrowd analyzer 60 computes an optimal inclusion distance for individual users based on user density within the bounding box (step 1814). More specifically, in one embodiment, the optimal inclusion distance for individuals, which is also referred to herein as an initial optimal inclusion distance, is set according to the following equation: -
- where a is a number between 0 and 1, ABoundingBox is an area of the bounding box, and number_of_users is the total number of users in the bounding box. The total number of users in the bounding box includes both individual users that are not already in a crowd and users that are already in a crowd. In one embodiment, a is ⅔.
- The
crowd analyzer 60 then creates a crowd for each individual user within the bounding box that is not already included in a crowd and sets the optimal inclusion distance for the crowds to the initial optimal inclusion distance (step 1816). At this point, the process proceeds toFIG. 17B where thecrowd analyzer 60 analyzes the crowds relevant to the bounding box to determine whether any of the crowd members (i.e., users in the crowds) violate the optimal inclusion distance of their crowds (step 1818). Any crowd member that violates the optimal inclusion distance of his or her crowd is then removed from that crowd (step 1820). Thecrowd analyzer 60 then creates a crowd of one user for each of the users removed from their crowds instep 1820 and sets the optimal inclusion distance for the newly created crowds to the initial optimal inclusion distance (step 1822). - Next, the
crowd analyzer 60 determines the two closest crowds for the bounding box (step 1824) and a distance between the two closest crowds (step 1826). The distance between the two closest crowds is the distance between the crowd centers of the two closest crowds. Thecrowd analyzer 60 then determines whether the distance between the two closest crowds is less than the optimal inclusion distance of a larger of the two closest crowds (step 1828). If the two closest crowds are of the same size (i.e., have the same number of users), then the optimal inclusion distance of either of the two closest crowds may be used. Alternatively, if the two closest crowds are of the same size, the optimal inclusion distances of both of the two closest crowds may be used such that thecrowd analyzer 60 determines whether the distance between the two closest crowds is less than the optimal inclusion distances of both of the two closest crowds. As another alternative, if the two closest crowds are of the same size, thecrowd analyzer 60 may compare the distance between the two closest crowds to an average of the optimal inclusion distances of the two closest crowds. - If the distance between the two closest crowds is not less than the optimal inclusion distance, the process proceeds to step 1838. If the distance between the two closest crowds is less than the optimal inclusion distance, the two closest crowds are combined or merged (step 1830), and a new crowd center for the resulting crowd is computed (step 1832). Again, a center of mass algorithm may be used to compute the crowd center of a crowd. In addition, a new optimal inclusion distance for the resulting crowd is computed (step 1834). In one embodiment, the new optimal inclusion distance for the resulting crowd is computed as:
-
- where n is the number of users in the crowd and di is a distance between the ith user and the crowd center. In other words, the new optimal inclusion distance is computed as the average of the initial optimal inclusion distance and the distances between the users in the crowd and the crowd center plus one standard deviation.
- At this point, the
crowd analyzer 60 determines whether a maximum number of iterations have been performed (step 1836). The maximum number of iterations is a predefined number that ensures that the crowd formation process does not indefinitely loop oversteps 1818 through 1834 or loop oversteps 1818 through 1834 more than a desired maximum number of times. If the maximum number of iterations has not been reached, the process returns to step 1818 and is repeated until either the distance between the two closest crowds is not less than the optimal inclusion distance of the larger crowd or the maximum number of iterations has been reached. At that point, thecrowd analyzer 60 discards crowds with less than three users, or members (step 1838) and the process ends. - Returning to step 1808 in
FIG. 17A , if the new and old bounding boxes do not overlap, the process proceeds toFIG. 17C and the bounding box to be processed is set to the old bounding box (step 1840). In general, thecrowd analyzer 60 then processes the old bounding box in much the same manner as described above with respect tosteps 1812 through 1838. More specifically, thecrowd analyzer 60 determines the individual users and crowds relevant to the bounding box (step 1842). The crowds relevant to the bounding box are crowds that are within or overlap the bounding box (e.g., have at least one user located within the bounding box). The individual users relevant to the bounding box are users that are currently located within the bounding box and not already part of a crowd. Next, thecrowd analyzer 60 computes an optimal inclusion distance for individual users based on user density within the bounding box (step 1844). More specifically, in one embodiment, the optimal inclusion distance for individuals, which is also referred to herein as an initial optimal inclusion distance, is set according to the following equation: -
- where a is a number between 0 and 1, ABoundingBox is an area of the bounding box, and number_of_users is the total number of users in the bounding box. The total number of users in the bounding box includes both individual users that are not already in a crowd and users that are already in a crowd. In one embodiment, a is ⅔.
- The
crowd analyzer 60 then creates a crowd of one user for each individual user within the bounding box that is not already included in a crowd and sets the optimal inclusion distance for the crowds to the initial optimal inclusion distance (step 1846). At this point, thecrowd analyzer 60 analyzes the crowds for the bounding box to determine whether any crowd members (i.e., users in the crowds) violate the optimal inclusion distance of their crowds (step 1848). Any crowd member that violates the optimal inclusion distance of his or her crowd is then removed from that crowd (step 1850). Thecrowd analyzer 60 then creates a crowd of one user for each of the users removed from their crowds instep 1850 and sets the optimal inclusion distance for the newly created crowds to the initial optimal inclusion distance (step 1852). - Next, the
crowd analyzer 60 determines the two closest crowds in the bounding box (step 1854) and a distance between the two closest crowds (step 1856). The distance between the two closest crowds is the distance between the crowd centers of the two closest crowds. Thecrowd analyzer 60 then determines whether the distance between the two closest crowds is less than the optimal inclusion distance of a larger of the two closest crowds (step 1858). If the two closest crowds are of the same size (i.e., have the same number of users), then the optimal inclusion distance of either of the two closest crowds may be used. Alternatively, if the two closest crowds are of the same size, the optimal inclusion distances of both of the two closest crowds may be used such that thecrowd analyzer 60 determines whether the distance between the two closest crowds is less than the optimal inclusion distances of both of the two closest crowds. As another alternative, if the two closest crowds are of the same size, thecrowd analyzer 60 may compare the distance between the two closest crowds to an average of the optimal inclusion distances of the two closest crowds. - If the distance between the two closest crowds is less than the optimal inclusion distance, the two closest crowds are combined or merged (step 1860), and a new crowd center for the resulting crowd is computed (step 1862). Again, a center of mass algorithm may be used to compute the crowd center of a crowd. In addition, a new optimal inclusion distance for the resulting crowd is computed (step 1864). As discussed above, in one embodiment, the new optimal inclusion distance for the resulting crowd is computed as:
-
- where n is the number of users in the crowd and di is a distance between the ith user and the crowd center. In other words, the new optimal inclusion distance is computed as the average of the initial optimal inclusion distance and the distances between the users in the crowd and the crowd center plus one standard deviation.
- At this point, the
crowd analyzer 60 determines whether a maximum number of iterations have been performed (step 1866). If the maximum number of iterations has not been reached, the process returns to step 1848 and is repeated until either the distance between the two closest crowds is not less than the optimal inclusion distance of the larger crowd or the maximum number of iterations has been reached. At that point, thecrowd analyzer 60 discards crowds with less than three users, or members (step 1868). Thecrowd analyzer 60 then determines whether the crowd formation process for the new and old bounding boxes is done (step 1870). In other words, thecrowd analyzer 60 determines whether both the new and old bounding boxes have been processed. If not, the bounding box is set to the new bounding box (step 1872), and the process returns to step 1842 and is repeated for the new bounding box. Once both the new and old bounding box have been processed, the crowd formation process ends. -
FIGS. 18A through 18D graphically illustrate the crowd formation process ofFIGS. 17A through 17D for a scenario where the crowd formation process is triggered by a location update for a user having no old location. In this scenario, thecrowd analyzer 60 creates anew bounding box 122 for the new location of the user, and thenew bounding box 122 is set as the bounding box to be processed for crowd formation. Then, as illustrated inFIG. 18A , thecrowd analyzer 60 identifies all individual users currently located within thebounding box 122 and all crowds located within or overlapping the bounding box. In this example,crowd 124 is an existing crowd relevant to thebounding box 122. Crowds are indicated by dashed circles, crowd centers are indicated by cross-hairs (+), and users are indicated as dots. Next, as illustrated inFIG. 18B , thecrowd analyzer 60 createscrowds 126 through 130 of one user for the individual users, and the optional inclusion distances of thecrowds 126 through 130 are set to the initial optimal inclusion distance. As discussed above, the initial optimal inclusion distance is computed by thecrowd analyzer 60 based on a density of users within thebounding box 122. - The
crowd analyzer 60 then identifies the twoclosest crowds bounding box 122 and determines a distance between the twoclosest crowds closest crowds closest crowds FIG. 18C . Thecrowd analyzer 60 then repeats the process such that the twoclosest crowds bounding box 122 are again merged, as illustrated inFIG. 18D . At this point, the distance between the twoclosest crowds -
FIGS. 19A through 19F graphically illustrate the crowd formation process ofFIGS. 17A through 17D for a scenario where the new and old bounding boxes overlap. As illustrated inFIG. 19A , a user moves from an old location to a new location, as indicated by an arrow. Thecrowd analyzer 60 receives a location update for the user giving the new location of the user. In response, thecrowd analyzer 60 creates anold bounding box 132 for the old location of the user and anew bounding box 134 for the new location of the user.Crowd 136 exists in theold bounding box 132, andcrowd 138 exists in thenew bounding box 134. - Since the
old bounding box 132 and thenew bounding box 134 overlap, thecrowd analyzer 60 creates abounding box 140 that encompasses both theold bounding box 132 and thenew bounding box 134, as illustrated inFIG. 19B . In addition, thecrowd analyzer 60 createscrowds 142 through 148 for individual users currently located within thebounding box 140. The optimal inclusion distances of thecrowds 142 through 148 are set to the initial optimal inclusion distance computed by thecrowd analyzer 60 based on the density of users in thebounding box 140. - Next, the
crowd analyzer 60 analyzes thecrowds crowds crowds crowd 136 and moving to his new location, both of the remaining members of thecrowd 136 violate the optimal inclusion distance of thecrowd 136. As such, thecrowd analyzer 60 removes the remaining users from thecrowd 136 and createscrowds FIG. 19C . - The
crowd analyzer 60 then identifies the two closest crowds in thebounding box 140, which in this example are thecrowds crowd analyzer 60 computes a distance between the twocrowds crowds crowds crowds crowd analyzer 60 merges thecrowd 148 into thecrowd 146, as illustrated inFIG. 19D . A new crowd center and new optimal inclusion distance are then computed for thecrowd 146. - At this point, the
crowd analyzer 60 repeats the process and determines that thecrowds crowds crowds crowd 138. As such, thecrowd 144 is merged into thecrowd 138 and a new crowd center and optimal inclusion distance are computed for thecrowd 138, as illustrated inFIG. 19E . At this point, there are no two crowds closer than the optimal inclusion distance of the larger of the two crowds. As such, thecrowd analyzer 60 discards any crowds having less than three members, as illustrated inFIG. 19F . In this example, thecrowds crowd 138 has three or more members and, as such, is not removed. At this point, the crowd formation process is complete. -
FIGS. 20A through 20E graphically illustrate the crowd formation process ofFIGS. 17A through 17D in a scenario where the new and old bounding boxes do not overlap. As illustrated inFIG. 20A , in this example, the user moves from an old location to a new location. Thecrowd analyzer 60 creates anold bounding box 154 for the old location of the user and anew bounding box 156 for the new location of the user.Crowds old bounding box 154, andcrowd 162 exists in thenew bounding box 156. In this example, since the old andnew bounding boxes crowd analyzer 60 processes the old andnew bounding boxes - More specifically, as illustrated in
FIG. 20B , as a result of the movement of the user from the old location to the new location, the remaining users in thecrowd 158 no longer satisfy the optimal inclusion distance for thecrowd 158. As such, the remaining users in thecrowd 158 are removed from thecrowd 158, andcrowds FIG. 20C . In this example, no two crowds in theold bounding box 154 are close enough to be combined. As such, processing of theold bounding box 154 is complete, and thecrowd analyzer 60 proceeds to process thenew bounding box 156. - As illustrated in
FIG. 20D , processing of thenew bounding box 156 begins by thecrowd analyzer 60 creating acrowd 168 of one user for the user. Thecrowd analyzer 60 then identifies thecrowds new bounding box 156 and determines a distance between the twocrowds crowds crowd 162. As such, thecrowd analyzer 60 combines thecrowds crowd 168 into thecrowd 162, as illustrated inFIG. 20E . A new crowd center and new optimal inclusion distance are then computed for thecrowd 162. At this point, the crowd formation process is complete. - Before proceeding, a variation of the spatial formation process discussed above with respect to
FIGS. 17A through 17D , 18A through 18D, 19A through 19F, and 20A through 20E will be described. In this alternative embodiment, a location accuracy of the location update from the user received instep 1800 is considered. More specifically, instep 1800, the location update received by theMAP server 12 includes the updated location of the user 20-1 as well as a location accuracy for the location of the user 20-1, which may be expressed as, for example, a radius in meters from the location of the user 20-1. In the embodiment where the location of the user 20-1 is obtained from a GPS receiver of the mobile device 18-1, the location accuracy of the location of the user 20-1 may be provided by the GPS receiver or derived from data from the GPS receiver as will be appreciated by one having ordinary skill in the art. - Then, in
steps - In addition, the location accuracy may be considered when computing the initial optimal inclusion distances used for crowds of one user in
steps -
- where a is a number between 0 and 1, ABoundingBox is an area of the bounding box, and number_of_users is the total number of users in the bounding box. The total number of users in the bounding box includes both individual users that are not already in a crowd and users that are already in a crowd. In one embodiment, a is ⅔. However, if the computed initial optimal inclusion distance is less than the location accuracy of the current location of the individual user in a crowd, then the location accuracy, rather than the computed value, is used for the initial optimal inclusion distance for that crowd. As such, as location accuracy decreases, crowds become larger and more inclusive. In contrast, as location accuracy increases, crowds become smaller and less inclusive. In other words, the granularity with which crowds are formed is a function of the location accuracy.
- Likewise, when new optimal inclusion distances for crowds are recomputed in
steps -
- where n is the number of users in the crowd and di is a distance between the ith user and the crowd center. In other words, the new optimal inclusion distance is computed as the average of the initial optimal inclusion distance and the distances between the users in the crowd and the crowd center plus one standard deviation. However, if the computed value for the new optimal inclusion distance is less than an average location accuracy of the users in the crowd, the average location accuracy of the users in the crowd, rather than the computed value, is used as the new optimal inclusion distance.
-
FIG. 21 illustrates the operation of thesystem 10 ofFIGS. 1A and 1B to enable the mobile devices 18-1 through 18-N to request crowd data for currently formed crowds according to one embodiment of the present disclosure. Note that while in this example the request is initiated by the MAP application 32-1 of the mobile device 18-1, this discussion is equally applicable to the MAP applications 32-2 through 32-N of the other mobile devices 18-2 through 18-N. In addition, in a similar manner, requests may be received from the third-party applications 34-1 through 34-N. Still further, theMAP server 12 may process crowd requests from other devices such as thesubscriber device 22, the third-party server 26, and/or theprofile server 14. - First, the MAP application 32-1 sends a crowd request to the MAP client 30-1 (step 1900). The crowd request is a request for crowd data for crowds currently formed near a specified POI or within a specified AOI. The crowd request may be initiated by the user 20-1 of the mobile device 18-1 via the MAP application 32-1 or may be initiated automatically by the MAP application 32-1 in response to an event such as, for example, start-up of the MAP application 32-1, movement of the user 20-1, or the like. In one embodiment, the crowd request is for a POI, where the POI is a POI corresponding to the current location of the user 20-1, a POI selected from a list of POIs defined by the user 20-1, a POI selected from a list of POIs defined by the MAP application 32-1 or the
MAP server 12, a POI selected by the user 20-1 from a map, a POI implicitly defined via a separate application (e.g., POI is implicitly defined as the location of the nearest Starbucks coffee house in response to the user 20-1 performing a Google search for “Starbucks”), or the like. If the POI is selected from a list of POIs, the list of POIs may include static POIs which may be defined by street addresses or latitude and longitude coordinates, dynamic POIs which may be defined as the current locations of one or more friends of the user 20-1, or both. Note that in some embodiments, the user 20-1 may be enabled to define a POI by selecting a crowd center of a crowd as a POI, where the POI would thereafter remain static at that point and would not follow the crowd. - In another embodiment, the crowd request is for an AOI, where the AOI may be an AOI of a predefined shape and size centered at the current location of the user 20-1, an AOI selected from a list of AOIs defined by the user 20-1, an AOI selected from a list of AOIs defined by the MAP application 32-1 or the
MAP server 12, an AOI selected by the user 20-1 from a map, an AOI implicitly defined via a separate application (e.g., AOI is implicitly defined as an area of a predefined shape and size centered at the location of the nearest Starbucks coffee house in response to the user 20-1 performing a Google search for “Starbucks”), or the like. If the AOI is selected from a list of AOIs, the list of AOIs may include static AOIs, dynamic AOIs which may be defined as areas of a predefined shape and size centered at the current locations of one or more friends of the user 20-1, or both. Note that in some embodiments, the user 20-1 may be enabled to define an AOI by selecting a crowd such that an AOI is created of a predefined shape and size centered at the crowd center of the selected crowd. The AOI would thereafter remain static and would not follow the crowd. The POI or the AOI of the crowd request may be selected by the user 20-1 via the MAP application 32-1. In yet another embodiment, the MAP application 32-1 automatically uses the current location of the user 20-1 as the POI or as a center point for an AOI of a predefined shape and size. - Upon receiving the crowd request, the MAP client 30-1 forwards the crowd request to the MAP server 12 (step 1902). Note that in some embodiments, the MAP client 30-1 may process the crowd request before forwarding the crowd request to the
MAP server 12. For example, in some embodiments, the crowd request may include more than one POI or more than one AOI. As such, the MAP client 30-1 may generate a separate crowd request for each POI or each AOI. - In response to receiving the crowd request from the MAP client 30-1, the
MAP server 12 identifies one or more crowds relevant to the crowd request (step 1904). More specifically, in one embodiment, thecrowd analyzer 60 performs a crowd formation process such as that described above inFIG. 15 to form one or more crowds relevant to the POI or the AOI of the crowd request. In another embodiment, thecrowd analyzer 60 proactively forms crowds using a process such as that described above inFIGS. 17A through 17D and stores corresponding crowd records in thedatastore 66 of theMAP server 12. Then, rather than forming the relevant crowds in response to the crowd request, thecrowd analyzer 60 queries thedatastore 66 to identify the crowds that are relevant to the crowd request. The crowds relevant to the crowd request may be those crowds within or intersecting a bounding region, such as a bounding box, for the crowd request. If the crowd request is for a POI, the bounding region is a geographic region of a predefined shape and size centered at the POI. If the crowd request is for an AOI, the bounding region is the AOI. - Once the
crowd analyzer 60 has identified the crowds relevant to the crowd request, theMAP server 12 generates crowd data for the identified crowds (step 1906). As discussed below in detail, the crowd data for the identified crowds may include aggregate profiles for the crowds, information characterizing the crowds, or both. In addition, the crowd data may include spatial information defining the locations of the crowds, the number of users in the crowds, the amount of time the crowds have been located at or near the POI or within the AOI of the crowd request, or the like. TheMAP server 12 then returns the crowd data to the MAP client 30-1 (step 1908). - Upon receiving the crowd data, the MAP client 30-1 forwards the crowd data to the MAP application 32-1 (step 1910). Note that in some embodiments the MAP client 30-1 may process the crowd data before sending the crowd data to the MAP application 32-1. The MAP application 32-1 then presents the crowd data to the user 20-1 (step 1912). The manner in which the crowd data is presented depends on the particular implementation of the MAP application 32-1. In one embodiment, the crowd data is overlaid upon a map. For example, the crowds may be represented by corresponding indicators overlaid on a map. The user 20-1 may then select a crowd in order to view additional crowd data regarding that crowd such as, for example, the aggregate profile of that crowd, characteristics of that crowd, or the like.
- Note that in one embodiment, the MAP application 32-1 may operate to roll-up the aggregate profiles for multiple crowds into a rolled-up aggregate profile for those crowds. The rolled-up aggregate profile may be the average of the aggregate profiles of the crowds. For example, the MAP application 32-1 may roll-up the aggregate profiles for multiple crowds at a POI and present the rolled-up aggregate profile for the multiple crowds at the POI to the user 20-1. In a similar manner, the MAP application 32-1 may provide a rolled-up aggregate profile for an AOI. In another embodiment, the
MAP server 12 may roll-up crowds for a POI or an AOI and provide the rolled-up aggregate profile in addition to or as an alternative to the aggregate profiles for the individual crowds. -
FIGS. 22 through 31 describe the operation of theprofile augmentation function 40 ofFIGS. 1A and 1B according to several different embodiments of the present disclosure. More specifically,FIG. 22 illustrates the operation of theprofile augmentation function 40 to augment a user profile of a subject user based on aggregate profile data for a crowd of users located at or near a current location of the subject user according to one embodiment of the present disclosure. First, theprofile augmentation function 40 gets, or obtains, a current location of a subject user (step 2000). Depending on the particular embodiment, the subject user may be a system-user, which is one of the users 20-1 through 20-N of the mobile devices 18-1 through 18-N or thesubscriber 24 of thesubscriber device 22, or a third-party user, which may be a user associated with theprofile server 14 or the third-party server 26 that is not one of the system-users. The current location of the subject user may be obtained using any suitable technique. For example, if the subject user is user 20-1, the current location of the user 20-1 is preferably obtained from the mobile device 18-1 or thelocation server 16. As another example, if the subject user is a third-party user, the current location of the third-party user may be obtained from a location-aware device of the third-party user. - Next, the
profile augmentation function 40 obtains an aggregate profile for a crowd of users currently located at or near the current location of the subject user (step 2002). Crowds of users currently located at or near the current location of the subject user are referred to herein as crowds that are currently located at locations that are relevant to the current location of the subject user. More specifically, depending on the particular implementation, the crowd currently located at or near the current location of the subject user is a crowd in which the subject user is included, a crowd closest to the current location of the subject user, or a crowd that is within a geographic region of a predefined shape and size encompassing (e.g., centered at) the current location of the subject user. The aggregate profile of the crowd is preferably generated by comparing the user profiles of the users in the crowd to one another, and the aggregate profile of the crowd preferably includes a number of keywords and, for each keyword, a number of user matches, or occurrences, for that keyword in the user profiles of the users in the crowd. Theprofile augmentation function 40 then augments a user profile of the subject user based on the aggregate profile of the crowd (step 2004). -
FIG. 23 illustratesstep 2004 ofFIG. 22 in more detail according to one embodiment of the present disclosure. In this embodiment, the user profile of the subject user includes a number of keywords and a probability assigned to each of the keywords. The probability assigned to a keyword in the user profile of the subject user is a probability that the subject user has an interest in the keyword. Initially, the user profile of the subject user includes zero or more keywords entered by the subject user, where each of these keywords is assigned a fixed probability of 100%. Over time, as a number of iterations of the profile augmentation process ofFIG. 22 are performed, additional keywords are added to the user profile of the subject user and probabilities are assigned to those keywords. As discussed below, the probabilities of these additional keywords are determined based on questions asked of the subject user and/or the number of user matches, or occurrences, for the keywords from one or more aggregate profiles of crowds located at or near the subject user. - More specifically, in order to augment the user profile of the subject user based on the aggregate profile of the crowd at or near the current location of the subject user, the
profile augmentation function 40 identifies, or selects, a predetermined number (NMAX) of keywords from the aggregate profile of the crowd having the highest number of user matches and not having a fixed probability in the user profile of the subject user (step 2100). Keywords in the user profile of the subject user having fixed probabilities are keywords that have been entered by the subject user into the user profile. In addition, as discussed below, the keywords having fixed probabilities may also include keywords in which the subject user has expressed an interest or disinterest in response to questions from theprofile augmentation function 40. - For example, assume that the user profile of the subject user is:
-
Keyword Probability (%) Tennis 100 (fixed) Politics 100 (fixed)
Also, assume that the aggregate profile for the crowd is: -
Keyword User Matches Tennis 5 Sports 3 China 2 Coffee 2 Photography 1
As such, theprofile augmentation function 40 selects, at most, the predetermined number (NMAX) of the keywords from the aggregate profile having the highest number of user matches and not having a fixed probability in the user profile of the subject user. In this example, assume that NMAX is three (3). Here, the three keywords having the highest number of user matches and not having fixed probabilities in the user profile of the subject user are the keywords Sports, China, and Coffee. Note that the keyword Tennis has a fixed probability in the user profile of the subject user and as such is not selected by theprofile augmentation function 40. - Next, the
profile augmentation function 40 generates a question for each of the keywords identified in step 2100 (step 2102). In general, the questions are automatically generated in order to determine whether the subject user is interested in the identified keywords. Returning to our example, if the identified keywords are Sports, China, and Coffee, theprofile augmentation function 40 may generate the following questions: “Do you have an interest in sports?,” “Do you have an interest in China?,” and “Do you like coffee?.” Alternatively, the questions for the identified keywords may be a list of the identified keywords where the subject user will be enabled to select “Yes” or “No” for each of the identified keywords, or the like. Theprofile augmentation function 40 then provides the questions for the identified keywords to the subject user (step 2104), and receives answers to the questions from the subject user (2106). Note that the subject user may choose to answer all, some, or none of the questions. Lastly, theprofile augmentation function 40 updates the user profile of the subject user based on any answers received from the subject user and, in this embodiment, the number of user matches for the keywords in the aggregate profile of the crowd (step 2108). -
FIG. 24 illustratesstep 2108 ofFIG. 23 in more detail according to one embodiment of the present disclosure. Specifically,FIG. 24 illustrates the operation of theprofile augmentation function 40 to update the user profile of the subject user based on any answers received from the subject user and the number of user matches for the keywords in the aggregate profile of the crowd. First, theprofile augmentation function 40 gets the next keyword from the aggregate profile (step 2200). Note that for the first iteration, the next keyword is the first keyword in the aggregate profile. Next, theprofile augmentation function 40 determines whether a question was asked for the keyword and whether an answer to the question was received from the subject user (step 2202). If not, theprofile augmentation function 40 determines whether the keyword is already in the user profile of the subject user (step 2204). The keyword may already be in the user profile if the subject user entered the keyword into the user profile or if the keyword was added to the user profile of the subject user during a previous iteration of the profile augmentation process. If the keyword is not already in the user profile of the subject user, theprofile augmentation function 40 computes a probability for the keyword based on the number of user matches for the keyword in the aggregate profile (step 2206). In one embodiment, the probability score is computed based on the following equation: -
- where PROBABILITY is the probability of the keyword, USER_MATCHES is the number of user matches for the keyword from the aggregate profile, and TOTAL_USER_MATCHES is the sum of the number of user matches for all of the keywords in the aggregate profile. Note that the equation above is exemplary and is not intended to limit the scope of the present disclosure. The
profile augmentation function 40 then adds the keyword and the probability computed for the keyword to the user profile of the subject user (step 2208). At this point, the process proceeds to step 2222, which is described below. - Returning to step 2204, if the keyword is already in the user profile of the subject user, the
profile augmentation function 40 determines whether the keyword has a fixed probability in the user profile of the subject user (step 2210). - In this embodiment, the keyword will have a fixed probability if the subject user added the keyword to the user profile or if the subject user previously answered a question for the keyword. More specifically, in this embodiment, the keyword will have a fixed probability of 100% if the subject user previously added the keyword to the user profile, a fixed probability of 100% if the subject user answered a question for the keyword in a previous iteration of the profile augmentation process in a manner that indicated that the subject user has an interest in the keyword, or a fixed probability of 0% if the subject user answered a question for the keyword in a previous iteration of the profile augmentation process in a manner that indicated that the subject user does not have an interest in the keyword. If the keyword does not have a fixed probability, the
profile augmentation function 40 computes a new probability for the keyword based on the probability for the keyword in the user profile (i.e., the old probability for the keyword) and the number of user matches for the keyword in the aggregate profile (step 2212). In one embodiment, the new probability is computed based on the following equation: -
PROBABILITYNEW=AVG(PROBABILITYOLD,PROBABILITYTEMP), - where
-
- and PROBABILITYNEW is the new probability for the keyword, PROBABILITYOLD is the old probability for the keyword, PROBABILITYTEMP is a temporary probability used for purposes of this exemplary calculation, USER_MATCHES is the number of user matches for the keyword from the aggregate profile, and TOTAL_USER_MATCHES is the sum of the number of user matches for all of the keywords in the aggregate profile. The function AVG(x,y) is the average of the values x and y. Note that other techniques may be used to combine the old probability and the temporary probability to provide the new probability (e.g., summing, weighted averaging, or the like). The
profile augmentation function 40 then updates the user profile of the subject user to include the new probability for the keyword (step 2214). At this point, the process proceeds to step 2222, which is described below. - Returning to step 2202, if a question was asked for the keyword and an answer was received from the subject user for the question asked for the keyword, the
profile augmentation function 40 determines whether the keyword is already in the user profile of the subject user (step 2216). If not, theprofile augmentation function 40 adds the keyword to the user profile of the subject user along with a fixed probability for the keyword that reflects the answer given by the subject user to the corresponding question (step 2218). In this example, the fixed probability for the keyword is 100% if the subject user gave a positive answer indicating that the subject user has an interest in the keyword. In contrast, the fixed probability for the keyword is 0% if the subject user gave a negative answer indicating that the subject user does not have an interest in the keyword. At this point, the process proceeds to step 2222, which is described below. - Returning to step 2216, if the keyword is already in the user profile of the subject user, then the
profile augmentation function 40 updates the user profile of the subject user with a fixed probability for the keyword that reflects the answer given by the subject user to the corresponding question (step 2220). Again, in this example, the fixed probability for the keyword is 100% if the subject user gave a positive answer indicating that the subject user has an interest in the keyword. In contrast, the fixed probability for the keyword is 0% if the subject user gave a negative answer indicating that the subject user does not have an interest in the keyword. The process then proceeds to step 2222, which is described below. - At this point, whether proceeding from
step 2208,step 2210,step 2214,step 2218, orstep 2220, theprofile augmentation function 40 determines whether that last keyword in the aggregate profile has been processed (step 2222). If not, the process returns to step 2200 and is repeated for the next keyword in the aggregate profile. Once all of the keywords in the aggregate profile have been processed, the process is complete. - Again, as an example, assume that the user profile of the subject user is:
-
Keyword Probability (%) Tennis 100 (fixed) Politics 100 (fixed)
Also, assume that the aggregate profile is: -
Keyword User Matches Tennis 5 Sports 3 China 2 Coffee 2 Photography 1
and that questions were asked for the keywords Sports, China, and Coffee from the aggregate profile. Further assume, that the subject user answered the question for Sports in a manner that indicated that the subject user has an interest in sports, answered the question for Coffee in a manner that indicated that the subject user is not interested in Coffee, and did not answer the question for China. As such, using the process described above, the user profile of the subject user is updated as follows: -
Keyword Probability Tennis 100 (fixed) Politics 100 (fixed) Sports 100 (fixed) China 15 Photography 8 Coffee 0 (fixed)
Note that future iterations of the profile augmentation process may be performed in order to further augment the user profile of the subject user. - For instance, if the subject user thereafter moves to a new location and the process is repeated, an aggregate profile for a new crowd that is at or near the new location of the subject user may be:
-
Keyword User Matches Sports 5 Photography 3 Hiking 2 Technology 2 Farming 1
In this example, assuming again that NMAX is 3, then Photography, Hiking, and Technology are selected and corresponding questions are provided to the subject user. For this example, assume that the subject user does not respond to any of the questions. As such, since the keyword Photography is already in the user profile of the subject user, a new probability is computed for the keyword Photography based on the old probability which in this case is 8 and the number of user matches for the keyword Photography in the aggregate profile for the new crowd. The keywords Hiking and Technology are not already in the user profile of the subject user. As such, the keywords Hiking and Technology are added to the user profile of the subject user along with corresponding probabilities computed based on the number of user matches for those keywords in the aggregate profile of the new crowd. As such, the updated user profile of the subject user may then be: -
Keyword Probability Tennis 100 (fixed) Politics 100 (fixed) Sports 100 (fixed) China 15 Photography 15 Hiking 15 Technology 15 Farming 8 Coffee 0 (fixed) -
FIG. 25 illustratesstep 2004 ofFIG. 22 in more detail according to another embodiment of the present disclosure. In this embodiment, the user profile of the subject user includes a number of keywords and a probability assigned to each of the keywords. Initially, the user profile of the subject user includes zero or more keywords entered by the subject user, where each of these keywords is assigned a fixed probability of 100%. Over time, as a number of iterations of the profile augmentation process ofFIG. 22 are performed, additional keywords are added to the user profile of the subject user. As discussed below, the probabilities of these additional keywords are determined based on questions asked of the subject user and/or the number of user matches for the keywords for aggregate profiles of crowds located at or near the subject user. - More specifically, in order to augment the user profile of the subject user based on the aggregate profile of the crowd at or near the current location of the subject user, the
profile augmentation function 40 first provides a preliminary question to the subject user (step 2300). The preliminary question is preferably an open-ended question regarding the interests of the subject user. For example, the preliminary question may be “What is one of your current topics of interest?.” Theprofile augmentation function 40 then receives an answer from the subject user (step 2302). The answer from the subject user is referred to herein as a topic of interest. Theprofile augmentation function 40 then selects a desired number of keywords from the aggregate profile that have the highest number of user matches, do not have fixed probabilities in the user profile of the subject user, and have the highest affinity to the topic of interest provided by the subject user (step 2304). Affinity between the topic of interest and the keywords in the aggregate profile may be determined using any suitable technique for determining the affinity between two keywords. For example, an ontology or similar data structure that defines relationships between words and topics may be used to determine the degree of relationship between two keywords (e.g., degrees of separation of the two keywords in the ontology), where the degree of relationship is utilized as the affinity of the two keywords. - For example, assume that the user profile of the subject user is:
-
Keyword Probability (%) Tennis 100 (fixed) Politics 100 (fixed)
Also, assume that the aggregate profile is: -
Keyword User Matches Tennis 5 Sports 3 China 2 Coffee 2 Europe 2 Photography 1
Further assume that topic of interest provided by the subject user is History and that the desired number of keywords to be selected is three (3). As such, theprofile augmentation function 40 selects the Sports keyword because it has the highest number of user matches and is not already included in the user profile of the subject user with a fixed probability. Theprofile augmentation function 40 then selects two more keywords from the keywords China, Coffee, and Europe based on the affinities of those keywords to the topic of interest, which is History. As such, in this example, theprofile augmentation function 40 selects the keywords China and Europe because they have higher affinities with the topic of interest than the keyword Coffee. - Next, the
profile augmentation function 40 generates a question for each of the selected keywords (step 2306). In general, the questions are automatically generated in order to determine whether the subject user is interested in the identified keywords. Returning to our example, if the identified keywords are Sports, China, and Europe, theprofile augmentation function 40 may generate the following questions: “Do you have an interest in sports?,” “Do you have an interest in China?,” and “Do you have an interest in Europe?.” Alternatively, the questions for the identified keywords may be a list of the identified keywords where the subject user will be enabled to select “Yes” or “No” for each of the identified keywords, or the like. Theprofile augmentation function 40 then provides the questions for the identified keywords to the subject user (step 2308), and receives answers to the questions from the subject user (2310). Note that the subject user may choose to answer all, some, or none of the questions. Lastly, theprofile augmentation function 40 updates the user profile of the subject user based on any answers received from the subject user and, in this embodiment, the number of user matches for the keywords in the aggregate profile of the crowd (step 2312). More specifically, in one embodiment, theprofile augmentation function 40 updates the user profile of the subject user using the process ofFIG. 24 described above. -
FIG. 26 illustrates the operation of theprofile augmentation function 40 to augment a user profile of a user based on an aggregate profile of a crowd for the embodiment ofFIG. 1A wherein theprofile augmentation function 40 is implemented on theMAP server 12. First, theMAP server 12 obtains a user profile of a system user (step 2400). The system user is one of the users 20-1 through 20-N. As discussed above, theMAP server 12 may obtain the user profile of the system user from theprofile server 14, but is not limited thereto. Next, theMAP server 12 obtains the current location of the system user in the manner described above and identifies a crowd at or near the current location of the system user (steps 2402 and 2404). TheMAP server 12 may identify the crowd by reactively performing the crowd formation process ofFIG. 15 for a geographic region encompassing the current location of the system user. Alternatively, theMAP server 12 may proactively form crowds using the process ofFIG. 15 orFIGS. 17A through 17D . In this case, theMAP server 12 identifies the crowd at or near the current location of the system user by querying thedatastore 66 of theMAP server 12. For example, the crowd at or near the current location of the system user may be a crowd in which the system user is currently included or a crowd that is closest to the current location of the system user. - Next, the
MAP server 12 obtains an aggregate profile for the crowd (step 2406). More specifically, theMAP server 12 compares the user profiles of the users in the crowd to one another to generate the aggregate profile of the crowd. As discussed above, in this embodiment, the aggregate profile of the crowd preferably includes a number of keywords and, for each keyword, a number of user matches for the keyword in the user profiles of the users in the crowd. Theprofile augmentation function 40, which for this embodiment is implemented on theMAP server 12, then augments the user profile of the system user based on the aggregate profile of the crowd in the manner described above (step 2408). Preferably, the process returns to step 2402 and is periodically or otherwise repeated to further augment the user profile of the system user over time. -
FIG. 27 illustrates the operation of theprofile augmentation function 40 for the embodiment ofFIG. 1B . In this embodiment, theprofile augmentation function 40 is implemented on theprofile server 14, one of the mobile devices 18-1 through 18-N, thesubscriber device 22, or the third-party server 26. First, theprofile augmentation function 40 sends an aggregate profile request to theMAP server 12 that includes the current location of the subject user (step 2500). Alternatively, if the subject user is a system user (i.e., one of the users 20-1 through 20-N), the aggregate profile request may identify the subject user, where theMAP server 12 then obtains the current location of the subject user. In this embodiment, the subject user may be a system user or a third-party user depending on the particular implementation. In response, theMAP server 12 identifies a crowd that is at or near the current location of the subject user (step 2502). Again, the crowd may be formed proactively or reactively, as described above. The crowd that is at or near the current location of the subject user is preferably a crowd that is at or closest to the current location of the subject user. If the subject user is a system user, the crowd that is at or near the current location of the subject user may be a crowd in which the subject user is included. TheMAP server 12 then obtains an aggregate profile for the crowd (step 2504). More specifically, theMAP server 12 compares the user profiles of the users in the crowd to one another to generate the aggregate profile of the crowd. As discussed above, in this embodiment, the aggregate profile of the crowd preferably includes a number of keywords and, for each keyword, a number of user matches for the keyword in the user profiles of the users in the crowd. Next, the MAP server returns the aggregate profile of the crowd to the profile augmentation function 40 (step 2506). Theprofile augmentation function 40 then augments the user profile of the subject user based on the aggregate profile of the crowd in the manner described above (step 2508). -
FIGS. 28 through 32 illustrate the operation of theprofile augmentation function 40 according to another embodiment of the present disclosure. In this embodiment, theprofile augmentation function 40 augments a user profile of a subject user based on a historical aggregate profile for users historically located at locations relevant to the current location of the subject user. The locations relevant to the current location of the subject user are locations that are at or near the current location of the subject user. Note that while described separately herein, theprofile augmentation function 40 may augment the user profile of a subject user based on both an aggregate profile of a crowd at or near the current location of the subject user and a historical aggregate profile for users historically located at or near the current location of the subject user. -
FIG. 28 illustrates the operation of theprofile augmentation function 40 to augment a user profile of a subject user based on a historical aggregate profile data for users historically, or previously, located at or near a current location of the subject user according to another embodiment of the present disclosure. First, theprofile augmentation function 40 gets, or obtains, a current location of a subject user (step 2600). Depending on the particular embodiment, the subject user may be a system-user, which is one of the users 20-1 through 20-N of the mobile devices 18-1 through 18-N or thesubscriber 24 of thesubscriber device 22, or a third-party user, which may be a user associated with theprofile server 14 or the third-party server 26 that is not one of the system-users. The current location of the subject user may be obtained using any suitable technique. For example, if the subject user is user 20-1, the current location of the user 20-1 is preferably obtained from the mobile device 18-1 or thelocation server 16. As another example, if the subject user is a third-party user, the current location of the third-party user may be obtained from a location-aware device of the third-party user. - Next, the
profile augmentation function 40 obtains a historical aggregate profile for users historically located at or near the current location of the subject user (step 2602). In one embodiment, the users historically located at or near the current location of the subject user are users that were located at or near the current location of the subject user within one or more defined time windows. Each time window may be a relative time window that is relative to the current time (e.g., past 6 months, past 2 years, or the like) or an absolute time window (e.g., Friday, Feb. 12, 2010 or the like). In general, the users historically located at or near the current location of the subject user are users that were historically located within a defined geographic region encompassing (e.g., centered at) the current location of the subject user. In the preferred embodiment, the historical aggregate profile includes a number of keywords and, for each keyword, a number of user matches, or occurrences, of the keyword in the user profiles of the users historically located at or near the current location of the subject user. Theprofile augmentation function 40 then augments a user profile of the subject user based on the historical aggregate profile (step 2604). -
FIG. 29 illustratesstep 2604 ofFIG. 28 in more detail according to one embodiment of the present disclosure. In this embodiment, the user profile of the subject user includes a number of keywords and a probability assigned to each of the keywords. Initially, the user profile of the subject user includes zero or more keywords entered by the subject user, where each of these keywords is assigned a fixed probability of 100%. Over time, as a number of iterations of the profile augmentation process ofFIG. 28 are performed, additional keywords are added to the user profile of the subject user. As discussed below, the probabilities of these additional keywords are determined based on questions asked of the subject user and/or the number of user matches for the keywords from a historical aggregate profile obtained for the current location of the subject user. - More specifically, in order to augment the user profile of the subject user based on the historical aggregate profile for the current location of the subject user, the
profile augmentation function 40 identifies, or selects, a predetermined number (NMAX) of keywords from the historical aggregate profile having the highest number of user matches and not having a fixed probability in the user profile of the subject user (step 2700). Keywords in the user profile of the subject user having fixed probabilities are keywords that have been entered by the subject user into the user profile. In addition, as discussed below, the keywords having fixed probabilities may also include keywords in which the subject user has expressed an interest or disinterest in response to questions from theprofile augmentation function 40. - For example, assume that the user profile of the subject user is:
-
Keyword Probability (%) Tennis 100 (fixed) Politics 100 (fixed)
Also, assume that the historical aggregate profile is: -
Keyword User Matches Tennis 19 Books 8 Photography 7 Fishing 4 Sports 3 China 3 Coffee 2 Skiing 2 Europe 1 Farm Animals 1
As such, theprofile augmentation function 40 selects, at most, the predetermined number (NMAX) of the keywords from the historical aggregate profile having the highest number of user matches and not having a fixed probability in the user profile of the subject user. In this example, assume that NMAX is three (3). Here, the three keywords having the highest number of user matches and not having fixed probabilities in the user profile of the subject user are the keywords Books, Photography, and Fishing. Note that the keyword Tennis has a fixed probability in the user profile of the subject user. - Next, the
profile augmentation function 40 generates a question for each of the identified keywords (step 2702). In general, the questions are automatically generated in order to determine whether the subject user is interested in the identified keywords. Returning to our example, if the identified keywords are Books, Photography, and Fishing, theprofile augmentation function 40 may generate the following questions: “Do you have an interest in books?,” “Do you have an interest in photography?,” and “Do you like fishing?.” Alternatively, the questions for the identified keywords may be a list of the identified keywords where the subject user will be enabled to select “Yes” or “No” for each of the identified keywords, or the like. Theprofile augmentation function 40 then provides the questions for the identified keywords to the subject user (step 2704), and receives answers to the questions from the subject user (2706). Note that the subject user may choose to answer all, some, or none of the questions. Lastly, theprofile augmentation function 40 updates the user profile of the subject user based on any answers received from the subject user and, in this embodiment, the number of user matches for the keywords in the historical aggregate profile (step 2708). In one embodiment, theprofile augmentation function 40 updates the user profile of the subject user using the process ofFIG. 24 described above. - Continuing our example, assume that the subject user responds positively to the question for the keyword Books, responds negatively to the question for the keyword Photography, and does not respond to the question for the keyword Fishing. After the process of
FIG. 24 has been performed, the updated user profile of the subject user would be: -
Keyword Probability Tennis 100 (fixed) Politics 100 (fixed) Books 100 (fixed) Fishing 8 Sports 6 China 6 Coffee 4 Skiing 4 Europe 2 Farm Animals 2 Photography 0 (fixed)
Note that future iterations of the profile augmentation process may be performed in order to further augment the user profile of the subject user. -
FIG. 30 illustratesstep 2604 ofFIG. 28 in more detail according to another embodiment of the present disclosure. In this embodiment, the user profile of the subject user includes a number of keywords and a probability assigned to each of the keywords. Initially, the user profile of the subject user includes zero or more keywords entered by the subject user, where each of these keywords is assigned a fixed probability of 100%. Over time, as a number of iterations of the profile augmentation process ofFIG. 28 are performed, additional keywords are added to the user profile of the subject user. As discussed below, the probabilities of these additional keywords are determined based on questions asked of the subject user and/or the number of user matches for the keywords in historical aggregate profiles. - More specifically, in order to augment the user profile of the subject user based on the historical aggregate profile of users historically located at or near the current location of the subject user, the
profile augmentation function 40 first provides a preliminary question to the subject user (step 2800). The preliminary question is preferably an open-ended question regarding the interests of the subject user. For example, the preliminary question may be “What is one of your current topics of interest?.” Theprofile augmentation function 40 then receives an answer from the subject user (step 2802). The answer from the subject user is referred to herein as a topic of interest. Theprofile augmentation function 40 then selects a desired number of keywords from the historical aggregate profile that have the highest number of user matches, do not have fixed probabilities in the user profile of the subject user, and have the highest affinity to the topic of interest provided by the subject user (step 2804). Affinity between the topic of interest and the keywords in the historical aggregate profile may be determined using any suitable technique for determining the affinity between two keywords. For example, an ontology or similar data structure that defines relationships between words and topics may be used to determine the degree of relationship between two keywords (e.g., degrees of separation of the two keywords in the ontology), where the degree of relationship is utilized as the affinity of the two keywords. - For example, assume that the user profile of the subject user is:
-
Keyword Probability (%) Sports 100 (fixed) Politics 100 (fixed)
Also, assume that the historical aggregate profile is: -
Keyword User Matches Sports 15 Books 10 Photography 7 Coffee 5 China 5 Skiing 5 Europe 5 Fishing 5
Further assume that the topic of interest provided by the subject user is the Winter Olympics and that the desired number of keywords to be selected is three (3). As such, theprofile augmentation function 40 selects Books and Photography because they have the highest number of user matches for keywords that do not have fixed probabilities in the user profile of the subject user. Theprofile augmentation function 40 then selects one more keyword from the keywords Coffee, China, Skiing, Europe, and Fishing based on the affinities of those keywords to the topic of interest, which is the Winter Olympics. As such, in this example, theprofile augmentation function 40 selects the keyword Skiing because it has a higher affinity with the topic of interest than the other keywords. - Next, the
profile augmentation function 40 generates a question for each of the selected keywords (step 2806). In general, the questions are automatically generated in order to determine whether the subject user is interested in the identified keywords. Returning to our example, if the identified keywords are Books, Photography, and Skiing, theprofile augmentation function 40 may generate the following questions: “Do you have an interest in books?,” “Do you have an interest in photography?,” and “Do you have an interest in skiing?.” Alternatively, the questions for the identified keywords may be a list of the identified keywords where the subject user will be enabled to select “Yes” or “No” for each of the identified keywords, or the like. Theprofile augmentation function 40 then provides the questions for the identified keywords to the subject user (step 2808), and receives answers to the questions from the subject user (step 2810). Note that the subject user may choose to answer all, some, or none of the questions. Lastly, theprofile augmentation function 40 updates the user profile of the subject user based on any answers received from the subject user and, in this embodiment, the number of user matches for the keywords in the historical aggregate profile for the current location of the subject user (step 2812). More specifically, in one embodiment, theprofile augmentation function 40 updates the user profile of the subject user using the process ofFIG. 24 described above. -
FIG. 31 illustrates the operation of theprofile augmentation function 40 to augment a user profile of a subject user based on a historical aggregate profile for the embodiment ofFIG. 1A wherein theprofile augmentation function 40 is implemented on theMAP server 12. First, theMAP server 12 obtains a user profile of a system user (step 2900). The system user is one of the users 20-1 through 20-N. As discussed above, theMAP server 12 may obtain the user profile of the system user from theprofile server 14, but is not limited thereto. Next, theMAP server 12 obtains the current location of the system user in the manner described above (step 2902). Next, theMAP server 12 obtains a historical aggregate profile for the current location of the system user (step 2904). The manner in which the historical aggregate profile is preferably obtained by theMAP server 12 is described below. In general, user profiles of users historically located at or near the current location of the system user during one or more defined time windows are combined to provide the historical aggregate profile. Again, the historical aggregate profile preferably includes a number of keywords and, for each keyword, a number of user matches for that keyword in the user profiles of the users historically located at or near the current location of the system user. Theprofile augmentation function 40, which for this embodiment is implemented on theMAP server 12, then augments the user profile of the system user based on the historical aggregate profile in the manner described above (step 2906). Preferably, the process returns to step 2902 and is periodically or otherwise repeated to further augment the user profile of the system user over time. -
FIG. 32 illustrates the operation of theprofile augmentation function 40 to perform the profile augmentation process ofFIG. 28 for the embodiment ofFIG. 1B . In this embodiment, theprofile augmentation function 40 is implemented on theprofile server 14, one of the mobile devices 18-1 through 18-N, thesubscriber device 22, or the third-party server 26. First, theprofile augmentation function 40 sends a historical aggregate profile request to theMAP server 12 that includes the current location of the subject user (step 3000). Alternatively, if the subject user is a system user (i.e., one of the users 20-1 through 20-N), the historical aggregate profile request may identify the subject user, where theMAP server 12 then obtains the current location of the subject user. In this embodiment, the subject user may be a system user or a third-party user depending on the particular implementation details. In response, theMAP server 12 generates or otherwise obtains a historical aggregate profile for the current location of the subject user (step 3002). Again, the manner in which the historical aggregate profile is preferably generated is described below. Next, the MAP server returns the historical aggregate profile to the profile augmentation function 40 (step 3004). Theprofile augmentation function 40 then augments the user profile of the subject user based on the historical aggregate profile in the manner described above (step 3006). -
FIG. 33 illustrates the operation of theMAP server 12 to generate a historical aggregate profile for a current location of a subject user according to one embodiment of the present disclosure. First, thehistory manager 58 of theMAP server 12 establishes a bounding box for the historical aggregate profile request based on the current location of the subject user (step 3100). Note that while a bounding box is used in this example, other geographic shapes may be used to define a bounding region for the historical request (e.g., a bounding circle). In this embodiment, the bounding box is a bounding box of a predefined size centered at the current location of the subject user. In addition to establishing the bounding box, thehistory manager 58 establishes a time window for the historical aggregate profile request (step 3102). The time window is preferably identified in the historical aggregate profile request, but is not limited thereto. For example, if the historical aggregate profile request is for the last week and the current date and time are Sep. 17, 2009 at 10:00 pm, thehistory manager 58 may generate the time window as Sep. 10, 2009 at 10:00 pm through Sep. 17, 2009 at 10:00 pm. Note that while a single time window is used for this example, any number of one or more time windows may be defined and processed accordingly. - Next, the
history manager 58 obtains history objects relevant to the bounding box and the time window for the historical aggregate profile request from thedatastore 66 of the MAP server 12 (step 3104). The relevant history objects are history objects recorded for time periods within or intersecting the time window and for locations, or geographic areas, within or intersecting the bounding box for the historical aggregate profile request. At this point, thehistory manager 58 gets the next history object from the relevant history objects identified in step 3104 (step 3106). Thehistory manager 58 then generates an aggregate profile for the history object (step 3108). In order to generate the aggregate profile for the history object, thehistory manager 58 compares the user profiles of the anonymous user records stored in the history object to one another. The resulting aggregate profile for the history object includes a number of keywords and, for each keyword, a number of user matches for that keyword. Thehistory manager 58 then determines whether there are more history objects to be processed (step 3110). If so, the process returns to step 3106 and is repeated until all of the history objects that are relevant to the historical aggregate profile request have been processed. Once all of the history objects have been processed, thehistory manager 58 combines the aggregate profiles of the history objects to provide the historical aggregate profile for the current location of the subject user (step 3112). More specifically, in this embodiment, thehistory manager 58 combines the aggregate profiles of the history objects to provide a list of keywords and, for each keyword, a number of user matches for that keyword over all of the history objects. - Before proceeding, it should be noted that, in the embodiments described above, the
profile augmentation function 40 utilizes questions asked of the subject user. However, theprofile augmentation function 40 is not limited thereto. In another embodiment, no questions are asked of the subject user. Rather, theprofile augmentation function 40 operates to update the user profile of the subject user based on the aggregate profile date (i.e., the aggregate profile of the crowd at or near the current location of the subject user or the historical aggregate profile for the current location of the subject user) according tosteps 2200, 2204-2214, and 2222 ofFIG. 24 . - It should also be noted that the
profile augmentation function 40 may utilize things in addition to the aggregate profile data when augmenting a user profile of a subject user. For example, in the embodiments ofFIGS. 25 and 30 , the topic of interest provided by the subject user may be used to identify other keywords identified as being of interest by other users that also provided the same topic of interest. The other users may be other users in general or other users currently or previously located at or near the current location of the subject user. -
FIG. 34 is a block diagram of theMAP server 12 according to one embodiment of the present disclosure. As illustrated, theMAP server 12 includes acontroller 170 connected tomemory 172, one or moresecondary storage devices 174, and acommunication interface 176 by abus 178 or similar mechanism. Thecontroller 170 is a microprocessor, digital Application Specific Integrated Circuit (ASIC), Field Programmable Gate Array (FPGA), or the like. In this embodiment, thecontroller 170 is a microprocessor, and theapplication layer 42, the business logic layer 44, and the object mapping layer 64 (FIG. 2 ) are implemented in software and stored in thememory 172 for execution by thecontroller 170. Further, the datastore 66 (FIG. 2 ) may be implemented in the one or moresecondary storage devices 174. Thesecondary storage devices 174 are digital data storage devices such as, for example, one or more hard disk drives. Thecommunication interface 176 is a wired or wireless communication interface that communicatively couples theMAP server 12 to the network 28 (FIGS. 1A and 1B ). For example, thecommunication interface 176 may be an Ethernet interface, local wireless interface such as a wireless interface operating according to one of the suite of IEEE 802.11 standards, or the like. -
FIG. 35 is a block diagram of the mobile device 18-1 according to one embodiment of the present disclosure. This discussion is equally applicable to the other mobile devices 18-2 through 18-N. As illustrated, the mobile device 18-1 includes acontroller 180 connected tomemory 182, acommunication interface 184, one or more user interface components 186, and the location function 36-1 by abus 188 or similar mechanism. Thecontroller 180 is a microprocessor, digital ASIC, FPGA, or the like. In this embodiment, thecontroller 180 is a microprocessor, and the MAP client 30-1, the MAP application 32-1, and the third-party applications 34-1 are implemented in software and stored in thememory 182 for execution by thecontroller 180. In addition, if implemented on the mobile device 18-1, theprofile augmentation function 40 is also preferably implemented in software and stored in thememory 182 for execution by thecontroller 180. In this embodiment, the location function 36-1 is a hardware component such as, for example, a GPS receiver. Thecommunication interface 184 is a wireless communication interface that communicatively couples the mobile device 18-1 to the network 28 (FIGS. 1A and 1B ). For example, thecommunication interface 184 may be a local wireless interface such as a wireless interface operating according to one of the suite of IEEE 802.11 standards, a mobile communications interface such as a cellular telecommunications interface, or the like. The one or more user interface components 186 include, for example, a touchscreen, a display, one or more user input components (e.g., a keypad), a speaker, or the like, or any combination thereof. -
FIG. 36 is a block diagram of thesubscriber device 22 according to one embodiment of the present disclosure. As illustrated, thesubscriber device 22 includes acontroller 190 connected tomemory 192, one or moresecondary storage devices 194, acommunication interface 196, and one or more user interface components 198 by abus 200 or similar mechanism. Thecontroller 190 is a microprocessor, digital ASIC, FPGA, or the like. In this embodiment, thecontroller 190 is a microprocessor, and the web browser 38 (FIGS. 1A and 1B ) is implemented in software and stored in thememory 192 for execution by thecontroller 190. In addition, if implemented on thesubscriber device 22, theprofile augmentation function 40 is also preferably implemented in software and stored in thememory 192 for execution by thecontroller 190. The one or moresecondary storage devices 194 are digital storage devices such as, for example, one or more hard disk drives. Thecommunication interface 196 is a wired or wireless communication interface that communicatively couples thesubscriber device 22 to the network 28 (FIGS. 1A and 1B ). For example, thecommunication interface 196 may be an Ethernet interface, local wireless interface such as a wireless interface operating according to one of the suite of IEEE 802.11 standards, a mobile communications interface such as a cellular telecommunications interface, or the like. The one or more user interface components 198 include, for example, a touchscreen, a display, one or more user input components (e.g., a keypad), a speaker, or the like, or any combination thereof. -
FIG. 37 is a block diagram of the third-party server 26 according to one embodiment of the present disclosure. As illustrated, the third-party server 26 includes acontroller 202 connected tomemory 204, one or moresecondary storage devices 206, acommunication interface 208, and one or more user interface components 210 by abus 212 or similar mechanism. Thecontroller 202 is a microprocessor, digital ASIC, FPGA, or the like. In this embodiment, thecontroller 202 is a microprocessor, and one or more services provided by the third-party server 26 are implemented in software and stored in thememory 204 for execution by thecontroller 202. For instance, if implemented on the third-party server 26, theprofile augmentation function 40 is also preferably implemented in software and stored in thememory 204 for execution by thecontroller 202. The one or moresecondary storage devices 206 are digital storage devices such as, for example, one or more hard disk drives. Thecommunication interface 208 is a wired or wireless communication interface that communicatively couples the third-party server 26 to the network 28 (FIGS. 1A and 1B ). For example, thecommunication interface 208 may be an Ethernet interface, local wireless interface such as a wireless interface operating according to one of the suite of IEEE 802.11 standards, a mobile communications interface such as a cellular telecommunications interface, or the like. The one or more user interface components 210 include, for example, a touchscreen, a display, one or more user input components (e.g., a keypad), a speaker, or the like, or any combination thereof. -
FIG. 38 is a block diagram of theprofile server 14 according to one embodiment of the present disclosure. As illustrated, theprofile server 14 includes acontroller 214 connected tomemory 216, one or moresecondary storage devices 218, acommunication interface 220, and one or more user interface components 222 by abus 224 or similar mechanism. Thecontroller 214 is a microprocessor, digital ASIC, FPGA, or the like. In this embodiment, thecontroller 214 is a microprocessor, and one or more services provided by theprofile server 14 are implemented in software and stored in thememory 216 for execution by thecontroller 214. For instance, if implemented on theprofile server 14, theprofile augmentation function 40 is also preferably implemented in software and stored in thememory 216 for execution by thecontroller 214. The one or moresecondary storage devices 218 are digital storage devices such as, for example, one or more hard disk drives. Thecommunication interface 220 is a wired or wireless communication interface that communicatively couples theprofile server 14 to the network 28 (FIGS. 1A and 1B ). For example, thecommunication interface 220 may be an Ethernet interface, local wireless interface such as a wireless interface operating according to one of the suite of IEEE 802.11 standards, a mobile communications interface such as a cellular telecommunications interface, or the like. The one or more user interface components 222 include, for example, a touchscreen, a display, one or more user input components (e.g., a keypad), a speaker, or the like, or any combination thereof. - Those skilled in the art will recognize improvements and modifications to the embodiments of the present invention. All such improvements and modifications are considered within the scope of the concepts disclosed herein and the claims that follow.
Claims (27)
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US12/722,564 US20120047143A1 (en) | 2009-03-25 | 2010-03-12 | Sparse profile augmentation using a mobile aggregate profiling system |
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US16309109P | 2009-03-25 | 2009-03-25 | |
US12/722,564 US20120047143A1 (en) | 2009-03-25 | 2010-03-12 | Sparse profile augmentation using a mobile aggregate profiling system |
Publications (1)
Publication Number | Publication Date |
---|---|
US20120047143A1 true US20120047143A1 (en) | 2012-02-23 |
Family
ID=45565580
Family Applications (8)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US12/711,517 Abandoned US20120047087A1 (en) | 2009-03-25 | 2010-02-24 | Smart encounters |
US12/713,508 Expired - Fee Related US9082077B2 (en) | 2009-03-25 | 2010-02-26 | Mobile private assisted location tracking |
US12/716,314 Active 2031-06-06 US8589330B2 (en) | 2009-03-25 | 2010-03-03 | Predicting or recommending a users future location based on crowd data |
US12/722,564 Abandoned US20120047143A1 (en) | 2009-03-25 | 2010-03-12 | Sparse profile augmentation using a mobile aggregate profiling system |
US12/731,242 Active 2032-01-13 US8620532B2 (en) | 2009-03-25 | 2010-03-25 | Passive crowd-sourced map updates and alternate route recommendations |
US14/062,405 Abandoned US20140129502A1 (en) | 2009-03-25 | 2013-10-24 | Predicting or recommending a user's future location based on crowd data |
US14/135,659 Expired - Fee Related US9140566B1 (en) | 2009-03-25 | 2013-12-20 | Passive crowd-sourced map updates and alternative route recommendations |
US14/851,341 Active US9410814B2 (en) | 2009-03-25 | 2015-09-11 | Passive crowd-sourced map updates and alternate route recommendations |
Family Applications Before (3)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US12/711,517 Abandoned US20120047087A1 (en) | 2009-03-25 | 2010-02-24 | Smart encounters |
US12/713,508 Expired - Fee Related US9082077B2 (en) | 2009-03-25 | 2010-02-26 | Mobile private assisted location tracking |
US12/716,314 Active 2031-06-06 US8589330B2 (en) | 2009-03-25 | 2010-03-03 | Predicting or recommending a users future location based on crowd data |
Family Applications After (4)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US12/731,242 Active 2032-01-13 US8620532B2 (en) | 2009-03-25 | 2010-03-25 | Passive crowd-sourced map updates and alternate route recommendations |
US14/062,405 Abandoned US20140129502A1 (en) | 2009-03-25 | 2013-10-24 | Predicting or recommending a user's future location based on crowd data |
US14/135,659 Expired - Fee Related US9140566B1 (en) | 2009-03-25 | 2013-12-20 | Passive crowd-sourced map updates and alternative route recommendations |
US14/851,341 Active US9410814B2 (en) | 2009-03-25 | 2015-09-11 | Passive crowd-sourced map updates and alternate route recommendations |
Country Status (1)
Country | Link |
---|---|
US (8) | US20120047087A1 (en) |
Cited By (13)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20110153665A1 (en) * | 2009-12-18 | 2011-06-23 | Electronics And Telecommunications Research Institute | Apparatus for providing social network service using relationship of ontology and method thereof |
US20120072341A1 (en) * | 2010-09-20 | 2012-03-22 | Agco Corporation | Allocating application servers in a service delivery platform |
US8473512B2 (en) | 2009-11-06 | 2013-06-25 | Waldeck Technology, Llc | Dynamic profile slice |
US20130238686A1 (en) * | 2011-10-18 | 2013-09-12 | Hugh O'Donoghue | Method and apparatus for generating, using, or updating an enriched user profile |
US8554770B2 (en) | 2009-04-29 | 2013-10-08 | Waldeck Technology, Llc | Profile construction using location-based aggregate profile information |
US20140075334A1 (en) * | 2012-09-10 | 2014-03-13 | Yahoo! Inc. | Cold Start Answers |
US9407590B2 (en) * | 2010-03-03 | 2016-08-02 | Waldeck Technology, Llc | Monitoring hashtags in micro-blog posts to provide one or more crowd-based features |
US9432402B1 (en) * | 2011-09-06 | 2016-08-30 | Utility Associates, Inc. | System and method for uploading files to servers utilizing GPS routing |
US9648089B2 (en) | 2014-04-25 | 2017-05-09 | Samsung Electronics Co., Ltd. | Context-aware hypothesis-driven aggregation of crowd-sourced evidence for a subscription-based service |
US9829340B2 (en) * | 2010-11-18 | 2017-11-28 | Google Inc. | Analysis of interactive map usage patterns |
US20190361879A1 (en) * | 2018-05-24 | 2019-11-28 | People.ai, Inc. | Systems and methods for updating email addresses based on email generation patterns |
US11924297B2 (en) | 2018-05-24 | 2024-03-05 | People.ai, Inc. | Systems and methods for generating a filtered data set |
US11949682B2 (en) | 2018-05-24 | 2024-04-02 | People.ai, Inc. | Systems and methods for managing the generation or deletion of record objects based on electronic activities and communication policies |
Families Citing this family (162)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US9459622B2 (en) | 2007-01-12 | 2016-10-04 | Legalforce, Inc. | Driverless vehicle commerce network and community |
US9098545B2 (en) | 2007-07-10 | 2015-08-04 | Raj Abhyanker | Hot news neighborhood banter in a geo-spatial social network |
US9064288B2 (en) | 2006-03-17 | 2015-06-23 | Fatdoor, Inc. | Government structures and neighborhood leads in a geo-spatial environment |
US9037516B2 (en) | 2006-03-17 | 2015-05-19 | Fatdoor, Inc. | Direct mailing in a geo-spatial environment |
US8965409B2 (en) | 2006-03-17 | 2015-02-24 | Fatdoor, Inc. | User-generated community publication in an online neighborhood social network |
US9070101B2 (en) | 2007-01-12 | 2015-06-30 | Fatdoor, Inc. | Peer-to-peer neighborhood delivery multi-copter and method |
US9002754B2 (en) | 2006-03-17 | 2015-04-07 | Fatdoor, Inc. | Campaign in a geo-spatial environment |
US9373149B2 (en) | 2006-03-17 | 2016-06-21 | Fatdoor, Inc. | Autonomous neighborhood vehicle commerce network and community |
US8863245B1 (en) | 2006-10-19 | 2014-10-14 | Fatdoor, Inc. | Nextdoor neighborhood social network method, apparatus, and system |
US8489111B2 (en) | 2007-08-14 | 2013-07-16 | Mpanion, Inc. | Real-time location and presence using a push-location client and server |
WO2009053410A1 (en) | 2007-10-26 | 2009-04-30 | Tomtom International B.V. | A method of processing positioning data |
US8219316B2 (en) | 2008-11-14 | 2012-07-10 | Google Inc. | System and method for storing and providing routes |
US8825074B2 (en) * | 2009-02-02 | 2014-09-02 | Waldeck Technology, Llc | Modifying a user'S contribution to an aggregate profile based on time between location updates and external events |
US20120047087A1 (en) | 2009-03-25 | 2012-02-23 | Waldeck Technology Llc | Smart encounters |
US20100250599A1 (en) * | 2009-03-30 | 2010-09-30 | Nokia Corporation | Method and apparatus for integration of community-provided place data |
US10042032B2 (en) * | 2009-04-29 | 2018-08-07 | Amazon Technologies, Inc. | System and method for generating recommendations based on similarities between location information of multiple users |
GB2475486B (en) * | 2009-11-18 | 2012-01-25 | Vodafone Plc | Method for identifying a candidate part of a map to be updated |
US20120063367A1 (en) | 2009-12-22 | 2012-03-15 | Waldeck Technology, Llc | Crowd and profile based communication addresses |
US8781990B1 (en) | 2010-02-25 | 2014-07-15 | Google Inc. | Crowdsensus: deriving consensus information from statements made by a crowd of users |
US20120123867A1 (en) * | 2010-05-11 | 2012-05-17 | Scott Hannan | Location Event Advertising |
US8498817B1 (en) | 2010-09-17 | 2013-07-30 | Amazon Technologies, Inc. | Predicting location of a mobile user |
US8694241B1 (en) | 2010-10-05 | 2014-04-08 | Google Inc. | Visualization of traffic patterns using GPS data |
US8694240B1 (en) | 2010-10-05 | 2014-04-08 | Google Inc. | Visualization of paths using GPS data |
US8825403B1 (en) | 2010-10-06 | 2014-09-02 | Google Inc. | User queries to model road network usage |
JP5246248B2 (en) * | 2010-11-29 | 2013-07-24 | 株式会社デンソー | Prediction device |
EP2649412B1 (en) * | 2010-12-07 | 2018-10-10 | TomTom Traffic B.V. | Mapping apparatus and method of operation thereof |
US10304066B2 (en) | 2010-12-22 | 2019-05-28 | Facebook, Inc. | Providing relevant notifications for a user based on location and social information |
US10068440B2 (en) * | 2011-01-12 | 2018-09-04 | Open Invention Network, Llc | Systems and methods for tracking assets using associated portable electronic device in the form of beacons |
US8548499B2 (en) | 2011-01-12 | 2013-10-01 | Ortiz And Associates Consulting, Llc | Determining the last location of lost and stolen portable electronic devices when wireless communications access to the lost or stolen devices is lost or intermittent |
US9055408B2 (en) * | 2011-04-02 | 2015-06-09 | Open Invention Network, Llc | System and method for determining geolocation of wireless access point or wireless device |
US8533146B1 (en) | 2011-04-29 | 2013-09-10 | Google Inc. | Identification of over-clustered map features |
US8862492B1 (en) * | 2011-04-29 | 2014-10-14 | Google Inc. | Identifying unreliable contributors of user-generated content |
US8700580B1 (en) | 2011-04-29 | 2014-04-15 | Google Inc. | Moderation of user-generated content |
US8954266B2 (en) * | 2011-06-28 | 2015-02-10 | Microsoft Technology Licensing, Llc | Providing routes through information collection and retrieval |
US20130097162A1 (en) * | 2011-07-08 | 2013-04-18 | Kelly Corcoran | Method and system for generating and presenting search results that are based on location-based information from social networks, media, the internet, and/or actual on-site location |
US8838581B2 (en) * | 2011-08-19 | 2014-09-16 | Facebook, Inc. | Sending notifications about other users with whom a user is likely to interact |
US20130060587A1 (en) * | 2011-09-02 | 2013-03-07 | International Business Machines Corporation | Determining best time to reach customers in a multi-channel world ensuring right party contact and increasing interaction likelihood |
JP5648979B2 (en) * | 2011-10-13 | 2015-01-07 | 株式会社デンソー | Road information update system and navigation device |
JP2013122381A (en) * | 2011-12-09 | 2013-06-20 | Denso Corp | Navigation apparatus |
US9372829B1 (en) | 2011-12-15 | 2016-06-21 | Amazon Technologies, Inc. | Techniques for predicting user input on touch screen devices |
US9191756B2 (en) * | 2012-01-06 | 2015-11-17 | Iii Holdings 4, Llc | System and method for locating a hearing aid |
US8832116B1 (en) | 2012-01-11 | 2014-09-09 | Google Inc. | Using mobile application logs to measure and maintain accuracy of business information |
US20130226926A1 (en) * | 2012-02-29 | 2013-08-29 | Nokia Corporation | Method and apparatus for acquiring event information on demand |
WO2013148940A1 (en) * | 2012-03-28 | 2013-10-03 | Pioneer Advanced Solutions, Inc. | Method for increasing waypoint accuracies for crowd-sourced routes |
US9829326B2 (en) * | 2012-04-14 | 2017-11-28 | Audi Ag | Method, system and vehicle for conducting group travel |
US9295022B2 (en) | 2012-05-18 | 2016-03-22 | Comcast Cable Communications, LLC. | Wireless network supporting extended coverage of service |
US9633368B2 (en) * | 2012-05-25 | 2017-04-25 | Apple Inc. | Content ranking and serving on a multi-user device or interface |
US20130325337A1 (en) * | 2012-06-01 | 2013-12-05 | CityMaps | Logo-enabled interactive map integrating social networking applications |
US20150169891A1 (en) * | 2012-06-08 | 2015-06-18 | Dstillery, Inc. | Systems, methods, and apparatus for providing content to related compute devices based on obfuscated location data |
IN2014KN03045A (en) | 2012-06-22 | 2015-05-08 | Google Inc | |
WO2014016796A1 (en) * | 2012-07-25 | 2014-01-30 | Siddhartha Gupta | A system and method for secure employee time and location tracking |
US20140052718A1 (en) * | 2012-08-20 | 2014-02-20 | Microsoft Corporation | Social relevance to infer information about points of interest |
US10148709B2 (en) * | 2012-08-31 | 2018-12-04 | Here Global B.V. | Method and apparatus for updating or validating a geographic record based on crowdsourced location data |
US9151616B1 (en) * | 2012-09-26 | 2015-10-06 | Travis Ryan Henderson | Route event mapping |
US9552372B2 (en) | 2012-10-08 | 2017-01-24 | International Business Machines Corporation | Mapping infrastructure layout between non-corresponding datasets |
US9219668B2 (en) * | 2012-10-19 | 2015-12-22 | Facebook, Inc. | Predicting the future state of a mobile device user |
US9449121B2 (en) | 2012-10-30 | 2016-09-20 | Apple Inc. | Venue based real time crowd modeling and forecasting |
US9392567B2 (en) | 2012-11-30 | 2016-07-12 | Qualcomm Incorporated | Distributed system architecture to provide wireless transmitter positioning |
US20140188537A1 (en) * | 2013-01-02 | 2014-07-03 | Primordial | System and method for crowdsourcing map production |
WO2014107160A1 (en) * | 2013-01-04 | 2014-07-10 | Evado Filip Holding Ltd. | Location tracking system |
US9122708B2 (en) * | 2013-02-19 | 2015-09-01 | Digitalglobe Inc. | Crowdsourced search and locate platform |
US10078645B2 (en) * | 2013-02-19 | 2018-09-18 | Digitalglobe, Inc. | Crowdsourced feature identification and orthorectification |
US10346495B2 (en) * | 2013-02-19 | 2019-07-09 | Digitalglobe, Inc. | System and method for large scale crowdsourcing of map data cleanup and correction |
US8825359B1 (en) | 2013-02-27 | 2014-09-02 | Google Inc. | Systems, methods, and computer-readable media for verifying traffic designations of roads |
US9594791B2 (en) | 2013-03-15 | 2017-03-14 | Factual Inc. | Apparatus, systems, and methods for analyzing movements of target entities |
US10599738B1 (en) * | 2013-04-09 | 2020-03-24 | Google Llc | Real-time generation of an improved graphical user interface for overlapping electronic content |
US9299256B2 (en) * | 2013-04-22 | 2016-03-29 | GM Global Technology Operations LLC | Real-time parking assistant application |
GB201307550D0 (en) * | 2013-04-26 | 2013-06-12 | Tomtom Dev Germany Gmbh | Methods and systems of providing information indicative of a recommended navigable stretch |
US8954279B2 (en) * | 2013-06-25 | 2015-02-10 | Facebook, Inc. | Human-like global positioning system (GPS) directions |
US10796085B2 (en) | 2013-07-10 | 2020-10-06 | Crowdcomfort, Inc. | Systems and methods for providing cross-device native functionality in a mobile-based crowdsourcing platform |
US11394462B2 (en) | 2013-07-10 | 2022-07-19 | Crowdcomfort, Inc. | Systems and methods for collecting, managing, and leveraging crowdsourced data |
US10379551B2 (en) | 2013-07-10 | 2019-08-13 | Crowdcomfort, Inc. | Systems and methods for providing augmented reality-like interface for the management and maintenance of building systems |
US10841741B2 (en) * | 2015-07-07 | 2020-11-17 | Crowdcomfort, Inc. | Systems and methods for providing error correction and management in a mobile-based crowdsourcing platform |
WO2015006622A1 (en) | 2013-07-10 | 2015-01-15 | Crowdcomfort, Inc. | System and method for crowd-sourced environmental system control and maintenance |
US10541751B2 (en) | 2015-11-18 | 2020-01-21 | Crowdcomfort, Inc. | Systems and methods for providing geolocation services in a mobile-based crowdsourcing platform |
US10070280B2 (en) * | 2016-02-12 | 2018-09-04 | Crowdcomfort, Inc. | Systems and methods for leveraging text messages in a mobile-based crowdsourcing platform |
US9519805B2 (en) * | 2013-08-01 | 2016-12-13 | Cellco Partnership | Digest obfuscation for data cryptography |
US9788061B2 (en) | 2013-11-19 | 2017-10-10 | Rovi Guides, Inc. | Methods and systems for recommending media content related to a recently completed activity |
US9439367B2 (en) | 2014-02-07 | 2016-09-13 | Arthi Abhyanker | Network enabled gardening with a remotely controllable positioning extension |
US10083409B2 (en) * | 2014-02-14 | 2018-09-25 | Bby Solutions, Inc. | Wireless customer and labor management optimization in retail settings |
US20150262112A1 (en) * | 2014-03-11 | 2015-09-17 | Matthew Raanan | Monitoring system and method |
US20150262312A1 (en) * | 2014-03-11 | 2015-09-17 | Matthew Raanan | Management system and method |
US9307354B2 (en) | 2014-03-12 | 2016-04-05 | Apple Inc. | Retroactive check-ins based on learned locations to which the user has traveled |
WO2015157344A2 (en) * | 2014-04-07 | 2015-10-15 | Digitalglobe, Inc. | Systems and methods for large scale crowdsourcing of map data location, cleanup, and correction |
US9457901B2 (en) | 2014-04-22 | 2016-10-04 | Fatdoor, Inc. | Quadcopter with a printable payload extension system and method |
US9004396B1 (en) | 2014-04-24 | 2015-04-14 | Fatdoor, Inc. | Skyteboard quadcopter and method |
US9022324B1 (en) | 2014-05-05 | 2015-05-05 | Fatdoor, Inc. | Coordination of aerial vehicles through a central server |
US20150323338A1 (en) * | 2014-05-09 | 2015-11-12 | Nokia Corporation | Historical navigation movement indication |
US9372089B2 (en) | 2014-06-02 | 2016-06-21 | International Business Machines Corporation | Monitoring suggested routes for deviations |
US9971985B2 (en) | 2014-06-20 | 2018-05-15 | Raj Abhyanker | Train based community |
US9441981B2 (en) | 2014-06-20 | 2016-09-13 | Fatdoor, Inc. | Variable bus stops across a bus route in a regional transportation network |
US9451020B2 (en) | 2014-07-18 | 2016-09-20 | Legalforce, Inc. | Distributed communication of independent autonomous vehicles to provide redundancy and performance |
US9743375B2 (en) * | 2014-08-05 | 2017-08-22 | Wells Fargo Bank, N.A. | Location tracking |
US9918001B2 (en) | 2014-08-21 | 2018-03-13 | Toyota Motor Sales, U.S.A., Inc. | Crowd sourcing exterior vehicle images of traffic conditions |
US20160073228A1 (en) * | 2014-09-04 | 2016-03-10 | Mastercard International Incorporated | System and method for generating expected geolocations of mobile computing devices |
US10169736B1 (en) * | 2014-09-22 | 2019-01-01 | Amazon Technologies, Inc. | Implementing device operational modes using motion information or location information associated with a route |
US9658074B2 (en) * | 2014-10-13 | 2017-05-23 | Here Global B.V. | Diverging and converging road geometry generation from sparse data |
GB2531332B (en) | 2014-10-17 | 2021-01-06 | Nokia Technologies Oy | Location identification |
US10043319B2 (en) | 2014-11-16 | 2018-08-07 | Eonite Perception Inc. | Optimizing head mounted displays for augmented reality |
US9916002B2 (en) | 2014-11-16 | 2018-03-13 | Eonite Perception Inc. | Social applications for augmented reality technologies |
CN106663411A (en) | 2014-11-16 | 2017-05-10 | 易欧耐特感知公司 | Systems and methods for augmented reality preparation, processing, and application |
US11182870B2 (en) * | 2014-12-24 | 2021-11-23 | Mcafee, Llc | System and method for collective and collaborative navigation by a group of individuals |
US9534913B2 (en) * | 2015-04-09 | 2017-01-03 | Mapquest, Inc. | Systems and methods for simultaneous electronic display of various modes of transportation for viewing and comparing |
US10200808B2 (en) * | 2015-04-14 | 2019-02-05 | At&T Mobility Ii Llc | Anonymization of location datasets for travel studies |
KR101908387B1 (en) * | 2015-04-25 | 2018-10-16 | 오렌 라파엘 | Proximity-based network mobile communication system and method |
US10909464B2 (en) | 2015-04-29 | 2021-02-02 | Microsoft Technology Licensing, Llc | Semantic locations prediction |
US9811734B2 (en) | 2015-05-11 | 2017-11-07 | Google Inc. | Crowd-sourced creation and updating of area description file for mobile device localization |
US10033941B2 (en) | 2015-05-11 | 2018-07-24 | Google Llc | Privacy filtering of area description file prior to upload |
US9904714B2 (en) | 2015-06-30 | 2018-02-27 | International Business Machines Corporation | Crowd sourcing of device sensor data for real time response |
CN105091894A (en) * | 2015-06-30 | 2015-11-25 | 百度在线网络技术(北京)有限公司 | Navigation method, intelligent terminal device and wearable device |
US9774994B2 (en) | 2015-08-14 | 2017-09-26 | Aeris Communications, Inc. | System and method for monitoring devices relative to a user defined geographic area |
US10648823B2 (en) | 2017-06-22 | 2020-05-12 | Aeris Communications, Inc. | Learning common routes and automatic geofencing in fleet management |
US10231084B2 (en) | 2015-08-14 | 2019-03-12 | Aeris Communications, Inc. | System and method for monitoring devices relative to a learned geographic area |
US10437575B2 (en) | 2015-08-14 | 2019-10-08 | Aeris Communications, Inc. | Aercloud application express and aercloud application express launcher |
CN105338427A (en) * | 2015-09-25 | 2016-02-17 | 北京奇艺世纪科技有限公司 | Method for video recommendation to mobile equipment and device thereof |
US9668103B1 (en) | 2015-12-10 | 2017-05-30 | At&T Mobility Ii Llc | Method and apparatus for management of location information |
US9602617B1 (en) * | 2015-12-16 | 2017-03-21 | International Business Machines Corporation | High performance and scalable telematics message dispatching |
JP6510969B2 (en) * | 2015-12-22 | 2019-05-08 | 本田技研工業株式会社 | Server and server client system |
EP4102437A1 (en) | 2016-03-04 | 2022-12-14 | Axon Vibe AG | Systems and methods for predicting user behavior based on location data |
US10223380B2 (en) | 2016-03-23 | 2019-03-05 | Here Global B.V. | Map updates from a connected vehicle fleet |
US9846052B2 (en) | 2016-04-29 | 2017-12-19 | Blackriver Systems, Inc. | Electronic route creation |
US10247559B2 (en) * | 2016-05-02 | 2019-04-02 | Here Global B.V. | Method and apparatus for disambiguating probe points within an ambiguous probe region |
RU2658876C1 (en) * | 2016-08-11 | 2018-06-25 | Общество С Ограниченной Ответственностью "Яндекс" | Wireless device sensor data processing method and server for the object vector creating connected with the physical position |
HUE057108T2 (en) | 2016-08-11 | 2022-04-28 | Axon Vibe AG | Geo-locating individuals based on a derived social network |
US11017712B2 (en) | 2016-08-12 | 2021-05-25 | Intel Corporation | Optimized display image rendering |
US20180060778A1 (en) * | 2016-08-31 | 2018-03-01 | Uber Technologies, Inc. | Driver location prediction for a transportation service |
US20180060973A1 (en) * | 2016-09-01 | 2018-03-01 | Facebook, Inc. | Systems and methods for pacing page recommendations |
US9928660B1 (en) | 2016-09-12 | 2018-03-27 | Intel Corporation | Hybrid rendering for a wearable display attached to a tethered computer |
EP3322149B1 (en) * | 2016-11-10 | 2023-09-13 | Tata Consultancy Services Limited | Customized map generation with real time messages and locations from concurrent users |
US10976172B2 (en) | 2016-12-31 | 2021-04-13 | Uber Technologies, Inc. | Recommending destinations of map-related requests using categorization |
US10296812B2 (en) | 2017-01-04 | 2019-05-21 | Qualcomm Incorporated | Systems and methods for mapping based on multi-journey data |
US10885219B2 (en) | 2017-02-13 | 2021-01-05 | Microsoft Technology Licensing, Llc | Privacy control operation modes |
US10540483B2 (en) | 2017-04-25 | 2020-01-21 | International Business Machines Corporation | Personalized training based on planned course and personal assessment |
US11009886B2 (en) | 2017-05-12 | 2021-05-18 | Autonomy Squared Llc | Robot pickup method |
US11036523B2 (en) | 2017-06-16 | 2021-06-15 | General Electric Company | Systems and methods for adaptive user interfaces |
US10628001B2 (en) * | 2017-06-16 | 2020-04-21 | General Electric Company | Adapting user interfaces based on gold standards |
US10735904B2 (en) | 2017-06-22 | 2020-08-04 | Aeris Communications, Inc. | System and method for monitoring location and activity of devices |
US11627195B2 (en) | 2017-06-22 | 2023-04-11 | Aeris Communications, Inc. | Issuing alerts for IoT devices |
US11132636B2 (en) | 2017-06-22 | 2021-09-28 | Aeris Communications, Inc. | System and method for monitoring and sharing location and activity of devices |
US10591309B2 (en) | 2017-10-12 | 2020-03-17 | International Business Machines Corporation | Autonomous vehicle-based guided tour rule selection |
WO2020002048A1 (en) | 2018-06-26 | 2020-01-02 | Signify Holding B.V. | Optimize commissioning in zigbee network |
US11562168B2 (en) * | 2018-07-16 | 2023-01-24 | Here Global B.V. | Clustering for K-anonymity in location trajectory data |
US10497256B1 (en) * | 2018-07-26 | 2019-12-03 | Here Global B.V. | Method, apparatus, and system for automatic evaluation of road closure reports |
US10885090B2 (en) * | 2018-09-06 | 2021-01-05 | Verizon Media Inc. | Computerized system and method for interest profile generation and digital content dissemination based therefrom |
JP2020046949A (en) * | 2018-09-19 | 2020-03-26 | トヨタ自動車株式会社 | Information processing device, information processing method, and information processing program |
US11022453B2 (en) * | 2018-09-21 | 2021-06-01 | International Business Machines Corporation | Alternative route decision making |
TWI686748B (en) * | 2018-12-07 | 2020-03-01 | 國立交通大學 | People-flow analysis system and people-flow analysis method |
US11280621B2 (en) * | 2019-01-04 | 2022-03-22 | International Business Machines Corporation | Navigation using a device without global positioning system assistance |
US10989545B2 (en) | 2019-06-04 | 2021-04-27 | Here Global B.V. | Method, apparatus, and computer program product for map data agnostic route fingerprints |
US10809074B1 (en) | 2019-06-04 | 2020-10-20 | Here Global B.V. | Method, apparatus, and computer program product for map data agnostic route fingerprints |
US10861333B1 (en) | 2019-06-04 | 2020-12-08 | Here Global B.V. | Method, apparatus, and computer program product for map data agnostic route fingerprints |
US10794717B1 (en) | 2019-06-04 | 2020-10-06 | Here Global B.V. | Method, apparatus, and computer program product for map data agnostic route fingerprints |
US11574213B1 (en) * | 2019-08-14 | 2023-02-07 | Palantir Technologies Inc. | Systems and methods for inferring relationships between entities |
US11391577B2 (en) | 2019-12-04 | 2022-07-19 | Pony Ai Inc. | Dynamically modelling objects in map |
KR102317447B1 (en) * | 2020-02-21 | 2021-10-28 | 주식회사 쿠핏 | Method for managing route information, and server and program using the same |
US11821739B2 (en) | 2020-06-03 | 2023-11-21 | Here Global B.V. | Method, apparatus, and computer program product for generating and communicating low bandwidth map version agnostic routes |
US11733059B2 (en) | 2020-06-03 | 2023-08-22 | Here Global B.V. | Method, apparatus, and computer program product for generating and communicating low bandwidth map version agnostic routes |
US11493586B2 (en) * | 2020-06-28 | 2022-11-08 | T-Mobile Usa, Inc. | Mobile proximity detector for mobile electronic devices |
US11769411B2 (en) * | 2020-12-31 | 2023-09-26 | Volvo Car Corporation | Systems and methods for protecting vulnerable road users |
US20220282980A1 (en) * | 2021-03-03 | 2022-09-08 | International Business Machines Corporation | Pedestrian route guidance that provides a space buffer |
US20220390256A1 (en) * | 2021-06-04 | 2022-12-08 | The University Of Hong Kong | Crowd-driven mapping, localization and social-friendly navigation system |
DE102021207570A1 (en) | 2021-07-15 | 2023-01-19 | Volkswagen Aktiengesellschaft | Method for determining a trajectory to be followed by a motor vehicle, electronic computing device and motor vehicle |
Citations (11)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20010036224A1 (en) * | 2000-02-07 | 2001-11-01 | Aaron Demello | System and method for the delivery of targeted data over wireless networks |
US20020087632A1 (en) * | 2000-12-28 | 2002-07-04 | Keskar Dhananjay V. | System and method for automatically sharing information between handheld devices |
US6571279B1 (en) * | 1997-12-05 | 2003-05-27 | Pinpoint Incorporated | Location enhanced information delivery system |
US20070061328A1 (en) * | 2005-09-14 | 2007-03-15 | Jorey Ramer | Managing sponsored content for delivery to mobile communication facilities |
US20070118509A1 (en) * | 2005-11-18 | 2007-05-24 | Flashpoint Technology, Inc. | Collaborative service for suggesting media keywords based on location data |
US20070143348A1 (en) * | 2005-10-01 | 2007-06-21 | Outland Research, Llc | Demographic assessment and presentation for personal area networks |
US20080140650A1 (en) * | 2006-11-29 | 2008-06-12 | David Stackpole | Dynamic geosocial networking |
US20090125321A1 (en) * | 2007-11-14 | 2009-05-14 | Qualcomm Incorporated | Methods and systems for determining a geographic user profile to determine suitability of targeted content messages based on the profile |
US20100205211A1 (en) * | 2009-02-06 | 2010-08-12 | Riddhiman Ghosh | System and Method for Generating a User Profile |
US7849082B2 (en) * | 2006-11-17 | 2010-12-07 | W.W. Grainger, Inc. | System and method for influencing display of web site content |
US20110082825A1 (en) * | 2009-10-05 | 2011-04-07 | Nokia Corporation | Method and apparatus for providing a co-creation platform |
Family Cites Families (527)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5949776A (en) | 1990-01-18 | 1999-09-07 | Norand Corporation | Hierarchical communication system using premises, peripheral and vehicular local area networking |
US5177685A (en) | 1990-08-09 | 1993-01-05 | Massachusetts Institute Of Technology | Automobile navigation system using real time spoken driving instructions |
US5220507A (en) | 1990-11-08 | 1993-06-15 | Motorola, Inc. | Land vehicle multiple navigation route apparatus |
JPH04188181A (en) | 1990-11-22 | 1992-07-06 | Nissan Motor Co Ltd | Route retrieving device for vehicle |
DE69331485T2 (en) | 1992-08-19 | 2002-06-20 | Aisin Aw Co | Navigation system for vehicles |
US5796727A (en) | 1993-04-30 | 1998-08-18 | International Business Machines Corporation | Wide-area wireless lan access |
US5493692A (en) | 1993-12-03 | 1996-02-20 | Xerox Corporation | Selective delivery of electronic messages in a multiple computer system based on context and environment of a user |
US6947571B1 (en) | 1999-05-19 | 2005-09-20 | Digimarc Corporation | Cell phones with optical capabilities, and related applications |
US5528501A (en) | 1994-03-28 | 1996-06-18 | At&T Corp. | System and method for supplying travel directions |
US5539232A (en) | 1994-05-31 | 1996-07-23 | Kabushiki Kaisha Toshiba | MOS composite type semiconductor device |
US5848373A (en) * | 1994-06-24 | 1998-12-08 | Delorme Publishing Company | Computer aided map location system |
US5802492A (en) | 1994-06-24 | 1998-09-01 | Delorme Publishing Company, Inc. | Computer aided routing and positioning system |
US6321158B1 (en) | 1994-06-24 | 2001-11-20 | Delorme Publishing Company | Integrated routing/mapping information |
EP1202028A1 (en) | 1994-09-08 | 2002-05-02 | Matsushita Electric Industrial Co., Ltd. | Method and system of route selection |
DE19521929A1 (en) | 1994-10-07 | 1996-04-11 | Mannesmann Ag | Facility for guiding people |
US5758257A (en) | 1994-11-29 | 1998-05-26 | Herz; Frederick | System and method for scheduling broadcast of and access to video programs and other data using customer profiles |
US5659476A (en) | 1994-12-22 | 1997-08-19 | Motorola Inc. | Land vehicle navigation apparatus and method for planning a recovery route |
US5682525A (en) | 1995-01-11 | 1997-10-28 | Civix Corporation | System and methods for remotely accessing a selected group of items of interest from a database |
DE19519107C1 (en) | 1995-05-24 | 1996-04-04 | Daimler Benz Ag | Travel route guidance device for electric vehicle |
US5729457A (en) | 1995-07-10 | 1998-03-17 | Motorola, Inc. | Route entry location apparatus |
US7171018B2 (en) | 1995-07-27 | 2007-01-30 | Digimarc Corporation | Portable devices and methods employing digital watermarking |
US6049711A (en) | 1995-08-23 | 2000-04-11 | Teletrac, Inc. | Method and apparatus for providing location-based information services |
JP3441306B2 (en) | 1995-09-12 | 2003-09-02 | 株式会社東芝 | Client device, message transmission method, server device, page processing method, and relay server device |
US5748148A (en) * | 1995-09-19 | 1998-05-05 | H.M.W. Consulting, Inc. | Positional information storage and retrieval system and method |
US6127945A (en) | 1995-10-18 | 2000-10-03 | Trimble Navigation Limited | Mobile personal navigator |
US5862325A (en) | 1996-02-29 | 1999-01-19 | Intermind Corporation | Computer-based communication system and method using metadata defining a control structure |
US5812134A (en) | 1996-03-28 | 1998-09-22 | Critical Thought, Inc. | User interface navigational system & method for interactive representation of information contained within a database |
US6098015A (en) | 1996-04-23 | 2000-08-01 | Aisin Aw Co., Ltd. | Navigation system for vehicles and storage medium |
JP3596704B2 (en) | 1996-04-23 | 2004-12-02 | アイシン・エィ・ダブリュ株式会社 | Vehicle navigation device and navigation method |
KR100267541B1 (en) | 1996-07-26 | 2000-10-16 | 모리 하루오 | Vehicle navigation method and system |
US6819783B2 (en) | 1996-09-04 | 2004-11-16 | Centerframe, Llc | Obtaining person-specific images in a public venue |
US6459987B1 (en) | 1996-11-15 | 2002-10-01 | Garmin Corporation | Method and apparatus for backtracking a path |
US5902347A (en) | 1996-11-19 | 1999-05-11 | American Navigation Systems, Inc. | Hand-held GPS-mapping device |
US6704118B1 (en) | 1996-11-21 | 2004-03-09 | Ricoh Company, Ltd. | Method and system for automatically and transparently archiving documents and document meta data |
DE69839855D1 (en) | 1997-01-29 | 2008-09-18 | Matsushita Electric Ind Co Ltd | Data carrier for road map with traffic guidance rules via connected intersections |
US20010013009A1 (en) | 1997-05-20 | 2001-08-09 | Daniel R. Greening | System and method for computer-based marketing |
JPH11120487A (en) | 1997-10-21 | 1999-04-30 | Toyota Motor Corp | Mobile object terminal equipment, for providing device, system, and method information and medium recording program for mobile object terminal equipment |
US6269369B1 (en) * | 1997-11-02 | 2001-07-31 | Amazon.Com Holdings, Inc. | Networked personal contact manager |
US6014090A (en) | 1997-12-22 | 2000-01-11 | At&T Corp. | Method and apparatus for delivering local information to travelers |
US6199014B1 (en) | 1997-12-23 | 2001-03-06 | Walker Digital, Llc | System for providing driving directions with visual cues |
US6359896B1 (en) | 1998-02-27 | 2002-03-19 | Avaya Technology Corp. | Dynamic selection of interworking functions in a communication system |
US20050251453A1 (en) | 2004-05-04 | 2005-11-10 | Jun Lu | Online electronic media exchange system and method |
US6192314B1 (en) | 1998-03-25 | 2001-02-20 | Navigation Technologies Corp. | Method and system for route calculation in a navigation application |
US6189008B1 (en) | 1998-04-03 | 2001-02-13 | Intertainer, Inc. | Dynamic digital asset management |
JP3514626B2 (en) | 1998-04-14 | 2004-03-31 | インクリメント・ピー株式会社 | Route information providing system and WWW server used therefor, route information providing method and WWW server used therefor |
DE19824141A1 (en) | 1998-05-29 | 1999-12-02 | Siemens Ag | Handover procedure (roaming) for mobile terminal equipment |
US20010044310A1 (en) | 1998-05-29 | 2001-11-22 | Scott Lincke | User-specific location information |
US6240069B1 (en) | 1998-06-16 | 2001-05-29 | Ericsson Inc. | System and method for location-based group services |
DE19829538A1 (en) | 1998-07-02 | 2000-01-05 | Bosch Gmbh Robert | Method for influencing source data for determining a route in a navigation system |
US6539080B1 (en) | 1998-07-14 | 2003-03-25 | Ameritech Corporation | Method and system for providing quick directions |
US6179252B1 (en) * | 1998-07-17 | 2001-01-30 | The Texas A&M University System | Intelligent rail crossing control system and train tracking system |
US6434579B1 (en) | 1998-08-19 | 2002-08-13 | Eastman Kodak Company | System and method of constructing a photo album |
WO2000011871A1 (en) | 1998-08-23 | 2000-03-02 | Open Entertainment, Inc. | Transaction system for transporting media files from content provider sources to home entertainment devices |
US6535868B1 (en) | 1998-08-27 | 2003-03-18 | Debra A. Galeazzi | Method and apparatus for managing metadata in a database management system |
JP3532773B2 (en) | 1998-09-26 | 2004-05-31 | ジヤトコ株式会社 | Portable position detection device and position management system |
US6363392B1 (en) | 1998-10-16 | 2002-03-26 | Vicinity Corporation | Method and system for providing a web-sharable personal database |
RU2144264C1 (en) | 1998-11-05 | 2000-01-10 | ЯН Давид Евгеньевич | Method and portable computer for remote wireless transmission and reception of coded information (options) |
US6023241A (en) | 1998-11-13 | 2000-02-08 | Intel Corporation | Digital multimedia navigation player/recorder |
US6212474B1 (en) | 1998-11-19 | 2001-04-03 | Navigation Technologies Corporation | System and method for providing route guidance with a navigation application program |
US6292743B1 (en) | 1999-01-06 | 2001-09-18 | Infogation Corporation | Mobile navigation system |
US20030060211A1 (en) | 1999-01-26 | 2003-03-27 | Vincent Chern | Location-based information retrieval system for wireless communication device |
DE19903909A1 (en) | 1999-02-01 | 2000-08-03 | Delphi 2 Creative Tech Gmbh | Method and device for obtaining relevant traffic information and for dynamic route optimization |
US6408301B1 (en) | 1999-02-23 | 2002-06-18 | Eastman Kodak Company | Interactive image storage, indexing and retrieval system |
EP1035531B1 (en) | 1999-03-05 | 2006-04-26 | Hitachi, Ltd. | Information providing system for mobile units |
US6278941B1 (en) | 1999-04-28 | 2001-08-21 | Kabushikikaisha Equos Research | Route guide system |
US6285950B1 (en) | 1999-05-13 | 2001-09-04 | Alpine Electronics, Inc. | Vehicle navigation system |
US6920455B1 (en) | 1999-05-19 | 2005-07-19 | Sun Microsystems, Inc. | Mechanism and method for managing service-specified data in a profile service |
AUPQ363299A0 (en) | 1999-10-25 | 1999-11-18 | Silverbrook Research Pty Ltd | Paper based information inter face |
DE19928295A1 (en) | 1999-06-22 | 2000-12-28 | Bosch Gmbh Robert | Determining route from initial position to destination involves storing route borders optimised with route search algorithm in route table, specifying intermediate destination(s) |
US20040181668A1 (en) | 1999-06-30 | 2004-09-16 | Blew Edwin O. | Methods for conducting server-side encryption/decryption-on-demand |
JP3791249B2 (en) | 1999-07-12 | 2006-06-28 | 株式会社日立製作所 | Mobile device |
US6122593A (en) | 1999-08-03 | 2000-09-19 | Navigation Technologies Corporation | Method and system for providing a preview of a route calculated with a navigation system |
US6549768B1 (en) | 1999-08-24 | 2003-04-15 | Nokia Corp | Mobile communications matching system |
EP1246495B1 (en) | 1999-08-30 | 2005-07-27 | Swisscom Mobile AG | Emergency call in a telecommunications network |
US6675015B1 (en) | 1999-09-15 | 2004-01-06 | Nokia Corporation | Apparatus, and associated method, for facilitating communication handovers in a bluetooth-public-access radio communication system |
DK1169873T3 (en) | 1999-09-29 | 2004-03-01 | Swisscom Mobile Ag | Procedure by which members of a common interest group can be found |
JP3749821B2 (en) | 1999-09-30 | 2006-03-01 | 株式会社東芝 | Pedestrian road guidance system and pedestrian road guidance method |
US6204844B1 (en) | 1999-10-08 | 2001-03-20 | Motorola, Inc. | Method and apparatus for dynamically grouping communication units in a communication system |
JP3521817B2 (en) | 1999-10-26 | 2004-04-26 | 株式会社エクォス・リサーチ | Navigation device |
US7630986B1 (en) | 1999-10-27 | 2009-12-08 | Pinpoint, Incorporated | Secure data interchange |
US6819919B1 (en) | 1999-10-29 | 2004-11-16 | Telcontar | Method for providing matching and introduction services to proximate mobile users and service providers |
JP3589124B2 (en) | 1999-11-18 | 2004-11-17 | トヨタ自動車株式会社 | Navigation device |
JP3751795B2 (en) | 1999-11-22 | 2006-03-01 | 株式会社東芝 | Pedestrian route guidance automatic creation device and method, and recording medium |
US6721727B2 (en) | 1999-12-02 | 2004-04-13 | International Business Machines Corporation | XML documents stored as column data |
US6826472B1 (en) | 1999-12-10 | 2004-11-30 | Tele Atlas North America, Inc. | Method and apparatus to generate driving guides |
US6415226B1 (en) | 1999-12-20 | 2002-07-02 | Navigation Technologies Corp. | Method and system for providing safe routes using a navigation system |
US6708172B1 (en) | 1999-12-22 | 2004-03-16 | Urbanpixel, Inc. | Community-based shared multiple browser environment |
US6662017B2 (en) | 1999-12-23 | 2003-12-09 | Tekelec | Methods and systems for routing messages associated with ported subscribers in a mobile communications network |
AU2001229371A1 (en) | 2000-01-14 | 2001-07-24 | Saba Software, Inc. | Information server |
US6523046B2 (en) | 2000-02-25 | 2003-02-18 | Microsoft Corporation | Infrastructure and method for supporting generic multimedia metadata |
ATE369677T1 (en) | 2000-02-29 | 2007-08-15 | Benjamin D Baker | INTELLIGENT CALLING PROCESS FOR A DISCUSSION FORUM |
US7367042B1 (en) | 2000-02-29 | 2008-04-29 | Goldpocket Interactive, Inc. | Method and apparatus for hyperlinking in a television broadcast |
JP3475142B2 (en) | 2000-03-01 | 2003-12-08 | 三菱電機株式会社 | Map data transmission device, map data transmission method, and computer-readable recording medium recording a program for causing a computer to execute the map data transmission method |
US6334086B1 (en) | 2000-03-10 | 2001-12-25 | Rotis Inc. (Road Traffic Information Systems) | Method and apparatus for collecting traffic information |
ATE276564T1 (en) | 2000-03-14 | 2004-10-15 | Siemens Ag | ROUTE PLANNING SYSTEM |
US6615130B2 (en) | 2000-03-17 | 2003-09-02 | Makor Issues And Rights Ltd. | Real time vehicle guidance and traffic forecasting system |
US6480783B1 (en) | 2000-03-17 | 2002-11-12 | Makor Issues And Rights Ltd. | Real time vehicle guidance and forecasting system under traffic jam conditions |
US6876642B1 (en) | 2000-03-27 | 2005-04-05 | Delphi Technologies, Inc. | In-vehicle wireless local area network |
US6502102B1 (en) | 2000-03-27 | 2002-12-31 | Accenture Llp | System, method and article of manufacture for a table-driven automated scripting architecture |
US7124164B1 (en) | 2001-04-17 | 2006-10-17 | Chemtob Helen J | Method and apparatus for providing group interaction via communications networks |
US6883019B1 (en) | 2000-05-08 | 2005-04-19 | Intel Corporation | Providing information to a communications device |
DE10023530A1 (en) | 2000-05-13 | 2001-11-15 | Mannesmann Vdo Ag | Route guidance display for navigation systems |
GB0011797D0 (en) | 2000-05-16 | 2000-07-05 | Yeoman Group Plc | Improved vehicle routeing |
US20020010628A1 (en) | 2000-05-24 | 2002-01-24 | Alan Burns | Method of advertising and polling |
US6718258B1 (en) | 2000-06-08 | 2004-04-06 | Navigation Technologies Corp | Method and system for obtaining user feedback regarding geographic data |
US6542750B2 (en) | 2000-06-10 | 2003-04-01 | Telcontar | Method and system for selectively connecting mobile users based on physical proximity |
US6539232B2 (en) | 2000-06-10 | 2003-03-25 | Telcontar | Method and system for connecting mobile users based on degree of separation |
US6542749B2 (en) | 2000-06-10 | 2003-04-01 | Telcontar | Method and system for connecting proximately located mobile users based on compatible attributes |
US7248841B2 (en) | 2000-06-13 | 2007-07-24 | Agee Brian G | Method and apparatus for optimization of wireless multipoint electromagnetic communication networks |
US20020049690A1 (en) | 2000-06-16 | 2002-04-25 | Masanori Takano | Method of expressing crowd movement in game, storage medium, and information processing apparatus |
EP1298414B1 (en) | 2000-07-04 | 2013-09-11 | Mitsubishi Denki Kabushiki Kaisha | Method for displaying landmark for navigation device |
WO2002009458A2 (en) | 2000-07-24 | 2002-01-31 | Bluesocket, Inc. | Method and system for enabling seamless roaming in a wireless network |
US6968179B1 (en) | 2000-07-27 | 2005-11-22 | Microsoft Corporation | Place specific buddy list services |
US6466938B1 (en) | 2000-07-31 | 2002-10-15 | Motorola, Inc. | Method and apparatus for locating a device using a database containing hybrid location data |
AUPQ921400A0 (en) | 2000-08-04 | 2000-08-31 | Canon Kabushiki Kaisha | Method of enabling browse and search access to electronically-accessible multimedia databases |
US6708186B1 (en) | 2000-08-14 | 2004-03-16 | Oracle International Corporation | Aggregating and manipulating dictionary metadata in a database system |
US7035912B2 (en) | 2000-08-28 | 2006-04-25 | Abaco.P.R., Inc. | Method and apparatus allowing a limited client device to use the full resources of a networked server |
EP1334587A1 (en) | 2000-08-31 | 2003-08-13 | Padcom Inc. | Method and apparatus for routing data over multiple wireless networks |
US6618593B1 (en) | 2000-09-08 | 2003-09-09 | Rovingradar, Inc. | Location dependent user matching system |
US6810323B1 (en) | 2000-09-25 | 2004-10-26 | Motorola, Inc. | System and method for storing and using information associated with geographic locations of interest to a mobile user |
US8117281B2 (en) | 2006-11-02 | 2012-02-14 | Addnclick, Inc. | Using internet content as a means to establish live social networks by linking internet users to each other who are simultaneously engaged in the same and/or similar content |
US20020062368A1 (en) | 2000-10-11 | 2002-05-23 | David Holtzman | System and method for establishing and evaluating cross community identities in electronic forums |
US6853841B1 (en) | 2000-10-25 | 2005-02-08 | Sun Microsystems, Inc. | Protocol for a remote control device to enable control of network attached devices |
US6895329B1 (en) | 2000-10-30 | 2005-05-17 | Board Of Trustees Of The University Of Illinois | Method and system for querying in a moving object database |
US6735583B1 (en) | 2000-11-01 | 2004-05-11 | Getty Images, Inc. | Method and system for classifying and locating media content |
US6591188B1 (en) | 2000-11-01 | 2003-07-08 | Navigation Technologies Corp. | Method, system and article of manufacture for identifying regularly traveled routes |
US6842761B2 (en) | 2000-11-21 | 2005-01-11 | America Online, Inc. | Full-text relevancy ranking |
US6366856B1 (en) | 2000-11-21 | 2002-04-02 | Qualcomm Incorporated | Method and apparatus for orienting a map display in a mobile or portable device |
US6629104B1 (en) | 2000-11-22 | 2003-09-30 | Eastman Kodak Company | Method for adding personalized metadata to a collection of digital images |
US6577949B1 (en) | 2000-11-22 | 2003-06-10 | Navigation Technologies Corp. | Method and system for exchanging routing data between end users |
WO2002059773A1 (en) | 2000-12-04 | 2002-08-01 | Thinkshare Corp. | Modular distributed mobile data applications |
US6675268B1 (en) | 2000-12-11 | 2004-01-06 | Lsi Logic Corporation | Method and apparatus for handling transfers of data volumes between controllers in a storage environment having multiple paths to the data volumes |
US6600418B2 (en) | 2000-12-12 | 2003-07-29 | 3M Innovative Properties Company | Object tracking and management system and method using radio-frequency identification tags |
US20030006911A1 (en) | 2000-12-22 | 2003-01-09 | The Cadre Group Inc. | Interactive advertising system and method |
US7493565B2 (en) | 2000-12-22 | 2009-02-17 | Microsoft Corporation | Environment-interactive context-aware devices and methods |
US7062469B2 (en) | 2001-01-02 | 2006-06-13 | Nokia Corporation | System and method for public wireless network access subsidized by dynamic display advertising |
WO2002057946A1 (en) | 2001-01-18 | 2002-07-25 | The Board Of Trustees Of The University Of Illinois | Method for optimizing a solution set |
US6505118B2 (en) | 2001-01-26 | 2003-01-07 | Ford Motor Company | Navigation system for land vehicles that learns and incorporates preferred navigation routes |
JP2002229991A (en) | 2001-01-31 | 2002-08-16 | Fujitsu Ltd | Server, user terminal, system and method for providing information |
US7457798B2 (en) | 2001-02-13 | 2008-11-25 | Microsoft Corporation | System and method for providing a universal and automatic communication access point |
JP3849435B2 (en) | 2001-02-23 | 2006-11-22 | 株式会社日立製作所 | Traffic situation estimation method and traffic situation estimation / provision system using probe information |
US6615133B2 (en) | 2001-02-27 | 2003-09-02 | International Business Machines Corporation | Apparatus, system, method and computer program product for determining an optimum route based on historical information |
JP3793032B2 (en) | 2001-02-28 | 2006-07-05 | 株式会社東芝 | Road guide method and apparatus |
US6529136B2 (en) | 2001-02-28 | 2003-03-04 | International Business Machines Corporation | Group notification system and method for implementing and indicating the proximity of individuals or groups to other individuals or groups |
JP2002258740A (en) | 2001-03-02 | 2002-09-11 | Mixed Reality Systems Laboratory Inc | Method and device for recording picture and method and device for reproducing picture |
US6954443B2 (en) | 2001-03-09 | 2005-10-11 | Nokia Corporation | Short range RF network with roaming terminals |
US20020128773A1 (en) | 2001-03-09 | 2002-09-12 | Chowanic Andrea Bowes | Multiple navigation routes based on user preferences and real time parameters |
US6484092B2 (en) | 2001-03-28 | 2002-11-19 | Intel Corporation | Method and system for dynamic and interactive route finding |
JP3994057B2 (en) | 2001-04-18 | 2007-10-17 | インターナショナル・ビジネス・マシーンズ・コーポレーション | Method and computer system for selecting an edge server computer |
US6879838B2 (en) | 2001-04-20 | 2005-04-12 | Koninklijke Philips Electronics N.V. | Distributed location based service system |
US6526349B2 (en) * | 2001-04-23 | 2003-02-25 | Motorola, Inc. | Method of compiling navigation route content |
US7240106B2 (en) | 2001-04-25 | 2007-07-03 | Hewlett-Packard Development Company, L.P. | System and method for remote discovery and configuration of a network device |
US6757517B2 (en) | 2001-05-10 | 2004-06-29 | Chin-Chi Chang | Apparatus and method for coordinated music playback in wireless ad-hoc networks |
US6633232B2 (en) * | 2001-05-14 | 2003-10-14 | Koninklijke Philips Electronics N.V. | Method and apparatus for routing persons through one or more destinations based on a least-cost criterion |
US20020168084A1 (en) * | 2001-05-14 | 2002-11-14 | Koninklijke Philips Electronics N.V. | Method and apparatus for assisting visitors in navigating retail and exhibition-like events using image-based crowd analysis |
US20040106415A1 (en) | 2001-05-29 | 2004-06-03 | Fujitsu Limited | Position information management system |
US7149625B2 (en) | 2001-05-31 | 2006-12-12 | Mathews Michael B | Method and system for distributed navigation and automated guidance |
US6990497B2 (en) | 2001-06-26 | 2006-01-24 | Microsoft Corporation | Dynamic streaming media management |
JP2003203084A (en) | 2001-06-29 | 2003-07-18 | Hitachi Ltd | Information terminal device, server, and information distributing device and method |
US7218611B2 (en) | 2001-07-05 | 2007-05-15 | Matsushita Electric Industrial Co., Ltd. | Broadcast system |
US7333820B2 (en) * | 2001-07-17 | 2008-02-19 | Networks In Motion, Inc. | System and method for providing routing, mapping, and relative position information to users of a communication network |
GB0117951D0 (en) | 2001-07-24 | 2001-09-19 | Koninkl Philips Electronics Nv | Methods and apparatus for determining the position of a transmitter and mobile communitcations device |
GB2379016A (en) * | 2001-07-27 | 2003-02-26 | Hewlett Packard Co | Portable apparatus monitoring reaction of user to music |
US7203753B2 (en) | 2001-07-31 | 2007-04-10 | Sun Microsystems, Inc. | Propagating and updating trust relationships in distributed peer-to-peer networks |
US7123918B1 (en) | 2001-08-20 | 2006-10-17 | Verizon Services Corp. | Methods and apparatus for extrapolating person and device counts |
US7567575B2 (en) | 2001-09-07 | 2009-07-28 | At&T Corp. | Personalized multimedia services using a mobile service platform |
US20050231425A1 (en) | 2001-09-10 | 2005-10-20 | American Gnc Corporation | Wireless wide area networked precision geolocation |
US7039622B2 (en) | 2001-09-12 | 2006-05-02 | Sas Institute Inc. | Computer-implemented knowledge repository interface system and method |
JP3882554B2 (en) | 2001-09-17 | 2007-02-21 | 日産自動車株式会社 | Navigation device |
US7765484B2 (en) | 2001-09-28 | 2010-07-27 | Aol Inc. | Passive personalization of lists |
EP1442411A4 (en) * | 2001-09-30 | 2006-02-01 | Realcontacts Ltd | Connection service |
US6757684B2 (en) | 2001-10-01 | 2004-06-29 | Ipac Acquisition Subsidiary I, Llc | Network-based photosharing architecture |
US6629100B2 (en) | 2001-10-01 | 2003-09-30 | Ipac Acquisition Subsidiary I, Llc | Network-based photosharing architecture for search and delivery of private images and metadata |
US20030229549A1 (en) | 2001-10-17 | 2003-12-11 | Automated Media Services, Inc. | System and method for providing for out-of-home advertising utilizing a satellite network |
AU2002363055A1 (en) | 2001-10-19 | 2003-05-06 | Bank Of America Corporation | System and method for interative advertising |
JP2003132158A (en) | 2001-10-22 | 2003-05-09 | Tryark Kk | Human network information management system and program |
AU2002365033A1 (en) * | 2001-10-25 | 2003-06-17 | The Johns Hopkins University | Wide area metal detection (wamd) system and method for security screening crowds |
EP1308694B1 (en) | 2001-11-01 | 2015-04-22 | Nissan Motor Company Limited | Navigation system, data server, travelling route establishing method and information providing method |
US7283628B2 (en) * | 2001-11-30 | 2007-10-16 | Analog Devices, Inc. | Programmable data encryption engine |
US6973384B2 (en) | 2001-12-06 | 2005-12-06 | Bellsouth Intellectual Property Corporation | Automated location-intelligent traffic notification service systems and methods |
US6606557B2 (en) | 2001-12-07 | 2003-08-12 | Motorola, Inc. | Method for improving dispatch response time |
US6574554B1 (en) | 2001-12-11 | 2003-06-03 | Garmin Ltd. | System and method for calculating a navigation route based on non-contiguous cartographic map databases |
US7617542B2 (en) * | 2001-12-21 | 2009-11-10 | Nokia Corporation | Location-based content protection |
US6978258B2 (en) | 2001-12-26 | 2005-12-20 | Autodesk, Inc. | Fuzzy logic reasoning for inferring user location preferences |
US7266563B2 (en) | 2001-12-28 | 2007-09-04 | Fotomedia Technologies, Llc | Specifying, assigning, and maintaining user defined metadata in a network-based photosharing system |
DE10200758A1 (en) | 2002-01-10 | 2003-11-13 | Daimler Chrysler Ag | Method and system for the guidance of vehicles |
US6970703B2 (en) | 2002-01-23 | 2005-11-29 | Motorola, Inc. | Integrated personal communications system and method |
US7421397B2 (en) | 2002-02-01 | 2008-09-02 | Canadian National Railway Company | System and method for providing a price quotation for a transportation service providing route selection capability |
US7167910B2 (en) | 2002-02-20 | 2007-01-23 | Microsoft Corporation | Social mapping of contacts from computer communication information |
US7343365B2 (en) | 2002-02-20 | 2008-03-11 | Microsoft Corporation | Computer system architecture for automatic context associations |
EP1481221B1 (en) | 2002-03-01 | 2010-11-17 | TeleCommunication Systems, Inc. | Method and apparatus for sending, retrieving, and planning location relevant information |
US6766245B2 (en) | 2002-03-14 | 2004-07-20 | Microsoft Corporation | Landmark-based location of users |
US7047315B1 (en) | 2002-03-19 | 2006-05-16 | Cisco Technology, Inc. | Method providing server affinity and client stickiness in a server load balancing device without TCP termination and without keeping flow states |
US7512702B1 (en) | 2002-03-19 | 2009-03-31 | Cisco Technology, Inc. | Method and apparatus providing highly scalable server load balancing |
CA2479838C (en) | 2002-03-19 | 2011-02-08 | Mapinfo Corporation | Location based service provider |
US7680796B2 (en) | 2003-09-03 | 2010-03-16 | Google, Inc. | Determining and/or using location information in an ad system |
US7134040B2 (en) | 2002-04-17 | 2006-11-07 | International Business Machines Corporation | Method, system, and program for selecting a path to a device to use when sending data requests to the device |
US20040025185A1 (en) | 2002-04-29 | 2004-02-05 | John Goci | Digital video jukebox network enterprise system |
JPWO2003093766A1 (en) | 2002-04-30 | 2005-09-08 | 株式会社日立製作所 | Communication navigation system and navigation method |
US7024207B2 (en) | 2002-04-30 | 2006-04-04 | Motorola, Inc. | Method of targeting a message to a communication device selected from among a set of communication devices |
JP4555072B2 (en) | 2002-05-06 | 2010-09-29 | シンクロネイション インコーポレイテッド | Localized audio network and associated digital accessories |
US7319379B1 (en) | 2003-05-16 | 2008-01-15 | Baglador S.A. Llc | Profile-based messaging apparatus and method |
US7254406B2 (en) | 2002-06-10 | 2007-08-07 | Suman Beros | Method and apparatus for effecting a detection of mobile devices that are proximate and exhibit commonalities between specific data sets, or profiles, associated with the persons transporting the mobile devices |
US7444655B2 (en) | 2002-06-11 | 2008-10-28 | Microsoft Corporation | Anonymous aggregated data collection |
US7236799B2 (en) | 2002-06-14 | 2007-06-26 | Cingular Wireless Ii, Llc | Apparatus and systems for providing location-based services within a wireless network |
US20050143097A1 (en) | 2002-06-14 | 2005-06-30 | Cingular Wireless Ii, Llc | System for providing location-based services in a wireless network, such as providing notification regarding meetings, destination arrivals, and the like |
US7116985B2 (en) | 2002-06-14 | 2006-10-03 | Cingular Wireless Ii, Llc | Method for providing location-based services in a wireless network, such as varying levels of services |
US7190960B2 (en) | 2002-06-14 | 2007-03-13 | Cingular Wireless Ii, Llc | System for providing location-based services in a wireless network, such as modifying locating privileges among individuals and managing lists of individuals associated with such privileges |
US7181227B2 (en) | 2002-06-14 | 2007-02-20 | Cingular Wireless Ii, Llc | Data structures and methods for location-based services within a wireless network |
US7203502B2 (en) | 2002-06-14 | 2007-04-10 | Cingular Wireless Ii, Llc | System for providing location-based services in a wireless network, such as locating individuals and coordinating meetings |
US7020710B2 (en) | 2002-06-21 | 2006-03-28 | Thomson Licensing | Streaming media delivery on multicast networks for network and server bandwidth minimization and enhanced personalization |
US20040225519A1 (en) | 2002-06-25 | 2004-11-11 | Martin Keith D. | Intelligent music track selection |
US7243134B2 (en) | 2002-06-25 | 2007-07-10 | Motorola, Inc. | Server-based navigation system having dynamic transmittal of route information |
US7071842B1 (en) | 2002-06-27 | 2006-07-04 | Earthcomber, Llc | System and method for locating and notifying a user of a person, place or thing having attributes matching the user's stated preferences |
JP3954454B2 (en) | 2002-07-05 | 2007-08-08 | アルパイン株式会社 | Map data distribution system and navigation device |
JP2004045054A (en) | 2002-07-08 | 2004-02-12 | Hcx:Kk | Car navigation system |
FI112998B (en) | 2002-08-21 | 2004-02-13 | Nokia Corp | Method and device for data transmission |
US7234117B2 (en) | 2002-08-28 | 2007-06-19 | Microsoft Corporation | System and method for shared integrated online social interaction |
AU2003279071A1 (en) | 2002-09-23 | 2004-04-08 | Wimetrics Corporation | System and method for wireless local area network monitoring and intrusion detection |
CN100507450C (en) | 2002-09-24 | 2009-07-01 | 三洋电机株式会社 | Navigation apparatus and server apparatus |
US20040257340A1 (en) | 2002-10-07 | 2004-12-23 | Bjorn Jawerth | Method and software for navigation of data on a device display |
US7249123B2 (en) | 2002-10-31 | 2007-07-24 | International Business Machines Corporation | System and method for building social networks based on activity around shared virtual objects |
US7247024B2 (en) | 2002-11-22 | 2007-07-24 | Ut-Battelle, Llc | Method for spatially distributing a population |
WO2004053755A1 (en) | 2002-12-11 | 2004-06-24 | Nokia Corporation | Method and device for accessing of documents |
AU2003296171A1 (en) | 2002-12-27 | 2004-07-29 | Matsushita Electric Industrial Co., Ltd. | Traffic information providing system, traffic information expression method and device |
JP2004241866A (en) | 2003-02-03 | 2004-08-26 | Alpine Electronics Inc | Inter-vehicle communication system |
JP4096180B2 (en) | 2003-02-10 | 2008-06-04 | アイシン・エィ・ダブリュ株式会社 | NAVIGATION DEVICE, PROGRAM FOR THE DEVICE, AND RECORDING MEDIUM |
US8423042B2 (en) | 2004-02-24 | 2013-04-16 | Invisitrack, Inc. | Method and system for positional finding using RF, continuous and/or combined movement |
US7787886B2 (en) | 2003-02-24 | 2010-08-31 | Invisitrack, Inc. | System and method for locating a target using RFID |
US7216034B2 (en) | 2003-02-27 | 2007-05-08 | Nokia Corporation | System and method for an intelligent multi-modal user interface for route drawing |
US7158798B2 (en) | 2003-02-28 | 2007-01-02 | Lucent Technologies Inc. | Location-based ad-hoc game services |
JP2004272632A (en) | 2003-03-10 | 2004-09-30 | Sony Corp | Information processor, information processing method and computer program |
FI118494B (en) | 2003-03-26 | 2007-11-30 | Teliasonera Finland Oyj | A method for monitoring traffic flows of mobile users |
JP2004309705A (en) | 2003-04-04 | 2004-11-04 | Pioneer Electronic Corp | Device, system, method, and program for processing map information, and recording medium with program recorded thereon |
JP4198513B2 (en) | 2003-04-18 | 2008-12-17 | パイオニア株式会社 | MAP INFORMATION PROCESSING DEVICE, MAP INFORMATION PROCESSING SYSTEM, POSITION INFORMATION DISPLAY DEVICE, ITS METHOD, ITS PROGRAM, AND RECORDING MEDIUM CONTAINING THE PROGRAM |
US20040224702A1 (en) | 2003-05-09 | 2004-11-11 | Nokia Corporation | System and method for access control in the delivery of location information |
EP1477770B1 (en) | 2003-05-12 | 2015-04-15 | Harman Becker Automotive Systems GmbH | Method to assist off-road navigation and corresponding navigation system |
US20050015432A1 (en) | 2003-05-13 | 2005-01-20 | Cohen Hunter C. | Deriving contact information from emails |
JP4133570B2 (en) | 2003-05-15 | 2008-08-13 | アルパイン株式会社 | Navigation device |
US7119716B2 (en) | 2003-05-28 | 2006-10-10 | Legalview Assets, Limited | Response systems and methods for notification systems for modifying future notifications |
US6987885B2 (en) | 2003-06-12 | 2006-01-17 | Honda Motor Co., Ltd. | Systems and methods for using visual hulls to determine the number of people in a crowd |
US7069308B2 (en) | 2003-06-16 | 2006-06-27 | Friendster, Inc. | System, method and apparatus for connecting users in an online computer system based on their relationships within social networks |
US6975266B2 (en) | 2003-06-17 | 2005-12-13 | Global Locate, Inc. | Method and apparatus for locating position of a satellite signal receiver |
GB0314770D0 (en) | 2003-06-25 | 2003-07-30 | Ibm | Navigation system |
US20050132047A1 (en) | 2003-07-10 | 2005-06-16 | University Of Florida Research Foundation, Inc. | Targeted messaging system and related methods |
WO2005017455A1 (en) | 2003-07-16 | 2005-02-24 | Harman Becker Automotive Systems Gmbh | Transmission of special routes to a navigation device |
US20050015800A1 (en) | 2003-07-17 | 2005-01-20 | Holcomb Thomas J. | Method and system for managing television advertising |
US7627334B2 (en) | 2003-07-21 | 2009-12-01 | Contextual Information, Inc. | Systems and methods for context relevant information management and display |
US7536256B2 (en) | 2003-07-31 | 2009-05-19 | International Business Machines Corporation | Agenda replicator system and method for travelers |
US7283046B2 (en) | 2003-08-01 | 2007-10-16 | Spectrum Tracking Systems, Inc. | Method and system for providing tracking services to locate an asset |
US20050038876A1 (en) | 2003-08-15 | 2005-02-17 | Aloke Chaudhuri | System and method for instant match based on location, presence, personalization and communication |
DE10338329A1 (en) | 2003-08-21 | 2005-03-17 | Dr.Ing.H.C. F. Porsche Ag | Navigation system with route guidance |
US7085571B2 (en) | 2003-08-26 | 2006-08-01 | Kyocera Wireless Corp. | System and method for using geographical location to determine when to exit an existing wireless communications coverage network |
US20050060350A1 (en) | 2003-09-15 | 2005-03-17 | Baum Zachariah Journey | System and method for recommendation of media segments |
US8473729B2 (en) * | 2003-09-15 | 2013-06-25 | Intel Corporation | Method and apparatus for managing the privacy and disclosure of location information |
US7545941B2 (en) | 2003-09-16 | 2009-06-09 | Nokia Corporation | Method of initializing and using a security association for middleware based on physical proximity |
US7773985B2 (en) | 2003-09-22 | 2010-08-10 | United Parcel Service Of America, Inc. | Symbiotic system for testing electromagnetic signal coverage in areas near transport routes |
US7428417B2 (en) | 2003-09-26 | 2008-09-23 | Siemens Communications, Inc. | System and method for presence perimeter rule downloading |
US7343160B2 (en) | 2003-09-29 | 2008-03-11 | Broadcom Corporation | System and method for servicing communications using both fixed and mobile wireless networks |
US8527332B2 (en) | 2003-09-29 | 2013-09-03 | International Business Machines Corporation | Incentive-based website architecture |
US20040107283A1 (en) | 2003-10-06 | 2004-06-03 | Trilibis Inc. | System and method for the aggregation and matching of personal information |
US7200638B2 (en) | 2003-10-14 | 2007-04-03 | International Business Machines Corporation | System and method for automatic population of instant messenger lists |
EP1528714B1 (en) | 2003-10-30 | 2012-03-07 | Research In Motion Limited | System and method of wireless proximity awareness |
US20050130634A1 (en) | 2003-10-31 | 2005-06-16 | Globespanvirata, Inc. | Location awareness in wireless networks |
US20050096840A1 (en) | 2003-11-03 | 2005-05-05 | Simske Steven J. | Navigation routing system and method |
US7373109B2 (en) | 2003-11-04 | 2008-05-13 | Nokia Corporation | System and method for registering attendance of entities associated with content creation |
US7130740B2 (en) * | 2003-11-07 | 2006-10-31 | Motorola, Inc. | Method and apparatus for generation of real-time graphical descriptions in navigational systems |
US20050102098A1 (en) | 2003-11-07 | 2005-05-12 | Montealegre Steve E. | Adaptive navigation system with artificial intelligence |
US7359724B2 (en) | 2003-11-20 | 2008-04-15 | Nokia Corporation | Method and system for location based group formation |
US7124023B2 (en) | 2003-12-12 | 2006-10-17 | Palo Alto Research Center Incorporated | Traffic flow data collection agents |
US7228224B1 (en) * | 2003-12-29 | 2007-06-05 | At&T Corp. | System and method for determining traffic conditions |
US7516212B2 (en) | 2004-01-21 | 2009-04-07 | Hewlett-Packard Development Company, L.P. | Device status identification |
JP2005214779A (en) | 2004-01-29 | 2005-08-11 | Xanavi Informatics Corp | Navigation system and method for updating map data |
US7269590B2 (en) | 2004-01-29 | 2007-09-11 | Yahoo! Inc. | Method and system for customizing views of information associated with a social network user |
US20050171843A1 (en) | 2004-02-03 | 2005-08-04 | Robert Brazell | Systems and methods for optimizing advertising |
US7398081B2 (en) | 2004-02-04 | 2008-07-08 | Modu Ltd. | Device and system for selective wireless communication with contact list memory |
US7310676B2 (en) | 2004-02-09 | 2007-12-18 | Proxpro, Inc. | Method and computer system for matching mobile device users for business and social networking |
JP4294509B2 (en) | 2004-02-10 | 2009-07-15 | アルパイン株式会社 | Navigation device, route search method and program |
US7545784B2 (en) | 2004-02-11 | 2009-06-09 | Yahoo! Inc. | System and method for wireless communication between previously known and unknown users |
WO2005079425A2 (en) | 2004-02-17 | 2005-09-01 | Tri-Pen Travelmaster Technologies, Llc | Travel monitoring |
US7239960B2 (en) | 2004-02-19 | 2007-07-03 | Alpine Electronics, Inc. | Navigation method and system for visiting multiple destinations by minimum number of stops |
WO2005081087A1 (en) | 2004-02-25 | 2005-09-01 | Accenture Global Services Gmbh | Rfid protected media system and method that provides dynamic downloadable media |
WO2005081088A1 (en) | 2004-02-25 | 2005-09-01 | Accenture Global Services Gmbh | Rfid protected media system and method |
ES2276240T3 (en) | 2004-02-26 | 2007-06-16 | Alcatel Lucent | METHOD FOR ENTERING DESTINATION DATA THROUGH A MOBILE TERMINAL. |
US8014763B2 (en) | 2004-02-28 | 2011-09-06 | Charles Martin Hymes | Wireless communications with proximal targets identified visually, aurally, or positionally |
US20050198305A1 (en) | 2004-03-04 | 2005-09-08 | Peter Pezaris | Method and system for associating a thread with content in a social networking environment |
US20050197846A1 (en) | 2004-03-04 | 2005-09-08 | Peter Pezaris | Method and system for generating a proximity index in a social networking environment |
US7206568B2 (en) | 2004-03-15 | 2007-04-17 | Loc-Aid Technologies, Inc. | System and method for exchange of geographic location and user profiles over a wireless network |
US7831387B2 (en) | 2004-03-23 | 2010-11-09 | Google Inc. | Visually-oriented driving directions in digital mapping system |
US20050256813A1 (en) | 2004-03-26 | 2005-11-17 | Radvan Bahbouh | Method and system for data understanding using sociomapping |
US8972576B2 (en) | 2004-04-28 | 2015-03-03 | Kdl Scan Designs Llc | Establishing a home relationship between a wireless device and a server in a wireless network |
US8028038B2 (en) | 2004-05-05 | 2011-09-27 | Dryden Enterprises, Llc | Obtaining a playlist based on user profile matching |
US20050251565A1 (en) | 2004-05-05 | 2005-11-10 | Martin Weel | Hybrid set-top box for digital entertainment network |
US7593740B2 (en) | 2004-05-12 | 2009-09-22 | Google, Inc. | Location-based social software for mobile devices |
US7269504B2 (en) | 2004-05-12 | 2007-09-11 | Motorola, Inc. | System and method for assigning a level of urgency to navigation cues |
US7123189B2 (en) * | 2004-05-13 | 2006-10-17 | Bushnell Performance Optics | Apparatus and method for allowing user to track path of travel over extended period of time |
US20050278371A1 (en) | 2004-06-15 | 2005-12-15 | Karsten Funk | Method and system for georeferential blogging, bookmarking a location, and advanced off-board data processing for mobile systems |
JP4277746B2 (en) | 2004-06-25 | 2009-06-10 | 株式会社デンソー | Car navigation system |
US7509131B2 (en) | 2004-06-29 | 2009-03-24 | Microsoft Corporation | Proximity detection using wireless signal strengths |
US7827176B2 (en) | 2004-06-30 | 2010-11-02 | Google Inc. | Methods and systems for endorsing local search results |
US7460953B2 (en) | 2004-06-30 | 2008-12-02 | Navteq North America, Llc | Method of operating a navigation system using images |
WO2006010977A1 (en) | 2004-06-30 | 2006-02-02 | Nokia Corporation | System and method for generating a list of devices in physical proximity of a terminal |
US7359894B1 (en) | 2004-06-30 | 2008-04-15 | Google Inc. | Methods and systems for requesting and providing information in a social network |
JP4130441B2 (en) | 2004-07-16 | 2008-08-06 | 三菱電機株式会社 | Map information processing device |
US20080126476A1 (en) | 2004-08-04 | 2008-05-29 | Nicholas Frank C | Method and System for the Creating, Managing, and Delivery of Enhanced Feed Formatted Content |
US20060036457A1 (en) | 2004-08-13 | 2006-02-16 | Mcnamara Lori | Systems and methods for facilitating romantic connections |
US7158876B2 (en) | 2004-08-13 | 2007-01-02 | Hubert W. Crook Computer Consultants, Inc. | Automated vehicle routing based on physical vehicle criteria |
US7424363B2 (en) | 2004-08-20 | 2008-09-09 | Robert Bosch Corporation | Method and system for adaptive navigation using a driver's route knowledge |
US20060046743A1 (en) | 2004-08-24 | 2006-03-02 | Mirho Charles A | Group organization according to device location |
US20060047568A1 (en) | 2004-08-26 | 2006-03-02 | Ian Eisenberg | SMS messaging-based layered service and contact method, system and method of conducting business |
US7890871B2 (en) | 2004-08-26 | 2011-02-15 | Redlands Technology, Llc | System and method for dynamically generating, maintaining, and growing an online social network |
US20060046740A1 (en) | 2004-09-01 | 2006-03-02 | Johnson Karen L | Technique for providing location-based information concerning products and services through an information assistance service |
US8126441B2 (en) | 2004-09-21 | 2012-02-28 | Advanced Ground Information Systems, Inc. | Method of establishing a cell phone network of participants with a common interest |
US7480567B2 (en) | 2004-09-24 | 2009-01-20 | Nokia Corporation | Displaying a map having a close known location |
JP2006119120A (en) | 2004-09-27 | 2006-05-11 | Denso Corp | Car navigation device |
US7881945B2 (en) * | 2004-09-28 | 2011-02-01 | Dell Products L.P. | System and method for managing data concerning service dispatches involving geographic features |
US7509093B2 (en) | 2004-10-07 | 2009-03-24 | Nokia Corporation | Apparatus and method for indicating proximity co-presence for social application using short range radio communication |
CN101040554B (en) * | 2004-10-14 | 2010-05-05 | 松下电器产业株式会社 | Destination prediction apparatus and destination prediction method |
EP1825430A4 (en) | 2004-10-19 | 2009-08-26 | Yahoo Inc | System and method for location based social networking |
US11283885B2 (en) | 2004-10-19 | 2022-03-22 | Verizon Patent And Licensing Inc. | System and method for location based matching and promotion |
US8615565B2 (en) | 2008-09-09 | 2013-12-24 | Monster Patents, Llc | Automatic content retrieval based on location-based screen tags |
US20060112141A1 (en) | 2004-11-24 | 2006-05-25 | Morris Robert P | System for automatically creating a metadata repository for multimedia |
US20060112067A1 (en) | 2004-11-24 | 2006-05-25 | Morris Robert P | Interactive system for collecting metadata |
US8606516B2 (en) | 2004-11-30 | 2013-12-10 | Dash Navigation, Inc. | User interface system and method for a vehicle navigation device |
US20060123080A1 (en) | 2004-12-03 | 2006-06-08 | Motorola, Inc. | Method and system of collectively setting preferences among a plurality of electronic devices and users |
US20060129308A1 (en) | 2004-12-10 | 2006-06-15 | Lawrence Kates | Management and navigation system for the blind |
DE102004062825B4 (en) * | 2004-12-27 | 2006-11-23 | Infineon Technologies Ag | Cryptographic unit and method for operating a cryptographic unit |
US7908080B2 (en) | 2004-12-31 | 2011-03-15 | Google Inc. | Transportation routing |
US20060149628A1 (en) | 2005-01-04 | 2006-07-06 | International Business Machines Corporation | Method and system for implementing a customer incentive program |
US20060195361A1 (en) | 2005-10-01 | 2006-08-31 | Outland Research | Location-based demographic profiling system and method of use |
US20060229058A1 (en) | 2005-10-29 | 2006-10-12 | Outland Research | Real-time person-to-person communication using geospatial addressing |
US7853268B2 (en) | 2005-01-26 | 2010-12-14 | Broadcom Corporation | GPS enabled cell phone location tracking for security purposes |
US7444237B2 (en) | 2005-01-26 | 2008-10-28 | Fujitsu Limited | Planning a journey that includes waypoints |
US7809500B2 (en) | 2005-02-07 | 2010-10-05 | Microsoft Corporation | Resolving discrepancies between location information and route data on a navigation device |
US7623966B2 (en) | 2005-02-11 | 2009-11-24 | Delphi Technologies, Inc. | System and method for providing information to travelers |
US7423580B2 (en) | 2005-03-14 | 2008-09-09 | Invisitrack, Inc. | Method and system of three-dimensional positional finding |
US7729947B1 (en) | 2005-03-23 | 2010-06-01 | Verizon Laboratories Inc. | Computer implemented methods and system for providing a plurality of options with respect to a stopping point |
US20060218225A1 (en) | 2005-03-28 | 2006-09-28 | Hee Voon George H | Device for sharing social network information among users over a network |
US7353034B2 (en) | 2005-04-04 | 2008-04-01 | X One, Inc. | Location sharing and tracking using mobile phones or other wireless devices |
US20090055229A1 (en) | 2005-04-07 | 2009-02-26 | Lars Lidgren | Emergency Warning Service |
US7495631B2 (en) | 2005-04-12 | 2009-02-24 | International Business Machines Corporation | Method, apparatus and computer program product for dynamic display of billboard information |
US7624024B2 (en) | 2005-04-18 | 2009-11-24 | United Parcel Service Of America, Inc. | Systems and methods for dynamically updating a dispatch plan |
US20070210937A1 (en) | 2005-04-21 | 2007-09-13 | Microsoft Corporation | Dynamic rendering of map information |
US7684815B2 (en) | 2005-04-21 | 2010-03-23 | Microsoft Corporation | Implicit group formation around feed content for mobile devices |
US7496445B2 (en) | 2005-04-27 | 2009-02-24 | Proxemics, Llc | Wayfinding |
US20060247852A1 (en) | 2005-04-29 | 2006-11-02 | Kortge James M | System and method for providing safety-optimized navigation route planning |
US7489240B2 (en) | 2005-05-03 | 2009-02-10 | Qualcomm, Inc. | System and method for 3-D position determination using RFID |
US7451041B2 (en) | 2005-05-06 | 2008-11-11 | Facet Technology Corporation | Network-based navigation system having virtual drive-thru advertisements integrated with actual imagery from along a physical route |
US8788192B2 (en) | 2005-05-18 | 2014-07-22 | International Business Machines Corporation | Navigation method, system or service and computer program product |
TW200641739A (en) | 2005-05-20 | 2006-12-01 | Mitac Int Corp | Navigation system for positioning by personal data |
US7848765B2 (en) | 2005-05-27 | 2010-12-07 | Where, Inc. | Location-based services |
US20060266830A1 (en) | 2005-05-31 | 2006-11-30 | Horozov Tzvetan T | Location-based recommendation system |
EP1894386B1 (en) | 2005-06-01 | 2018-08-08 | Google LLC | Media play optimization |
US7711478B2 (en) | 2005-06-21 | 2010-05-04 | Mappick Technologies, Llc | Navigation system and method |
US20070005419A1 (en) | 2005-06-30 | 2007-01-04 | Microsoft Corporation | Recommending location and services via geospatial collaborative filtering |
US20090063205A1 (en) * | 2005-07-12 | 2009-03-05 | Pioneer Corporation | Theme park management apparatus, theme park management method, theme park management program, and recording medium |
WO2007011839A2 (en) | 2005-07-15 | 2007-01-25 | Agilis Systems, Inc. | Mobile resource location-based customer contact systems and methods |
US7706280B2 (en) | 2005-08-01 | 2010-04-27 | Limelight Networks, Inc. | Heavy load packet-switched routing |
US7831381B2 (en) | 2005-08-04 | 2010-11-09 | Microsoft Corporation | Data engine for ranking popularity of landmarks in a geographical area |
US8150416B2 (en) | 2005-08-08 | 2012-04-03 | Jambo Networks, Inc. | System and method for providing communication services to mobile device users incorporating proximity determination |
US20070037574A1 (en) | 2005-08-09 | 2007-02-15 | Jonathan Libov | Method and apparatus of a location-based network service for mutual social notification |
US7634354B2 (en) | 2005-08-31 | 2009-12-15 | Microsoft Corporation | Location signposting and orientation |
US8560385B2 (en) | 2005-09-02 | 2013-10-15 | Bees & Pollen Ltd. | Advertising and incentives over a social network |
US20090234711A1 (en) | 2005-09-14 | 2009-09-17 | Jorey Ramer | Aggregation of behavioral profile data using a monetization platform |
US7702821B2 (en) | 2005-09-15 | 2010-04-20 | Eye-Fi, Inc. | Content-aware digital media storage device and methods of using the same |
KR101085700B1 (en) * | 2005-09-16 | 2011-11-22 | 삼성전자주식회사 | Method for providing location information service in lbs provider and method for receiving location information service in requester terminal |
US7698061B2 (en) | 2005-09-23 | 2010-04-13 | Scenera Technologies, Llc | System and method for selecting and presenting a route to a user |
US20070078596A1 (en) | 2005-09-30 | 2007-04-05 | John Grace | Landmark enhanced directions |
US20070083428A1 (en) | 2005-10-12 | 2007-04-12 | Susanne Goldstein | System and method for navigation by advertising landmark |
US7874521B2 (en) | 2005-10-17 | 2011-01-25 | Hoshiko Llc | Method and system for aviation navigation |
US7660666B2 (en) | 2005-11-18 | 2010-02-09 | Navteq North America, Llc | Geographic database with detailed local data |
US9240051B2 (en) | 2005-11-23 | 2016-01-19 | Avigilon Fortress Corporation | Object density estimation in video |
US7558404B2 (en) | 2005-11-28 | 2009-07-07 | Honeywell International Inc. | Detection of abnormal crowd behavior |
KR100721522B1 (en) * | 2005-11-28 | 2007-05-23 | 한국전자통신연구원 | Method for providing location based service using location token |
US20070136132A1 (en) | 2005-12-09 | 2007-06-14 | Envisionit Llc | Systems and methods for distributing promotions over message broadcasting and local wireless systems |
US20060227047A1 (en) | 2005-12-13 | 2006-10-12 | Outland Research | Meeting locator system and method of using the same |
US20070149214A1 (en) | 2005-12-13 | 2007-06-28 | Squareloop, Inc. | System, apparatus, and methods for location managed message processing |
US20070168208A1 (en) * | 2005-12-13 | 2007-07-19 | Ville Aikas | Location recommendation method and system |
US20070135138A1 (en) | 2005-12-13 | 2007-06-14 | Internation Business Machines Corporation | Methods, systems, and computer program products for providing location based subscription services |
CN1776684A (en) | 2005-12-15 | 2006-05-24 | 陈彦 | Wiki electronic map method |
US7774001B2 (en) | 2005-12-16 | 2010-08-10 | Sony Ericsson Mobile Communications Ab | Device and method for determining where crowds exist |
US7801542B1 (en) | 2005-12-19 | 2010-09-21 | Stewart Brett B | Automatic management of geographic information pertaining to social networks, groups of users, or assets |
US7620404B2 (en) | 2005-12-22 | 2009-11-17 | Pascal Chesnais | Methods and apparatus for organizing and presenting contact information in a mobile communication system |
US20070218900A1 (en) | 2006-03-17 | 2007-09-20 | Raj Vasant Abhyanker | Map based neighborhood search and community contribution |
US7743985B2 (en) | 2005-12-29 | 2010-06-29 | Motorola, Inc. | Method and apparatus for an up-to-date transportation notification system |
US7496359B2 (en) | 2006-01-10 | 2009-02-24 | Inventec Corporation | System for finding a missing mobile phone |
JP2007192893A (en) * | 2006-01-17 | 2007-08-02 | Sony Corp | Encryption processing device, encryption processing method, and computer program |
US7466986B2 (en) | 2006-01-19 | 2008-12-16 | International Business Machines Corporation | On-device mapping of WIFI hotspots via direct connection of WIFI-enabled and GPS-enabled mobile devices |
US20070174243A1 (en) | 2006-01-20 | 2007-07-26 | Fritz Charles W | Mobile social search using physical identifiers |
US7788188B2 (en) * | 2006-01-30 | 2010-08-31 | Hoozware, Inc. | System for providing a service to venues where people aggregate |
WO2007090133A2 (en) | 2006-01-30 | 2007-08-09 | Kramer Jame F | System for providing a service to venues where people aggregate |
US20070179863A1 (en) | 2006-01-30 | 2007-08-02 | Goseetell Network, Inc. | Collective intelligence recommender system for travel information and travel industry marketing platform |
US8352183B2 (en) | 2006-02-04 | 2013-01-08 | Microsoft Corporation | Maps for social networking and geo blogs |
WO2007092946A2 (en) | 2006-02-08 | 2007-08-16 | Entermedia Corporation | Downloadable server-client collaborative mobile social computing application |
US20070185744A1 (en) | 2006-02-09 | 2007-08-09 | Steven Robertson | System and method for providing customized travel guides and itineraries over a distributed network |
US7925243B2 (en) | 2006-02-14 | 2011-04-12 | Mcgary Faith | System and method for providing mobile device services using SMS communications |
US20070205276A1 (en) | 2006-03-01 | 2007-09-06 | Uwe Sodan | Visualization confirmation of price zoning display |
CA2648800A1 (en) | 2006-03-03 | 2007-09-13 | Fort Supply Ip, Llc | Social group management system and method therefor |
US7831235B2 (en) | 2006-03-17 | 2010-11-09 | Nokia Corporation | System and method for requesting remote care using mobile devices |
US7743056B2 (en) | 2006-03-31 | 2010-06-22 | Aol Inc. | Identifying a result responsive to a current location of a client device |
US7840224B2 (en) | 2006-04-07 | 2010-11-23 | Pelago, Inc. | Facilitating user interactions based on proximity |
US9100454B2 (en) | 2006-04-07 | 2015-08-04 | Groupon, Inc. | Method and system for enabling the creation and maintenance of proximity-related user groups |
US7702456B2 (en) | 2006-04-14 | 2010-04-20 | Scenera Technologies, Llc | System and method for presenting a computed route |
US20070250476A1 (en) | 2006-04-21 | 2007-10-25 | Lockheed Martin Corporation | Approximate nearest neighbor search in metric space |
US7636779B2 (en) | 2006-04-28 | 2009-12-22 | Yahoo! Inc. | Contextual mobile local search based on social network vitality information |
US8046411B2 (en) | 2006-04-28 | 2011-10-25 | Yahoo! Inc. | Multimedia sharing in social networks for mobile devices |
US7689355B2 (en) | 2006-05-04 | 2010-03-30 | International Business Machines Corporation | Method and process for enabling advertising via landmark based directions |
US20070271136A1 (en) | 2006-05-19 | 2007-11-22 | Dw Data Inc. | Method for pricing advertising on the internet |
US20070282621A1 (en) | 2006-06-01 | 2007-12-06 | Flipt, Inc | Mobile dating system incorporating user location information |
US8571580B2 (en) * | 2006-06-01 | 2013-10-29 | Loopt Llc. | Displaying the location of individuals on an interactive map display on a mobile communication device |
US20070290832A1 (en) | 2006-06-16 | 2007-12-20 | Fmr Corp. | Invoking actionable alerts |
WO2008000044A1 (en) | 2006-06-29 | 2008-01-03 | Relevancenow Pty Limited | Cyberpersonalities in artificial reality |
US20090287783A1 (en) | 2006-06-30 | 2009-11-19 | Eccosphere International Pty Ltd., An Australian C | Method of social interaction between communication device users |
US7680959B2 (en) | 2006-07-11 | 2010-03-16 | Napo Enterprises, Llc | P2P network for providing real time media recommendations |
US7932831B2 (en) | 2006-07-11 | 2011-04-26 | At&T Intellectual Property I, L.P. | Crowd determination |
US20080033809A1 (en) | 2006-07-24 | 2008-02-07 | Black Andre B | Techniques for promotion management |
US7522069B2 (en) | 2006-07-27 | 2009-04-21 | Vmatter Holdings, Llc | Vehicle trip logger |
US9976865B2 (en) | 2006-07-28 | 2018-05-22 | Ridetones, Inc. | Vehicle communication system with navigation |
US20080032666A1 (en) | 2006-08-07 | 2008-02-07 | Microsoft Corporation | Location based notification services |
DE102006037250A1 (en) | 2006-08-09 | 2008-04-10 | Müller, Thomas | Methods and devices for identity verification |
GB2440958A (en) | 2006-08-15 | 2008-02-20 | Tomtom Bv | Method of correcting map data for use in navigation systems |
US20080077595A1 (en) | 2006-09-14 | 2008-03-27 | Eric Leebow | System and method for facilitating online social networking |
US8436911B2 (en) | 2006-09-14 | 2013-05-07 | Freezecrowd, Inc. | Tagging camera |
US20080182563A1 (en) | 2006-09-15 | 2008-07-31 | Wugofski Theodore D | Method and system for social networking over mobile devices using profiles |
US20080086741A1 (en) | 2006-10-10 | 2008-04-10 | Quantcast Corporation | Audience commonality and measurement |
US20080097999A1 (en) | 2006-10-10 | 2008-04-24 | Tim Horan | Dynamic creation of information sharing social networks |
US7917154B2 (en) | 2006-11-01 | 2011-03-29 | Yahoo! Inc. | Determining mobile content for a social network based on location and time |
US20080113674A1 (en) | 2006-11-10 | 2008-05-15 | Mohammad Faisal Baig | Vicinity-based community for wireless users |
US20080242317A1 (en) | 2007-03-26 | 2008-10-02 | Fatdoor, Inc. | Mobile content creation, sharing, and commerce in a geo-spatial environment |
US8116564B2 (en) | 2006-11-22 | 2012-02-14 | Regents Of The University Of Minnesota | Crowd counting and monitoring |
US20080134088A1 (en) | 2006-12-05 | 2008-06-05 | Palm, Inc. | Device for saving results of location based searches |
US20080182591A1 (en) | 2006-12-13 | 2008-07-31 | Synthesis Studios, Inc. | Mobile Proximity-Based Notifications |
EP2177010B1 (en) | 2006-12-13 | 2015-10-28 | Quickplay Media Inc. | Mobile media platform |
US20080146250A1 (en) | 2006-12-15 | 2008-06-19 | Jeffrey Aaron | Method and System for Creating and Using a Location Safety Indicator |
US8566602B2 (en) | 2006-12-15 | 2013-10-22 | At&T Intellectual Property I, L.P. | Device, system and method for recording personal encounter history |
US8224359B2 (en) | 2006-12-22 | 2012-07-17 | Yahoo! Inc. | Provisioning my status information to others in my social network |
US20080183814A1 (en) | 2007-01-29 | 2008-07-31 | Yahoo! Inc. | Representing online presence for groups |
US20080188261A1 (en) | 2007-02-02 | 2008-08-07 | Miles Arnone | Mediated social network |
CN101652789A (en) | 2007-02-12 | 2010-02-17 | 肖恩·奥沙利文 | Share transportation system and service network |
US7774227B2 (en) | 2007-02-23 | 2010-08-10 | Saama Technologies, Inc. | Method and system utilizing online analytical processing (OLAP) for making predictions about business locations |
US20080242271A1 (en) | 2007-03-26 | 2008-10-02 | Kurt Schmidt | Electronic device with location-based and presence-based user preferences and method of controlling same |
US8112720B2 (en) | 2007-04-05 | 2012-02-07 | Napo Enterprises, Llc | System and method for automatically and graphically associating programmatically-generated media item recommendations related to a user's socially recommended media items |
US8229458B2 (en) | 2007-04-08 | 2012-07-24 | Enhanced Geographic Llc | Systems and methods to determine the name of a location visited by a user of a wireless device |
US9140552B2 (en) | 2008-07-02 | 2015-09-22 | Qualcomm Incorporated | User defined names for displaying monitored location |
WO2008128133A1 (en) | 2007-04-13 | 2008-10-23 | Pelago, Inc. | Location-based information determination |
US8930135B2 (en) | 2007-04-17 | 2015-01-06 | Esther Abramovich Ettinger | Device, system and method of landmark-based routing and guidance |
US20080288375A1 (en) | 2007-04-21 | 2008-11-20 | Carpe Media | Media Distribution Reporting System, Apparatus, Method and Software |
WO2008134595A1 (en) | 2007-04-27 | 2008-11-06 | Pelago, Inc. | Determining locations of interest based on user visits |
TWI346479B (en) | 2007-05-07 | 2011-08-01 | Ind Tech Res Inst | Method for grouping wireless devices and apparatus thereof |
US20080294556A1 (en) | 2007-05-24 | 2008-11-27 | Jim Anderson | Mobile commerce service |
US8185137B2 (en) | 2007-06-25 | 2012-05-22 | Microsoft Corporation | Intensity-based maps |
US8175802B2 (en) | 2007-06-28 | 2012-05-08 | Apple Inc. | Adaptive route guidance based on preferences |
US20090012955A1 (en) | 2007-07-03 | 2009-01-08 | John Chu | Method and system for continuous, dynamic, adaptive recommendation based on a continuously evolving personal region of interest |
US8165808B2 (en) | 2007-07-17 | 2012-04-24 | Yahoo! Inc. | Techniques for representing location information |
US7962155B2 (en) | 2007-07-18 | 2011-06-14 | Hewlett-Packard Development Company, L.P. | Location awareness of devices |
WO2009014735A2 (en) | 2007-07-23 | 2009-01-29 | Motivepath, Inc. | System, method and apparatus for secure multiparty located based services |
US20090030999A1 (en) | 2007-07-27 | 2009-01-29 | Gatzke Alan D | Contact Proximity Notification |
US8050690B2 (en) | 2007-08-14 | 2011-11-01 | Mpanion, Inc. | Location based presence and privacy management |
US8249807B1 (en) * | 2007-08-22 | 2012-08-21 | University Of South Florida | Method for determining critical points in location data generated by location-based applications |
US8924250B2 (en) | 2007-09-13 | 2014-12-30 | International Business Machines Corporation | Advertising in virtual environments based on crowd statistics |
CN101118162A (en) | 2007-09-18 | 2008-02-06 | 倚天资讯股份有限公司 | System of realistic navigation combining landmark information, user interface and method |
US8224353B2 (en) | 2007-09-20 | 2012-07-17 | Aegis Mobility, Inc. | Disseminating targeted location-based content to mobile device users |
US8923887B2 (en) | 2007-09-24 | 2014-12-30 | Alcatel Lucent | Social networking on a wireless communication system |
US8185131B2 (en) | 2007-10-02 | 2012-05-22 | Jeremy Wood | Method of providing location-based information from portable devices |
JP4858400B2 (en) | 2007-10-17 | 2012-01-18 | ソニー株式会社 | Information providing system, information providing apparatus, and information providing method |
US8654974B2 (en) | 2007-10-18 | 2014-02-18 | Location Based Technologies, Inc. | Apparatus and method to provide secure communication over an insecure communication channel for location information using tracking devices |
US8171035B2 (en) | 2007-10-22 | 2012-05-01 | Samsung Electronics Co., Ltd. | Situation-aware recommendation using correlation |
US20090106040A1 (en) | 2007-10-23 | 2009-04-23 | New Jersey Institute Of Technology | System And Method For Synchronous Recommendations of Social Interaction Spaces to Individuals |
US8254961B2 (en) | 2007-10-23 | 2012-08-28 | Verizon Patent And Licensing Inc. | Retail-related services for mobile devices |
US20090110177A1 (en) | 2007-10-31 | 2009-04-30 | Nokia Corporation | Dynamic Secondary Phone Book |
US20090111438A1 (en) | 2007-10-31 | 2009-04-30 | Weng Chong Chan | Streamlined method and system for broadcasting spontaneous invitations to social events |
US8467955B2 (en) | 2007-10-31 | 2013-06-18 | Microsoft Corporation | Map-centric service for social events |
US8624733B2 (en) | 2007-11-05 | 2014-01-07 | Francis John Cusack, JR. | Device for electronic access control with integrated surveillance |
US20090125230A1 (en) | 2007-11-14 | 2009-05-14 | Todd Frederic Sullivan | System and method for enabling location-dependent value exchange and object of interest identification |
US20090132366A1 (en) | 2007-11-15 | 2009-05-21 | Microsoft Corporation | Recognizing and crediting offline realization of online behavior |
US8195598B2 (en) | 2007-11-16 | 2012-06-05 | Agilence, Inc. | Method of and system for hierarchical human/crowd behavior detection |
US8620996B2 (en) | 2007-11-19 | 2013-12-31 | Motorola Mobility Llc | Method and apparatus for determining a group preference in a social network |
US9269089B2 (en) | 2007-11-22 | 2016-02-23 | Yahoo! Inc. | Method and system for media promotion |
US20100020776A1 (en) | 2007-11-27 | 2010-01-28 | Google Inc. | Wireless network-based location approximation |
US8155877B2 (en) | 2007-11-29 | 2012-04-10 | Microsoft Corporation | Location-to-landmark |
US7895049B2 (en) | 2007-11-30 | 2011-02-22 | Yahoo! Inc. | Dynamic representation of group activity through reactive personas |
US8307029B2 (en) | 2007-12-10 | 2012-11-06 | Yahoo! Inc. | System and method for conditional delivery of messages |
US8862622B2 (en) | 2007-12-10 | 2014-10-14 | Sprylogics International Corp. | Analysis, inference, and visualization of social networks |
US20090157312A1 (en) | 2007-12-14 | 2009-06-18 | Microsoft Corporation | Social network based routes |
US20090157496A1 (en) * | 2007-12-14 | 2009-06-18 | Yahoo! Inc. | Personal broadcast engine and network |
US8270937B2 (en) | 2007-12-17 | 2012-09-18 | Kota Enterprises, Llc | Low-threat response service for mobile device users |
US20090152349A1 (en) | 2007-12-17 | 2009-06-18 | Bonev Robert | Family organizer communications network system |
US20090164503A1 (en) | 2007-12-20 | 2009-06-25 | Searete Llc, A Limited Liability Corporation Of The State Of Delaware | Methods and systems for specifying a media content-linked population cohort |
US8010601B2 (en) | 2007-12-21 | 2011-08-30 | Waldeck Technology, Llc | Contiguous location-based user networks |
US8024431B2 (en) | 2007-12-21 | 2011-09-20 | Domingo Enterprises, Llc | System and method for identifying transient friends |
US20090164919A1 (en) * | 2007-12-24 | 2009-06-25 | Cary Lee Bates | Generating data for managing encounters in a virtual world environment |
US8452529B2 (en) | 2008-01-10 | 2013-05-28 | Apple Inc. | Adaptive navigation system for estimating travel times |
US8060018B2 (en) | 2008-02-08 | 2011-11-15 | Yahoo! Inc. | Data sharing based on proximity-based ad hoc network |
US20090210480A1 (en) | 2008-02-14 | 2009-08-20 | Suthaharan Sivasubramaniam | Method and system for collective socializing using a mobile social network |
US10402833B2 (en) | 2008-03-05 | 2019-09-03 | Ebay Inc. | Method and apparatus for social network qualification systems |
US7940170B2 (en) * | 2008-03-05 | 2011-05-10 | Omnivision Technologies, Inc. | Tracking system with user-definable private ID for improved privacy protection |
US8634796B2 (en) * | 2008-03-14 | 2014-01-21 | William J. Johnson | System and method for location based exchanges of data facilitating distributed location applications |
US20100030578A1 (en) | 2008-03-21 | 2010-02-04 | Siddique M A Sami | System and method for collaborative shopping, business and entertainment |
US20090239552A1 (en) | 2008-03-24 | 2009-09-24 | Yahoo! Inc. | Location-based opportunistic recommendations |
US20090286550A1 (en) | 2008-05-15 | 2009-11-19 | Brane Wolrd Ltd. | Tempo Spatial Data Extraction From Network Connected Devices |
US10163113B2 (en) | 2008-05-27 | 2018-12-25 | Qualcomm Incorporated | Methods and apparatus for generating user profile based on periodic location fixes |
US20090307263A1 (en) | 2008-06-06 | 2009-12-10 | Sense Networks, Inc. | System And Method Of Performing Location Analytics |
US8072954B2 (en) | 2008-06-16 | 2011-12-06 | Microsoft Corporation | Mashup application and service for wireless devices |
US9200901B2 (en) | 2008-06-19 | 2015-12-01 | Microsoft Technology Licensing, Llc | Predictive services for devices supporting dynamic direction information |
US20100017261A1 (en) | 2008-07-17 | 2010-01-21 | Kota Enterprises, Llc | Expert system and service for location-based content influence for narrowcast |
US8401771B2 (en) | 2008-07-22 | 2013-03-19 | Microsoft Corporation | Discovering points of interest from users map annotations |
US8583668B2 (en) | 2008-07-30 | 2013-11-12 | Yahoo! Inc. | System and method for context enhanced mapping |
US10230803B2 (en) | 2008-07-30 | 2019-03-12 | Excalibur Ip, Llc | System and method for improved mapping and routing |
US8386211B2 (en) | 2008-08-15 | 2013-02-26 | International Business Machines Corporation | Monitoring virtual worlds to detect events and determine their type |
US8620624B2 (en) | 2008-09-30 | 2013-12-31 | Sense Networks, Inc. | Event identification in sensor analytics |
US20100088148A1 (en) * | 2008-10-02 | 2010-04-08 | Presswala Irfan | System and methodology for recommending purchases for a shopping intent |
US8645283B2 (en) | 2008-11-24 | 2014-02-04 | Nokia Corporation | Determination of event of interest |
US8494560B2 (en) | 2008-11-25 | 2013-07-23 | Lansing Arthur Parker | System, method and program product for location based services, asset management and tracking |
US8825074B2 (en) | 2009-02-02 | 2014-09-02 | Waldeck Technology, Llc | Modifying a user'S contribution to an aggregate profile based on time between location updates and external events |
US8265658B2 (en) * | 2009-02-02 | 2012-09-11 | Waldeck Technology, Llc | System and method for automated location-based widgets |
US8070595B2 (en) | 2009-02-10 | 2011-12-06 | Cfph, Llc | Amusement devices and games including means for processing electronic data where ultimate outcome of the game is dependent on relative odds of a card combination and/or where chance is a factor: the monty hall paradox |
US20100217525A1 (en) | 2009-02-25 | 2010-08-26 | King Simon P | System and Method for Delivering Sponsored Landmark and Location Labels |
US8150967B2 (en) * | 2009-03-24 | 2012-04-03 | Yahoo! Inc. | System and method for verified presence tracking |
US20120047087A1 (en) | 2009-03-25 | 2012-02-23 | Waldeck Technology Llc | Smart encounters |
US8284934B2 (en) * | 2009-07-21 | 2012-10-09 | Cellco Partnership | Systems and methods for shared secret data generation |
US8423791B1 (en) * | 2009-08-07 | 2013-04-16 | Google Inc. | Location data quarantine system |
JP5471829B2 (en) * | 2010-05-25 | 2014-04-16 | 日産自動車株式会社 | Accelerator pedal force control device for hybrid vehicle |
US8447328B2 (en) * | 2010-08-27 | 2013-05-21 | At&T Mobility Ii Llc | Location estimation of a mobile device in a UMTS network |
CN103429989B (en) * | 2010-12-30 | 2017-10-20 | 泰为信息科技公司 | Navigation system and its operating method with limited resources route planning optimizer |
CN104662527A (en) * | 2012-08-10 | 2015-05-27 | 诺基亚公司 | Method and apparatus for providing crowd-sourced geocoding |
US8965398B2 (en) * | 2012-09-26 | 2015-02-24 | Hewlett-Packard Development Company, L.P. | Bluetooth beacon based location determination |
US20140201276A1 (en) * | 2013-01-17 | 2014-07-17 | Microsoft Corporation | Accumulation of real-time crowd sourced data for inferring metadata about entities |
-
2010
- 2010-02-24 US US12/711,517 patent/US20120047087A1/en not_active Abandoned
- 2010-02-26 US US12/713,508 patent/US9082077B2/en not_active Expired - Fee Related
- 2010-03-03 US US12/716,314 patent/US8589330B2/en active Active
- 2010-03-12 US US12/722,564 patent/US20120047143A1/en not_active Abandoned
- 2010-03-25 US US12/731,242 patent/US8620532B2/en active Active
-
2013
- 2013-10-24 US US14/062,405 patent/US20140129502A1/en not_active Abandoned
- 2013-12-20 US US14/135,659 patent/US9140566B1/en not_active Expired - Fee Related
-
2015
- 2015-09-11 US US14/851,341 patent/US9410814B2/en active Active
Patent Citations (11)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US6571279B1 (en) * | 1997-12-05 | 2003-05-27 | Pinpoint Incorporated | Location enhanced information delivery system |
US20010036224A1 (en) * | 2000-02-07 | 2001-11-01 | Aaron Demello | System and method for the delivery of targeted data over wireless networks |
US20020087632A1 (en) * | 2000-12-28 | 2002-07-04 | Keskar Dhananjay V. | System and method for automatically sharing information between handheld devices |
US20070061328A1 (en) * | 2005-09-14 | 2007-03-15 | Jorey Ramer | Managing sponsored content for delivery to mobile communication facilities |
US20070143348A1 (en) * | 2005-10-01 | 2007-06-21 | Outland Research, Llc | Demographic assessment and presentation for personal area networks |
US20070118509A1 (en) * | 2005-11-18 | 2007-05-24 | Flashpoint Technology, Inc. | Collaborative service for suggesting media keywords based on location data |
US7849082B2 (en) * | 2006-11-17 | 2010-12-07 | W.W. Grainger, Inc. | System and method for influencing display of web site content |
US20080140650A1 (en) * | 2006-11-29 | 2008-06-12 | David Stackpole | Dynamic geosocial networking |
US20090125321A1 (en) * | 2007-11-14 | 2009-05-14 | Qualcomm Incorporated | Methods and systems for determining a geographic user profile to determine suitability of targeted content messages based on the profile |
US20100205211A1 (en) * | 2009-02-06 | 2010-08-12 | Riddhiman Ghosh | System and Method for Generating a User Profile |
US20110082825A1 (en) * | 2009-10-05 | 2011-04-07 | Nokia Corporation | Method and apparatus for providing a co-creation platform |
Non-Patent Citations (2)
Title |
---|
Behrend, Data Stream Analysis for Location-Aware Collaborative Information Retrieval, Advances in Databases and Information Systems, Proceedings of the 12th East European Conference, ADBIS 2008, September 5-9, 2008, Pori, Finland. Tampere University of Technology. Pori. Publication 2008, ISBN 978-952-15-2014-3 * |
Roche, From Tagged Photo to Profile Photo, 15 January 2008 * |
Cited By (70)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US9053169B2 (en) | 2009-04-29 | 2015-06-09 | Waldeck Technology, Llc | Profile construction using location-based aggregate profile information |
US8554770B2 (en) | 2009-04-29 | 2013-10-08 | Waldeck Technology, Llc | Profile construction using location-based aggregate profile information |
US8473512B2 (en) | 2009-11-06 | 2013-06-25 | Waldeck Technology, Llc | Dynamic profile slice |
US20110153665A1 (en) * | 2009-12-18 | 2011-06-23 | Electronics And Telecommunications Research Institute | Apparatus for providing social network service using relationship of ontology and method thereof |
US8463812B2 (en) * | 2009-12-18 | 2013-06-11 | Electronics And Telecommunications Research Institute | Apparatus for providing social network service using relationship of ontology and method thereof |
US9407590B2 (en) * | 2010-03-03 | 2016-08-02 | Waldeck Technology, Llc | Monitoring hashtags in micro-blog posts to provide one or more crowd-based features |
US20120072341A1 (en) * | 2010-09-20 | 2012-03-22 | Agco Corporation | Allocating application servers in a service delivery platform |
US9829340B2 (en) * | 2010-11-18 | 2017-11-28 | Google Inc. | Analysis of interactive map usage patterns |
US20180045534A1 (en) * | 2010-11-18 | 2018-02-15 | Google Inc. | Analysis of interactive map usage patterns |
US10135908B1 (en) | 2011-09-06 | 2018-11-20 | Utility Associates, Inc. | System and method for uploading files to servers utilizing GPS routing |
US9432402B1 (en) * | 2011-09-06 | 2016-08-30 | Utility Associates, Inc. | System and method for uploading files to servers utilizing GPS routing |
US9253282B2 (en) * | 2011-10-18 | 2016-02-02 | Qualcomm Incorporated | Method and apparatus for generating, using, or updating an enriched user profile |
US10091322B2 (en) | 2011-10-18 | 2018-10-02 | Qualcomm Incorporated | Method and apparatus for improving a user experience or device performance using an enriched user profile |
US20130238686A1 (en) * | 2011-10-18 | 2013-09-12 | Hugh O'Donoghue | Method and apparatus for generating, using, or updating an enriched user profile |
US9299081B2 (en) * | 2012-09-10 | 2016-03-29 | Yahoo! Inc. | Deriving a user profile from questions |
US20140075334A1 (en) * | 2012-09-10 | 2014-03-13 | Yahoo! Inc. | Cold Start Answers |
US9648089B2 (en) | 2014-04-25 | 2017-05-09 | Samsung Electronics Co., Ltd. | Context-aware hypothesis-driven aggregation of crowd-sourced evidence for a subscription-based service |
US11017004B2 (en) * | 2018-05-24 | 2021-05-25 | People.ai, Inc. | Systems and methods for updating email addresses based on email generation patterns |
US11394791B2 (en) | 2018-05-24 | 2022-07-19 | People.ai, Inc. | Systems and methods for merging tenant shadow systems of record into a master system of record |
US10649999B2 (en) | 2018-05-24 | 2020-05-12 | People.ai, Inc. | Systems and methods for generating performance profiles using electronic activities matched with record objects |
US10657131B2 (en) | 2018-05-24 | 2020-05-19 | People.ai, Inc. | Systems and methods for managing the use of electronic activities based on geographic location and communication history policies |
US10657130B2 (en) | 2018-05-24 | 2020-05-19 | People.ai, Inc. | Systems and methods for generating a performance profile of a node profile including field-value pairs using electronic activities |
US10657132B2 (en) | 2018-05-24 | 2020-05-19 | People.ai, Inc. | Systems and methods for forecasting record object completions |
US10671612B2 (en) | 2018-05-24 | 2020-06-02 | People.ai, Inc. | Systems and methods for node deduplication based on a node merging policy |
US10678795B2 (en) | 2018-05-24 | 2020-06-09 | People.ai, Inc. | Systems and methods for updating multiple value data structures using a single electronic activity |
US10678796B2 (en) | 2018-05-24 | 2020-06-09 | People.ai, Inc. | Systems and methods for matching electronic activities to record objects using feedback based match policies |
US10679001B2 (en) | 2018-05-24 | 2020-06-09 | People.ai, Inc. | Systems and methods for auto discovery of filters and processing electronic activities using the same |
US10769151B2 (en) | 2018-05-24 | 2020-09-08 | People.ai, Inc. | Systems and methods for removing electronic activities from systems of records based on filtering policies |
US10860794B2 (en) | 2018-05-24 | 2020-12-08 | People. ai, Inc. | Systems and methods for maintaining an electronic activity derived member node network |
US10860633B2 (en) | 2018-05-24 | 2020-12-08 | People.ai, Inc. | Systems and methods for inferring a time zone of a node profile using electronic activities |
US10866980B2 (en) | 2018-05-24 | 2020-12-15 | People.ai, Inc. | Systems and methods for identifying node hierarchies and connections using electronic activities |
US10872106B2 (en) | 2018-05-24 | 2020-12-22 | People.ai, Inc. | Systems and methods for matching electronic activities directly to record objects of systems of record with node profiles |
US10878015B2 (en) | 2018-05-24 | 2020-12-29 | People.ai, Inc. | Systems and methods for generating group node profiles based on member nodes |
US10922345B2 (en) | 2018-05-24 | 2021-02-16 | People.ai, Inc. | Systems and methods for filtering electronic activities by parsing current and historical electronic activities |
US20190361879A1 (en) * | 2018-05-24 | 2019-11-28 | People.ai, Inc. | Systems and methods for updating email addresses based on email generation patterns |
US11048740B2 (en) | 2018-05-24 | 2021-06-29 | People.ai, Inc. | Systems and methods for generating node profiles using electronic activity information |
US11153396B2 (en) | 2018-05-24 | 2021-10-19 | People.ai, Inc. | Systems and methods for identifying a sequence of events and participants for record objects |
US11265388B2 (en) | 2018-05-24 | 2022-03-01 | People.ai, Inc. | Systems and methods for updating confidence scores of labels based on subsequent electronic activities |
US11265390B2 (en) | 2018-05-24 | 2022-03-01 | People.ai, Inc. | Systems and methods for detecting events based on updates to node profiles from electronic activities |
US11277484B2 (en) | 2018-05-24 | 2022-03-15 | People.ai, Inc. | Systems and methods for restricting generation and delivery of insights to second data source providers |
US11283888B2 (en) | 2018-05-24 | 2022-03-22 | People.ai, Inc. | Systems and methods for classifying electronic activities based on sender and recipient information |
US11283887B2 (en) | 2018-05-24 | 2022-03-22 | People.ai, Inc. | Systems and methods of generating an engagement profile |
US11343337B2 (en) | 2018-05-24 | 2022-05-24 | People.ai, Inc. | Systems and methods of determining node metrics for assigning node profiles to categories based on field-value pairs and electronic activities |
US11363121B2 (en) | 2018-05-24 | 2022-06-14 | People.ai, Inc. | Systems and methods for standardizing field-value pairs across different entities |
US10649998B2 (en) | 2018-05-24 | 2020-05-12 | People.ai, Inc. | Systems and methods for determining a preferred communication channel based on determining a status of a node profile using electronic activities |
US11418626B2 (en) | 2018-05-24 | 2022-08-16 | People.ai, Inc. | Systems and methods for maintaining extracted data in a group node profile from electronic activities |
US11451638B2 (en) | 2018-05-24 | 2022-09-20 | People. ai, Inc. | Systems and methods for matching electronic activities directly to record objects of systems of record |
US11457084B2 (en) | 2018-05-24 | 2022-09-27 | People.ai, Inc. | Systems and methods for auto discovery of filters and processing electronic activities using the same |
US11463534B2 (en) | 2018-05-24 | 2022-10-04 | People.ai, Inc. | Systems and methods for generating new record objects based on electronic activities |
US11463545B2 (en) | 2018-05-24 | 2022-10-04 | People.ai, Inc. | Systems and methods for determining a completion score of a record object from electronic activities |
US11470171B2 (en) | 2018-05-24 | 2022-10-11 | People.ai, Inc. | Systems and methods for matching electronic activities with record objects based on entity relationships |
US11470170B2 (en) | 2018-05-24 | 2022-10-11 | People.ai, Inc. | Systems and methods for determining the shareability of values of node profiles |
US11503131B2 (en) | 2018-05-24 | 2022-11-15 | People.ai, Inc. | Systems and methods for generating performance profiles of nodes |
US11563821B2 (en) | 2018-05-24 | 2023-01-24 | People.ai, Inc. | Systems and methods for restricting electronic activities from being linked with record objects |
US11641409B2 (en) | 2018-05-24 | 2023-05-02 | People.ai, Inc. | Systems and methods for removing electronic activities from systems of records based on filtering policies |
US11647091B2 (en) | 2018-05-24 | 2023-05-09 | People.ai, Inc. | Systems and methods for determining domain names of a group entity using electronic activities and systems of record |
US11805187B2 (en) | 2018-05-24 | 2023-10-31 | People.ai, Inc. | Systems and methods for identifying a sequence of events and participants for record objects |
US11831733B2 (en) | 2018-05-24 | 2023-11-28 | People.ai, Inc. | Systems and methods for merging tenant shadow systems of record into a master system of record |
US11876874B2 (en) | 2018-05-24 | 2024-01-16 | People.ai, Inc. | Systems and methods for filtering electronic activities by parsing current and historical electronic activities |
US11888949B2 (en) | 2018-05-24 | 2024-01-30 | People.ai, Inc. | Systems and methods of generating an engagement profile |
US11895205B2 (en) | 2018-05-24 | 2024-02-06 | People.ai, Inc. | Systems and methods for restricting generation and delivery of insights to second data source providers |
US11895208B2 (en) | 2018-05-24 | 2024-02-06 | People.ai, Inc. | Systems and methods for determining the shareability of values of node profiles |
US11895207B2 (en) | 2018-05-24 | 2024-02-06 | People.ai, Inc. | Systems and methods for determining a completion score of a record object from electronic activities |
US11909836B2 (en) | 2018-05-24 | 2024-02-20 | People.ai, Inc. | Systems and methods for updating confidence scores of labels based on subsequent electronic activities |
US11909834B2 (en) | 2018-05-24 | 2024-02-20 | People.ai, Inc. | Systems and methods for generating a master group node graph from systems of record |
US11909837B2 (en) | 2018-05-24 | 2024-02-20 | People.ai, Inc. | Systems and methods for auto discovery of filters and processing electronic activities using the same |
US11924297B2 (en) | 2018-05-24 | 2024-03-05 | People.ai, Inc. | Systems and methods for generating a filtered data set |
US11930086B2 (en) | 2018-05-24 | 2024-03-12 | People.ai, Inc. | Systems and methods for maintaining an electronic activity derived member node network |
US11949682B2 (en) | 2018-05-24 | 2024-04-02 | People.ai, Inc. | Systems and methods for managing the generation or deletion of record objects based on electronic activities and communication policies |
US11949751B2 (en) | 2018-05-24 | 2024-04-02 | People.ai, Inc. | Systems and methods for restricting electronic activities from being linked with record objects |
Also Published As
Publication number | Publication date |
---|---|
US20120047102A1 (en) | 2012-02-23 |
US8620532B2 (en) | 2013-12-31 |
US20120047087A1 (en) | 2012-02-23 |
US20120046860A1 (en) | 2012-02-23 |
US20140129502A1 (en) | 2014-05-08 |
US8589330B2 (en) | 2013-11-19 |
US9140566B1 (en) | 2015-09-22 |
US9410814B2 (en) | 2016-08-09 |
US20120042046A1 (en) | 2012-02-16 |
US9082077B2 (en) | 2015-07-14 |
US20160003634A1 (en) | 2016-01-07 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US20120047143A1 (en) | Sparse profile augmentation using a mobile aggregate profiling system | |
US9641393B2 (en) | Forming crowds and providing access to crowd data in a mobile environment | |
US8473512B2 (en) | Dynamic profile slice | |
US20120064919A1 (en) | Crowd creation system for an aggregate profiling service | |
US9053169B2 (en) | Profile construction using location-based aggregate profile information | |
US8898288B2 (en) | Status update propagation based on crowd or POI similarity | |
US20120041672A1 (en) | Automated social routing | |
US20120063367A1 (en) | Crowd and profile based communication addresses | |
US20210173887A1 (en) | Sytem and method for filtering and creating points-of-interest |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
AS | Assignment |
Owner name: KOTA ENTERPRISES, LLC, DELAWARE Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:PETERSEN, STEVEN L.;KATPELLY, RAVI REDDY;REEL/FRAME:024070/0190 Effective date: 20100310 |
|
AS | Assignment |
Owner name: WALDECK TECHNOLOGY, LLC, DELAWARE Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:KOTA ENTERPRISES, LLC;REEL/FRAME:024859/0855 Effective date: 20100730 |
|
AS | Assignment |
Owner name: CONCERT DEBT, LLC, NEW HAMPSHIRE Free format text: SECURITY INTEREST;ASSIGNOR:WALDECK TECHNOLOGY, LLC;REEL/FRAME:036433/0382 Effective date: 20150801 Owner name: CONCERT DEBT, LLC, NEW HAMPSHIRE Free format text: SECURITY INTEREST;ASSIGNOR:WALDECK TECHNOLOGY, LLC;REEL/FRAME:036433/0313 Effective date: 20150501 |
|
AS | Assignment |
Owner name: CONCERT DEBT, LLC, NEW HAMPSHIRE Free format text: SECURITY INTEREST;ASSIGNOR:CONCERT TECHNOLOGY CORPORATION;REEL/FRAME:036515/0471 Effective date: 20150501 Owner name: CONCERT DEBT, LLC, NEW HAMPSHIRE Free format text: SECURITY INTEREST;ASSIGNOR:CONCERT TECHNOLOGY CORPORATION;REEL/FRAME:036515/0495 Effective date: 20150801 |
|
STCB | Information on status: application discontinuation |
Free format text: ABANDONED -- AFTER EXAMINER'S ANSWER OR BOARD OF APPEALS DECISION |
|
AS | Assignment |
Owner name: WALDECK TECHNOLOGY, LLC, NEW HAMPSHIRE Free format text: RELEASE BY SECURED PARTY;ASSIGNOR:CONCERT DEBT, LLC;REEL/FRAME:039527/0303 Effective date: 20160823 Owner name: CONCERT TECHNOLOGY CORPORATION, NEW HAMPSHIRE Free format text: RELEASE BY SECURED PARTY;ASSIGNOR:CONCERT DEBT, LLC;REEL/FRAME:039527/0182 Effective date: 20160823 |
|
AS | Assignment |
Owner name: IP3, SERIES 100 OF ALLIED SECURITY TRUST I, CALIFO Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:WALDECK TECHNOLOGY LLC;REEL/FRAME:039900/0862 Effective date: 20160829 |
|
AS | Assignment |
Owner name: UBER TECHNOLOGIES, INC., CALIFORNIA Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:IP3, SERIES 100 OF ALLIED SECURITY TRUST I;REEL/FRAME:043084/0656 Effective date: 20170616 |
|
AS | Assignment |
Owner name: UBER TECHNOLOGIES, INC., CALIFORNIA Free format text: CORRECTIVE ASSIGNMENT TO CORRECT THE PATENT NUMBER 8520609 PREVIOUSLY RECORDED ON REEL 043084 FRAME 0656. ASSIGNOR(S) HEREBY CONFIRMS THE ASSIGNMENT;ASSIGNOR:IP3, SERIES 100 OF ALLIED SECURITY TRUST 1;REEL/FRAME:045813/0044 Effective date: 20170616 |