AWS re:Invent 2016: Blockchain on AWS: Disrupting the Norm (GPST301)
Similar to Legal Analytics Course - Class 7 - Binary Classification with Decision Tree Learning - Professor Daniel Martin Katz + Professor Michael J Bommarito
Similar to Legal Analytics Course - Class 7 - Binary Classification with Decision Tree Learning - Professor Daniel Martin Katz + Professor Michael J Bommarito (20)
IBC (Insolvency and Bankruptcy Code 2016)-IOD - PPT.pptx
Legal Analytics Course - Class 7 - Binary Classification with Decision Tree Learning - Professor Daniel Martin Katz + Professor Michael J Bommarito
1. Class 7
Binary Classification & DecisionTree Learning
Legal Analytics
Professor Daniel Martin Katz
Professor Michael J Bommarito II
legalanalyticscourse.com
4. Classification to Predict Quantity
Classification to Predict Category
Regression Methods
Trees, Forests, Knn, etc.
access more at legalanalyticscourse.com
5. Adapted from Slides By
Victor Lavrenko and Nigel Goddard
@ University of Edinburgh
Take A LookThese 12
access more at legalanalyticscourse.com
7. Task = Determine Whether the Agents
Will Obtain Employment?
Yes
No
f( )
Job?
Binary Classification (Supervised Learning)
access more at legalanalyticscourse.com
12. Task = Determine Whether the Agents
Will Obtain a Loan?
Yes
Perhapsf( )
Loan?
Multi Class Classification (Supervised Learning)
No
access more at legalanalyticscourse.com
13. f( )
Multi Class Classification (Supervised Learning)
Loan?
Yes
Perhaps
No
access more at legalanalyticscourse.com
14. f( )
Loan?
Yes
Multi Class Classification (Supervised Learning)
No
Maybe
Yes
Perhaps
No
access more at legalanalyticscourse.com
24. Uses a set of binary rules applied to calculate a
target value
Used for classification (categorical variables)
or regression (continuous variables)
Different algorithms are used to determine the
“best” split at a node
Introduction to DecisionTrees
access more at legalanalyticscourse.com
25. “CART Approach”
to Decision Trees
Classification And RegressionTree (CART)
access more at legalanalyticscourse.com
40. 1
0
1
1
1
0
0
0
0
0
1
1 1
1
0
0
1
1
1
1
0
01
0
Xi1
Xi2
0
1 2
1
2
Adapted from Example
By Mathematical Monk
If No - then we are in zone (a) ...
we tally the number of zeros and ones
Using Majority Rule do we assign a
classification to this rule this leaf
split 1
(a)
Xi1 > 1 ?
YesNo
(0,5)
Classify as 1
zone (a)
56. For real problems, you
need to select criteria
(or a criterion) for
deciding where to
partition (split) the data
(2)
access more at legalanalyticscourse.com
57. For real problems you must
develop a stopping condition
or pursue recursive
partitioning of the space
(3)
access more at legalanalyticscourse.com
58. Solutions to these 3 Problems
are among the core questions in
algorithm selection / development
access more at legalanalyticscourse.com
59. From an Algorithmic Perspective -
TheTask is to Develop a
Method to Partition theTrees
access more at legalanalyticscourse.com
60. Must Do So Without Knowing
the Specific Contours of the
Data / Problem in Question
access more at legalanalyticscourse.com
61.
62. So How Do We
TraverseThrough
The Data?
access more at legalanalyticscourse.com
64. “Although any given solution to an NP-complete problem can
be verified quickly (in polynomial time), there is no known
efficient way to locate a solution in the first place; indeed, the
most notable characteristic of NP-complete problems is that no
fast solution to them is known.That is, the time required to
solve the problem using any currently known algorithm
increases very quickly as the size of the problem grows”
65. key implication is that one
cannot in advance determine
the “optimal tree”
access more at legalanalyticscourse.com
66. Breiman, et al (1984) uses a
Greedy Optimization Method
access more at legalanalyticscourse.com
67. Greedy Optimization Method
is used to calculate the MLE
(maximum-likelihood estimation)
access more at legalanalyticscourse.com
68. Greedy is a Heuristic
“makes the locally optimal choice at each stage
with the hope of finding a global optimum. In
many problems, a greedy strategy does not in
general produce an optimal solution, but
nonetheless a greedy heuristic may yield locally
optimal solutions that approximate a global optimal
solution in a reasonable time.”
access more at legalanalyticscourse.com
69.
70. More onTrees (and Forests)
NextTime ...
access more at legalanalyticscourse.com
71. Legal Analytics
Class 7 - Binary Classification with Decision Tree Learning
daniel martin katz
blog | ComputationalLegalStudies
corp | LexPredict
michael j bommarito
twitter | @computational
blog | ComputationalLegalStudies
corp | LexPredict
twitter | @mjbommar
more content available at legalanalyticscourse.com
site | danielmartinkatz.com site | bommaritollc.com