A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Network Simplification with Minimal Loss of Connectivity
2010
2010 IEEE International Conference on Data Mining
We propose a novel problem to simplify weighted graphs by pruning least important edges from them. Simplified graphs can be used to improve visualization of a network, to extract its main structure, or as a pre-processing step for other data mining algorithms. We define a graph connectivity function based on the best paths between all pairs of nodes. Given the number of edges to be pruned, the problem is then to select a subset of edges that best maintains the overall graph connectivity. Our
doi:10.1109/icdm.2010.133
dblp:conf/icdm/ZhouMT10
fatcat:3joo3xqt4nccnlch5nr2zowcku