Weighted One Mode Projection of a Bipartite Graph as a Local Similarity Measure
| Autor: | Rotem Stram, Pascal Reuss, Klaus-Dieter Althoff |
|---|---|
| Rok vydání: | 2017 |
| Předmět: |
Theoretical computer science
Computer science Voltage graph 02 engineering and technology Simplex graph law.invention Edge-transitive graph law 020204 information systems Line graph 0202 electrical engineering electronic engineering information engineering Bipartite graph 020201 artificial intelligence & image processing Adjacency matrix Blossom algorithm Clustering coefficient |
| Zdroj: | Case-Based Reasoning Research and Development ISBN: 9783319610290 ICCBR |
| Popis: | 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|