Fine-Grained Bipartite Concept Factorization for Clustering
In this paper we propose a novel concept factorization method that seeks factor matrices using a cross-order positive semi-definite neighbor graph which provides comprehensive and complementary neighbor information of the data. The factor matrices are learned with bipartite graph partitioning which exploits explicit cluster structure of the data and is more geared towards clustering application. We develop an effective and efficient optimization algorithm for our method and provide elegant theoretical results about the convergence. Extensive experimental results confirm the effectiveness of the proposed method.
Code (0)
등록된 구현이 없습니다.
Tasks
Clusteringgraph partitioningSimilar Papers 제목 키워드 기반
Visualizing Overlapping Biclusterings and Boolean Matrix Factorizations
Finding (bi-)clusters in bipartite graphs is a popular data analysis approach. Analysts typically want to visualize the clusters, which is simple as long as the clusters are disjoint. However, many modern algorithms find…
Biclustering and Boolean Matrix Factorization in Data Streams
We study the clustering of bipartite graphs and Boolean matrix factorization in data streams. We consider a streaming setting in which the vertices from the left side of the graph arrive one by one together with all of t…
ClusteringInterpretable Multi-View Clustering Based on Anchor Graph Tensor Factorization
The clustering method based on the anchor graph has gained significant attention due to its exceptional clustering performance and ability to process large-scale data. One common approach is to learn bipartite graphs wit…
ClusteringBERT4FCA: A Method for Bipartite Link Prediction using Formal Concept Analysis and BERT
We propose BERT4FCA, a novel method for link prediction in bipartite networks, using formal concept analysis (FCA) and BERT. Link prediction in bipartite networks is an important task that can solve various practical pro…
Link PredictionPredictionLatent Random Steps as Relaxations of Max-Cut, Min-Cut, and More
Algorithms for node clustering typically focus on finding homophilous structure in graphs. That is, they find sets of similar nodes with many edges within, rather than across, the clusters. However, graphs often also exh…
ClusteringNode Clustering