K-closely subgraph of probability attribute graph and its mining algorithm

There exist the uncertainty of edge, vertex and its attributes in complicated networks, so probability attribute graph is formed. Finding closely subgraph in the probability attribute graph is a kind of important issues. The probability attribute subgraph and closely subgraph are put forward based on probability attribute graph. They are discussed from the points of the probability I attribute graph, the probability II attribute graph and probability attribute graph. The expectation tightness function is definite and the mining algorithm of the Kclosely subgraph is given. Analysis shows that the algorithm has more practical application value.