The Data Exploration Game Ben McCamish, Arash Termehchy, Behrouz - - PowerPoint PPT Presentation

the data exploration game
SMART_READER_LITE
LIVE PREVIEW

The Data Exploration Game Ben McCamish, Arash Termehchy, Behrouz - - PowerPoint PPT Presentation

The Data Exploration Game Ben McCamish, Arash Termehchy, Behrouz Touri I nformation & D ata Manag e ment and A nalytics Laboratory (IDEA) Most users cannot precisely express their intents Intents they wish to find Use Queries to Grades


slide-1
SLIDE 1

The Data Exploration Game

Ben McCamish, Arash Termehchy, Behrouz Touri Information & Data Management and Analytics Laboratory (IDEA)

slide-2
SLIDE 2

Results

First_Name Last_Name Dept. Grade

Sarah Smith CE A John Smith EE B

  • Database system returns only a

subset of matching tuples

Most users cannot precisely express their intents

Smith

Grades

First_Name Last_Name Dept. Grade

… … … …

Sarah Smith CE A John Smith EE B Kerry Smith CS D

… … … … 2

Kerry Smith in CS

Use Queries to express intents Intents they wish to find

slide-3
SLIDE 3

Results

First_Name Last_Name Dept. Grade

Kerry Smith CS D Sarah Smith CE A

  • Learning and reformulating

query allowed the user to find the desired student

Smith CS

Grades

First_Name Last_Name Dept. Grade

… … … …

Sarah Smith CE A John Smith EE B Kerry Smith CS D

… … … …

But they learn by interacting with database systems

3

Kerry Smith in CS

slide-4
SLIDE 4

Results

First_Name Last_Name Dept. Grade

Kerry Smith CS D John Smith EE B Smith

Grades

First_Name Last_Name Dept. Grade

… … … …

Sarah Smith CE A John Smith EE B Kerry Smith CS D

… … … … 4

Database system can also learn from interactions

  • Database system has learned

to return Kerry Smith in CS department

Kerry Smith in CS

slide-5
SLIDE 5

Naturally data interaction is a game between two rational agents

  • Two Players: user and database system
  • Final goal: user to get desired information
  • Database system understands the intent behind users queries.
  • User expresses intent in a way that DBMS understands.
  • Strategy of the user is how intents are expressed using queries.
  • Strategy of the database system is how to decode queries.
  • Reward: the desired information user receive.

5

slide-6
SLIDE 6

Query # Query q1

“Smith CE”

q2

“Smith”

User may use a single query for multiple intents

User Strategy (U)

q1 q2 e1 1 e2 1 e3 1 Intent # Intent e1

John Smith in EE

e2

Sarah Smith in CE

e3

Kerry Smith in CS

Grades

First_Name Last_Name Dept. Grade

… … … …

Sarah Smith CE A John Smith EE B Kerry Smith CS D

… … … … 6

  • Row stochastic mapping from intents to

queries

  • Due to the lack of knowledge, saving time, …
  • Makes it hard to interpret the exact intent

behind the query.

slide-7
SLIDE 7
  • Row-stochastic

mapping from queries to intents

Database system strategy

Database Strategy

e1 e2 e3 q1 1 q2 0.5 0.5 Intent # Intent e1

ans(y)← Grades(x,’Smith’, ‘EE’, y)

e2

ans(y)← Grades(x,’Smith’, ‘CE’, y)

e3

ans(y)← Grades(x,’Smith’, ‘CS’, y)

Query # Query q1

“Smith CE”

q2

“Smith”

Grades

First_Name Last_Name Dept. Grade

… … … …

Sarah Smith CE A John Smith EE B Kerry Smith CS D

… … … … 7

Sarah Smith in CE

slide-8
SLIDE 8

Database system must take into account user learning.

  • Current systems assume that users do not learn (static

environment).

  • They cannot discover user intents accurately where users

learn (dynamic environment).

8

slide-9
SLIDE 9

First, we want to know how users learn

  • Research in psychology shows that humans exhibit reinforcement

learning behavior

  • Components of reinforcement learning:
  • Select a query based on its past success, i.e., exploitation.
  • Explore and try new/ less successful queries to gain new knowledge, i.e., exploration.
  • Sacrifice immediate success for more success in the long run.

9

slide-10
SLIDE 10

User learning mechanisms

  • We evaluate 6 different human reinforcement learning

methods from experimental economics and psychology.

  • They differ in:
  • The rate of exploration/ exploitation
  • The degree by which users use the experience from past interactions
  • The degree of reinforcement

10

slide-11
SLIDE 11
  • Yahoo! interaction history of 300,000 interactions.

Empirical evaluation

Method Mean Squared Error Bush and Mosteller’s 0.0673 Cross’s 0.0686 Roth and Erev 0.0666 Roth and Erev Modified 0.0666 Win-Stay/Lose-Randomize 0.0713 Latest Reward 0.1427

11

  • Roth and Erev explores, using a randomized method,

remembers all previous interactions, and reinforces based on reward in each interaction.

slide-12
SLIDE 12

How should the DBMS learn?

  • We have proposed a reinforcement learning algorithm for

the DBMS that considers user learning.

  • It is more effective that the state-of-the-art learning

algorithms in current systems.

  • It scales to large databases:
  • Full paper: arxiv.org/abs/1603.04068v4

12