: Networks having several hundred or more nodes and significant edge probabilities are extremely difficult to visualize. They typically appear as dense clumps, with the various sub...
Inter-organizational networks often have multiple dimensions, each one denoting a type of relationship. In this research, we studied how one dimension of the network, a collaborati...
Kang Zhao, John Yen, Louis-Marie Ngamassi Tchouake...
We introduce a novel technique for comparing graphs using the structure of their subgraphs, which we call a graph's fine structure. Our technique compares graphs using the ear...
The typical task of unsupervised learning is to organize data, for example into clusters, typically disjoint clusters (eg. the K-means algorithm). One would expect (for example) a...
Mark K. Goldberg, Mykola Hayvanovych, Malik Magdon...