Given an uncertain graph G and a support threshold min_sup proximity pattern mining on G is to find all the label sets whose support exceed min_sup .

u7ed9u5b9au4e00u4e2au4e0du786eu5b9au56feGu548cu652fu6301u5ea6u9608u503cminsupuff0cu8fd1u90bbu6a21u5f0fu6316u6398u5c31u662fu627eu51faGu4e2du6240u6709u652fu6301 u5ea6u8d85u8fc7 min supu7684u6807u7b7eu96c6u5408u3002

The latter can be converted into the existence of Max inf solution and Mini sup solution of function f ( x y ) defined on proper conduct spaces by means of Hamilton function and Lagrange function .

u8fd9u4e00u7c7bu95eeu9898u53c8u53efu901au8fc7Hamiltonu51fdu6570u3001Lagrangeu51fdu6570u8f6cu5316u4e3au9002u5f53u4e58u79efu7a7au95f4 u4e0au4e8cu5143u51fdu6570fuff08xuff0cyuff09u7684Mini supu89e3u3001Maxinfu89e3u7684u5b58u5728u6027u95eeu9898u3002