Systems | Information | Learning | Optimization
 

Co-clustering for directed graphs: an algorithm, a model, and some asymptotic.

Although the network clustering literature has focused on undirected networks, many networks are directed. For example, communication networks contain asymmetric relationships, representing the flow of information from one person to another. This talk will (1) demonstrate that co-clustering, instead of clustering, is more natural for many directed graphs, (2) propose …