A Graph-Based Platform for Customer Behavior Analysis using Applications' Clickstream Data

• URL: http://arxiv.org/abs/2002.10269v1
• Date: Thu, 20 Feb 2020 13:57:29 GMT
• Title: A Graph-Based Platform for Customer Behavior Analysis using Applications' Clickstream Data
• Authors: Mojgan Mohajer
• Abstract summary: Clickstream data can be considered as a sequence of log events collected at different levels of web/app usage. We show how representing and saving the sequences with their underlying graph structures can induce a platform for customer behavior analysis.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Clickstream analysis is getting more attention since the increase of usage in e-commerce and applications. Beside customers' purchase behavior analysis, there is also attempt to analyze the customer behavior in relation to the quality of web or application design. In general, clickstream data can be considered as a sequence of log events collected at different levels of web/app usage. The analysis of clickstream data can be performed directly as sequence analysis or by extracting features from sequences. In this work, we show how representing and saving the sequences with their underlying graph structures can induce a platform for customer behavior analysis. Our main idea is that clickstream data containing sequences of actions of an application, are walks of the corresponding finite state automaton (FSA) of that application. Our hypothesis is that the customers of an application normally do not use all possible walks through that FSA and the number of actual walks is much smaller than total number of possible walks through the FSA. Sequences of such a walk normally consist of a finite number of cycles on FSA graphs. Identifying and matching these cycles in the classical sequence analysis is not straight forward. We show that representing the sequences through their underlying graph structures not only groups the sequences automatically but also provides a compressed data representation of the original sequences.

Related papers

• ALPS: An Auto-Labeling and Pre-training Scheme for Remote Sensing Segmentation With Segment Anything Model [32.91528641298171]
  We introduce an innovative auto-labeling framework named ALPS (Automatic Labeling for Pre-training in Pre-training in Remote Sensing) We leverage the Segment Anything Model (SAM) to predict precise pseudo-labels for RS images without necessitating prior annotations or additional prompts. Our approach enhances the performance of downstream tasks across various benchmarks, including iSAID and ISPRS Potsdam.
  arXiv  Detail & Related papers  (2024-06-16T09:02:01Z)
• Efficient User Sequence Learning for Online Services via Compressed Graph Neural Networks [18.068737439570402]
  Graph Neural Networks (GNNs) have been extensively applied to model sequence relationships, and extract information from similar sequences. We propose a novel unified framework called ECSeq, to introduce graph compression techniques into relation modeling for user sequence representation learning.
  arXiv  Detail & Related papers  (2024-06-05T06:22:11Z)
• Graph Signal Sampling for Inductive One-Bit Matrix Completion: a Closed-form Solution [112.3443939502313]
  We propose a unified graph signal sampling framework which enjoys the benefits of graph signal analysis and processing. The key idea is to transform each user's ratings on the items to a function (signal) on the vertices of an item-item graph. For the online setting, we develop a Bayesian extension, i.e., BGS-IMC which considers continuous random Gaussian noise in the graph Fourier domain.
  arXiv  Detail & Related papers  (2023-02-08T08:17:43Z)
• Sequence Feature Extraction for Malware Family Analysis via Graph Neural Network [0.0]
  We design and implement an Attention Aware Graph Neural Network (AWGCN) to analyze the API call sequences. Through AWGCN, we can obtain the sequence embeddings to analyze the behavior of the malware.
  arXiv  Detail & Related papers  (2022-08-10T07:31:44Z)
• Predictive Object-Centric Process Monitoring [10.219621548854343]
  This thesis shows that a prediction method utilizing Generative Adversarial Networks (GAN), Long Short-Term Memory (LSTM), and Sequence to Sequence models (Seq2seq) can be augmented with the rich data contained in OCEL. This thesis provides a web interface to predict the next sequence of activities from user input.
  arXiv  Detail & Related papers  (2022-07-20T16:30:47Z)
• Similarity-aware Positive Instance Sampling for Graph Contrastive Pre-training [82.68805025636165]
  We propose to select positive graph instances directly from existing graphs in the training set. Our selection is based on certain domain-specific pair-wise similarity measurements. Besides, we develop an adaptive node-level pre-training method to dynamically mask nodes to distribute them evenly in the graph.
  arXiv  Detail & Related papers  (2022-06-23T20:12:51Z)
• A Graph-Enhanced Click Model for Web Search [67.27218481132185]
  We propose a novel graph-enhanced click model (GraphCM) for web search. We exploit both intra-session and inter-session information for the sparsity and cold-start problems.
  arXiv  Detail & Related papers  (2022-06-17T08:32:43Z)
• FedAvg with Fine Tuning: Local Updates Lead to Representation Learning [54.65133770989836]
  Federated Averaging (FedAvg) algorithm consists of alternating between a few local gradient updates at client nodes, followed by a model averaging update at the server. We show that the reason behind generalizability of the FedAvg's output is its power in learning the common data representation among the clients' tasks. We also provide empirical evidence demonstrating FedAvg's representation learning ability in federated image classification with heterogeneous data.
  arXiv  Detail & Related papers  (2022-05-27T00:55:24Z)
• Dynamic Sequential Graph Learning for Click-Through Rate Prediction [29.756257920214168]
  We propose a novel method to enhance users' representations by utilizing collaborative information from the local sub-graphs associated with users or items. Results on real-world CTR prediction benchmarks demonstrate the improvements brought by DSGL.
  arXiv  Detail & Related papers  (2021-09-26T09:23:43Z)
• Temporal Graph Network Embedding with Causal Anonymous Walks Representations [54.05212871508062]
  We propose a novel approach for dynamic network representation learning based on Temporal Graph Network. For evaluation, we provide a benchmark pipeline for the evaluation of temporal network embeddings. We show the applicability and superior performance of our model in the real-world downstream graph machine learning task provided by one of the top European banks.
  arXiv  Detail & Related papers  (2021-08-19T15:39:52Z)
• Structural Temporal Graph Neural Networks for Anomaly Detection in Dynamic Graphs [54.13919050090926]
  We propose an end-to-end structural temporal Graph Neural Network model for detecting anomalous edges in dynamic graphs. In particular, we first extract the $h$-hop enclosing subgraph centered on the target edge and propose the node labeling function to identify the role of each node in the subgraph. Based on the extracted features, we utilize Gated recurrent units (GRUs) to capture the temporal information for anomaly detection.
  arXiv  Detail & Related papers  (2020-05-15T09:17:08Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.