2009 MiningfortheMostCertainPredicti

• (Deodhar et al., 2009) ⇒ Meghana Deodhar, and Joydeep Ghosh. (2009). “Mining for the Most Certain Predictions from Dyadic Data.” In: Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD-2009). doi:10.1145/1557019.1557052

Subject Headings:

Cited By

• http://scholar.google.com/scholar?q=%22Mining+for+the+most+certain+predictions+from+dyadic+data%22+2009
• http://portal.acm.org/citation.cfm?doid=1557019.1557052&preflayout=flat#citedby

Quotes

Abstract

In several applications involving regression or classification, along with making predictions it is important to assess how accurate or reliable individual predictions are. This is particularly important in cases where due to finite resources or domain requirements, one wants to make decisions based only on the most reliable rather than on the entire set of predictions. This paper introduces novel and effective ways of ranking predictions by their accuracy for problems involving large-scale, heterogeneous data with a dyadic structure, i.e., where the independent variables can be naturally decomposed into three groups associated with two sets of elements and their combination. These approaches are based on modeling the data by a collection of localized models learnt while simultaneously partitioning (co-clustering) the data. For regression this leads to the concept of “certainty lift”. We also develop a robust predictive modeling technique that identifies and models only the most coherent regions of the data to give high predictive accuracy on the selected subset of response values. Extensive experimentation on real life datasets highlights the utility of our proposed approaches

References

,

	Author	volume	Date Value	title	type	journal	titleUrl	doi	note	year
2009 MiningfortheMostCertainPredicti	Joydeep Ghosh Meghana Deodhar			Mining for the Most Certain Predictions from Dyadic Data		KDD-2009 Proceedings		10.1145/1557019.1557052		2009