Login / Signup
Clustering bipartite graphs in terms of approximate formal concepts and sub-contexts.
Bruno Gaume
Emmanuel Navarro
Henri Prade
Published in:
Int. J. Comput. Intell. Syst. (2013)
Keyphrases
</>
bipartite graph
formal concepts
graph clustering
formal concept analysis
maximum matching
clustering method
clustering algorithm
conceptual clustering
k means
data points
formal contexts
mutual reinforcement
concept lattice
link prediction
co occurrence
categorical data
binary data
information retrieval