The paper makes a point that the social nets are not really totally usable by its original form. We usually have to remove some edges by a certain extent for a specific tasks. My thought on this is like the social edges are like aqueduct or wires. Different behaviors have different propagation coefficients.
Another important thing in this paper is those features, in three categories:
- reach
- node degree
- average neighbor degree
- size of two-hop neighborhood
- closure
- embeddedness, an average of ratios of common friends over or-friends;
- normalized clustering coefficient, the average probability of two of my neighbors are friends
- bridge
- network constraints (sum of all neighbors, each inner producted with the node)
- ego components (after removal, how many new components will appear)
No comments:
Post a Comment