Detecting correlations between hot days in news feeds

RaghvenPhDa Mall, Nahil Jain, Vikram Pudi

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

We use text mining mechanisms to analyze Hot days in news feeds. We build upon the earlier work used to detect Hot topics and assume that we have already attained the Hot days. In this paper we identify the most relevant documents of a topic on a Hot day. We construct a similarity based technique for identifying and ranking these documents. Our aim is to automatically detect chains of hot correlated events over time. We develop a scheme using similarity measures like cosine similarity and KL-divergence to find correlation between these Hot days. For the 'U.S. Presidential Elections', the presidential debates which spanned over a week was one such event.

Original languageEnglish
Title of host publicationKDIR 2011 - Proceedings of the International Conference on Knowledge Discovery and Information Retrieval
Pages375-378
Number of pages4
Publication statusPublished - 1 Dec 2011
Externally publishedYes
EventInternational Conference on Knowledge Discovery and Information Retrieval, KDIR 2011 - Paris, France
Duration: 26 Oct 201129 Oct 2011

Other

OtherInternational Conference on Knowledge Discovery and Information Retrieval, KDIR 2011
CountryFrance
CityParis
Period26/10/1129/10/11

Keywords

  • Correlated hot events
  • Derived hotness
  • Deriving hot topics

ASJC Scopus subject areas

  • Information Systems

Cite this

Mall, R., Jain, N., & Pudi, V. (2011). Detecting correlations between hot days in news feeds. In KDIR 2011 - Proceedings of the International Conference on Knowledge Discovery and Information Retrieval (pp. 375-378)

Detecting correlations between hot days in news feeds. / Mall, RaghvenPhDa; Jain, Nahil; Pudi, Vikram.

KDIR 2011 - Proceedings of the International Conference on Knowledge Discovery and Information Retrieval. 2011. p. 375-378.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Mall, R, Jain, N & Pudi, V 2011, Detecting correlations between hot days in news feeds. in KDIR 2011 - Proceedings of the International Conference on Knowledge Discovery and Information Retrieval. pp. 375-378, International Conference on Knowledge Discovery and Information Retrieval, KDIR 2011, Paris, France, 26/10/11.
Mall R, Jain N, Pudi V. Detecting correlations between hot days in news feeds. In KDIR 2011 - Proceedings of the International Conference on Knowledge Discovery and Information Retrieval. 2011. p. 375-378
Mall, RaghvenPhDa ; Jain, Nahil ; Pudi, Vikram. / Detecting correlations between hot days in news feeds. KDIR 2011 - Proceedings of the International Conference on Knowledge Discovery and Information Retrieval. 2011. pp. 375-378
@inproceedings{30ee2f67a6ca45efab15cf433f8f5dcf,
title = "Detecting correlations between hot days in news feeds",
abstract = "We use text mining mechanisms to analyze Hot days in news feeds. We build upon the earlier work used to detect Hot topics and assume that we have already attained the Hot days. In this paper we identify the most relevant documents of a topic on a Hot day. We construct a similarity based technique for identifying and ranking these documents. Our aim is to automatically detect chains of hot correlated events over time. We develop a scheme using similarity measures like cosine similarity and KL-divergence to find correlation between these Hot days. For the 'U.S. Presidential Elections', the presidential debates which spanned over a week was one such event.",
keywords = "Correlated hot events, Derived hotness, Deriving hot topics",
author = "RaghvenPhDa Mall and Nahil Jain and Vikram Pudi",
year = "2011",
month = "12",
day = "1",
language = "English",
isbn = "9789898425799",
pages = "375--378",
booktitle = "KDIR 2011 - Proceedings of the International Conference on Knowledge Discovery and Information Retrieval",

}

TY - GEN

T1 - Detecting correlations between hot days in news feeds

AU - Mall, RaghvenPhDa

AU - Jain, Nahil

AU - Pudi, Vikram

PY - 2011/12/1

Y1 - 2011/12/1

N2 - We use text mining mechanisms to analyze Hot days in news feeds. We build upon the earlier work used to detect Hot topics and assume that we have already attained the Hot days. In this paper we identify the most relevant documents of a topic on a Hot day. We construct a similarity based technique for identifying and ranking these documents. Our aim is to automatically detect chains of hot correlated events over time. We develop a scheme using similarity measures like cosine similarity and KL-divergence to find correlation between these Hot days. For the 'U.S. Presidential Elections', the presidential debates which spanned over a week was one such event.

AB - We use text mining mechanisms to analyze Hot days in news feeds. We build upon the earlier work used to detect Hot topics and assume that we have already attained the Hot days. In this paper we identify the most relevant documents of a topic on a Hot day. We construct a similarity based technique for identifying and ranking these documents. Our aim is to automatically detect chains of hot correlated events over time. We develop a scheme using similarity measures like cosine similarity and KL-divergence to find correlation between these Hot days. For the 'U.S. Presidential Elections', the presidential debates which spanned over a week was one such event.

KW - Correlated hot events

KW - Derived hotness

KW - Deriving hot topics

UR - http://www.scopus.com/inward/record.url?scp=84862201017&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84862201017&partnerID=8YFLogxK

M3 - Conference contribution

SN - 9789898425799

SP - 375

EP - 378

BT - KDIR 2011 - Proceedings of the International Conference on Knowledge Discovery and Information Retrieval

ER -