Utilizing hyperlink transitivity to improve web page clustering

The rapid increase of web complexity and size makes web searched results far from satisfaction in many cases due to a huge amount of information returned by search engines. How to find intrinsic relationships among the web pages at a higher level to implement efficient web searched information management and retrieval is becoming a challenge problem. In this paper, we propose an approach to measure web page similarity. This approach takes hyperlink transitivity and page importance into consideration. From this new similarity measurement, an effective hierarchical web page clustering algorithm is proposed. The primary evaluations show the effectiveness of the new similarity measurement and the improvement of web page clustering. The proposed page similarity, as well as the matrix-based hyperlink analysis methods, could be applied to other web-based research areas..

Web page clustering : a hyperlink-based similarity and matrix-based hierarchical algorithms

This paper proposes a hyperlink-based web page similarity measurement and two matrix-based hierarchical web page clustering algorithms. The web page similarity measurement incorporates hyperlink transitivity and page importance within the concerned web page space. One clustering algorithm takes cluster overlapping into account, another one does not. These algorithxms do not require predefined similarity thresholds for clustering, and are independent of the page order. The primary evaluations show the effectiveness of the proposed algorithms in clustering improvement.

Effects of social characters in viral propagation seeding strategies in online social networks

Online social networks have not only become a point of aggregation and exchange of information, they have so radically rooted into our everyday behaviors that they have become the target of important network attacks. We have seen an increasing trend in Sybil based activity, such as in personification, fake profiling and attempts to maliciously subvert the community stability in order to illegally create benefits for some individuals, such as online voting, and also from more classic informatics assaults using specifically mutated worms. Not only these attacks, in the latest months, we have seen an increase in spam activities on social networks such as Facebook and RenRen, and most importantly, the first attempts at propagating worms within these communities. What differentiates these attacks from normal network attacks, is that compared to anonymous and stealthy activities, or by commonly untrusted emails, social networks regain the ability to propagate within consentient users, who willingly accept to partake. In this paper, we will demonstrate the effects of influential nodes against non-influential nodes through in simulated scenarios and provide an overview and analysis of the outcomes.

Trust evaluation for indirectly connected nodes using link community information

Inspired by recent empirical research on link communities, we borrow some important ideas and concepts for our own research to provide a more reasonable computation model of transitive trust. The key advantages of using link community methodology is to reflect on the nature of the social network features of Hierarchy and Overlap. Our research mainly resolves the computation of trust transitivity in which two nodes do not have any direct links to any link community. In this research, we discover a new direction analyzing trust transitivity. By using a social network game, we found that the link community methodology is a natural way to analyze trust in social networks. We also discovered, even in a small social network, trust has certain community features.

Construction and aggregation of preference relations based on fuzzy partial orders

In group decision-making problems it is common to elicit preferences from human experts in the form of pairwise preference relations. When this is extended to a fuzzy setting, entries in the pairwise preference matrix are interpreted to denote strength of preference, however once logical properties such as consistency and transitivity are enforced, the resulting preference relation requires almost as much information as providing raw scores or a complete order over the alternatives. Here we instead interpret fuzzy degrees of preference to only apply where the preference over two alternatives is genuinely fuzzy and then suggest an aggregation procedure that minimizes a generalized Kemeny distance to the nearest complete or partial order. By focusing on the fuzzy partial order, the method is less affected by differences in the natural scale over which an expert expresses their preference, and can also limit the influence of extreme scores.