Cited By
View all- Suchanek FNica AHe QIyengar ANejdl WPei JRastogi R(2013)PIKM 2013Proceedings of the 22nd ACM international conference on Information & Knowledge Management10.1145/2505515.2505817(2561-2562)Online publication date: 27-Oct-2013
We are interested in objective functions for clustering undirected and unweighted graphs. Our goal is to define alternatives to the popular modularity measure. To this end, we propose to adapt statistical association coefficients, which traditionally ...
Graph clustering, or community detection, is an important task of discovering the underlying structure in a network by clustering vertices in a graph into communities. In the past decades, non-overlapping methods such as normalized cuts and modularity-...
An edge clique cover of a graph is a set of cliques that covers all edges of the graph. We generalize this concept to K t clique cover, i.e. a set of cliques that covers all complete subgraphs on t vertices of the graph, ...
Association for Computing Machinery
New York, NY, United States
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in