International Journal of Mathematical Sciences and Computing (IJMSC)
IJMSC Vol. 7, No. 3, 8 Aug. 2021
Cover page and Table of Contents: PDF (size: 468KB)
Development of an Effective Method of Data Collection for Advertising and Marketing on the Internet
Full Text (PDF, 468KB), PP.1-11
Views: 0 Downloads: 0
Author(s)
Index Terms
Internet advertising, advertising effectiveness, effectiveness indicators, effective data collection.
Abstract
The Internet advertising has more capabilities than other advertising tools. Taking into consideration the broad spectrum of the Internet, the study of the effectiveness indicators of the Internet advertising and the identification of problems in this field are considered to be topical issues. The article analyzes the key effectiveness indicators (KEA) to evaluate the effectiveness of the Internet advertising. Moreover, proposals for the effective use of advertising and marketing systems are also provided. Reducing the number of indicators to simplify the effective collection and analysis of the effectiveness indicators of Internet advertising can be promising. In this regard, some statistical and spectral operations are performed on the efficiency values, and effectiveness signs vector is determined. The Euclidean distance between these vectors is seen as the closeness between the two performance measures. The difference from other methods lies in the collection and distribution in the storage area, the distribution of data by the subsystem in the appropriate analysis systems. The processed information consists of numerical, temporary, logical and text data. The article uses a systematic approach and methodology for the scientific analysis of problems and ways to solve them, as well as for summing up.
Cite This Paper
Hashimova Kamala," Development of an Effective Method of Data Collection for Advertising and Marketing on the Internet ", International Journal of Mathematical Sciences and Computing(IJMSC), Vol.7, No.3, pp. 1-11, 2021. DOI: 10.5815/ijmsc.2021.03.01
Reference
[1]Ahmed, Y. and Hassan, M., ‘A genetic algorithm to solve the minimum-cost paths tree problem’, In International Journal of Computer Networks & Communications (IJCNC,), Vol.7, No.4, 2015, pp 75-85.
[2]Ahmed,Y., ‘A genetic algorithm for finding the K shortest paths in a network’, In Egyptians informatics Journal Vol. 11, 2010, pp 75-79.
[3]Bhasin, H., and Gupta, N., ‘Critical Path Problem for Scheduling using Genetic Algorithm’,In Conference proceedings on Advances in Intelligent system and Computing, Springer Nature Singapore Pte Ltd., 2018, pp 15-25.
[4]Cheng,H., and Yang, S. ‘Genetic Algorithms with Elitism-based Immigrants for Dynamic Shortest Path Problem in Mobile AdHoc Networks’, In IEEE Congress on Evolutionary Computation, 2009, pp 3135-3145.
[5]Chowdhury,S., Das,S., and Das,A., ‘Application of Genetic Algorithm in Communication Network Security’, In International Journal of Innovative Research in Computer and Communication Engineering, Vol. 3, No. 1, 2015, pp 274-280.
[6]Hashimova K The role of Big Data in Internet advertising problem solution 2016 Inter J of Education and Management Engineering 4:10-20
[7]Hadiyati E Study of marketing mix and aida model to purchasing on line product in indonesia 2016 British J of Marketing Studies 4(7):49-62
[8]Bohdan P, Gabi S The Effectiveness of Online Advertising: Consumer’s Perceptions of Ads on Facebook, Twitter and YouTube 2014 J of Applied Business and Economics 16(4):70-81
[9]Borisova O, Martynova A, Comparing the Effectiveness of Outdoor Advertising with Internet Advertising 2017 Case Study: Inetcom Company 85 p.
[10]Hashimova K Application Of Sentiment Analysis Technologies To Increase The Effectiveness Of Advertising-Marketing On Internet,
[11]Hashimova K K, Analysis Method of Internet Advertising-Marketing Information’s Dynamic Changes 2017 International Journal of Information Engineering and Electronic Business vol.9, No.5, pp. 28-33
[12]Papagelis M, Plexousakis D Qualitative analysis of user-based and item-based prediction algorithms for recommendation agents 2005 Int J Eng Appl Artif Intell, 18(4) pp.781-789
[13]Singh R., Rani A. A Survey on the Generation of Recommender Systems 2017 International Journal of Information Engineering and Electronic Business vol. 9, no.3, pp. 26–35
[14]Zhengbing Hu, Bodyanskiy Y, Tyshchenko O, Tkachov V 2017 Fuzzy Clustering Data Arrays with Omitted Observations, Inter J of Intelligent Systems and Applications 9(6):24-32
[15]Abdrakhmanova G, Vishnevsky L, Volkova G, Gohberg L Indicators of the digital economy: statistical collection 2018, M.: 268
[16]Fadil, Y. ‘Routing using Genetic Algorithm for Large Networks’, In Diyala Journal of Engineering Sciences, Vol. 3, 2010, pp53-70.
[17]Fall, K. and Varadhan, K. ‘The ns Manual: The VINT Project between researchers at UC Berkeley, LBL, USC/ISI, and Xerox PARC’, 2011, pp 1-434.
[18]Ghazal, M., Sayed, A., and Kelash, H., ‘Routing Optimization using Genetic Algorithm in Ad Hoc Networks’, In IEEE Int. Symposium on Signal Processing and Information Technology, 2007, pp 497-503.
[19]Gonen, B., and Yuksel, Y., ‘Genetic Algorithm Finding the Shortest Path in Networks’, In International Conference on Genetic and Evolutionary Methods in Deptt. Of CSE, University of Nevada, Reno,USA,2011, pp 63-73.
[20]Greg, S., Marie, J.,and Sandra, U., ‘Adaptations of k-shortest path algorithms for transportation networks’, In Industrial Engineering and Systems Management International Conference, 2015, pp 21-23.
[21]Heidari, A., and Delavar, M., ‘A modified Genetic Algorithm for finding fuzzy shortest paths in uncertain Networks’, In the International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences, Vol. XLI-B2, XXIII ISPRS Congress, , Prague, Czech Republic, 2016, pp 12–19.
[22]Huiping, L, Cheqing J, and Bin, Y, ‘Finding Top-k Shortest Paths with Diversity, In IEEE Transactions on Knowledge and Data Engineering’, Vol. 30, Issue: 3, 2018, pp 3-14.
[23]Jang, P., Quan, C., and Yeh, C., ‘Efficient unicast routing algorithms in Software- Defined Networking’, In European Conference on Networks and Communication, 2016, pp 27- 30.
[24]Jianyuan, G and Limin. J, ‘A new algorithm for finding the K shortest paths in a time-schedule network with constraints on arcs’, In Journal of Algorithms and Computational Technology,Vol.11, Issue 2, 2017, pp 70-77.
[25]Kairanbay, M.,and Hajar, M., ‘A Review and Evaluations of Shortest Path Algorithms’, In International Journal of Scientific & Technology Research, Vol. 2, Issue 6, 2013, pp 99-104.
[26]Kavitha S. and Nair T., ‘A Comparative Analysis for Determining the Optimal Path using PSO and GA’, In International Journal of Computer Applications (0975-8887) Vol. 32, No.4, 2011, pp 8-12.
[27]Keivan, B., and Vahid, H., ‘An improved genetic algorithm with a local optimization strategy and an extra mutation level for solving traveling salesman problem’, In International Journal of Computer Science, Engineering and Information Technology (IJCSEIT), Vol. 4, Issue 4, 2014, pp 47-53.
[28]Kini, S., Ramasubramanian, S., Kvalbein, A. and Hansen, A., ‘Fast Recovery from Dual-Link Failures in IP Networks’, In Proceedings of IEEE International Conference on Computer Communications (INFOCOM), Rio de Janeiro, Brazil, 2009, pp 1368–1376.
[29]Kumar, N., Misra, S., Obaidat, M., ‘Collaborative Learning Automata-Based Routing for Rescue Operations in Dense Urban Regions Using Vehicular Sensor Networks’, In IEEE Systems Journal, DOI: 10.1109/JSYST.2014 22335451, 2014, pp 1081-1090.
[30]Agarwal, U., and Gupta, V., ‘Network Routing Algorithm using Genetic Algorithm and Compare with Route Guidance Algorithm’, In International Journal of Scientific Research Engineering and Technology, Conference proceedings IEERET, , 2014, pp 92-96.
[31]Kumar, R. and Kumar, M. ‘Exploring GA for Shortest Path Optimization in Data Networks’, In Global Journal of Computer Science and Technology, Vol 10, No. 11, 2010, pp 8-13.
[32]Kumari, S. and Geethanjali, N., ‘A Survey on Shortest Path Routing Algorithms for Public Transport Travel”, In Global Journal of Computer Science and Technology, Vol. 9 Issue 5 ,Ver 5., 2016, pp 73-77.
[33]Misra, S., ‘An Adaptive Online Routing Algorithm for MPLS Traffic Engineering’, In Proceedings of the 3rd International Conference for Upcoming Engineers (ICUE2004), IEEE Toronto, Ontario, 2004,pp 959-976.
[34]Misra, S., and Oommen, B., ‘Adaptive Algorithms for Network Routing and Traffic Engineering’, In Proceedings of the 19th National Conference on Artificial Intelligence,SanJose,California,USA, 2004.
[35]Misra, S., and Rajesh, G., ‘Bird Flight-Inspired Routing Protocol for Mobile Ad Hoc Networks’, In ACM Transactions on Autonomous and Adaptive Systems, Vol. 6, No. 4, 2011, pp 843-852.
[36]Misra, S., Ghosh, T., Obaidat, M., ‘Routing Bandwidth Guaranteed Paths for Traffic Engineering in WiMAX Mesh Networks’, In International Journal of Communication Systems(Wiley),Vol.27, No.11, 2012, pp. 2964-2984.
[37]Misra,S., Krishna, P., Bhiwal, A., Chawla, A., Wolfinger, B., Lee, C., ‘A Learning Automata-Based Fault-Tolerant Routing Algorithm for Mobile Ad Hoc Networks’, In the Journal of Supercomputing (Springer), Vol. 62, No. 1, 2012, pp. 4-23.
[38]Moza, M., and Kumar, S., , 2018, ‘Routing in networks using genetic algorithm’, In International Journal of Communication Networks and Distributed Systems, Vol. 20, No. 3, 2018, pp. 291-311.
[39]Obeidat, A .F. and Alshalabi, M. E., ‘Improving the Performance of the Networks Using Genetic Algorithm’, In Proceedings of the International Conference on Advances in Computer and Information Technology, 2012, pp 33-37.
[40]Qingson, W., Ren, C., Lifeng, N., and Yinglong, X.,‘ Finding Top K Shortest Simple Paths with Improved Space Efficiency’, In ACM, Vol 9, Issue 5, 2017, pp 1-6.
[41]Reza, Roshani., and Mohammad, K., ‘Parallel Genetic Algorithm for Shortest Path Routing Problem with Collaborative Neighbors’,In Ciência eNatura, Vol. 3,Issue 2 , 2015, pp. 328−333.
[42]Sonam, J., and Sandeep, S., ‘The Application of Genetic Algorithm in the Design of Routing Protocols in MANETs: A Survey’, In International Journal of Computer Science and Information Technologies, Vol. 3, No. 3, 2012, pp 4318 – 4321.
[43]Theodoros, C., and Panagiotis, B., ‘Exact and Approximate Algorithms for Finding k-Shortest Paths with Limited Overlap’, In 20th International Conference on Extending Database Technology (EDBT), Venice, Italy, 2017, pp 414-425.
[44]Umit, A., Ismail, R., Cevdet, G., Beyza, Y., and Ilhami, M., ‘An Idea for Finding the Shortest Driving Time Using Genetic Algorithm Based Routing Approach on Mobile Devices’, In International Journal of Mathematics and Computers in Simulation, Vol. 6 , Issue 1, 2012, pp 9-16.
[45]Yang,S., Cheng, H., and Wang,F., ‘Genetic Algorithms With Immigrants and Memory Schemes for Dynamic Shortest Path Routing Problems in Mobile Ad Hoc Network’, In IEEE transaction on System, Man, and Cybernetics-Part C: Application and Reviews, Vol 40, No. 1, 2010, pp 52-63.
[46]Yusof, R., Khairuddin, U., and Khalid, M., ‘A New Mutation Operation for Faster Convergence in Genetic Algorithm Feature Selection’,In International Journal of Innovative Computing, Information and Control, Vol. 18, No. 10, 2012, pp 7363-7380.