Research Article
Personalized Recommendations Based on Sentimental Interest Community Detection
Input: | node . | Output: | community . | (1) A loop is performed over all adjacent nodes of ; | (2) Select the adjacent vertex , where , generating a subgraph ; | (3) Calculate the fitness of each vertex of ; | (4) if ,satisfy then | (5) Delete , yielding a new subgraph ; | (6) end if | (7) if 4 occurs then | (8) Repeat from (3). | (9) else | (10) Repeat from (1) for subgraph . | (11) end if |
|