On finding the maximum edge biclique in a bipartite graph: a subspace clustering approach.
Eran ShahamHonghai YuXiaoli LiPublished in: SDM (2016)
Keyphrases
- bipartite graph
- subspace clustering
- high dimensional data
- subspace clusters
- edge weights
- clustering high dimensional data
- maximum matching
- clustering method
- graph model
- high dimensional
- minimum weight
- clustering algorithm
- high dimensionality
- link prediction
- subspace projections
- maximum cardinality
- bipartite graph matching
- subgraph mining
- neural network
- weighted graph
- data sets