EFFECTIVE MINING ALGORITHM OF K-DENSE SUB-GRAPH IN COMPLEX NETWORK BASED ON PROBABILITY ATTRIBUTE GRAPH

Chunying Zhang, Liya Wang, and Baoxiang Liu

References

  1. [1] C.Y. Zhang and X. Zhang, Uncertain attribute graph model of web social network and its application, 8th International Conf. on Computer Science & Education, Colombo, Sri Lanka, April 2013.
  2. [2] M. Han, W. Zhang, and J.Z. Li, RANKING: An efficient algorithm for mining maximum frequent patterns in uncertain graph, Journal of Computer, 33(8), 2010, 1387–1395.
  3. [3] Z.N. Zou, J.Z. Li, H. Gao, and S. Zhang, Mining frequent sub-graph patterns from uncertain graph, Journal of Software, 20(11), 2009, 2965–2976.
  4. [4] W.F. Li, Z.Y. Peng and D.Y. Li, Uncertainty over the top-k query processing, Journal of Software, 23(6), 2012, 1542–1560.
  5. [5] D. Conte, P. Foggia, C. Sansone, and M. Vento, Thirty years of graph matching in pattern recognition, International Journal of Pattern Recognition and Artificial Intelligence, 18(3), 2004, 256–298.
  6. [6] M.I. Jordan, Graphical models (special issue on Bayesian statistics), Statistical Science, 19, 2004, 140–155.
  7. [7] M. Aurangzeb, F.L. Lewis, and M. Huber, Efficient, swarmbased path finding in unknown graphs using reinforcement learning, Control and Intelligent Science, 42(3), 2014, 870–877.
  8. [8] T.S. Li, W.N. Wang, and Q.F. Chen, Research on the projection position-based sequential pattern mining algorithm, Control and Intelligent Science, 42(1), 2014, 1298–1302.
  9. [9] Z.N. Zou, J.Z. Li, H. Gao, and S. Zhang, Mining frequent sub-graph patterns from uncertain graph data, IEEE Transactions on Knowledge and Data Engineering, 22(9), 2010, 1203–1218.
  10. [10] M. Han, J.Z. Li, and Z.N. Zou, Finding K dense sub-graph from uncertain graph, Computer Science and Exploration, 5(9), 2011, 791–803.
  11. [11] Y. Yuan and G.R. Wang, The probability query for uncertain graph, Journal of Computer, 33(8), 2010, 1378–1386.

Important Links:

Go Back