A NOVEL APPROACH FOR COMMUNITY DISCOVERY IN DYNAMIC NETWORKS
Journal Title: International Journal of Computer Science & Engineering Technology - Year 2015, Vol 6, Issue 11
Abstract
Recently, discovering aggressive communities has become an increasingly critical task. Many conclusion have been expected, most of which only use correlation structure. However, rich information is cipher in the content of social chain such as node content and edge contented, which is fundamental to discover topically meaningful association. Therefore, to disclose both structurally and topically meaningful association, linkage architecture, node comfortable and edge content should be unified. The main objection lies in how to integrate those dynamics in a seamless way. This paper nominates a novel transformation of comfortable based network into a Node-Edge Interaction chain where linkage architecture, node content and boundary comfortable are fixed seamlessly. A differential action based access is expected to incrementally continue the Node Edge Interactional chain as the comfortable based network derives. To capture the semantic aftermath of different edge types, a transition chance matrix is construct for the NEI network. Based on this, heterogeneous accidental walk is enforced to discover aggressive communities, leading to a new dynamic association detection method describe Node Edge Interaction Walk (random Walk).
Authors and Affiliations
P. Moulika , R. Veerababu
Keywords
Related Articles
- EP ID EP153867
- DOI -
- Views 109
- Downloads 0
MINING ALGORITHM FOR XML QUERY-ANSWERING SUPPORT
In this current world, we come across digital information available on the web like e-business transaction, e-shopping, e-learning etc., These XML documents are outsized and so the datasets returned as a answer query is...
Requirement Engineering Research
The requirement validation is vital for every successful software development. In this process, the requirements from the users are checks and analyzed with its consistency, completeness and correctness. The validation o...
Modelling and Performance Analysis of Personalized DSR Routing Protocol to discover a selfish and Inimical Node in MANETs Using NS-2
In this paper we activated the default dynamic source routing protocol with a selfish and inimical node and compared the performance of this code with default dynamic source routing protocol. The performance of this code...
A Single Image Super Resolution Using Advanced Neighbor Embedding
There are lots of Super resolution methods developed recently. Each has its own pros and cons and behavior. The neighbor-embedding (NE) algorithm for single-image super-resolution reconstruction is one of them which assu...
A Comparative Review on Hierarchical based and Distance Based Leach Protocol
Wireless Networking is a tools in which numeral mobile nodes can converse with each other openly or not directly through wireless relations. A sensor network is poised of a great number of sensor nodes and a sink. In the...