Geolocation Prediction via Probabilistic Transition Clustering

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Traditional predictive information retrieval systems face challenges in processing large-scale, real-time geolocation data due to high dimensionality and latency issues, making them unsuitable for large-scale, real-time local search problems, especially when dealing with millions of users and thousands of geolocation events per hour.

Innovation Solution

A scalable complex event processing system using probabilistic machine learning models is implemented, which trains location and time-specific predictive models on historical geolocation data, segmenting it into temporal bins and determining pairwise transition probabilities to predict subsequent geolocations, and configures a compute cluster to process geolocation streams in real-time with low latency.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If traditional brute-force techniques are used to process geolocation events, then processing can be performed with general-purpose computers, but the processing speed is slow and reliability is insufficient

Engineering Contradiction:
Improveprocessing reliabilityVSAvoidprocessing speed
Core Design Contradiction:
ReliabilityVSProductivity

Solution Approach 1:

The patent segments the geolocation processing task into multiple components: dimensionality reduction module that converts high-dimensional geolocation data into lower-dimensional representations, pattern matching module that applies predefined patterns to segmented data, and parallel processing across multiple computing devices. This segmentation enables reliable processing while maintaining high speed by distributing work across the system architecture.

Inventive Principle:
Principle #1Segmentation

2Productivity

If the number of dimensions to be evaluated is reduced using hand-coded rules, then processing speed can be improved, but the systems become exceedingly difficult and expensive to configure

Engineering Contradiction:
Improveprocessing speedVSAvoidsystem configuration ease
Core Design Contradiction:
ProductivityVSEase of manufacture

Solution Approach 1:

The system employs machine learning models that automatically learn and adapt patterns from geolocation data without requiring manual configuration. The models self-adjust to changing user behaviors and location patterns, eliminating the need for expensive and difficult hand-coded rule construction while maintaining high processing speed through automated pattern recognition.

Inventive Principle:
Principle #25Self-service

3Reliability

If individual general purpose computers are used to process rich pattern sets, then processing can be performed with simple hardware, but the latency is insufficient for commercial applications

Engineering Contradiction:
Improvelatency performanceVSAvoidsystem complexity
Core Design Contradiction:
ReliabilityVSDevice complexity

Solution Approach 1:

The patent transitions from single-computer sequential processing to a distributed cluster architecture, adding the dimension of spatial distribution across multiple computing devices. This enables parallel processing of pattern sets against geolocation events, achieving the low latency required for commercial applications while managing complexity through standardized communication protocols and coordinated processing.

Inventive Principle:
Principle #17Another dimension (Dimensionality change)

4Measurement precision

If predictive models are trained on large-scale historical geolocation data, then prediction accuracy for millions of users can be improved, but processing latency increases

Engineering Contradiction:
Improveprediction accuracyVSAvoidprocessing latency
Core Design Contradiction:
Measurement precisionVSLoss of time

Solution Approach 1:

The system performs preliminary actions by pre-training machine learning models on large-scale historical geolocation data offline before deployment. The trained models are then loaded into the distributed cluster and used for real-time predictions, separating the computationally intensive training phase from the low-latency inference phase. This enables high prediction accuracy for millions of users while maintaining low processing latency during actual geolocation event handling.

Inventive Principle:
Principle #10Preliminary action

Data Source

PatentUS11037072B2Scalable complex event processing with probabilistic machine learning models to predict subsequent geolocations
Publication Date: 2021.06.15 RETAILMENOT INC
  • US11037072B2 patent drawing
  • US11037072B2 patent drawing
  • US11037072B2 patent drawing

AI summary

Provided is a process, including: obtaining a set of historical geolocations; segmenting the historical geolocations into a plurality of temporal bins; determining pairwise transition probabilities between a set of geographic places based on the historical geolocations; configuring a compute cluster by assigning subsets of the transition probabilities to computing devices in the compute cluster; receiving a geolocation stream indicative of current geolocations of individuals; selecting a computing device in the compute cluster in response to determining that the computing device contain transition probabilities for the received respective geolocation; selecting transition probabilities applicable to the received respective geolocation from among the subset of transition probabilities assigned to the selected computing device; predicting a subsequent geographic place based on the selected transition probabilities.