Co-Embedding: Discovering Communities on Bipartite Graphs through Projection

09/15/2021
by   Gaëlle Candel, et al.
0

Many datasets take the form of a bipartite graph where two types of nodes are connected by relationships, like the movies watched by a user or the tags associated with a file. The partitioning of the bipartite graph could be used to fasten recommender systems, or reduce the information retrieval system's index size, by identifying groups of items with similar properties. This type of graph is often processed by algorithms using the Vector Space Model representation, where a binary vector represents an item with 0 and 1. The main problem with this representation is the dimension relatedness, like words' synonymity, which is not considered. This article proposes a co-clustering algorithm using items projection, allowing the measurement of features similarity. We evaluated our algorithm on a cluster retrieval task. Over various datasets, our algorithm produced well balanced clusters with coherent items in, leading to high retrieval scores on this task..

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/14/2021

Tagged Documents Co-Clustering

Tags are short sequences of words allowing to describe textual and non-t...
research
02/20/2023

Information Retrieval in long documents: Word clustering approach for improving Semantics

In this paper, we propose an alternative to deep neural networks for sem...
research
07/01/2020

A simple bipartite graph projection model for clustering in networks

Graph datasets are frequently constructed by a projection of a bipartite...
research
04/27/2020

Hierarchical clustering of bipartite data sets based on the statistical significance of coincidences

When a set 'entities' are related by the 'features' they share they are ...
research
06/24/2021

Fund2Vec: Mutual Funds Similarity using Graph Learning

Identifying similar mutual funds with respect to the underlying portfoli...
research
10/28/2010

Random Graph Generator for Bipartite Networks Modeling

The purpose of this article is to introduce a new iterative algorithm wi...
research
01/20/2021

Uncovering and Displaying the Coherent Groups of Rank Data by Exploratory Riffle Shuffling

Let n respondents rank order d items, and suppose that d << n. Our main ...

Please sign up or login with your details

Forgot password? Click here to reset