While the existing online community detection methods mostly only deal with the nodes and edges from the increment part
which are difficult to effectively detect the dynamic changes in the community structure.Based on this
a new method for the detection of flow graphs based on online non negative matrix factorization (ONMF) is proposed.Firstly
our method put graph data into the cache as continuous streams to deal with.Then
our method iteratively updates the existing community belonging matrix real-time using online nonnegative matrix decomposition architecture and by means of the projected gradient descent theory.Lastly
through effective learning rate and cache strategy setting
our method ensures the convergence and rationality of graph stream processing.Experiments on real network data sets show that ONM has a higher community detection quality compared with the existing methods.