@techreport{TD:101573,
	att_abstract={{The notion of heavy hitters - items that make up a large fraction of the population - has been successfully used in a variety of applications across sensor and RFID monitoring, network data analysis, event mining, and more. Yet this notion often fails to capture the semantics we desire when we observe data in the form of correlated pairs. Here, we are interested in items that are conditionally frequent: when a particular item is frequent within the context of its parent item. In this work, we introduce and formalize the notion of Conditional Heavy Hitters to identify such items, with applications in network monitoring, and Markov chain modeling. We explore the relationship between Conditional Heavy Hitters and other related notions in the literature, and show analytically and experimentally the usefulness of our approach. We introduce several algorithm variations that allow us to efficiently find conditional heavy hitters for input data with very different characteristics, and provide analytical results for their performance. Finally, we perform experimental evaluations
with several synthetic and real datasets to demonstrate the efficacy of our methods, and to study the behavior of the proposed algorithms for different types of data.}},
	att_authors={ds8961},
	att_categories={C_CCF.1, C_IIS.1, C_IIS.2},
	att_copyright={{Springer}},
	att_copyright_notice={{The definitive version was published in 2015. {{, Volume 24}}{{, Issue 3}}{{, 2015-08-30}}{{, http://dx.doi.org/10.1007/s00778-015-0382-5}}
}},
	att_donotupload={},
	att_private={false},
	att_projects={},
	att_tags={},
	att_techdoc={true},
	att_techdoc_key={TD:101573},
	att_url={http://web1.research.att.com:81/techdocs_downloads/TD:101573_DS1_2015-02-14T19:07:24.129Z.pdf},
	author={Divesh Srivastava and Katsiaryna Mirylenka and Graham Cormode and Themis Palpanas},
	institution={{VLDB Journal}},
	month={August},
	title={{Conditional Heavy Hitters: Detecting Interesting Correlations in Data Streams}},
	year=2015,
}