Towards Rule-Based Minimization of RDF Graphs under Constraints
RR '08 Proceedings of the 2nd International Conference on Web Reasoning and Rule Systems
Approximating Transitive Reductions for Directed Networks
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
| Hi-index | 0.00 |
In this paper, we will show that transitive reduction can be used in real, large social networks analysis. Transitive reduction is an edge-removing operation on directed graphs, that preserves some important properties and structures of the graph. After a presentation of this tool interest, we will show its properties and how to use it. An application of the process on a real-word large social network (public and famous Enron corpus [3]) built upon interaction data (email boxes) validates this approach.