Using tf-idf as an edge weighting scheme in user-object bipartite networks
arXiv:1308.6118
Abstract
Bipartite user-object networks are becoming increasingly popular in representing user interaction data in a web or e-commerce environment. They have certain characteristics and challenges that differentiates them from other bipartite networks. This paper analyzes the properties of five real world user-object networks. In all cases we found a heavy tail object degree distribution with popular objects connecting together a large part of the users causing significant edge inflation in the projected users network. We propose a novel edge weighting strategy based on tf-idf and show that the new scheme improves both the density and the quality of the community structure in the projections. The improvement is also noticed when comparing to partially random networks.
References in corpus (11)
- Fast unfolding of communities in large networks
- Finding and evaluating community structure in networks
- Community detection in graphs
- Finding community structure in very large networks
- Random graphs with arbitrary degree distributions and their applications
- Near linear time algorithm to detect community structures in large-scale networks
- Resolution limit in community detection
- Who is the best connected scientist? A study of scientific coauthorship networks
- Cycles and clustering in bipartite networks
- The clustering coefficient and community structure of bipartite networks
- Social inertia in collaboration networks