Reflexive Regular Equivalence in Bipartite Data

Gerow, Aaron; Zhou, Mingyang; Matwin, Stan and Shi, Feng. 2017. 'Reflexive Regular Equivalence in Bipartite Data'. In: Canadian Conference on A.I. (CAI 2017). Edmonton, AB, Canada. [Conference or Workshop Item]

gerow-cai17-manuscript.pdf - Accepted Version
Available under License Creative Commons Attribution Non-commercial.

Download (471kB) | Preview

Abstract or Description

Bipartite data is common in data engineering and brings unique challenges, particularly when it comes to clustering tasks that impose strong structural assumptions. This work presents an unsupervised method for assessing similarity in bipartite data. The method is based on regular equivalence in graphs and uses spectral properties of a bipartite adjacency matrix to estimate similarity in both dimensions. The method is reflexive in that similarity in one dimension informs similarity in the other. The method also uses local graph transitivities, a contribution governed by its only free parameter. Reflexive regular equivalence can be used to validate assumptions of co-similarity, which are required but often untested in co-clustering analyses. The method is robust to noise and asymmetric data, making it particularly suited for cluster analysis and recommendation in data of unknown structure.

Item Type:

Conference or Workshop Item (Paper)

Departments, Centres and Research Units:



May 2017Published

Event Location:

Edmonton, AB, Canada

Item ID:


Date Deposited:

09 Jan 2018 12:16

Last Modified:

29 Apr 2020 16:43


View statistics for this item...

Edit Record Edit Record (login required)