Self-organized Detection of Relationships in a Network

Full Text (PDF, 404KB), PP.80-87

Views: 0 Downloads: 0

Author(s)

P.Lokesh Kumar Reddy 1,* B.Rama Bhupal Reddy 2 S.Rama Krishna 3

1. Rama Raja Institute of Technology and Science, Tirupati, A.P., India

2. Dept. of Mathematics, K.S.R.M. College of Engineering, Kadapa, A.P., India

3. Dept. of Computer Science, S.V. University, Tirupati, A.P., India

* Corresponding author.

DOI: https://doi.org/10.5815/ijitcs.2013.02.09

Received: 27 May 2012 / Revised: 3 Oct. 2012 / Accepted: 10 Dec. 2012 / Published: 8 Jan. 2013

Index Terms

Relationship Network, Network Access, Self-organization in Networks, Relationship Clustering

Abstract

Multistate operations within a network result in high-dimensional, multivariate temporal data, and are useful for systems, which monitor access to network entities like resources, objects, etc. Efficient self organization of such multistate network operations stored in databases with respect to relationships amongst users or between a user and a data object is an important and a challenging problem. In this work, a layer is proposed where discovered relationship patterns amongst users are classified as clusters. This information along with attributes of involved users is used to monitor and extract existing and growing relationships. The correlation is used to help generate alerts in advance due to internal user-object interactions or collaboration of internal as well as external entities. Using an experimental setup, the evolving relationships are monitored, and clustered in the database.

Cite This Paper

P.Lokesh Kumar Reddy, B.Rama Bhupal Reddy, S.Rama Krishna, "Self-organized Detection of Relationships in a Network", International Journal of Information Technology and Computer Science(IJITCS), vol.5, no.2, pp.80-87, 2013. DOI:10.5815/ijitcs.2013.02.09

Reference

[1]T. Shinohara, “Ubiquitous network vision for new growth”, ITU Telecom Report, 2003.

[2]L. Srivastava, “The network of the future: What is over the horizon”, Billing Asia 2006, Shanghai, China, 13, March 2006.

[3]Y. Zhang and W. Lee, “An integrated environment for testing mobile ad-hoc networks”, Proceedings of 3rd ACM Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc), June, 2002.

[4]R. Fernandez, “Enterprise dynamic access control (EDA C) case study”, CS1/06-0078 Project, United States Navy, March 2006.

[5]National Institute of Standards and Technology-RBAC. http://csrc.nist.gov/rbac/.

[6]D. Hammerstrom, “Neural networks at work”, IEEE Spectrum, pp. 26–32, June 993. 

[7]Aleksander, et al., “An Introduction to neural computing”, Chapman and Hall, 1990.

[8]N. Ye, X. Li, Q. Chen, S. Emran, and M. Xu, “Probabilistic techniques for intrusion detection based on computer audit data”, IEEE Transactions on Systems, Man, and Cybernetics-Part A: Systems and Humans, Vol. 31, No. 4, pp. 266–274, 2001.

[9]R. Fuller and M. Kantardzic, “Distributed monitoring of frequent items”, Transactions on Machine Learning and Data Mining, Vol. 1, No. 2, pp. 67–82, 2008.

[10]F. Anjum, D. Subhadrabandhu, and S. Sarkar, “Signature based intrusion detection for wireless ad hoc networks: A comparative study of various routing protocols”, IEEE Vehicular Technology Conference, Orlando, FL, Vol. 58, pp. 2152–2156, 6–9 October 2003.

[11]A. Mishra, K. Nadkarni, and A. Patcha, “Intrusion detection in wireless ad hoc networks”, IEEE Wireless Communications, pp. 48–60, February 2004.

[12]D. Subhadrabandhu, S. Sarkar, and F. Anjum, “Efficacy of misuse detection in ad hoc networks”, Proceedings of the Annual IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks, pp. 97–107, 2004.

[13]T. Chen and V. Venkataramanan, “Dempster-Shafer theory for intrusion detection in ad hoc networks”, IEEE Internet Computing, pp.35–41, December 2005.

[14]T. Otto, A. Meyer-Baese, M. Hurdal, D. Sumners, D. Auer, and A. Wismuller, “Model-free functional MRI analysis using cluster-based methods”, Proceedings of SPIE, Vol. 5103, pp. 17–24, August 2003.

[15]S. Przylucki, W. Wojcik, K. Plachecki, and T. Golec, “An analysis of self-organization process for data classification in multisensor systems”, Proceedings of SPIE, Vol.5124, pp. 325–332, September 2003.

[16]P. D’Urso and L. Giovanni, “Temporal self-organizing maps for telecommunications market segmentation”, Neurocomputing, Vol. 71, pp. 2880–2892, 2008.

[17]T. Voegtlin and P. Dominey, “Recursive self-organizing maps”, Neural Networks, Vol. 15, No. 8–9, pp. 979–991, 2002.

[18]B. Hammer, A. Micheli, A. Sperduti, and M. Strickert, “Recursive self-organizing network models”, Neural Networks, Vol.17, No. 8–9, pp. 1061–1085, 2004.

[19]Y. Shidara, M. Mineichi Kudo, and A. Nakamura, “Classification based on consistent item set rules”, Transactions on Machine Learning and Data Mining, Vol. 1, No. 1, pp.17–30, 2008.

[20]A. Fornells, E. Armengol, E. Golobardes, S. Puig, and J. Malvehy, “Experiences using clustering and generalizations for knowledge discovery in melanomas domain”, Transactions on Machine Learning and Data Mining, Vol. 1, No. 2, pp. 49–65, 2008.

[21]K. Rosen, “Discrete mathematics and its applications”, 4th Edition, McGraw-Hill Publishers, 2000.

[22]V. Krebs, “Introduction to social network analysis”, 15 January 2007. http://www.orgnet. com/sna.html.