Co-embedding: Discovering Communities On Bipartite Graphs Through Projection

Abstract

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..

Stats

• citations0
• S2 citations—
• github stars0
• HF likes0
• heat score0.00
• arxiv keycandel2021co

Related papers

• Graphhash: Graph Clustering Enables Parameter Efficiency In Recommender Systems (2024)4.77
• Answering Compositional Queries With Set-theoretic Embeddings (2023)0.00
• Collaborative Similarity Embedding For Recommender Systems (2019)13.93
• Towards Effective Top-n Hamming Search Via Bipartite Graph Contrastive Hashing (2024)6.34
• Analysis Of Sparsehash: An Efficient Embedding Of Set-similarity Via Sparse Projections (2019)4.52
• HS-GCN: Hamming Spatial Graph Convolutional Networks For Recommendation (2023)11.67
• TPCH: Tensor-interacted Projection And Cooperative Hashing For Multi-view Clustering (2024)5.84
• In Search Of The Most Efficient And Memory-saving Visualization Of High Dimensional Data (2023)0.00