Low selectivity problem using the concept of sampling

Journal Title: IOSR Journals (IOSR Journal of Computer Engineering) - Year 2014, Vol 16, Issue 3

Abstract

 available information on social peers for improving the information needs of a user or node, this is because of the birth of online social networks. In this paper, the focus is on improvement of the performance of collecting information from the neighborhood of a user or a node in a dynamic social network. To explore user’s or node’s social network correctly we have introduced sampling based algorithms by keeping in mind the structure of social network and to approximate the quantities of interest in short time. By showing correlations across our samples we have introduced and also analyzed variants of basic sampling scheme. Here, the models of distributed and centralized network are considered. Assuming that information for each user or node is available we have showed that our algorithms can be utilized to rank nodes which are neighbor to the user. We demonstrate the working of our algorithms for approximation of various quantities of interest and validate analysis results. This is done using real and synthetic data. The methods we describe can be possibly easily adopted in verities of strategies which aim to collect information efficiently from a social graph.

Authors and Affiliations

Mr. Y. P. Murumakar, , Prof. Y. B. Gurav,

Keywords

Related Articles

Performance Issues on the Interoperability between IEEE 802.3 & IEEE 802.11 in Heterogeneous Network Environment

Abstract: This paper addresses network computing that seeks to utilize the aggregate resources of many networked computers that can be installed in heterogeneous environment to solve problems of resource allocation, and...

 A Machine Learning Approach to Beaconing for Vehicular Ad Hoc Network (A Review)

 Abstract: Vehicular ad hoc network (VANET) are classified as an application of mobile ad hoc network (MANET) that has the potential in improving road safety and in providing traveller comfort.VANET is an emerging f...

An EfficientHybrid Push-Pull Based Protocol for VOD In Peer-to-Peer network

 Abstract : Video-on-Demand is a service where movies are delivered to distributed users with low delay and free interactivity. The traditional client-server architecture experiences scalability issues to provide vi...

 DSNs & X.400 assist in ensuring email reliability

 Abstract: While email is fairly reliable, messages do get lost. This can be due to the store-and-forward natureof e- mail, which passes responsibility for delivering email from one mail server to another, but in do...

 A Survey Paper on Steganalysis F5 Algorithm

 Steganography is a technique which used for securing the secret information from the illegal activity. Steganalysis is technique of finding the hidden text from the stego image. A Steganalysis based on the  ...

Download PDF file
  • EP ID EP116085
  • DOI 10.9790/0661-16317882
  • Views 81
  • Downloads 0

How To Cite

Mr. Y. P. Murumakar, , Prof. Y. B. Gurav, (2014).  Low selectivity problem using the concept of sampling. IOSR Journals (IOSR Journal of Computer Engineering), 16(3), 78-82. https://europub.co.uk/articles/-A-116085