A Soft Computing Approach for Targeted Product Promotion on Social Networks

  • Monika Bajaj
  • Shikha Mehta
  • Hema Banati
Part of the Studies in Computational Intelligence book series (SCI, volume 611)


Soft computing techniques such as nature-inspired algorithms have always been a great source of inspiration for researchers in developing intelligent systems. One of the prominent nature inspired algorithms is firefly algorithm. The algorithm simulates the attraction approach of real fireflies where each firefly has specific agenda and coordinates with other fireflies in the group (swarm) to achieve the same. The presented work employs this attraction mechanism of firefly algorithm for product promotion at global scale through social networking sites. The algorithm is strategically employed to capture the user interest toward product features and explore the social network of prospective consumers to identify the best initial seeds for efficient product promotion. The strategy is divided into three phases. In the first phase, the market analysis phase, the often changing market demands for a product feature and user preferences for the same are captured. Based on these preferences users are grouped into homogeneous segments in the second phase, i.e., market segmentation. Thereafter, for targeted product promotion the most potential segment(s) with respect to the product to be promoted is selected in the third phase, i.e., targeted product promotion. Experimental studies are conducted to evaluate the performance of each phase individually and subsequently overall strategy is evaluated on epinion dataset. The results reveal the supremacy of firefly algorithm-based approach over other algorithms and substantiate the potential of presented plan to target wide and right range of audience by employing small fraction of advertising budget.


Soft computing Evolutionary algorithms Social networking Opinion mining Online product promotion Targeted e-marketing 


  1. 1.
    Zadeh LA (1965) Fuzzy sets. J Inf Control 8(3):338–353CrossRefMathSciNetMATHGoogle Scholar
  2. 2.
    Hopfield JJ, Tank DW (1985) Neural computation of decisions in optimization problems. J Biol Cybern 52(3):141–152MathSciNetMATHGoogle Scholar
  3. 3.
    Bandyopadhyay S, Murthy CA, Pal SK (1999) Theoretic performance of genetic pattern classifier. J Franklin Inst 336:387–422CrossRefMathSciNetMATHGoogle Scholar
  4. 4.
    Dasgupta D, Michalewicz Z (1997) Evolutionary algorithms in engineering applications. Springer Science & Business Media, pp 1–557Google Scholar
  5. 5.
    Mehta S (2013) Bio-inspired approach to solve chemical equations. In: Proceedings of international conference on contemporary computing, pp 461–466Google Scholar
  6. 6.
    Zhang J, Lo WL, Chung H (2006) Pseudocoevolutionary genetic algorithms for power electronic circuits optimization. IEEE Trans Syst Man Cybern Part C 36(4):590–598CrossRefGoogle Scholar
  7. 7.
    Bandyopadhyay S, Murthy CA, Pal SK (1995) Pattern classification with genetic algorithms. Pattern Recogn Lett 16:801–808CrossRefGoogle Scholar
  8. 8.
    Hurley S, Moutinho L, Stephens NM (1995) Solving marketing optimization problems using genetic algorithms. Eur J Mark 29(4):39–56CrossRefGoogle Scholar
  9. 9.
    Potvina JY, Sorianoa P, Maxime V (2004) Generating trading rules on the stock markets with genetic programming. Comput Oper Res 31:1033–1047CrossRefGoogle Scholar
  10. 10.
    Fuchs MM (2000) An evolutionary approach to support web page design. In: Proceedings of congress on evolutionary computation, pp 1312–1319Google Scholar
  11. 11.
    Cutler M, Deng H, Maniccam SS, Meng W (1999) A new study on using HTML structures to improve retrieval. In: Proceedings of 11th IEEE international conference on tools with artificial intelligence, pp 406–409Google Scholar
  12. 12.
    Salton G, Buckley C (1998) Term-weighting approaches in automatic text retrieval. J Inf Proc Manage 24:513–523CrossRefGoogle Scholar
  13. 13.
    Atsumi M (1997) Extraction of user’s interests from web pages based on genetic algorithm. English version of the original Japanese paper published in IPSJ SIG notes (information processing society of Japan, the special interest groups notes), vol 97, no. 51, pp 13–18Google Scholar
  14. 14.
    Morgan JJ, Kilgour AC (1996) Personalising on-line information retrieval support with a genetic algorithm. In: Proceedings of PolyModel 16: applications of artificial intelligence, pp 142–149Google Scholar
  15. 15.
    Akkermans H (2001) Intelligent E-business: from technology to value. In: Guest Editor’s Introduction. IEEE intelligent systems, July/August 2001, pp 8–10Google Scholar
  16. 16.
    Kaplan AM, Haenlein M (2010) Users of the world, unite! The challenges and opportunities of social media. Bus Horiz 53(1):59–68CrossRefGoogle Scholar
  17. 17.
    Kietzmann JH, Hermkens K et al (2011) Social media? Get serious! Understanding the functional building blocks of social media. Bus Horiz 54(3):241–251CrossRefGoogle Scholar
  18. 18.
    Yu Z, Zhaoqing W, Chaolun X (2010) Identifying key users for targeted marketing by mining online social network. In: Proceedings of 24th international conference on advanced information networking and applications workshops (WAINA), pp 644–649Google Scholar
  19. 19.
    Pritam G, Huan L (2012) Mining social media: a brief introduction. In: Tutorials in operation research, INFORMS, pp 1–17Google Scholar
  20. 20.
    Domingos P, Richardson M (2001) Mining the network value of customers. In: Proceedings of knowledge discovery and data mining, pp 57–66Google Scholar
  21. 21.
    Domingos P, Richardson M (2002) Mining knowledge-sharing sites for viral marketing. In: Proceedings of the eight ACM SIGKDD international conference on knowledge discovery and data mining, pp 61–70Google Scholar
  22. 22.
    Kempe D, Kleinberg J, Tardos E (2003) Maximizing the spread of influence through a social network. In: Proceedings of knowledge discovery and data mining, pp 137–146Google Scholar
  23. 23.
    Fowler JH, Christakis NA (2008) Dynamic spread of happiness in a large social network: longitudinal analysis over 20 years in the framingham heart study. Br Med J 337(768):1–23Google Scholar
  24. 24.
    Datta P, Chowdhury D, Chakraborty B (2005) Viral marketing: new form of word of mouth through internet. Bus Rev Cambridge 3(2):69–75Google Scholar
  25. 25.
    Breazele M (2009) Word of mouse—an assessment of electronic word-of-mouth research. Int J Market Res 51(3):297–318CrossRefGoogle Scholar
  26. 26.
    Jensen R, Shen Q (2003) Finding rough set reducts with ant colony optimization. In: Proceedings of 6th annual UK workshop on computational intelligence, pp 15–22Google Scholar
  27. 27.
    Suguna N, Thanuskodi K (2010) A novel rough set reduct algorithm for medical domain based on bee colony optimization. J Comput 2(6). ISSN:2151-9617Google Scholar
  28. 28.
    Yue B et al (2007) A new rough set reduct algorithm based on particle swarm optimization. In: Proceedings of IWINAC, Part I, LNCS, vol. 4527, pp 397–406Google Scholar
  29. 29.
    Bandyopadhyay S, Maulik U (2002) An evolutionary technique based on k-means algorithm for optimal clustering. J Inform Sci 146:221–237CrossRefMathSciNetMATHGoogle Scholar
  30. 30.
    Bandyopadhyay S, Maulik U (2002) Genetic clustering for automatic evolution of clusters and application to image classification. Pattern Recogn 35:1197–1208CrossRefMATHGoogle Scholar
  31. 31.
    Yang XS (2008) Nature inspired metaheuristic algorithms. Luniver Press, BeckingtonGoogle Scholar
  32. 32.
    Banati H, Bajaj M (2012) Promoting products online using firefly algorithm. In: Proceedings of 12th international conference on intelligent system design and applications (ISDA), November 27–29, 2012, India, pp 580–585Google Scholar
  33. 33.
    NLProcessor–TextAnalysisToolkit (2000).
  34. 34.
    Banati H, Bajaj M (2011b) Dynamic user profile generation by mining user opinion. In: Proceedings of 3rd international conference on computer engineering and technology (ICCET-11), June 17–19, 2011, Malaysia, pp 540–545Google Scholar
  35. 35.
    Dash M, Liu H (1997) Feature selection for classification. J Intell Data Anal 1(3):131–156CrossRefGoogle Scholar
  36. 36.
    Devijver PA, Kittler J (1982) Pattern recognition: a statistical approach. Prentice Hall, UKMATHGoogle Scholar
  37. 37.
    Pawlak Z (1982) Rough sets. Int J Comput Inform Sci 11:341–356CrossRefMathSciNetMATHGoogle Scholar
  38. 38.
    Pawlak Z (1991) Rough sets: theoretical aspects of reasoning about data. Kluwer Academic PublishersGoogle Scholar
  39. 39.
    Pawlak Z (1993) Rough sets: present state and the future. Found Comput Decis Sci 18:157–166MathSciNetMATHGoogle Scholar
  40. 40.
    Pawlak Z (2002) Rough Sets and Intelligent Data Analysis. J Inform Sci 147:1–12CrossRefMathSciNetMATHGoogle Scholar
  41. 41.
    Chouchoulas A, Shen Q (2001) Rough set-aided keyword reduction for text categorization. Appl Artif Intell 15(9):843–873CrossRefGoogle Scholar
  42. 42.
    Jensen R, Shen Q (2001) A rough set-aided system for sorting WWW bookmarks. In: Zhong N et al (eds) Web intelligence: research and development. pp 95–105Google Scholar
  43. 43.
    Liu H, Abraham A, Li Y (2009) Nature inspired population-based heuristics for rough set reduction, rough set theory, SCI, vol. 174. Springer, pp 261–278Google Scholar
  44. 44.
    Banati H, Bajaj M (2011a) Firefly based feature selection approach. Int J Comput Sci Issues (IJCSI) 8(4/2):473–480Google Scholar
  45. 45.
    Morita M Shinoda Y (1994) Information filtering based on user behavior analysis and best match text retrieval. In: Proceedings of the 17th annual International ACM SIGIR conference, pp 272–281Google Scholar
  46. 46.
    Banati H, Bajaj M (2009) Feature based implicit user modeling. In: Proceedings of 4th Indian international conference on artificial intelligence (IICAI-09), December 16–18, 2009, India, pp 1077–1084Google Scholar
  47. 47.
    Aaker DA (2001) Strategic market management. Wiley, New YorkGoogle Scholar
  48. 48.
    Andrade RD (1978) U-statistic hierarchical clustering. Psychometrika 58–67Google Scholar
  49. 49.
    D’Urso P, Giovanni LD (2008) Temporal self-organizing maps for telecommunications market segmentation. Neurocomputing 71:2880–2892CrossRefGoogle Scholar
  50. 50.
    Huang J, Tzeng G, Ong C (2007) Marketing segmentation using support vector clustering. J Expert Syst Appl 32(2):313–317CrossRefGoogle Scholar
  51. 51.
    Kiang MY, Hu MY, Fisher DM (2006) An extended self-organizing map network for market segmentation—a telecommunication example. J Decis Support Syst 42:36–47CrossRefGoogle Scholar
  52. 52.
    Brucker P (1978) On the complexity of clustering problems. In: Beckmenn M, Kunzi HP (eds) Optimization and operations research. Lecture notes in economics and mathematical systems, vol 157. Springer, Berlin, pp 45–54Google Scholar
  53. 53.
    Welch JW (1983) Algorithmic complexity: three NP-hard problems in computational statistics. J Stat Comput Simul 15:17–25CrossRefMathSciNetGoogle Scholar
  54. 54.
    Goyal A, Bonchi F, Lakshmanan LVS (2010) Learning influence probabilities in social networks. In: Proceedings of the third ACM international conference on web search and data mining, pp 241–250Google Scholar
  55. 55.
    Banati H, Mehta M, Bajaj M (2014) Social behaviour based metrics to enhance collaborative filtering. Int J Comput Inf Syst Ind Manage Appl 6:217–226Google Scholar
  56. 56.
    Aggarwal CC, Wolf JL, Wu K-L, Yu PS (1999) Horting hatches an egg: a new graph-theoretic approach to collaborative filtering. In: Proceedings of the fifth ACM SIGKDD international conference on knowledge discovery and data mining, pp 201–212Google Scholar
  57. 57.
    Goldberg Nichols D, Oki BM, Terry D (1992) Using collaborative filtering to weave an information tapestry. Commun ACM 35(12):61–70CrossRefGoogle Scholar
  58. 58.
    Shardanand U, Maes P (2005) Social information filtering: algorithms for automating “word of mouth”. In: Proceedings of ACM conference on human factors in computing systems. ACM Press, pp 210–217Google Scholar
  59. 59.
    Leskovec J, Krause A, Guestrin C, Faloutsos C, VanBriesen J, Glance N (2007) Cost-effective outbreak detection in networks. In: Proceedings of the 13th ACM SIGKDD international conference on knowledge discovery and data mining, pp 420–429Google Scholar
  60. 60.
    Stonedahl F, Rand W, Wilensky U (2010) Evolving viral marketing strategies. In: Proceedings of genetic and evolutionary computation conference (GECCO), pp 1195–1202Google Scholar
  61. 61.
    Sarker R, Mohammadian M, Yao X (2002) Evolutionary optimization. In: International series in operations research and management science, vol 48. Kluwer Academic, Boston, pp 87–113Google Scholar
  62. 62.
    Chevallier J, Maylin D (2006) The Effect of Word-of-Mouth on Sales: Online book Reviews. J Mark Res 43(3):345–354CrossRefGoogle Scholar
  63. 63.
    Balasubramanian S, Mahajan V (2001) The economic leverage of the virtual community. Int J Electron Commer 5(3):103–138Google Scholar
  64. 64.
    Banati H, Bajaj M (2013) Performance analysis of firefly algorithm for data clustering. Int J Swarm Intell 1(1):19–35CrossRefGoogle Scholar
  65. 65.
    Banati H, Bajaj M (2013) An evolutionary approach for k-max-influence problem. Int J Netw Innovative Comput 1(1):163–172Google Scholar
  66. 66.
  67. 67.
    Nissen V, Biethahn J (1995) An introduction to evolutionary algorithms. In: Biethahn J, Nissen V (eds) Evolutionary algorithms in management applications. Springer, pp 3–97Google Scholar
  68. 68.
    Terano T, Ishino Y (1998) Interactive genetic algorithm based feature selection and its application to marketing data analysis. In: Liu H, Motoda H (eds) Feature extraction, construction and selection. pp 393–406Google Scholar
  69. 69.
    De la Torre F, Kanade T (2006) Discriminative cluster analysis. In: Proceedings of the 23rd international conference on machine learning. ACM, pp 241–248Google Scholar

Copyright information

© Springer India 2016

Authors and Affiliations

  1. 1.Department of Computer ScienceUniversity of DelhiNew DelhiIndia
  2. 2.Department of Computer Science and EngineeringJaypee Institute of Information TechnologyNoidaIndia
  3. 3.Department of Computer ScienceDyal Singh College, University of DelhiNew DelhiIndia

Personalised recommendations