Community similarity based on user profile joins

Similarity joins on multidimensional data are crucial operators for recommendation purposes. The classic ��-join problem finds all pairs of points within �� distance to each other among two ��-dimensional datasets. In this paper, we consider a novel and alternative version of ��-join named community...

Full description

Saved in:
Bibliographic Details
Main Authors: THEOCHARIDIS, Konstantinos, LAUW, Hady Wirawan
Format: text
Language:English
Published: Institutional Knowledge at Singapore Management University 2024
Subjects:
Online Access:https://ink.library.smu.edu.sg/sis_research/8719
https://ink.library.smu.edu.sg/context/sis_research/article/9722/viewcontent/edbt24.pdf
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Singapore Management University
Language: English
id sg-smu-ink.sis_research-9722
record_format dspace
spelling sg-smu-ink.sis_research-97222024-04-18T07:38:22Z Community similarity based on user profile joins THEOCHARIDIS, Konstantinos LAUW, Hady Wirawan Similarity joins on multidimensional data are crucial operators for recommendation purposes. The classic ��-join problem finds all pairs of points within �� distance to each other among two ��-dimensional datasets. In this paper, we consider a novel and alternative version of ��-join named community similarity based on user profile joins (CSJ). The aim of CSJ problem is, given two communities having a set of ��-dimensional users, to find how similar are the communities by matching every single pair of users (a user can be matched with at most one other user) having an absolute difference of at most �� per dimension. Each dimension in each user vector stores a counter that measures the number of user preferences to a concrete general topic. CSJ uses low �� and applies the strict condition per dimension so as to really find similar user profiles among two communities. CSJ applies to a number of cases in which the popular community detection and community search problems do not suit. This happens since CSJ treats existing communities as brands of a specific commercial value and does not search to form general communities as prior works do; these two community types semantically differ. Also, CSJ does not rely its execution on social or/and physical links among community users, instead, it only focus on the similarity of user profiles. We deploy a suite of 6 methods to solve CSJ; 3 approximate and 3 exact algorithms. We evaluate our solutions to meaningful case studies of real and synthetic datasets having different characteristics. Our experimental results show interesting and diverse conclusions of CSJ applicability to realistic scenarios. 2024-03-01T08:00:00Z text application/pdf https://ink.library.smu.edu.sg/sis_research/8719 info:doi/10.48786/edbt.2024.49 https://ink.library.smu.edu.sg/context/sis_research/article/9722/viewcontent/edbt24.pdf http://creativecommons.org/licenses/by-nc-nd/4.0/ Research Collection School Of Computing and Information Systems eng Institutional Knowledge at Singapore Management University Databases and Information Systems
institution Singapore Management University
building SMU Libraries
continent Asia
country Singapore
Singapore
content_provider SMU Libraries
collection InK@SMU
language English
topic Databases and Information Systems
spellingShingle Databases and Information Systems
THEOCHARIDIS, Konstantinos
LAUW, Hady Wirawan
Community similarity based on user profile joins
description Similarity joins on multidimensional data are crucial operators for recommendation purposes. The classic ��-join problem finds all pairs of points within �� distance to each other among two ��-dimensional datasets. In this paper, we consider a novel and alternative version of ��-join named community similarity based on user profile joins (CSJ). The aim of CSJ problem is, given two communities having a set of ��-dimensional users, to find how similar are the communities by matching every single pair of users (a user can be matched with at most one other user) having an absolute difference of at most �� per dimension. Each dimension in each user vector stores a counter that measures the number of user preferences to a concrete general topic. CSJ uses low �� and applies the strict condition per dimension so as to really find similar user profiles among two communities. CSJ applies to a number of cases in which the popular community detection and community search problems do not suit. This happens since CSJ treats existing communities as brands of a specific commercial value and does not search to form general communities as prior works do; these two community types semantically differ. Also, CSJ does not rely its execution on social or/and physical links among community users, instead, it only focus on the similarity of user profiles. We deploy a suite of 6 methods to solve CSJ; 3 approximate and 3 exact algorithms. We evaluate our solutions to meaningful case studies of real and synthetic datasets having different characteristics. Our experimental results show interesting and diverse conclusions of CSJ applicability to realistic scenarios.
format text
author THEOCHARIDIS, Konstantinos
LAUW, Hady Wirawan
author_facet THEOCHARIDIS, Konstantinos
LAUW, Hady Wirawan
author_sort THEOCHARIDIS, Konstantinos
title Community similarity based on user profile joins
title_short Community similarity based on user profile joins
title_full Community similarity based on user profile joins
title_fullStr Community similarity based on user profile joins
title_full_unstemmed Community similarity based on user profile joins
title_sort community similarity based on user profile joins
publisher Institutional Knowledge at Singapore Management University
publishDate 2024
url https://ink.library.smu.edu.sg/sis_research/8719
https://ink.library.smu.edu.sg/context/sis_research/article/9722/viewcontent/edbt24.pdf
_version_ 1814047493494669312