Your browser does not support JavaScript!
http://iet.metastore.ingenta.com
1887

access icon free Inference network building and movements prediction based on analysis of induced dependencies

State prediction of a node is made through analyses of adjacent nodes to learn about movements and to manage users in inference network. This study first simplifies ego network to reduce the complexity of structural analyses based on three different relationships among users. Second, degrees of mutual influences are computed according to different forms of association. Finally, the action of the centre node is predicted by analysing the changing of the states of adjacent nodes. The experiment proves that accuracy and efficiency of the algorithm proposed performs well not only in the simplification of ego network but also in the prediction of movements.

References

    1. 1)
    2. 2)
    3. 3)
      • 4. Scripps, J., Tan, P., Esfahanian, A.: ‘Measuring the effects of preprocessing decisions and network forces in dynamic network analysis’. Proc Int. Conf. ACM SIGKDD Int. Conf. on Data Mining (KDD), Paris, France, 2009, pp. 747756.
    4. 4)
      • 12. Andrzejewski, D., Zhu, X., Craven, M., et al: ‘A framework for incorporating general domain knowledge into latent Dirichlet allocation using first-order logic’. Proc Int. Conf. Artificial Intelligence (IJCAI), 2011.
    5. 5)
      • 3. Shi, T., Zhu, J.: ‘Online Bayesian passive-aggressive learning’. Proc Int. Conf. 31st Int. Conf. on Machine Learning, 2014, pp. 378386.
    6. 6)
      • 13. Macskassy, S., Provost, F.: ‘A Simple Relational Classifier’. Proc Int. Conf. Workshop on Multi-Relational Data Mining in Conjunction with KDD, Washington, DC, 2003.
    7. 7)
      • 11. Pearl, J.: ‘Probabilistic reasoning in intelligent systems: networks of plausible inference’ (Morgan Kaufmann Publishers, San Mateo, 1988), pp. 117133.
    8. 8)
      • 5. Backstrom, L., Kleinberg, J.: ‘Romantic partnerships and the dispersion of social ties: A network analysis of relationship status on facebook’. Proc Int. Conf. 17th ACM Conf. on Computer Supported Cooperative Work and Social Computing (CSCW), 2014.
    9. 9)
      • 9. Mei, S., Zhu, J., Zhu, J.: ‘Robust RegBayes: selectively incorporating first-order logic domain knowledge into Bayesian models’. Proc Int. Conf. 31st Int. Conf. on Machine Learning, 2014, pp. 253261.
    10. 10)
      • 7. Anhn, Y., Bagrow, J., Lehmann, S.: ‘Link communities reveal multi-scale complexity in networks’, Nature, 2010, 466, pp. 14764687.
    11. 11)
      • 1. Tan, C., Tang, J., Sun, J., et al: ‘Social action tracking via noise tolerant time-varying factor graphs’. Proc Int. Conf. ACM SIGKDD Int. Conf. on Data Mining (KDD), Washington, DC, USA, 2010, pp. 10491058.
    12. 12)
      • 6. Zhou, Y., Liu, L.: ‘Social Influence Based Clustering of Heterogeneous Information Networks’. Proc Int. Conf. 19th ACM SIGKDD Int. Conf. on Knowledge discovery and data mining, 2013.
    13. 13)
      • 2. Max, W., Teh, Y.: ‘Bayesian learning via stochastic gradient Langevin dynamics’. Proc Int. Conf. 28th Int. Conf. on Machine Learning, 2011.
http://iet.metastore.ingenta.com/content/journals/10.1049/iet-sen.2015.0033
Loading

Related content

content/journals/10.1049/iet-sen.2015.0033
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading
This is a required field
Please enter a valid email address