Clustering Link Data - Theory and Algortithms

点击翻译按钮获取中文摘要

Many domains of human activity are characterized by directed graphs:interactions in social networks, citation networks, hyperlinkeddomains like the web, trade relations between companies, patterns ofair travel. Clustering is a general technique to discover globalstructure in such networks of local interactions. Presently, networkswith asymmetric relations are first symmetrized then clustered bymethods applicable to undirected graphs. This proposal shows thatsymmetrization often loses the information about structure and proposeto develop a theoretical framework and algorithms for clustering ofdirected networks. I will approach the task using the random walksview that I developed and which has proved successful at clustering inundirected graphs.