Discovering informative connection subgraphs in multi-relational graphs
From Semantic Portal Wiki
{{#vardefine:category|Publication}}{{#vardefine:templatename|i.publication}}{{#vardefine:package|smwbp_instance_templates}}
| Edit |
Reference: {{#vardefine:pagename|discovering informative connection subgraphs in multi-relational graphs }}
- [[]]
bibtex
{{#vardefine:pagename|Discovering informative connection subgraphs in multi-relational graphs }}{{#vardefine:key| }}
abstract:
download:
- paper:
- slides:
Facts about Discovering informative connection subgraphs in multi-relational graphsRDF feed
| Author | Cartic Ramakrishnan +, William H. Milnor +, Matthew Perry +, and Amit P. Sheth + |
| Bibtype | article + |
| Doi | http://doi.acm.org/10.1145/1117454.1117462 + |
| Journal | SIGKDD Explorations + |
| Key | dblp:journals/sigkdd/ramakrishnanmps05 + |
| Number | 2 + |
| Pages | 56-63 + |
| Source | http://dblp.uni-trier.de/rec/bibtex/journals/sigkdd/RamakrishnanMPS05 + |
| Tag | Computer science + |
| Title | Discovering informative connection subgraphs in multi-relational graphs + |
| Volume | 7 + |
| Year | 2005 + |

