A Systematic Review of Feature Location Techniques under Software Change Impact Analysis
Review Paper | Journal Paper
Vol.7 , Issue.3 , pp.184-192, Mar-2019
CrossRef-DOI: https://doi.org/10.26438/ijcse/v7i3.184192
Abstract
The possibility of introduction of a change in software cannot be denied as the request for upgrades and improved functionality keeps coming on. Implementing these changes require a systematic Change Impact Analysis (CIA) which is a step by step process under software maintenance. However, the most difficult phase in this systematic CIA process is the identification of an initial location of initiating the proposed change. Various techniques have been proposed to identify this initial location which comes under Feature Location Techniques. These techniques are aimed at finding areas in the software code and other software artifacts that implement a feature. The paper attempts to organize and structure existing work in the field of feature location by presenting a literature survey of recent feature location techniques whereby the techniques have been categorized according to the methodology followed, the tools proposed and their impact. The paper also discusses open issues and defines future directions in the field of feature location.
Key-Words / Index Term
change impact analysis, feature location, software maintenance,concept location
References
[1] W.Li, S.Henry, “Maintenance support for object-oriented programs” Vol 7, No 2, pp. 131–147, 1995.
[2] S Bohner, R. Arnold, “Software Change Impact Analysis”, IEEE Computer Society Press: Los Alamitos, CA, USA, 1996.
[3] S.L. Pfleeger, S.A.Bohner, “A framework for software maintenance metrics”, In the Proceedings of the International Conference on Software Maintenance, Washington, DC, pp. 320–327, 1990.
[4] E. Horowitz, R.C. Williamson,”SODOS: a software documentation support environment—its definition”, IEEE Transactions on Software Engineering, Vol 12, No 8, pp. 849–859. 1986.
[5] N.Wilde, M.Scully,”Software Reconnaissance: Mapping Program Features to Code”, Software Maintenance: Research and Practice, vol. 7, pp. 49-62, 1995.
[6] V. Rajlich and P. Gosavi,), "Incremental Change in Object-Oriented Programming", IEEE Software, pp. 2-9. 2004.
[7] A.Dhamija, S.Sikka, “Software Change Management: A Quantified Perspective”, International Journal of Engineering & Technology-UAE, Vol 7, Issue 3.12, pp. 963-967. 2018.
[8] B.Dit, M.Revelle, M.Gethers, D.Poshyvanyk, “Feature location in source code: a taxonomy and survey”, Journal of Software Maintenance and Evolution: Research and Practice, 2011.
[9] M. Revelle and D. Poshyvanyk, “An Exploratory Study on Assessing Feature Location Techniques”, In Proceedings of 17th IEEE International Conference on Program Comprehension (ICPC`09), Vancouver, British Columbia, Canada, May 17-19, pp. 218-222, 2009.
[10] J. Rubin and M. Chechik, “A survey of feature location techniques,” Domain Engineering: Product Lines, Conceptual Models, and Languages. Springer, pp. 29–58, 2013.
[11] N. Alhindawi, J. Alsakran, A. Rodan, H. Faris, “A Survey of Concepts Location Enhancement for Program Comprehension and Maintenance”, Journal of Software Engineering and Applications, Vol 7, pp. 413-421, 2014.
[12] E. Hill, B. Sisman, A.C. Kak, “On the use of positional proximity in IR-based feature location”, CSMR-WCRE,pp. 318–322, 2014.
[13] F. Beck, B. Dit, J. Velasco-Madden, D. Weiskopf, and D. Poshyvanyk. Rethinking user interfaces for feature location. In Proceedings of the 23rd IEEE International Conference on Program Comprehension, ICPC, pages 151–162. IEEE, 2015
[14] C.S. Corley, K.L. Kashuda, N.A. Kraft, "Modeling changeset topics for feature location" , ICSME, Germany, IEEE., pp. 71-80, 2015.
[15] C.S. Corley, K Damevski and N.A. Kraft, Exploring the Use of Deep Learning for Feature Location, , ICSME, Germany, IEEE, 2015.
[16] M. Chochlov, M. English and J. Buckley, “Using Changeset Descriptions as a Data Source to Assist Feature Location”,IEEE SCAM, Breman Germany, 2015.
[17] G Liang, Y Dang, H Chen, L Mei, S Li, Y M Chee, “What Code Implements Such Service? A Behavior Model Based Feature Location Approach”, IEEE International Conference on Services Computing, 2016.
[18] B.Dit, L.Guerrouj, D.Poshyvanyk and G.Antoniol,"Can Better Identifier Splitting Techniques Help Feature Location?" In Proceedings. of 19th IEEE International Conference on Program Comprehension (ICPC`11), Kingston, Ontario, Canada, June 22-24 pp. 11-20, 2011.
[19] J.T. Burke, “Utilizing Feature Location Techniques for Feature Addition and Feature Enhancement”, In Proceedings of the 29th ACM/IEEE international conference on Automated software engineering pp. 879-882, 2014.
[20] T. Eisenbarth, R. Koschke and D. Simon, "Locating Features in Source Code" , IEEE Transactions on Software Engineering vol. 29 no. 3, pp. 210 – 224, 2003.
[21] X.Peng, X.Zhenchang, T.Xi, Yijun and Zhao, Wenyun). “Improving feature location using structural similarity and iterative graph mapping”, Journal of Systems and Software, 86(3) pp. 664–676, 2013.
[22] M.D.A.Maia, R.F. Lafetá, “On the impact of trace-based feature location in the performance of software maintainers”, Journal of Systems and Software, v.86 n.4, p.1023-1037, April, 2013.
[23] S. Zamani, S.P. Lee, R.Shokripour, J.Anvik J, “A noun-based approach to feature location using time-aware term-weighting”. Inf Softw Technol, Vol 56, No 8, pp. 991-1011, 2014.
[24] G.Scanniello, A. Marcus, D. Pascale, “Link analysis algorithms for static concept location: an empirical assessment”. Empirical Softw Eng, pp. 1–55, 2014.
[25] K. Damevski D. Shepherd L. Pollock "A field study of how developers locate features in source code" Empirical Software Engineering, pp. 1-24, 2015.
[26] Aanchal, S. kumar, "Metrics for Software Components in Object Oriented Environments: A Survey", International Journal of Scientific Research in Computer Science and Engineering, Vol.1, Issue.2, pp.25-29, 2013.
[27] Anandi Mahajan, Pankaj Sharma, "Object Oriented Requirement management Tools for maintaining of status of requirements", International Journal of Scientific Research in Computer Science and Engineering, Vol.6, Issue.6, pp.27-30, 2018
Citation
Ankit Dhamija, Sunil Sikka, "A Systematic Review of Feature Location Techniques under Software Change Impact Analysis," International Journal of Computer Sciences and Engineering, Vol.7, Issue.3, pp.184-192, 2019.
Towards the Deployment of Machine Learning Solutions for Document Classification
Research Paper | Journal Paper
Vol.7 , Issue.3 , pp.193-201, Mar-2019
CrossRef-DOI: https://doi.org/10.26438/ijcse/v7i3.193201
Abstract
In the era of internet-connected devices, the amount of unstructured data is multiplying in many different types of file formats. In particular, a great deal of knowledge is hidden in the vast amounts of textual data such as emails, blogs, tweets, and log files. The primary issue in this kind of textual data is to classify its content into predefined classes expeditiously in real time. Hence this research paper investigates the deployment of the state-of-the-art Machine Learning (ML) algorithms such as decision tree, k-nearest neighbourhood, Rocchio, ridge, passive-aggressive, multinomial naïve Bayes, Bernoulli naïve Bayes, support vector machine, artificial neural network including perceptron, stochastic gradient descent, back-propagation neural network in automatic classification of text documents on benchmark datasets such as 20Newsgroup, BBC news, BBC sports and IMDB. Finally, the performance of all the aforementioned built-in classifiers is compared and empirically evaluated using the well-defined metrics such as accuracy, error rate, precision, recall, f-measure and Kappa statistics.
Key-Words / Index Term
Text mining, Machine learning, Documents classification, Information Retrieval, Comparative study
References
[1] J. Han, M. Kamber, J. Pei, “Data Mining: Concepts and Techniques”, Morgan Kaufmann Publishers Inc., San Francisco, CA, 2011.
[2] S. Murugan, R. Karthika, “A Literature Review on Text Mining Techniques and Methods”, International Journal of Computer Sciences and Engineering, Vol.06, Issue.02, pp.96-99, 2018.
[3] R. Lourdusamy, S. Abraham, "A Survey on Text Pre-processing Techniques and Tools", International Journal of Computer Sciences and Engineering, Vol.06, Issue.03, pp.148-157, 2018.
[4] A. McCallum, R. Rosenfeld, T.M. Mitchell, and A.Y. Ng,”Improving Text Classification by Shrinkage in a Hierarchy of Classes”. In ICML, Vol. 98. 359–367, 1998.
[5] C.D. Manning, P. Raghavan, and H. Schütze, “Introduction to information retrieval”,Vol. 1, Cambridge university press, Cambridge, 2008.
[6] H. Turtle and W.B. Croft,“Inference networks for document retrieval”, In Proceedings of the 13th annual international ACM SIGIR conference on Research and development in information retrieval, ACM, pp. 1–24, 1989.
[7] P.V. Arivoli, T.Chakravarthy, G.Kumaravelan, “International Journal of Advanced Research in Computer Science”, 8, (8), 299-302, 2017.
[8] F. Sebastiani. “Machine Learning in Automated Text Categorization”, ACM Computing Surveys, 34(1), 2002.
[9] F. Colas ,P. Brazdil., “Artificial Intelligence in Theory and Practice”, ed. M. Bramer, (Boston: Springer), pp. 169-178, 2006.
[10] S. Z. Mishu, S. M. Rafiuddin, "Performance Analysis of Supervised Machine Learning Algorithms for Text Classification", 19th Int. Conf. Comput. Inf. Technol, pp. 409-413, 2016.
[11] A. Singh, B. S. Prakash, K. Chandrasekaran,” A comparison of linear discriminant analysis and ridge classifier on Twitter data”, International Conference on Computing, Communication and Automation (ICCCA), pp. 133-138,2016.
[12] Z.E. Rasjida, R. Setiawan, “Performance comparison and optimization of text document classification using k-NN and naïve bayes classification techniques”,Procedia Computer Science 2017; 116(C),pp.107-12, 2017.
[13] B.R. Samal, A.K. Behera, M. Panda, ” Performance analysis of supervised machine learning techniques for sentiment analysis” Proceedings of the 1st ICRIL international conference on sensing, signal processing and security (ICSSS). Piscataway, IEEE, pp. 128–133. 2017.
[14] M. Ghosh and G. Sanyal, “Performance Assessment of Multiple Classifiers Based on Ensemble Feature Selection Scheme for Sentiment Analysis”, Applied Computational Intelligence and Soft Computing, vol. 2018, Article ID 8909357, 12 pages, 2018.
[15] Y. Li, A. Jain, “Classification of text documents”,The Computer Journal, 41(8), pp. 537–546, 1998.
[16] C.C. Aggarwal and C. X. Zhai, “Mining text data”, Springer, 2012.
[17] A. McCallum, Kamal Nigam, ”A comparison of event models for naive bayes text classification”, In AAAI-98 workshop on learning for text categorization, Vol. 752. Citeseer, pp.41–48, 1998.
[18] D.D. Lewis, “Naive (Bayes) at forty: The independence assumption in information retrieval”, In Machine learning:ECML-98,Springer, pp.4–15. 1998.
[19] E.S. Han, G. Karypis, and V. Kumar, ”Text categorization using weight adjusted k-nearest neighborclassification. Springer”,2001
[20] C. Cortes, V. Vapnik.,” Support-vector networks. Machine Learning”, 20, pp. 273–297, 1995.
[21] H. Drucker, D. Wu, V. Vapnik, “Support Vector Machines for Spam Categorization”, IEEE Transactions on NeuralNetworks, vol. 10(5), pp.1048–1054, 1999.
[22] J.J. Rocchio, ”Relevance Feedback in Information Retrieval” The SMART Retrieval System, pp. 313–323 ,1971.
[23] J. He, L. Ding, L. Jiang, L. Ma, “Kernel ridge regression classification”, Proceedings of the International Joint Conference on Neural Networks. pp.2263-2267, 2014.
[24] K. Crammer, O. Dekel, J. Keshet, S. Shalev-Shwartz, and Y. Singer. “Online passive aggressive algorithms”, Journal of Machine Learning Research, vol. 7, pp. 551–585, 2006.
[25] B. Pang and L. Lee,”A Sentimental Education: Sentiment Analysis Using Subjectivity SummarizationBased on Minimum Cuts``, Proceedingsof the ACL, 2004.
[26] D. Greene and P. Cunningham. "Practical Solutions to the Problem of Diagonal Dominance in Kernel DocumentClustering", Proc. ICML 2006.
[27] F. Pedregosa et al,“Scikit-learn: Machine learning in Python”, Journal of Machine Learning Research, vol. 12, pp. 2825–2830, 2011.
[28] M. Sokolova, G. Lapalme, "A systematic analysis of performance measures for classification tasks", Inform. Process.Manage., vol. 45, no. 4, pp. 427-437, 2009.
Citation
Bichitrananda Behera, G. Kumaravelan, "Towards the Deployment of Machine Learning Solutions for Document Classification," International Journal of Computer Sciences and Engineering, Vol.7, Issue.3, pp.193-201, 2019.
Color Image Encryption using Single Layer Artificial Neural Network and Buffer Shuffling
Research Paper | Journal Paper
Vol.7 , Issue.3 , pp.202-211, Mar-2019
CrossRef-DOI: https://doi.org/10.26438/ijcse/v7i3.202211
Abstract
An image encryption is a traditional way to hide original image to an adversary in the case of secure image transmission. In this regard, the Artificial Neural Network (ANN) can be used in digital communication systems (digital image transmission) to achieve a secure and reliable data transmission. However, we have designed a new scheme that encrypts a color image, which can be used in secure image transmission. This proposed scheme is divided into three steps, (a) we subdivide the color image into R (red), G (green) and B (blue) factors, and using the chaotic map, we randomly shuffle these RGB factors to get first encrypted image; (b) we process the first encrypted image through the single-layer artificial neural network to get the second encrypted image; and (c) pixels of the second encrypted image are shuffled using exclusive-or (XOR) operation to get the final encrypted image, which can be transmitted over insecure channel. Furthermore, we have examined the proposed scheme on some standard color images each of size 512 × 512. The several security study and experimental outcomes indicate that the proposed scheme can protect from several statistical attacks like Plaintext Attack, Cipher text Attacks, Brute Force Attack, and Birthday Attack etc.
Key-Words / Index Term
Encryption, RGB buffer shuffle, Artificial Neural Network, Attacks
References
[1] W. Yao, X. Zhang, Z. Zheng and W. Qiu, “A color image encryption algorithm using 4-pixel Feistel structure and multiple chaotic systems”, Non-linear Dynamics, Vol. 81, pp. 151-168, 2015.
[2] X. J. Tong, Z. Wang, M. Zhang, Y. Liu, H. Xu and J. Ma, “An image encryption algorithm based on the perturbed high-dimensional chaotic map”, Nonlinear Dynamics, Vol. 80, pp. 1493-1508, 2015.
[3] A. Kanso and M. Ghebleh, “An efficient and robust image encryption scheme for medical applications”, Commun Nonlinear Sci Numer Simulat, Vol. 24, pp. 98-116, 2015.
[4] M. Chauhan and R. Prajapati, “Image encryption using chaotic based artificial neural network”, International Journal of Scientific Engineering Research, Vol. 5, pp. 2229-5518, 2014.
[5] Dr. S. Ramakrishnan, R. R. Rakshitha, V.Gayathiri and P.Kalaiyarasi, “Neural network based image encryption and authentication using chaotic maps”, International Journal of Current Trends in Engineering Research, Vol. 3, pp. 29-37, 2017.
[6] P. Alfke, “Efficient Shift Registers, LFSR Counters, and Long Pseudo-Random Sequence Generators”, XAPP 052, (Version 1.1), July 7,1996.
[7] H. Bahjat and M. A. Salih, “Speed Image Encryption Scheme using Dynamic Galois Field GF(P) Matrices”, International Journal of Computer Applications, Vol. 89, pp. 0975-8887, 2014.
[8] Q. A. Kester, “Image Encryption based on the RGB PIXEL Transposition and Shuffling”, I. J. Computer Network and Information Security, Vol. 7, pp. 43-50, 2013.
[9] W. S. Yap, R. C. W. Phan, W. C. Yau, S. H. Heng “Cryptanalysis of a new image alternate encryption algorithm based on chaotic map”, Nonlinear Dynamics, Vol. 80, pp. 483-1491, 2015.
[10] R. Rhouma, S. Meherzi and S. Belghith “OCML-based colour image encryption”, Science Direct, Vol. 40, pp. 309-318, 2009.
[11] L. M. Jawad and G. Sulong “Chaotic map-embedded Blowfish algorithm for security enhancement of color image encryption”, Nonlinear Dynamics, Vol. 81, pp. 2079-2093, 2015.
[12] D. Arroyo, S. Li, J. M. Amigoc, G. Alvarez and R. Rhouma “Comment on - Image encryption with chaotically coupled chaotic maps”, Science Direct, Vol. 239, pp. 1002-1006, 2010.
[13] C. K. Huang and H. H. Nien “Multi chaotic systems based pixel shuffle for image encryption”, Science Direct, Vol. 282, pp. 2123-2127, 2009.
[14] L. Hongjun and W. Xingyuan “Color image encryption based on one-time keys and robust chaotic maps”, Science Direct, Vol. 59, pp. 3320-3327, 2010.
[15] C. Li, S. Li, M. Asim, J. Nunez, G. Alvarez and G. Chen “On the security defects of an image encryption scheme”, Science Direct, Vol. 27, pp. 1371-1381, 2009.
[16] W. Chen and X. Chen “Optical color image encryption based on an asymmetric cryptosystem in the Fresnel domain”, Science Direct, Vol. 284, pp. 3913-3917, 2011.
[17] N. R. Kumar , G. Manikandan , R. B. Krishnan , N. R. Raajan and N. Sairam “A reversible visual cryptography technique for color images using Galois field arithmetic”, Biomedical Research, Vol. 28 (5), pp. 2036-2039, 2017.
[18] S. N. Lagmiri , N. E. Alami and J. E. Alami “Color and gray images encryption algorithm using chaotic systems of different dimensions ”, IJC-SNS International Journal of Computer Science and Network Security, Vol. 18, pp. 1, 2018.
[19] S. Banerjee, L. Rondoni, S. Mukhopadhyay and A. P. Misra “Synchronization of spatiotemporal semiconductor lasers and its application in color image encryption ”, Optics Communications, Vol. 284, pp. 2278-2291, 2011.
[20] M. Joshi, C. Shakher and K. Singh “Fractional Fourier transform based image multiplexing and encryption technique for four-color images using input images as keys ”, Optics Communications, Vol. 283, pp. 2496-2505, 2001.
[21] Y. Tang, Z. Wanga and J. A. Fang, “Image encryption using chaotic coupled map lattices with time-varying delays”, Commun Nonlinear Sci Nu-mer Simulat, Vol. 15, pp. 2456-2468, 2010.
[22] L. Hongjun and W. Xingyuan, “Color image encryption based on one-time keys and robust chaotic maps”, Computers and Mathematics with Applications, Vol. 59, pp. 3320-3327, 2010.
[23] W. Chen and X. Chen, “Optical color image encryption based on an asymmetric cryptosystem in the Fresnel domain”, Optics Communications, Vol. 284, pp. 3913-3917, 2011.
[24] Jyotsna, A. Papola, “An Image Encryption Using Chaos Algorithm Based on GLCM and PCA”, International Journal of Computer Sciences and Engineering, Vol. 6(3), pp. 76-81, 2018.
[25] M. Dasgupta, J. K. Mandal, “Bit-plane Oriented Image Encryption through Prime-Nonprime based Positional Substitution (BPIEPNPS)”, International Journal of Computer Sciences and Engineering, Vol. 4(6), pp. 65-70, 2016.
Citation
Dipankar Dey, Soumen Paul, "Color Image Encryption using Single Layer Artificial Neural Network and Buffer Shuffling," International Journal of Computer Sciences and Engineering, Vol.7, Issue.3, pp.202-211, 2019.
Arc Flash Analysis of Medium Voltage Level Power System using ETAP
Research Paper | Journal Paper
Vol.7 , Issue.3 , pp.212-219, Mar-2019
CrossRef-DOI: https://doi.org/10.26438/ijcse/v7i3.212219
Abstract
Electricity is the need of every day’s life both at home and on industry. But sometimes it causes very dangerous incident called an arc flash hazard in industry which damages the equipment and harm the workers to a greater extent. For knowing the level of arc flash hazard and providing better protection to working personnel, analysis of it is very important. This paper presents an arc flash analysis of medium voltage level power system based on standard IEEE 1584. IEEE 30 bus network is considered for analysis purpose. Electrical Transient and Analysis Program (ETAP) Software is used for Arc Flash Hazard (AFH) analysis of medium voltage level system. Comparative analysis is carried out based on result of software and hand calculation. These results are then used to determine Personnel Protective Equipment (PPE) to protect personnel and Labels are also generated for equipment to alert operators about hazard level.
Key-Words / Index Term
AFH analysis, PPE, FPB, AFIE, ETAP
References
[1]. Standard for Electrical Safety in the Workplace, NFPA70E-2015, Quincy, MA, USA: NFPA.
[2]. T. Gammon, W. Lee, Z. Zhang and B. C. Johnson, ““Arc Flash” Hazards, Incident Energy, PPE Ratings and Thermal Burn Energy-A Deeper Look”, in IEEE Transactions on Industry Applications, vol.51, no.5, pp. 4275-4283, 2015.
[3]. R. H. LEE, “Pressure Developed by Arcs”, in IEEE Transactions on Industry Applications, vol. IA-23, no. 4, pp. 1-4, 1987.
[4]. R. L. Doughty, T. E. Neal, and H. L. Floyd, “Predicting Incident Energy to Better Manage the Electric Arc Hazard on 600-V Power Distribution Systems”, in IEEE Transactions on Industry Applications, vol.36, no. 1, pp.1-13, 2000.
[5]. T. A. Short, “Arc-Flash Analysis Approaches for Medium-Voltage Distribution”, in IEEE Transactions on Industry Applications, vol.47, no.4, pp.1-8, 2011.
[6]. “Guide for performing arc-flash hazard calculations.”, IEEE 1584-2002.
[7]. T.K. Nagsarkar and M.S. Sukhija, “Power System Analysis”, Oxford higher education publisher, India, pp.650-652, 2011.
[8]. A. Yadav, V. K. Harit, “Fault identification in sub-station by using neuro-fuzzy technique”, International Journal of Scientific Research in Computer Science and Engineering, Vol.4, Issue.6, pp.1-7, 2016.
[9]. S. V.V.S.K. Reddy, K. Satyanarayana, “Sensing of ground fault in bipolar LVDC grid”, International Journal of Scientific Research in Network Security and Communication, Vol.6, Issue.6, 2018.
[10]. A. Khan, M. M. Aman, “Investigation of effect of critical incident energy parameters using ETAP to reduce arc flash hazards”, In the proceeding of the 2018 First International Conference on Power, Energy and Smart Grid(ICPESG), Mirpur Azad Kashmir, pp.1-6, 2018.
Citation
S.N. Chauhan, S.M. Pujara, P.K. Makhijani, C.D. Kotwal, "Arc Flash Analysis of Medium Voltage Level Power System using ETAP," International Journal of Computer Sciences and Engineering, Vol.7, Issue.3, pp.212-219, 2019.
Web Server log Analysis for Unstructured data Using Apache Flume and Pig
Research Paper | Journal Paper
Vol.7 , Issue.3 , pp.220-225, Mar-2019
CrossRef-DOI: https://doi.org/10.26438/ijcse/v7i3.220225
Abstract
Web server normally produces log files. A weblog is a group of connected web pages that consists of a log or daily record of information, particular fields or views which is altered, every now and then, by owner of site, other websites or by website users. This is used to convert the unstructured data of web server log which will be coming from Apache flume into structured format using Pig. An enterprise weblog analysis system based on Hadoop architecture with Hadoop Distributed File System (HDFS), Hadoop MapReduce Software Framework and Pig Latin Language aids the business decision-making process of the system administrators and helps them to collect and identify the potential value which is hidden within such huge data generated by the websites. Such a weblog analysis includes the analysis of an Internet site’s entry log as well as provides information about the amount of visitors, days of week and rush hours, views, hits, very often accessed pages, application server traffic trends, performance reports at varying intervals and statistical reports which indicate the performance of program. Web log file is a log file created and stored by a web server automatically. Analyzing such web server access logs files will provide us various insights about website usage. Due to high usage of web, the log files are growing at much faster rate with increase in size. Processing this fast growing log files using relational database technology has been a challenging task these days. Hadoop runs the big data where a massive quantity of information is processed via cluster of commodity hardware. In this paper we present the methodology used in pre-processing of high volume web log files, studying the statics of website and learning the user behaviour using the architecture of Hadoop MapReduce framework, Hadoop Distributed File System, and HiveQL query language Pig.
Key-Words / Index Term
HDFS, Apache Flume, Pig , Hbase, web log server
References
[1] Babak Yadranjiaghdam, Nathan Pool, Nasseh Tabrizi, “A Survey on Real-time Big Data Analytics: Applications and Tool”, 2016 International Conference on Computational Science and Computational Intelligence
[2] P. Muthulakshmi1, S. Udhayapriya , “A Survey on Big Data Issues and Challenges”,International Journal of Computer Sciences and Engineering, Vol.-6, Issue-6, Jun 2018 E-ISSN: 2347-2693
[3] SayaleeNarkhede and TriptiBaraskar, “HMR Log Analyzer: Analyze Web Application Logs over HadoopMapReduce,” International Journal of UbiComp (IJU) vol.4, No.3, July 2013.
[4] Mirghani. A. Eltahir ; Anour F. A. Dafa-Alla,” Extracting knowlede from web server logs using web usage minning”, Published in: 2013 International Conference On Computing, Electrical And Electronic Engineering (Icceee)
[5] https://en.wikipedia.org/wiki/Apache_Hadoop
[6] Dr.S.Suguna, M.Vithya,J.I.ChristyEunaicy, “Big Data Analysis in E-commerce System Using HadoopMapReduce”in 2016 IEEE.
[7] G.S.Katkar, A.D.Kasliwal, “Use of Log Data for Predictive Analytics through Data Mining”, Current Trends in Technology and Science, ISSN: 2279-0535. Volume: 3, Issue: 3(Apr-May 2014).
[8] Savitha K, Vijaya M S, “Mining of web server logs in a distributed cluster using big data technologies”, International Journal of Advanced Computer Science and Applications, Vol.5, NO.1, 2014
[9] Mahendra Pratap Yadav ; Pankaj Kumar Keserwani ; Shefalika Ghosh Samaddar, “An Efficient Web Mining Algorithm for Web Log Analysis: E-Web Miner” 2012 1st International Conference on Recent Advances in Information Technology (RAIT)
[10] Xianjun Ni, “Design and Implementation of Web log Minning” International conference of computer engineering and technology 2009
[11] Apache-Hadoop,http://www.hadoop.apache.org
Citation
A.S. Nagdive, R.M. Tugnayat, G.B Regulwar, D.Petkar, "Web Server log Analysis for Unstructured data Using Apache Flume and Pig," International Journal of Computer Sciences and Engineering, Vol.7, Issue.3, pp.220-225, 2019.
A novel framework for combating network attacks using Iptables
Research Paper | Journal Paper
Vol.7 , Issue.3 , pp.226-237, Mar-2019
CrossRef-DOI: https://doi.org/10.26438/ijcse/v7i3.226237
Abstract
Network attacks pose as grievous threat to the stability of the Internet and are a major security concern as they can breach the security of the network or even make the victim unavailable. The network attack packets can intercepted by using Iptables before they can reach the victim machine. Iptables is the standard firewall included in Linux distributions for handling the kernel Netfilter modules. The effectiveness of the defense provided by the Iptables firewall mainly depends on its rules. In this paper, we have proposed a novel framework with new customized Iptables rules for mitigating fifteen types of network attacks which include port scanning; denial of service attacks, TCP, UDP, and ICMP based attacks etc. The performance of Iptables with these rules is evaluated with the real experiments for examining the competence of firewall in managing the network traffic and security when subjected to attack flow along with the normal traffic. The performance of Iptables is recorded in the terms of CPU utilization for processing and Logs generation, Frame Loss Ratio and Efficiency. The attack traffic is generated using Scapy for execution of the attacks whereas the normal traffic is generated using a traffic generator called D-ITG. It was found that Iptables could successfully detect the network attack and performed really well during the mitigation of such attacks.
Key-Words / Index Term
Iptables, Netfilter, Scapy, DITG, network-attacks
References
[1] W. Su and J. Xu, "Performance Evaluations of Cisco ASA and Linux Iptables Firewall Solutions," May 2013.
[2] "Netfilter Project," [Online]. Available: www.netfilter.org. [Accessed 01 October 2017].
[3] "Iptables," 2017. [Online]. Available: http://www.Iptables.info/en/structure-of-Iptables.html. [Accessed 7 September 2017].
[4] "Monitoring and Tuning the Linux Networking Stack: Receiving Data," May 2016. [Online]. Available: https://blog.packagecloud.io/eng/2016/06/22/monitoring-tuning-linux-networking-stack-receiving-data/. [Accessed 27 September 2017].
[5] R. K. C. Chang, "Defending against Flooding-Based Distributed Denial-of-Service Attacks:A Tutorial," IEEE Communications Magazine, pp. 42-51, October 2002.
[6] "Scapy and its Documentation," 6 Nov 2017. [Online]. Available: https://scapy.readthedocs.io/en/latest/. [Accessed 22 October 2017].
[7] A. Botta, W. Donato, A. Dainotti, S. Avallone and A. Pescapé. [Online]. Available:http://traffic.comics.unina.it/software/ITG/ manual/. [Accessed 16 November 2017].
[8] O. Andreasson, 2001. [Online]. Available: http://onz.es/IpTables %20Tutorial.pdf. [Accessed 5 October 2017].
[9] M. Rash, Linux Firewalls- Attack Detection and Response, 2007.
[10] K. Chatterjee, "Design and Development of a Framework to Mitigate DoS/DDoS Attacks Using IPtables Firewall," International Journal of Computer Science and Telecommunications , vol. 4, no. 3, pp. 67-72, March 2013.
[11] B. Sharma and K. Bajaj, "Packet Filtering using IP Tables in Linux," International Journal of Computer Science Issues(IJCSI), vol. 8, no. 4, pp. 320-325, July 2011.
[12] B. Q. M. AL-Musawi, "Mitigating DoS/DDoS Attacks Using Iptables," International Journal of Engineering & Technology IJET-IJENS, vol. 12, no. 03, pp. 101-111, June 2012.
[13] S. Mirzaie, A. K. Elyato and D. A. Sarram, "Preventing of SYN Flood attack with iptables Firewall," in 2010 Second International Conference on Communication Software and Networks.
[14] M. Šimon, L. Huraj and M. Čerňanský, "Performance Evaluations of IPTables Firewall Solutions under DDoS attacks," Journal of Applied Mathematics Statistics and Informatics (JAMSI), vol. 11, no. 2, pp. 35-45, 2015.
[15] A. Balobaid, W. Alawad and H. Aljasim, "A Study on the Impacts of DoS and DDoS Attacks on Cloud and Mitigation Techniques," in 2016 International Conference on Computing, Analytics and Security Trends (CAST), College of Engineering Pune, India. Dec 19-21, 2016, 2016.
[16] M. Y. Arafat, M. M. Alam and F. Ahmed, "A Realistic Approach and Mitigation Techniques for Amplifying DDOS Attack on DNS," in Proceedings of 10th Global Engineering, Science and Technology Conference, BIAM Foundation, Dhaka, Bangladesh, 2-3 January, 2015.
[17] K. Salah, K. Elbadawi and R. Boutaba, "Performance Modelling and Analysis of Network Firewalls," IEEE Transactions on Network and Service Management, vol. 9, no. 1, pp. 12-20, March 2012.
[18] T. Hayajneh, B. J. Mohd, A. Itradat and A. N. Quttoum, "Performance and Information Security Evaluation with Firewalls," International Journal of Security and Its Applications, vol. 7, no. 6, pp. 355-372, 2013.
[19] S. M. Aaqib, "To Analyze Performance, Scalability & Security Mechanisms of Apache Web Server Vis-a-vis with contemporary Web Servers," University of Jammu. Available: [http://hdl.handle.net/10603/65175], Jammu, 2014.
[20] S. Mishra, S. Sonavane and A. Gupta, "Study of Traffic Generation Tools," International Journal of Advanced Research in Computer and Communication Engineering, (IJARCCE) Vol. 4, Issue 6, June 2015.
[21] "BULK Email," BESI Marketing Solutions, [Online]. Available: http://www.bulkemailsmsindia.com/. [Accessed 12 December 2017].
[22] "Bulk Email service," Mail Marketer, [Online]. Available: http://mailmarketer.in/.
[23] R. J. Shimonski, D. L. Shinder, T. W. Shinder and A. C.-. Henmi, Best Damn Firewall Book Period, Syngress, ISBN: 1-931836-90-6, 2003.
[24] S. Sharma, Y. Verma and A. Nadda, “Information Security: Cyber Security Challenges,” International Journal of Scientific Research in Computer Science and Engineering, Vol.7, Issue.1, pp.10-15, February (2019)
[25] P. Santra, “An Expert Forensic Investigation System for Detecting Malicious Attacks and Identifying Attackers in Cloud Environment,” International Journal of Scientific Research in Network Security and Communication, Volume-6, Issue-5, October 2018.
Citation
Nikita Gandotra, Lalit Sen Sharma, "A novel framework for combating network attacks using Iptables," International Journal of Computer Sciences and Engineering, Vol.7, Issue.3, pp.226-237, 2019.
Optimal Power Flow Using Grass Hopper Optimization Algorithm for Generator Fuel Cost and Voltage Profile
Research Paper | Journal Paper
Vol.7 , Issue.3 , pp.238-241, Mar-2019
CrossRef-DOI: https://doi.org/10.26438/ijcse/v7i3.238241
Abstract
In this paper, optimal power flow (OPF) using grass hopper optimization algorithm (GOA) is addressed. OPF is a basic tool for economical and secure operation of power system. Here, the generator fuel cost and voltage profile are considered as main objectives with constraints. The GOA is a metaheuristic swarm based optimization algorithm. It mimics the natural behaviour of grass hopper. The GOA is implemented on IEEE-30 bus system to solve OPF problem. Results show the ability of GOA to reduce the voltage deviation. It demonstrates that the GOA is capable to improve the voltage profile of system buses.
Key-Words / Index Term
optimal power flow, grass hopper optimization algorithm, generator fuel cost and voltage profile, IEEE-30 bus system
References
[1] J. Carpentier, Contribution a l’etude du dispatching economique, Bull. Soc. Franc. Elec. 3 (1962) 431–447.
[2] Mohamed Ebeed, Salah Kamel and Francisco Jurado, Optimal Power Flow Using Recent Optimization Techniques, chapter 7, Classical and Recent Aspects of Power System Optimization, Academic Press (2018) 157-183.
[3] C.M chen, M.A.laughton ,”determination of optimum power system operating conditions under constraints” proceding the institution of power engineers.volume 116.No 2,pp.225-239, 1969.
[4] O alsac, B.stott, “optimal load flow with steady state security” IEEE PES summer meeting EHV/UHVconferenceVancouver,B.C.canadajuly pp.15- 20, 1973.
[5] H.H.Happ ”optimal power dispatch” ” IEEE PES summer meeting EHV/UHV conference Vancouver,B.C.canadajuly pp. 15-20,1973.
[6] David .I.sun,bruce member Ashley member,brian brewer member,arthuges senior member and William tinney fellow consutant, “optimal power flow by newton apporoch” IEEE trans power apparatus and system vol pas- 103 no.10 pp. 2864-2879,oct 1984.
[7] R.mota.palomino,member IEEE, V.H.Quintana,senior member IEEE” A penalty function- linear programing method for solving power system constrainted economic operation problems” ” IEEE trans power apparatus and system vol pas-103 no.6 oct 1984.
[8] Gerald F. Reid, Lawrence Hasdorff , “Economic Dispatch using Quadratic Programming”IEEE Trans. On power appar. And systems vol. pas -92 pp. 2015-2023 , September 13,1972
[9] K. Ponnambalamt, V.H. Quintana ,A. Vannelli , “a fast algorithm for powr system optimization problems using an interior point method” , Transactions on Power Systems, Vol. 7, No. 2,pp.748-759,May 1992
[10] James A. Momoh, S. X. Guo, E. C. Ogbuobiri, and R. Adapa , “the quadratic interior point method solving power system optimization problems” , IEEE Transactions on Power Systems, Vol. 9. No. 3,pp.261- 267, August 1994
[11] I S. Granville J.C.O. Mello A.C.G. Melo, “application of interior point methods to power fowunsolvability” , IEEE Transactions on Power System, Vol.11,No.2,pp. 1096-1103, May 1966
[12] Po- Hung Chen, Hong-Chan Chang, “Large-Scale EconomicDispatch by Genetic Algorithm” , IEEE Transaction on Power System , Vol.10, No.4, pp. 1919-1926,November 1995
[13] Anastasios G. Bakirtzis, Pandel N. Biskas, Christofors E. Zoumas, Vasilios Petridis, “Optimal Power Flow by Enhanced Genetic Algorithm ” ,IEEE Transaction on Power System ,Vol.17,No.2, pp. 229 -236,May 2002
[14] Chao-Lung Chiang, “Improved Genetic Algorithm for Power Economic Dispatch of Units with Valve-Point Effects and Multiple Fuels” , IEEE Transaction on Power System ,Vol 20, No.4, pp. 1690- 1699,November 2005
[15]B.Zhao,C.X.guo,Y.J.cao ”Improved partical swarm optimaization algorithm for OPF problem” IEEE, pp1-6,2004.
[16] L. L. Lai, T. Y. Nieh, D. Vujatovic, Y. N. Ma, Y. P. Lu, Y.W. Yang,H
[17] Braun “Particle Swarm Optimization for Economic Dispatch of units with Non-smooth Input-output Characteristic Functions” ISAP, pp. 499- 503,2005.
[18] F. R. Zaro M. A. Abido “Multi-Objective Particle Swarm Optimization for Optimal Power Flow in a Deregulated Environment of Power Systems” 978-1-4577-1676-8/11, 2011
[19] T. Niknam M.R. Narimani J. Aghaei R. Azizipanah-Abarghooee “Improved particle swarm optimisation for multi-objective optimal power flow considering the cost, loss, emission and voltage stability index” IET generation,Transmission and distribution vol 6,issue.6 pp. 515-527,2012
[20] C. Sumpavakup, I.Srikun and S.Chusanapiputt “A solution to optimal power flow using Artificial Bee Colony algorithm” International Conference on power system technology 978-1-4244-5940-7/10, 2010
[21]KursatAyan,Ulaskilic, Burhan Barakli “Chaotic artificial bee colony algorithm based solution of security and transient stability constrained optimal power flow” Electric power and energy system 64 pp.136- 147,2015
[22] Indrajit N. Trivedi, Pradeep Jangir,Siddharth A. Parmar andNarottamJangir “Optimal power flow with voltage stability improvement and loss reduction in power system using Moth-Flame Optimizer” Neural Computing & Applications, 2016
[23] Florin Capitanescu “Critical review of recent advances and further developments needed in AC optimal power flow” Electrical power system research Vol 136 pp 57-68 ,201
[24] D.H. Wolpert, W.G. Macready, No free lunch theorems for optimization, IEEE transactions on evolutionary computation, 1 (1997) 67-82.
[25] S. Saremi, S. Mirjalili, A. Lewis, Grasshopper optimisation algorithm: theory and application, Adv. Eng. Softw. 105 (2017) 30–47
[26] S.Z. Mirjalili, S. Mirjalili, S. Saremi, H. Faris, I. Aljarah, Grasshopper optimization algorithm for multi-objective optimization problems, Appl. Intell. (2017) 1–16
Citation
A.I. Modi, T.V. Rabari, "Optimal Power Flow Using Grass Hopper Optimization Algorithm for Generator Fuel Cost and Voltage Profile," International Journal of Computer Sciences and Engineering, Vol.7, Issue.3, pp.238-241, 2019.
Rotation Invariant ZLBP Features for Copy-Move-Rotation Based Image Forgery Detection System
Research Paper | Journal Paper
Vol.7 , Issue.3 , pp.242-247, Mar-2019
CrossRef-DOI: https://doi.org/10.26438/ijcse/v7i3.242247
Abstract
In this paper, an effective method for copy-move-rotation forgery detection is proposed which uses Zernike moments and local binary pattern (LBP) as feature extractors. First image is divided into overlapped blocks in which Zernike moments are calculated by rotating block pixels into different directions. Then rotated block with minimum value of Zernike moments is evaluated for which LBP features are extracted. Similar procedure is followed for all blocks. For matching process, mean value of block pixels is used after sorting them in an array. For similar mean value blocks, matching process is carried out by taking the variance difference of LBP features. Blocks with similar variance values are marked as forged pixels in the image. For decreasing the time complexity, edge detector is used which gives edge binary image for high gradient pixels in the image. First matching is carried out for edge pixel blocks only. In post processing, morphological operations are used and matching procedure is followed to get the forged pixels in the image. Experiment results are carried out on a standard dataset in which detection accuracy (DA) and false positive rate (FPR) are used for performance evaluation.
Key-Words / Index Term
forgery detection, Rotation invariant, LBP, Zernike moments etc
References
[1] I. Amerini, L. Ballan, R.Caldelli, A. D. Bimbo, L.D. Tongo, G.Serra, “Copy-move forgery detection and localization by means of robust clustering with J-Linkage”, Signal Processing: Image Communication, Vol. 28, Issue. 6, pp.659-669, 2013
[2] R. Dixit, R. Naskar and A. Sahoo, "Copy-move forgery detection exploiting statistical image features," International Conference on Wireless Communications, Signal Processing and Networking (WiSPNET), Chennai, pp. 2277-2281, 2017
[3] D. Cozzolino , G. Poggi , L. Verdoliva, “Efficient dense-field copy–move forgery detection”, IEEE Transactions on Information Forensics and Security, vol. 10, issue 11, pp. 2284-2297, 2015
[4] D. Tralic, I. Zupancic, S. Grgic, and M. Grgic, “CoMoFoD-New database for copy–move forgery detection,” 55th IEEE International Symposium ELMAR, 2013.
[5] N. Warif, A.Wahab, M. Idris, R.Ramli, R.Salleh, S.Shamshirband, K. Choo, "Copy-move forgery detection: Survey, challenges and future directions" Journal of Network and Computer Applications, Vol. 75, pp.259-278, 2016
[6] D. Chauhan, D. Kasat, S. Jain, V. Thakare, “Survey on Keypoint Based Copy-move Forgery Detection Methods on Image”, Procedia Computer Science, Vol. 85, pp. 206-212, 2016
[7] X. Bi, C. M. Pun “Fast reflective offset-guided searching method for copy-move forgery detection” Information Sciences, Vol. 418–419, pp. 531-545, 2017
[8] S. M. Fadl, N. A. Semary, “Robust Copy–Move forgery revealing in digital images using polar coordinate system”, Neuro computing, Vol. 265, pp. 57-65, 2017
[9] A. Kuznetsov, V. Myasnikov, “A new copy-move forgery detection algorithm using image preprocessing procedure”, Procedia Engineering, Vol. 201, pp. 436-444, 2017
[10] D. Vaishnavi, T.S. Subashini, “Application of local invariant symmetry features to detect and localize image copy move forgeries”, Journal of Information Security and Applications, Vol. 44, pp. 23-3, 2019
[11] Z. Xie, W. Lu, X. Liu, Y. Xue, Y. Yeung, “Copy-move detection of digital audio based on multi-feature decision”, Journal of Information Security and Applications, Vol. 43, pp. 37-46, 2018
[12] H. A. Alberry, A. A. Hegazy, G. I. Salama, “A fast SIFT based method for copy move forgery detection”, Future Computing and Informatics Journal, Vol. 3, Issue 2, pp. 159-165, 2018
[13] P. M. Raju, M. S. Nair, “Copy-move forgery detection using binary discriminant features”, Journal of King Saud University - Computer and Information Sciences, 2018
[14] J. Yang, P. Ran, D. Xiao, and J. Tan, “Digital image forgery forensics by using undecimated dyadic wavelet transform and Zernike moments”, Journal of Computational Information Systems, vol. 9,Issue 16, 2008.
[15] Suma S L, Sarika Raga, "Real Time Face Recognition of Human Faces by using LBPH and Viola Jones AlgorithmReal Time Face Recognition of Human Faces by using LBPH and Viola Jones Algorithm", International Journal of Scientific Research in Computer Science and Engineering, Vol.6, Issue.5, pp.6-10, 2018
[16] Amey Samant, Sushma Kadge, "Classification of a Retinal Disease based on Different Supervised Learning Techniques", International Journal of Scientific Research in Network Security and Communication, Vol.5, Issue.3, pp.9-13, 2017
Citation
Gurpreet Kaur, Rajan Manro, "Rotation Invariant ZLBP Features for Copy-Move-Rotation Based Image Forgery Detection System," International Journal of Computer Sciences and Engineering, Vol.7, Issue.3, pp.242-247, 2019.
Application of Image Processing and Data Mining Techniques for Traffic Density Estimation and Prediction
Research Paper | Journal Paper
Vol.7 , Issue.3 , pp.248-253, Mar-2019
CrossRef-DOI: https://doi.org/10.26438/ijcse/v7i3.248253
Abstract
Most of the common problems encounter by the today’s world is traffic congestion. As populations as well as number of vehicles are increasing in the cities and towns, traffic congestion has become a major problem for the time being. Delays, fuel consumption and air pollutions are some of the problems arise from traffic congestion. There are many reasons for traffic congestion like narrow roads, lack of alternate route, slow traffic speed, improper uses of traffic signals etc. In this paper, we proposed a system to overcome some these problems by providing an alternate route for the vehicles by predicting a possible congestion ahead of that road.
Key-Words / Index Term
Traffic congestion, Traffic density, vehicle count, vehicle speed, background subtraction, frame, Artificial neural network (ANN), Epoch
References
[1] Jithin Raj, Hareesh Bahuleyan, Lelitha Devi Vanajakshi, “Application of Data Mining Techniques for Traffic Density Estimation and Prediction” ,Transportation Research Procedia,Volume 17, 2016,Pages 321-330,ISSN 2352-1465, https://doi.org/10.1016/j.trpro.2016.11.102.
[2] S. S. Harsha, Ch. Sandeep, “Real Time Traffic Density and Vehicle Count Using Image Processing Techniques”. International Journal of Research in Computer and Communication Technology. Vol 4, Issue 8 , 2015, pages 594-598
[3] P. Niksaz, “Automatic Traffic Estimation Using Image Processing”. International Journal of Signal Processing, Image Processing and Pattern Recognition. Vol. 5, No. 4 ,2012
[4] A. Janrao, M. Gupta, D. Chandwanni, U. A. Joglekar. “ Real Time Traffic Density Count Using Image Processing”. International Journal of Computer Application., Volume 162 – No 10 , 2017
[5] XuLuhang, “The Research of Data Mining in Traffic Flow Data”. International Journal of Database Theory and Application, 2015, Vol.8, No.4, pp.19-30, http://dx.doi.org/10.14257/ijdta.2015.8.4.03
[6] Yong, Xi & Zhang, Liwei & Song, Zhangjun & Hu, Ying & Zheng, Lan & Zhang, Jianwei, “Real-time vehicle detection based on Haar features and Pairwise Geometrical Histograms”, International Conference on Information and Automation Shenzhen, China June 2011, 10.1109/ICINFA.2011.5949023.
[7] R. A. B. O. K. Rahmat, K.B. Jumari, “Vehicle Detection Using Image Processing for Traffic Control and Surveillance System”. University Kebangsaan, Malaysia,2015
[8] S. Kumar, D. Toshniwal, “A Data Mining Framework to Analyze Road Accident Data” . Journal of Big Data, vol:2,no:1 ISSN:2196-1115, DOI: 10.1186/s40537-015-0035-y.
[9] Ray R. Venkataraman, Jeffrey K. Pinto, “Operations Management: Managing global supply chains”,Second Edition, Thousand Oaks: SAGE publications, 2019
[10] Xu J., Yin W., Huang Z,“A Study of Multi-agent Based Metropolitan Demand Responsive Transport Systems”. In: Wang H., Shen Y., Huang T., Zeng Z. (eds) The Sixth International Symposium on Neural Networks. Advances in Intelligent and Soft Computing, vol 56. Springer, Berlin, Heidelberg, 2009
[11] de Myttenaere, B Golden, B Le Grand, F Rossi (2015). "Mean absolute percentage error for regression models", Neurocomputing, 2016
[12] Boya Akhila,Burgubai Jyothi, "Face Identification through Learned Image High Feature Video Frame Works",International Journal of Scientific Research in Computer Science and Engineering,Vol.6, Issue.4, pp.24-29, 2018
Citation
Mirzanur Rahman, Surojit Dey, "Application of Image Processing and Data Mining Techniques for Traffic Density Estimation and Prediction," International Journal of Computer Sciences and Engineering, Vol.7, Issue.3, pp.248-253, 2019.
Trust Analysis Techniques in Online Social Networks: A Review
Review Paper | Journal Paper
Vol.7 , Issue.3 , pp.254-258, Mar-2019
CrossRef-DOI: https://doi.org/10.26438/ijcse/v7i3.254258
Abstract
Online social network (OSN) has become an important aspect of everyone’s life. Social networking involves connecting users with their friends, relatives, family and companions. This is internet and development of other social media technologies which allow people to communicate through social media. The very well-known social sites such as Skype, Facebook, Twitter, Instagram and LinkedIn etc. enable their users for performing various activities like sharing photos, videos and information, organize events, chat, and playing online games. In this paper, a comparison study is done on various existing trust analysis techniques which will help to identify the problems need to be focused.
Key-Words / Index Term
Online Social Networks, Trust analysis, Privacy
References
[1] Sunil Sexena, “http://www.easymedia.in/8-key-characteristics-social-networking-sites”, December, 2013.
[2] Wanita Sherchan, Surya Nepal, Cecile Paris, “ A survey on Trust in Scoial Network” in ACM Computing Surveys, Vol. 45, no. 4, pp. 47:1-47:33 August 2013.
[3] Si Shi, Dawei Jin, “Real-time Public Mood Tracking of Chinese Microblog Streams with Complex Event Processing”, in Institute of Electrical and Electronics Engineers, Vol. 5, no. 2, pp. 421-431, December 2016.
[4] Liang, Biru Dai, “Opinion Mining on Social Media Data” in International Conference of Mobile Data Management, Institute of Electrical and Electronics Engineers, Vol. 2, no. 14 , pp. 91-96, July 2013.
[5] Poornima Singh , “Opinion Mining on Social Media: Based on Unstructured Data” in International Journal of Computer Science and Mobile Computing, Vol. 4, no. 6, pp. 768-777, June 2015.
[6] Xiu li, Jiangou MA, “A Service Mode of Expert Finding in Social Network” in IEEE Control System Society, IEEE Xlpore, http://ieeexplore.ieee.org/document/6519794, pp. 220 – 223, May 2013.
[7] DimahH. Alahmadi, Xiao-JunZeng, “ ISTS: Implicit Social Trust and Sentiment based approach to recommender system” in ScienceDirect Expert Systems With Applications, Vol. 42, No. 10, pp. 8840–8849, 2015.
[8] DimahH.Alahmadi, Xiao-JunZeng, “Improving Recommendation Using Trust and Sentiment Inference from OSNs” in International Journal of Knowledge Engineering, Vol. 1, No. 1, pp. 9-17, June 2015.
[9] Golbeck, “ Computing and Applying Trust in Web-based Social Networks ”, http://drum.lib.umd.edu/bitstream/handle/1903/2384/umi-umd-2244.pdf;sequence=1, 2005.
[10] Avesani, Massa, “A trust-aware recommender system for ski mountaineering” in International Journal for Infonomics, Vol 20, no. 35, pp. 1-10, August 2005.
[11] Omar Hasan, Lionel Brunie, Jean-Marc Pierson, “Evaluation of the Iterative Multiplication Strategy”, in International Conference on Protecton and Security, ACM, Vol 4. no. 6, July 13–17, 2009.
[12] Partha Sarathi Chakraborty, Sunil Karform, “Designing Trust Propagation Algorithms based on Simple Multiplicative Strategy for Social Networks” in Procedia Technology, Vol. 6, no. 1, pp. 534-539, 2012.
[13] Y.A. Kim, H.S. Song, “Strategies for predicting local trust based on trust propagation in Online social networks” in International Journal of Computer Applications, Vol. 156, no. 7, pp. 8-15, December 2016.
[14] Mohsen Taherian, Morteza Amini, Rasool Jalili, “Trust inference in web-based social networks using resistive networks” in International Conference on Internet and Web Applications and Services, http://ieeexplore.ieee.org/document/4545620, pp. 233-238, June 2008.
[15] Wenjun Jiang and Guojun Wang, “ SWTrust: Generating trusted graph for trust evaluation in online social networks”, in IEEE Xplore, http://ieeexplore.ieee.org/document/6120835, pp. 320–327, November 2011.
[16] Sana Hamdi, Gancarski, “TISON: Trust Inference In Trust-Oriented Social Networks” in ACM Transactions on Information Systems, Vol. 34, no. 3, pp. 17:1- 17:32, March 2016.
[17] Guanfeng Liu, YanWang, “Trust Transitivity in Complex Social Networks” in Association for the Advnacemnet of Artificial Intelligence, Vol. 11, no. 15, pp. 1222-1229, January 2011.
[18] Wenjun Jiang, JieWu, GuojunWang, “Trust Evaluation in Online Social Networks Using Generalized Network Flow”, in International Conference of Transactions on computers, IEEE Xplore, Vol. 65, no. 3, pp. 952-963, March 2016.
[19] W.Fan, K.H. Yeung, “Incorporating Profile Information In Community Detection For Online Social Networks” in ScienceDirect, Vol. 405, no. 1, pp. 226–234, July 2014.
[20] Francesco Bonchi, “Influence Propagation in Social Networks: A Data Mining Perspective”, in Institute of Electrical and Electronics Engineers, Vol. 12, no.1, pp. 8-16, December 2011.
[21] D. Liben-Nowell and J. Kleinberg, “The link prediction problem for social networks” in Association for Information Science and Technology, Vol. 58, no. 7, pp. 1019-1031, May 2007.
Citation
Mohit Gambhir, Sapna Gambhir, "Trust Analysis Techniques in Online Social Networks: A Review," International Journal of Computer Sciences and Engineering, Vol.7, Issue.3, pp.254-258, 2019.