Website Optimization Using Network Analysis for Customer Segmentation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current methods for website optimization rely on outdated statistical models that require assumptions about customer behavior and segment number, making them inefficient and costly, especially for large datasets, and fail to provide objective customer profiling.
Innovation Solution
A method that collects user data to construct profiles, quantify affinities, and segment users into communities based on network analysis, using principal eigenvectors and adjacency matrices to provide personalized content according to user communities.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If statistical modelling techniques are used for customer segmentation, then customer profiling can be achieved, but the process becomes costly and time-consuming with large datasets
Solution Approach 1:
The patent replaces traditional statistical modelling techniques with network analysis methods. Instead of using conventional statistical algorithms that require specifying segment numbers beforehand, the invention constructs a network graph where customers are nodes and affinities are edges, then uses graph theory algorithms (like community detection) to automatically identify segments. This substitution eliminates the need for iterative statistical modeling and manual segment number specification, significantly reducing processing time while maintaining or improving segmentation accuracy.
Solution Approach 2:
The invention changes the fundamental parameters of the segmentation approach by transitioning from statistical parameters (mean, variance, distribution assumptions) to network parameters (node degrees, betweenness centrality, community structure). This parameter transformation allows the system to handle large datasets more efficiently by leveraging the scalable nature of graph algorithms compared to traditional statistical methods that become computationally intensive with large n.
2Adaptability or versatility
If traditional segmentation methods are used, then customer segments can be identified, but numerous assumptions about customer behavior must be made
Solution Approach 1:
The patent extracts the underlying customer affinity relationships directly from behavioral data without imposing external assumptions. By constructing the network graph from observed customer interactions and preferences, the method removes the need for assumptions about segment numbers, segment characteristics, or customer behavior patterns. The segmentation emerges naturally from the data structure itself, preserving all objective behavioral information without filtering through preconceived models.
Solution Approach 2:
Instead of starting with assumptions about customer segments and fitting data to those assumptions (traditional approach), the invention inverts the process by starting with the raw data to construct the network, then letting the segment structure emerge from the network analysis. This inversion eliminates assumption-driven bias and allows the data to speak for itself, revealing genuine customer segments that may not fit traditional marketing categories.
3Quantity of substance
If offline CRM database data is used for analysis, then customer information can be gathered, but data from different channels cannot be incorporated
Solution Approach 1:
The patent creates a universal network framework that can accommodate multiple data sources and channel types. The graph structure is channel-agnostic, allowing offline CRM data, online clickstream data, social media interactions, and other channels to be integrated as different types of edges or node attributes. This universal structure enables seamless multi-channel data incorporation without requiring separate analysis pipelines for each channel, as all data types can be represented within the same network model.
Data Source
AI summary
A method of website optimization including collecting data for constructing user profiles; constructing the user profiles; quantifying affinities between the user profiles; constructing a user network in which the affinities are represented as links between user nodes; constructing an adjacency matrix; calculating a first principal eigenvector of the adjacency matrix; defining a new network by removing a random link in the network and calculating a new adjacency matrix for the new network; calculating a second principal eigenvector of the new adjacency matrix; calculating a vector of relative shifts between the first principal eigenvector and the second principal eigenvector; for every node, assigning a value for a direction of its shift between the network and the new network; and repeating certain of the steps.


