City vehicle social network community recommendation nearest optimal configuration method based on improved Steiner minimal tree

[0022] In order to make the above and other objects, features and advantages of the invention more obvious, further description will be made below in conjunction with specific embodiments.

[0023] C 1 Each member in corresponds to an external trust value T ext,i , community C 2 Each member in the community C 1 Members in have an internal trust value T int,i (g, g). Then community C 1 to community C 2 The community recommendation near-optimal allocation problem in the urban vehicle social network can be defined as: in the community C 1 There exists at least one member in C that will be socially recommended, and then from members to C 2 The social recommendation path of members in is determined in order to maximize. Furthermore, it shows that the socially recommended optimal configuration has the highest confidence.

[0024] Community C 2 All members in will be included in all socially recommended configurations without the need to override C 1 All members in . For the