13.07.2015 Views

E-Commerce

E-Commerce

E-Commerce

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

Ranking Companies Based on Multiple Social Networks Mined from the Web 83N. Although other operations can be performed, such as taking the variance ortaking the mean, we limit the operations to the four described above. The valueobtained here results in the network-based feature for node x. Additionally, we cantake the difference or the ratio of two obtained values. For example, if we obtain 2by Sum ○ s (1) ○C x(1) and 1 by Sum ○ s (1) ○ C x(k), the ratio is 2/1 = 2.0.We can thereby generate a feature by subsequently defining a nodeset, applying an operator,and aggregating the values. The number of possible combinations is enormous. Therefore,we apply some constraints on the combinations. First, when defining a nodeset, k is anarbitrary integer theoretically; however, we limit k to be 1 for a nodeset of neighbors, k to be3 for a nodeset of reachable nodes simplicity. Operator s (k) is used only as s (1) . We also limittaking the ratio only to those two values with neighbor nodeset C x(1) and reachable nodesetC x(∞). The nodesets, operators, and aggregations are presented in Table 1. We have2(nodesets) × 5(operators) × 4(aggregations) = 40 combinations. There are ratios for C x(1) toC x(k) if we consider the ratio. In all, there are 4 × 5 more combinations: there are 60 in all.Each combination corresponds to a feature of node x. Some combinations produce the samevalue. One example is that Sum ○ t x ○ C x1 is the same as Sum ○ s ○C x(∞), representing thedegree of node x.NotationC x(1)C x(k)s (1)tt xγu xAvgSumMinMaxInput Output Descriptionnode xnode xa nodeseta nodeseta nodeseta nodeseta nodeseta list ofvaluesa list ofvaluesa list ofvaluesa list ofvaluesa nodeseta nodeseta list ofvaluesa list ofvaluesa list ofvaluesa list ofvaluesa list ofvaluesa valuea valuea valuea valueadjacent nodes to xnodes within distance k from x1 if connected, 0 otherwisedistance between a pair of nodesdistance between node x and othernodesnumber of links in each node1 if the shortest path includes node x, 0otherwiseaverage of valuessummation of valuesminimum of valuesmaximum of valuesRatio Two values value ratio of value on neighbor nodeset C x(1)by reachable nodeset C x(∞)Table 1. Operator list

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!