Hyperbolic-Based Tree Edit Distance as Similarity of User Behavior

In this paper, we evaluate the similarity between users' behavior by applying tree edit distance (TED) to tree representations generated through hyperbolic metric learning methods. Understanding user behavior similarity is an essential task in e-commerce, as it can be modeled as a tree-like structure where each action corresponds to a node, representing the user's possible next move. Analyzing user behavior similarity through the lens of advertising costs provides insight into the effort needed to shift from one user's action pattern to another. We explore the benefits of using tree edit distance for user behavior analysis and further consider their similarity under hyperbolic metric embedding methods.

Authors

Institutions

Publication Details

Published
2024-11-03
DOI
https://doi.org/10.1109/icce-asia63397.2024.10773632
Citations
2
Primary Topic
Complex Network Analysis Techniques
Type
article
Field-Weighted Citation Impact
0.56
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Hyperbolic-Based Tree Edit Distance as Similarity of User Behavior

Harutaka UNO, Tsung‐Han Lee, Yu-Hsuan Liang, Tse-Yu Lin
2 citations
Complex Network Analysis Techniques
0.56
article

Hyperbolic-Based Tree Edit Distance as Similarity of User Behavior

Harutaka UNO, Tsung‐Han Lee, Yu-Hsuan Liang, Tse-Yu Lin
article en
2 citations

Abstract

In this paper, we evaluate the similarity between users' behavior by applying tree edit distance (TED) to tree representations generated through hyperbolic metric learning methods. Understanding user behavior similarity is an essential task in e-commerce, as it can be modeled as a tree-like structure where each action corresponds to a node, representing the user's possible next move. Analyzing user behavior similarity through the lens of advertising costs provides insight into the effort needed to shift from one user's action pattern to another. We explore the benefits of using tree edit distance for user behavior analysis and further consider their similarity under hyperbolic metric embedding methods.

National Taiwan University (TW), University of Kang Ning (TW), Institute of European and American Studies, Academia Sinica (TW)
Openalex Percentile: Top 33%
Complex Network Analysis Techniques
0.56
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.