Active Sampling For Entity Matching

Active Sampling
for Entity Matching

Kedar Bellare1, Suresh Iyengar1, Aditya Parameswaran2 & Vibhor Rastogi1
1 Yahoo! Research
2 Stanford University
KDD 2012
(slide)[http://shrdocs.com/presentations/9266/index.html]
5
Takuya Makino
Saturday, August 3, 13
Active
Active
Sampling
Sampling
for Entity Matching
with Guarantees
for Entity Matching
ACM Transactions on Embedded Computing Systems, 2010
Kedar Bellare11, Suresh Iyengar21, Aditya Parameswaran32, Vibhor Rastogi4 1

Kedar
Bellare
, Suresh Iyengar , Aditya Parameswaran & Vibhor Rastogi
1
Facebook
Inc.
1 Microsoft
Yahoo! Research
2
Research Lab India
2 Stanford
Stanford University
3
University
4
Google
Inc.
KDD
2012
(slide)[http://shrdocs.com/presentations/9266/index.html]
5
Takuya Makino

entity

: == True/False
active learning

Entity Matching
Imbalanced data:
blocking(): = 100:1

Imbalanced data [Arasu, 11]
precisionrecall

precisionrecall()
sub-linearlabel complexity
Importance Weighted Active Learning

[Beygelzimer+, 09]
xtpt
ptloss

xt1/pt
loss

loss
Overview
IWAL [Beygelzimer+, 09]

CONVEXHULL Algorithm

precisionrecall
maximize RECALL(h),
subject to PRECISION(h) >= r,
=>
maximize -fn(h),
subject to tp(h) - fp(h) >= 0,
=r/(1-r)
h = argmax -fn(h) + (tp(h) - fp(h))
h = argmax X(h) + Y(h)
black box B()
hblack box

H

recallh
Y(h)>=0
P={(X(h), Y(h)):hH}
H
P-1/
Y(h)>=0h O(log n)
h
h
h
Y(h)
precision
recallh
0
X(h)
while min < max do

Y(h)
h = B(mid),
if Y(h)>=0, max=mid
max
mid
min
precision
recallh
0
X(h)
while min < max do

Y(h)
h = B(mid),
if Y(h)>=0, max=mid
max mid
min
precision
recallh
0
X(h)
while min < max do

Y(h)
h = B(mid),
if Y(h)>=0, max=mid
max min
mid
precision
recallh
0
X(h)
REJECTION SAMPLING Algorithm

black box B(*)

minimize (fn(h) + (1 - )fp(h))/n
RECALL(0-1LOSS)
min fn(h)/n (0-1 LOSSWEIGHTED)
(1 - )
0-1 LOSSB
http://www.machinedlearnings.com/2012/01/cost-sensitive-binary-classication.html
: http://www.slideshare.net/pfi/20120105-pfi
REJECTION SAMPLING ()
1-
1-
(fn(h) + (1 - )fp(h))/n
REJECTION SAMPLING ()
1-
1-
(fn(h) + (1 - )fp(h))/n
Label Complexity
Blabel complextitymax(/(1 - ), (1 - )/)
O(log n)

Conclusion
entity matchingprecisionrecall
active learning
black box
label & computational complexity
recall
state-of-the-artoutperform

Active Sampling For Entity Matching

Enviado por

Dados do documento

Título original

Direitos autorais

Formatos disponíveis

Compartilhar este documento

Compartilhar ou incorporar documento

Opções de compartilhamento

Você considera este documento útil?

Este conteúdo é inapropriado?

Direitos autorais:

Formatos disponíveis

Active Sampling For Entity Matching

Enviado por

Direitos autorais:

Formatos disponíveis

Active Sampling

for Entity Matching

for Entity Matching

ACM Transactions on Embedded Computing Systems, 2010

Kedar Bellare11, Suresh Iyengar21, Aditya Parameswaran32, Vibhor Rastogi4 1

Importance Weighted Active Learning

IWAL [Beygelzimer+, 09]

IWAL [Beygelzimer+, 09]

h = argmax -fn(h) + (tp(h) - fp(h))

h = argmax X(h) + Y(h)

black box B()

while min < max do

while min < max do

while min < max do

REJECTION SAMPLING Algorithm

IWAL [Beygelzimer+, 09]

black box B(*)

Você também pode gostar