Latent informative links detection

Publication Type:
Conference Proceeding
Frontiers in Artificial Intelligence and Applications, 2012, 243 pp. 1233 - 1242
Issue Date:
Filename Description Size
ThumbnailLiang-KES2012.pdf Published version411.81 kB
Adobe PDF
Full metadata record
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 net-works 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. © 2012 The authors and IOS Press. All rights reserved.
Please use this identifier to cite or link to this item: