Name
Abstract | ||
|---|---|---|
Sometimes, explicit relationships between entities do not provide sufficient information or can be unavailable in the real world. Unseen latent relationships may be more informative than explicit relationships. Thereby, we provide a method for constructing latent informative links between entities, using their common features, where entities are regarded as vertices on a graph. First, we employ a hierarchical nonparametric model to infer shared latent features for entities. Then, we define a filter function based on information theory to extract significant features and control the density of links. Finally, a couple of stochastic interaction processes are introduced to simulate dynamics on the networks so that link strength can be retrieved from statistics in a natural way. In experiments, we evaluate the usage of filter function. The results of two examples based on mixture networks show how our method is capable of providing latent informative relationships in comparison to explicit relationships. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.3233/978-1-61499-105-2-1233 | ADVANCES IN KNOWLEDGE-BASED AND INTELLIGENT INFORMATION AND ENGINEERING SYSTEMS |
DocType | Volume | ISSN |
Conference | 243 | 0922-6389 |
Citations | PageRank | References |
0 | 0.34 | 5 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Liang Hu | 1 | 166 | 15.64 |
| Jian Cao | 2 | 41 | 11.40 |
| Guandong Xu | 3 | 3 | 1.31 |
| Zhiping Gu | 4 | 132 | 9.49 |