An integrated ranking algorithm for efficient information computing in social networks

Social networks have ensured the expanding disproportion between the face of WWW stored traditionally in search engine repositories and the actual ever changing face of Web. Exponential growth of web users and the ease with which they can upload contents on web highlights the need of content controls on material published on the web. As definition of search is changing, socially-enhanced interactive search methodologies are the need of the hour. Ranking is pivotal for efficient web search as the search performance mainly depends upon the ranking results. In this paper new integrated ranking model based on fused rank of web object based on popularity factor earned over only valid interlinks from multiple social forums is proposed. This model identifies relationships between web objects in separate social networks based on the object inheritance graph. Experimental study indicates the effectiveness of proposed Fusion based ranking algorithm in terms of better search results.Comment: 14 pages, International Journal on Web Service Computing (IJWSC), Vol.3, No.1, March 201

Using Link Types in Web Page Ranking and Filtering

Corresponding to the evolution of the Web from the poorly structured towards more structured, semantic rich network, search methods that apply to it are also evolving from using little structural and semantic information to using more such information that is available. This paper proposes a ranking and filtering mechanism that makes use of link types that is representable with new Web standards. We suggest that page ranking can be propagational through links and the propagational rates depend on the types of the links and users ’ specific set of interests. Page filtering can be decided based on link types combined with some other information relevant to links. For either a ranking or filtering task, a profile containing a set of ranking or filtering rules to be followed in the task can be specified to reflect users’ specific interests. Technical issues in implementing the mechanism in a search system are also discussed