IDEAS home Printed from https://ideas.repec.org/a/jbh/ijsrcs/v4y2018i2idhcseit1833606.html

Compressive Review On Mining Competitors From Large Unstructured Datasets

Author

Listed:
  • K. Hari Krishna
  • Badarla Sravani

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.

Suggested Citation

  • K. Hari Krishna & Badarla Sravani, 2018. "Compressive Review On Mining Competitors From Large Unstructured Datasets," International Journal of Scientific Research in Computer Science, Engineering and Information Technology, International Journal of Scientific Research in Computer Science, Engineering and Information Technology, vol. 4(2), pages 01-07, April.
  • Handle: RePEc:jbh:ijsrcs:v4:y2018:i2:id:hcseit1833606
    Note: Article URL: https://ijsrcseit.com/CSEIT1833606
    as

    Download full text from publisher

    File URL: https://ijsrcseit.com/CSEIT1833606
    File Function: Article URL
    Download Restriction: no

    File URL: https://ijsrcseit.com/paper/CSEIT1833606.pdf
    File Function: Full text
    Download Restriction: no
    ---><---

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:jbh:ijsrcs:v4:y2018:i2:id:hcseit1833606. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Pankaj Sharma (USA) (email available below). General contact details of provider: https://ijsrcseit.com/home .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.