Aggregate Graph Statistics

@article{Audrito2017AggregateGS,
  title={Aggregate Graph Statistics},
  author={Giorgio Audrito and Ferruccio Damiani and Mirko Viroli},
  journal={CoRR},
  year={2017},
  volume={abs/1802.01788},
  pages={18-22}
}
Collecting statistic from graph-based data is an increasingly studied topic in the data mining community. We argue that these statistics have great value as well in dynamic IoT contexts: they can support complex computational activities involving distributed coordination and provision of situation recognition. We show that the HyperANF algorithm for calculating the neighbourhood function of vertices of a graph naturally allows for a fully distributed and asynchronous implementation, thanks to a… CONTINUE READING
Related Discussions
This paper has been referenced on Twitter 3 times. VIEW TWEETS

From This Paper

Topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 13 references

Efficient Engineering of Complex Self-Organising Systems by Self-Stabilising Fields

2015 IEEE 9th International Conference on Self-Adaptive and Self-Organizing Systems • 2015
View 2 Excerpts

Building Blocks for Aggregate Programming of Self-Organising Applications

2014 IEEE Eighth International Conference on Self-Adaptive and Self-Organizing Systems Workshops • 2014
View 1 Excerpt

Similar Papers

Loading similar papers…