Compressive Review On Mining Competitors From Large Unstructured Datasets

Authors

  • K. Hari Krishna  MCA Department, Vignan's Lara Institute of Technology and Science, Vadlamudi, Guntur, Andhra Pradesh, India
  • Badarla Sravani  MCA Department, Vignan's Lara Institute of Technology and Science, Vadlamudi, Guntur, Andhra Pradesh, India

Keywords:

Abstract

In any competitive business, success is based on the ability to make an item more appealing to customers than the competition. A number of questions arise in the context of this task: how do we formalize and quantify the Competitiveness between two items? Who are the main competitors of a given item? What are the features of an Item that most affect its competitiveness? Despite the impact and relevance of this problem too many domains, only a limited amount of work has been devoted toward an effective solution. In this paper, we present a formal Definition of the competitiveness between two items based on the market segments that they can both cover. Our Evaluation of competitiveness utilizes customer reviews, an abundant source of information that is available in a Wide range of domains. We present efficient methods for evaluating competitiveness in large review datasets and address the natural problem of finding the top-k competitors of a given item. Finally, we evaluate the Quality of our results and the scalability of our approach using multiple datasets from different domains.

References

  1. M.E.Porter, CompetitiveStrategy: Techniques for Analyzing Industries and Competitors. Free Press, 1980.
  2. R. Deshpand and H. Gatingon, "Competitive analysis," Marketing Letters, 1994.
  3. B. H. Clark and D. B. Montgomery, "Managerial Identification of Competitors," Journal of Marketing, 1999. 4W. T. Few, "Managerial competitor dentification: Integrating the categorization, economic and organizational identity perspectives," Doctoral Dissertaion, 2007.
  4. M. Bergen and M. A. Peteraf, "Competitor identification and competitor analysis: a broad-based managerial approach," Managerial and Decision Economics, 2002.
  5. J. F. Porac and H. Thomas, "Taxonomic mental models in competitor definition," The Academy of Management Review, 2008.
  6. M.-J. Chen, "Competitor analysis and interfirm rivalry: Toward a theoretical integration," Academy of Management Review, 1996.
  7. R. Li, S. Bao, J. Wang, Y. Yu, and Y. Cao, "Cominer: An effective algorithm for mining competitors from the web," in ICDM, 2006.
  8. Z. Ma, G. Pant, and O. R. L. Sheng, "Mining competitor relationships from online news: A network- based approach," Electronic Commerce Research and Applications, 2011.
  9. R. Li, S. Bao, J. Wang, Y. Liu, and Y. Yu, "Web scale competitor discovery using mutual information,"in ADMA, 2006.
  10. S.Bao,R.Li,Y.Yu,andY.Cao,"Competitorminingwiththeweb," IEEE Trans. Knowl. Data Eng., 2008.
  11. G. Pant and O. R. L. Sheng, "Avoiding the blind spots: Competitor identification using web text and linkage structure," in ICIS, 2009.
  12. D. Zelenko and O. Semin, "Automatic competitor identification from public information sources," International Journal of Computational Intelligence and Applications, 2002.
  13. R. Decker and M. Trusov, "Estimating aggregate consumer preferences from online product reviews,"International Journal of Research in Marketing, vol. 27, no. 4, pp. 293-307, 2010.
  14. C. W.-K. Leung, S. C.-F. Chan, F.-L. Chung, and G. Ngai, "A probabilistic rating inference framework for mining user preferences from reviews," World Wide Web, vol. 14, no. 2, pp. 187-215, 2011.
  15. K. Lerman, S. Blair-Goldensohn, and R. McDonald, "Sentiment summarization: evaluating and learning user preferences," in ACL, 2009, pp. 514-522.
  16. E.Marrese-Taylor,J.D.Vel´asquez,F.Bravo-Marquez,and Y.Matsuo,"Identifyingcustomerpreferencesabouttourismproductsusing an aspect-based opinion mining approach," Procedia Computer Science, vol. 22, pp. 182-191, 2013.
  17. C.-T. Ho, R. Agrawal, N. Megiddo, and R. Srikant, "Range queries in olap data cubes," in SIGMOD, 1997, pp. 73-88.
  18. Y.-L.Wu,D.Agrawal,andA.ElAbbadi,"Usingwaveletdecomposition to support progressive and approximate range-sum queries over data cubes," in CIKM, ser. CIKM ’00, 2000, pp. 414-421.
  19. D. Gunopulos, G. Kollios, V. J. Tsotras, and C. Domeniconi, "Approximating multi-dimensional aggregate range queries over real attributes," in SIGMOD, 2000, pp. 463-474.
  20. M. Muralikrishna and D. J. DeWitt, "Equi-depth histograms for estimating selectivity factors for multi- dimensional queries," in SIGMOD, 1988, pp. 28-36.
  21. N. Thaper, S. Guha, P. Indyk, and N. Koudas, "Dynamic multidimensional histograms," in SIGMOD,2002, pp. 428-439.
  22. K.-H. Lee, Y.-J. Lee, H. Choi, Y. D. Chung, and B. Moon, "Parallel data processing with mapreduce: a survey," AcM sIGMoD Record, vol. 40, no. 4, pp. 11-20, 2012.
  23. S.Borzsonyi,D.Kossmann,andK.Stocker,"Theskylineoperator," in ICDE, 2001.
  24. D. Papadias, Y. Tao, G. Fu, and B. Seeger, "An optimal and progressive algorithm for skyline queries,"ser. SIGMOD ’03.
  25. G. Valkanas, A. N. Papadopoulos, and D. Gunopulos, "Skyline ranking `a la IR," in ExploreDB, 2014,pp. 182-187.
  26. J. L. Bentley, H. T. Kung, M. Schkolnick, and C. D. Thompson, "On the average number of maxima in a set of vectors and applications," J. ACM, 1978.
  27. X. Ding, B. Liu, and P. S. Yu, "A holistic lexicon-based approach to opinion mining," ser. WSDM ’08.29A. Agresti, Analysis of ordinal categorical data. John Wiley & Sons, 2010, vol. 656.
  28. T.Lappas,G.Valkanas,andD.Gunopulos,"Efficientanddomaininvariant competitor mining," in SIGKDD,2012, pp. 408-416.
  29. J. F. Porac and H. Thomas, "Taxonomic mental models in competitor definition," Academy of Management Review, vol. 15, no. 2, pp. 224-240, 1990.
  30. Z. Zheng, P. Fader, and B. Padmanabhan, "From business intelligence to competitive intelligence: Inferring competitive measures using augmented site-centric data," Information Systems Research, vol.23, no. 3-part-1, pp. 698-720, 2012.
  31. T.-N. Doan, F. C. T. Chua, and E.-P. Lim, "Mining business competitiveness from user visitation data,"in International Conference on Social Computing, Behavioral-Cultural Modeling, and Prediction.Springer, 2015, pp. 283-289.
  32. G. Pant and O. R. Sheng, "Web footprints of firms: Using online isomorphism for competitor identification," Information Systems Research, vol. 26, no. 1, pp. 188-209, 2015.
  33. K. Xu, S. S. Liao, J. Li, and Y. Song, "Mining comparative opinions from customer reviews for competitive intelligence," Decis. Support Syst., 2011.
  34. Q. Wan, R. C.-W. Wong, I. F. Ilyas, M. T. Ozsu, and Y. Peng, "Creating competitive products," PVLDB, vol. 2, no. 1, pp. 898- 909, 2009.
  35. Q. Wan, R. C.-W. Wong, and Y. Peng, "Finding top-k profitable products," in ICDE, 2011.
  36. Z. Zhang, L. V. S. Lakshmanan, and A. K. H. Tung, "On domination game analysis for microeconomic data mining," ACM Trans. Knowl. Discov. Data, 2009.
  37. T. Wu, D. Xin, Q. Mei, and J. Han, "Promotion analysis in multidimensional space," PVLDB, 2009.
  38. T. Wu, Y. Sun, C. Li, and J. Han, "Region-based online promotion analysis," in EDBT, 2010.
  39. D. Kossmann, F. Ramsak, and S. Rost, "Shooting stars in the sky: an online algorithm for skyline queries," ser. VLDB, 2002.
  40. A. Vlachou, C. Doulkeridis, Y. Kotidis, and K. Nørvå g, "Reverse top-k queries," in ICDE, 2010.
  41. A. Vlachou, C. Doulkeridis, K. Nørvå g, and Y. Kotidis, "Identifying the most influential data objects with reverse top-k queries," PVLDB, 2010.
  42. K.HoseandA.Vlachou,"Asurveyofskylineprocessinginhighly distributed environments," The VLDB Journal, vol. 21, no. 3, pp. 359-384, 2012.

IInternational Journal of Scientific Research in Computer Science, Engineering and Information Technology

Downloads

Published

2018-04-30

Issue

Volume 4, Issue 2, March-April-2018

Section

Research Articles

License

Copyright (c) IJSRCSEIT

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

How to Cite

[1]
K. Hari Krishna, Badarla Sravani, " Compressive Review On Mining Competitors From Large Unstructured Datasets, IInternational Journal of Scientific Research in Computer Science, Engineering and Information Technology(IJSRCSEIT), ISSN : 2456-3307, Volume 4, Issue 2, pp.01-07, March-April-2018.