A Graph-Enhanced Click Model for Web Search
- URL: http://arxiv.org/abs/2206.08621v1
- Date: Fri, 17 Jun 2022 08:32:43 GMT
- Title: A Graph-Enhanced Click Model for Web Search
- Authors: Jianghao Lin, Weiwen Liu, Xinyi Dai, Weinan Zhang, Shuai Li, Ruiming
Tang, Xiuqiang He, Jianye Hao, Yong Yu
- Abstract summary: 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.
- Score: 67.27218481132185
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: To better exploit search logs and model users' behavior patterns, numerous
click models are proposed to extract users' implicit interaction feedback. Most
traditional click models are based on the probabilistic graphical model (PGM)
framework, which requires manually designed dependencies and may oversimplify
user behaviors. Recently, methods based on neural networks are proposed to
improve the prediction accuracy of user behaviors by enhancing the expressive
ability and allowing flexible dependencies. However, they still suffer from the
data sparsity and cold-start problems. In this paper, we propose a novel
graph-enhanced click model (GraphCM) for web search. Firstly, we regard each
query or document as a vertex, and propose novel homogeneous graph construction
methods for queries and documents respectively, to fully exploit both
intra-session and inter-session information for the sparsity and cold-start
problems. Secondly, following the examination hypothesis, we separately model
the attractiveness estimator and examination predictor to output the
attractiveness scores and examination probabilities, where graph neural
networks and neighbor interaction techniques are applied to extract the
auxiliary information encoded in the pre-constructed homogeneous graphs.
Finally, we apply combination functions to integrate examination probabilities
and attractiveness scores into click predictions. Extensive experiments
conducted on three real-world session datasets show that GraphCM not only
outperforms the state-of-art models, but also achieves superior performance in
addressing the data sparsity and cold-start problems.
Related papers
- Sub-graph Based Diffusion Model for Link Prediction [43.15741675617231]
Denoising Diffusion Probabilistic Models (DDPMs) represent a contemporary class of generative models with exceptional qualities.
We build a novel generative model for link prediction using a dedicated design to decompose the likelihood estimation process via the Bayesian formula.
Our proposed method presents numerous advantages: (1) transferability across datasets without retraining, (2) promising generalization on limited training data, and (3) robustness against graph adversarial attacks.
arXiv Detail & Related papers (2024-09-13T02:23:55Z) - Generated Graph Detection [27.591612297045817]
Graph generative models become increasingly effective for data distribution approximation and data augmentation.
We propose the first framework to investigate a set of sophisticated models and their performance in four classification scenarios.
Our solution can sustain for a decent while to curb generated graph misuses.
arXiv Detail & Related papers (2023-06-13T13:18:04Z) - LUKE-Graph: A Transformer-based Approach with Gated Relational Graph
Attention for Cloze-style Reading Comprehension [13.173307471333619]
We propose the LUKE-Graph, a model that builds a heterogeneous graph based on the intuitive relationships between entities in a document.
We then use the Attention reading (RGAT) to fuse the graph's reasoning information and the contextual representation encoded by the pre-trained LUKE model.
Experimental results demonstrate that the LUKE-Graph achieves state-of-the-art performance with commonsense reasoning.
arXiv Detail & Related papers (2023-03-12T14:31:44Z) - Bayesian Graph Contrastive Learning [55.36652660268726]
We propose a novel perspective of graph contrastive learning methods showing random augmentations leads to encoders.
Our proposed method represents each node by a distribution in the latent space in contrast to existing techniques which embed each node to a deterministic vector.
We show a considerable improvement in performance compared to existing state-of-the-art methods on several benchmark datasets.
arXiv Detail & Related papers (2021-12-15T01:45:32Z) - Towards Open-World Feature Extrapolation: An Inductive Graph Learning
Approach [80.8446673089281]
We propose a new learning paradigm with graph representation and learning.
Our framework contains two modules: 1) a backbone network (e.g., feedforward neural nets) as a lower model takes features as input and outputs predicted labels; 2) a graph neural network as an upper model learns to extrapolate embeddings for new features via message passing over a feature-data graph built from observed data.
arXiv Detail & Related papers (2021-10-09T09:02:45Z) - Stochastic Iterative Graph Matching [11.128153575173213]
We propose a new model, Iterative Graph MAtching, to address the graph matching problem.
Our model defines a distribution of matchings for a graph pair so the model can explore a wide range of possible matchings.
We conduct extensive experiments across synthetic graph datasets as well as biochemistry and computer vision applications.
arXiv Detail & Related papers (2021-06-04T02:05:35Z) - A Robust and Generalized Framework for Adversarial Graph Embedding [73.37228022428663]
We propose a robust framework for adversarial graph embedding, named AGE.
AGE generates the fake neighbor nodes as the enhanced negative samples from the implicit distribution.
Based on this framework, we propose three models to handle three types of graph data.
arXiv Detail & Related papers (2021-05-22T07:05:48Z) - Model-Agnostic Graph Regularization for Few-Shot Learning [60.64531995451357]
We present a comprehensive study on graph embedded few-shot learning.
We introduce a graph regularization approach that allows a deeper understanding of the impact of incorporating graph information between labels.
Our approach improves the performance of strong base learners by up to 2% on Mini-ImageNet and 6.7% on ImageNet-FS.
arXiv Detail & Related papers (2021-02-14T05:28:13Z) - Neural Stochastic Block Model & Scalable Community-Based Graph Learning [8.00785050036369]
This paper proposes a scalable community-based neural framework for graph learning.
The framework learns the graph topology through the task of community detection and link prediction.
We look into two particular applications, the graph alignment and the anomalous correlation detection.
arXiv Detail & Related papers (2020-05-16T03:28:50Z) - Graph Ordering: Towards the Optimal by Learning [69.72656588714155]
Graph representation learning has achieved a remarkable success in many graph-based applications, such as node classification, prediction, and community detection.
However, for some kind of graph applications, such as graph compression and edge partition, it is very hard to reduce them to some graph representation learning tasks.
In this paper, we propose to attack the graph ordering problem behind such applications by a novel learning approach.
arXiv Detail & Related papers (2020-01-18T09:14:16Z)
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.