IDEAS home Printed from https://ideas.repec.org/a/igg/jkbo00/v5y2015i3p1-18.html
   My bibliography  Save this article

Constructing Temporal Equivalence Partitionings for Keyword Sets

Author

Listed:
  • Parvathi Chundi

    (Department of Computer Science, Peter Kiewit Institute, University of Nebraska-Omaha, Omaha, NE, USA)

  • Mahadevan Subramaniam

    (Department of Computer Science, Peter Kiewit Institute, University of Nebraska-Omaha, Omaha, NE, USA)

Abstract

Identifying keyword associations from text and search sources is often used to facilitate many tasks such as understanding relationships among concepts, extracting relevant documents, matching advertisements to web pages, expanding user queries, etc. However, these keyword associations change continually change with time. In this paper, the authors define an equivalence relationship among keywords and develop methods to construct a temporal view of the equivalence relationship by constructing optimal temporal equivalence partitionings for keyword sets. They describe efficient algorithms to construct an optimal temporal equivalence partitioning for a keyword pair. They use the fact that the equivalence relationship is transitive to extend these algorithms to obtain an optimal temporal equivalence partitioning for a larger set of keywords. The authors show the effectiveness of the approach by constructing the temporal equivalence partitionings of several sets of keywords from the Multi-Domain Sentiment data set and the ICWS2009 Spinn3r data set.

Suggested Citation

  • Parvathi Chundi & Mahadevan Subramaniam, 2015. "Constructing Temporal Equivalence Partitionings for Keyword Sets," International Journal of Knowledge-Based Organizations (IJKBO), IGI Global, vol. 5(3), pages 1-18, July.
    • Handle: RePEc:igg:jkbo00:v:5:y:2015:i:3:p:1-18
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/ijkbo.2015070101
    Download Restriction: no
    ---><---

    More about this item

    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:igg:jkbo00:v:5:y:2015:i:3:p:1-18. 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: Journal Editor (email available below). General contact details of provider: https://www.igi-global.com .

    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.