Mining Association Rules in Scale-Free Networks

For the characteristic of scale-free networks, containing a few nodes that have a very high degree and many with low degree,the high connectivity nodes play an important role of hubs in communication and networking. This characteristic can be exploited with designing efficient search algorithms. This paper proposes an algorithm to change each new node connecting to the network based on its high-degree-probability for equal-degree-probability ,after having constituted initial model by choosing high-degree-probability nodes. We use an association rule search strategy that utilizes high degree nodes in scale-free networks and costs scaling with the size of the graph. We also demonstrate the utility of these CSCCNU network.. It can improve networks´ robustness.