event thumbnail image
Research Track

Mining for the Most Certain Predictions from Dyadic Data

author: Meghana Deodhar, Electrical and Computer Engineering, The University of Texas at Austin

Description

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.

You might be experiencing some problems with Your Video player.
Slides
0:00 Mining for the Most Certain Predictions from Dyadic Data
0:16 Table of contents
0:26 Motivation
2:18 Problem
2:42 Traditional Solutions (1)
2:50 Traditional Solutions (2)
2:59 Traditional Solutions (3)
3:15 Traditional Solutions (4)
3:23 Dyadic Data
4:29 Ranking with a Single Model
4:55 Dyadic Ranking with a Single Model (1)
5:38 Dyadic Ranking with a Single Model (2)
6:09 Simultaneous Co-clustering And Learning (SCOAL)
7:15 SCOAL Details (1)
7:59 SCOAL Details (2)
8:14 SCOAL Based Ranking (1)
8:33 SCOAL Based Ranking (2)
9:17 Robust SCOAL
10:25 Robust SCOAL Algorithm
11:19 Contrasting Techniques (1)
12:21 Contrasting Techniques (2)
12:38 Certainty Lift
13:22 MovieLens Data Description
13:29 Results
14:22 ERIM Data Description
14:49 Results
15:20 Robust SCOAL Evaluation
16:21 Conclusions and Future Work

Lecture rating

People found this lecture:
Worth seeing
because it is:
 Valuable and informative
Well presented
Easily understandable
Acceptably recorded
You need to login to cast your vote.

Report a problem or upload files

If you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.

Link this page

Would you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !

Write your own review or comment:

make sure you have javascript enabled or clear this field: