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

 SSEGR: Secure Single-Copy Energy Efficient Geographical Routing Algorithm in Wireless Sensor Networks

Abstract: Geographical Routing Technique is a new trend in Wireless Sensor Networks in which the sensor nodes are enabled using Global Positioning Systems (GPS). This helps to easily detect the position of their neighbor...

A Survey on Multiple Patient Data Semantic Conflicts and the Methods of Electronically Data Exchange Advantages and Disadvantages

Abstract: In last few years heterogeneous healthcare information such as electronically patient data has gains a great attention especially from clinicians, researchers, health care organizations. The government of unite...

Bandwidth allocation mechanisms in the next mobile generation: A practical Approach

Abstract: This paper presents an algorithm for bandwidth management in integrated LTE network and WLAN. The proposed algorithm also suitable for multimedia network (image, telephone and videophone). A software tool is im...

Severe SOA Security Threats on SOAP Web Services– A Critical Analysis 

 Abstract: Enterprise Application Integration (EAI) involves several technologies; among them, the popular and recent one is Service Oriented Architecture (SOA). Mainly, SOA is used for developing loosely coupled di...

Towards Automated Generation of ER-Diagram using a Web Based Approach

Abstract : Diagrams plays an important role in the software development process. Drawing the diagrams manually is the time consuming task, so there are many tools to draw and modify the diagram. From all the diagrams ER...

Download PDF file
  • EP ID EP116085
  • DOI 10.9790/0661-16317882
  • Views 112
  • 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