9099

Weighted One Mode Projection of a Bipartite Graph as a Local Similarity Measure

Rotem Stram, Pascal Reuss, Klaus-Dieter Althoff

Case-Based Reasoning Research and Development International Conference on Case-Based Reasoning (ICCBR-17), June 26-28, Trondheim, Norway , Pages: 375-389 , Springer , 2017
Bipartite graphs are a common structure to model relationships between two populations. Many times a compression of the graph to one population, namely a one mode projection (OMP), is needed in order to gain insight into one of the populations. Since this compression leads to loss of information, several works in the past attempted to quantify the connection quality between the items from the population that is being projected, but have ignored the edge weights in the bipartite graph. This paper presents a novel method to create a weighted OMP (WOMP) by taking edge weights of the bipartite graph into account. The usefulness of the method is then displayed in a case-based reasoning (CBR) environment as a local similarity measure between unordered symbols, in an attempt to solve the long-tail problem of infrequently used but significant symbols of textual CBR. It is shown that our method is superior to other similarity options.

Show BibTex:

@inproceedings {
       abstract = {Bipartite graphs are a common structure to model relationships between two populations. Many times a compression of the graph to one population, namely a one mode projection (OMP), is needed in order to gain insight into one of the populations. Since this compression leads to loss of information, several works in the past attempted to quantify the connection quality between the items from the population that is being projected, but have ignored the edge weights in the bipartite graph. This paper presents a novel method to create a weighted OMP (WOMP) by taking edge weights of the bipartite graph into account. The usefulness of the method is then displayed in a case-based reasoning (CBR) environment as a local similarity measure between unordered symbols, in an attempt to solve the long-tail problem of infrequently used but significant symbols of textual CBR. It is shown that our method is superior to other similarity options.},
       number = {}, 
       month = {}, 
       year = {2017}, 
       title = {Weighted One Mode Projection of a Bipartite Graph as a Local Similarity Measure}, 
       journal = {}, 
       volume = {}, 
       pages = {375-389}, 
       publisher = {Springer}, 
       author = {Rotem Stram, Pascal Reuss, Klaus-Dieter Althoff}, 
       keywords = {Bipartite graph, One-mode projection, Textual case-based reasoning, Local similarity, Weights, Long-tail},
       url = {https://link.springer.com/chapter/10.1007/978-3-319-61030-6_26}
}