SlideShare a Scribd company logo
1 of 82
http://www.photoxpress.com/stock-photos/man/blank/card/2694628
Suggestion
Reformulation
     http://www.london-eating.co.uk/newsletter/2006/may/images/wine.jpg
Teaching Math or Something / foundphotoslj
http://www.photoxpress.com/stock-photos/brown/human/white/6458163
• Mei Q, Zhou D, Church K. Query suggestion
 using hitting time. Proceeding of the 17th ACM
 conference on Information and knowledge mining - CIKM '08.
 2008:469.

• Herdagdelen A, Ciaramita M, Mahler D, et al.
 Generalized syntactic and semantic
 models of query reformulation. In:
 Proceedings of the 33rd ACM SIGIR Conference, Geneva,
 Switzerland.; 2010.
Query suggestion
using hitting time
      (CIKM 2008)
introduction (1)
introduction (2)
http://morguefile.com/archive/display/105605
V1   W   V2
P
V1   W   V2
                    w(i, j)
              pij =
                      di
              di =          w(i, j)
                     j∈V2

                          30
                  p11   =
                          52
                          15
                  p12   =
                          52
                           7
                  p13   =
                          52
V1
V1   V2    V1
                               w(i, k) w(k, j)
                pij =
                                 di      dk
                        k∈V2

                   =           pik pkj
                        k∈V2
A V
Xt                 t


                 TA


     A
         T   A
                 = min{t : Xt ∈ A, t ≥ 0}
i


P [T   A
           = m|X0 = i] =         P [X1 = j|X0 = i]
                           j∈V
                                 ·P [T   A
                                             = m − 1|X0 = j]

                      =          pij P [T    A
                                                 = m − 1|X0 = j]
                           j∈V

TA = m          m-1                 A
A
          X0 = i                 TA                hi
          ∞
 A
hi   =         mP [T     A
                             = m|X0 = i]
         m=1
          ∞
     =         m         pij P [T   A
                                        = m − 1|X0 = j]
         m=1       j∈V
               ∞
     =             (m − 1)pij P [T          A
                                                = m − 1|X0 = j]
         j∈V m=1
                             ∞
               +                 pij P [T   A
                                                = m − 1|X0 = j]
                   j∈V m=1
∞
          (m − 1)pij P [T   A
                                = m − 1|X0 = j]
j∈V m=1
                  ∞
          =             npij P [T   A
                                        = n|X0 = j]
              j∈V n=1

                                        =              A
                                                  pij hj
                                            j∈V
∞
       P [T   A
                  = m − 1|X0 = j] = 1
 m=1


      ∞
           pij P [T   A
                          = m − 1|X0 = j] =         pij = 1
j∈V m=1                                       j∈V



  A
 hi    =               A
                  pij hj   +1      A
                                  hi   = 0, f or i ∈ A
           j∈V
w(i, k) w(k, j)
                      pij =
                                       di      dk
                              k∈V2




hi (t + 1) =         pij hj (t) + 1, hi (0) = 0
               j=s
http://www.photoxpress.com/stock-photos/macro/fashion/person/2134644/
http://www.flickr.com/photos/fabricio/50889626
c(QT , U RL, U ser)
p(QT |U RL, U ser) =
                        Q c(Q, U RL, U ser)

                          p(U RL|Q, U ser)
                          ˆ
p(U RL|QT , U ser)p(QT |U ser)
                     ˆ
p(QT |U RL, U ser) =
                            p(U RL|U ser)


                p(QT |U RL, U ser)        k=j   wik
        wij =
                   1 − p(QT |U RL, U ser)

    ˆ
    p
                            4
        p(U RL|Q, IP ) =
        ˆ                        λi p(U RL|Q, IPi )
                           i=0
Generalized syntactic and
  semantic models of
  query reformulation
         (SIGIR 2010)
http://www.photoxpress.com/stock-photos/meeting/recipe/business/1996577/
p(x, y)
    P M I(x, y) = log
                      p(x)p(y)
                     P M I(x, y)
    P M I(J)(x, y) =
                     − log p(x, y)
                 P M I(x, y)
P M I(S)(x, y) =
                 − log p(x)
                 P M I(x, y)
P M I(G)(x, y) =
                 − log(p(y))
“Sorted”
http://morguefile.com/archive/display/105605
Ns            Nt                 Ns,t
p(qs ) =    , p(qt ) =    , p(qs , qt ) =
         N             N                   N
                              P M IW eb (qs , qt )
dA (x, y)




∀a, b ∈ T, cE1 (a, b) = 1 if a = b




∀a, b ∈ T, cE2 (a, b) = dA (a, b)
    if a = N U LL||b = N U LL
s(wi , wj ) = 2 − 2f (wi , wj ) + (wi , wj )


     ∀a, b ∈ T, cGE (a, b) = s(a, b)
      if a = N U LL||b = N U LL
qs = qs qt , qt = qt qs

                    
                    1
                                    if wi = wj ∧ wi ∈ qs ∧ wj ∈ qt
ni,j (qs , qt ) =          1
                                     if wi ∈ qs ∧ wj ∈ qt
                     (|qs ||qt |)
                    
                     0               otherwise

                                           Ni,j =            ni,j (qs , qt )
                                                    qs ,qt
Ni,· =       Ni,j , N·, =       Ni,j , N =         Ni,j
         j                   i                i,j




           Ni,·              N·,j              Ni,j
P (i, ·) =      , P (·, j) =      , P (i, j) =
           N                 N                  N
∀xi                S(yj |xi ) = 1, S(λ|ξ) = 0
      yj ∈T ∪{λ}
m                            n+z
                          G(z)n!z!
p(y|x) =                                           S(yk , xk )
                          (n + z)!
           z=max(0,m−n)              x   y   k=1
http://nix.ksc.nasa.gov/info?id=KSC-00PD-5019&orgid=5
Similarity    Spearman
NN                  0.500     GenEdit(G)            0.380
Oommen-Kashyap      0.470     GenEdit(J)            0.365
DistSim             0.438     SortedEdit2           0.320
Mean all            0.435     SortedEdit1           0.314
SortedGenEdit(S)    0.429     PMIWeb(G)             0.283
SortedGenEdit(G)    0.428     Edit2                 0.270
PMIWeb(S)           0.417     Edit1                 0.252
PMIWeb(J)           0.409     Length-target(Char)   0.139
SortedGenEdit(J)    0.408     Length-target(Term)   0.112
GenEdit(S)          0.382     log-prob target       -0.161
Similarity Function   Spearman   Mean all          0.386
NN                      0.432    PMIWeb(G)         0.369
GenEdit(G)              0.424    PMIWeb(J)         0.330
SortedGenEdit(G)        0.419    DistSim           0.322
GenEdit(S)              0.414    Edit1             0.299
SortedGenEdit(S)        0.407    SortedEdit1       0.298
GenEdit(J)              0.402    Edit2             0.292
Oommen-Kashyap          0.391    SortedEdit2       0.288
SortedGenEdit(J)        0.391    PMIWeb(S)         0.264
                                 log-prob target   0.114
                                 Length-
                                                   -0.036
                                 target(Char)
                                 Length-
                                                   -0.077
                                 target(Term)
Similarity Measure   QS1500    CC2000
Oommen-Kashyap       0.470*   0.391*(6)
SortedGenEdit(S)     0.429*   0.407* (4)
SortedGenEdit(G)     0.428*   0.419* (2)
SortedGenEdit(J)      0.408   0.391* (7)
GenEdit(S)            0.382   0.414* (3)
GenEdit(G)            0.380   0.424* (1)
GenEdit(J)            0.365   0.402* (5)
SortedEdit2           0.320   0.288 (11)
SortedEdit1           0.314    0.298 (9)
Edit2                 0.270   0.292 (10)
Edit1                 0.252    0.299 (8)
http://www.imageafter.com/image.php?image=b3_landscapes008.jpg
“
http://www.flickr.com/photos/walkadog/3560856061/

More Related Content

What's hot

GradStudentSeminarSept30
GradStudentSeminarSept30GradStudentSeminarSept30
GradStudentSeminarSept30
Ryan White
 
Actuarial Science Reference Sheet
Actuarial Science Reference SheetActuarial Science Reference Sheet
Actuarial Science Reference Sheet
Daniel Nolan
 
Datamining 6th Svm
Datamining 6th SvmDatamining 6th Svm
Datamining 6th Svm
sesejun
 
Reflect tsukuba524
Reflect tsukuba524Reflect tsukuba524
Reflect tsukuba524
kazuhase2011
 

What's hot (18)

Mesh Processing Course : Active Contours
Mesh Processing Course : Active ContoursMesh Processing Course : Active Contours
Mesh Processing Course : Active Contours
 
Low Complexity Regularization of Inverse Problems - Course #1 Inverse Problems
Low Complexity Regularization of Inverse Problems - Course #1 Inverse ProblemsLow Complexity Regularization of Inverse Problems - Course #1 Inverse Problems
Low Complexity Regularization of Inverse Problems - Course #1 Inverse Problems
 
Low Complexity Regularization of Inverse Problems
Low Complexity Regularization of Inverse ProblemsLow Complexity Regularization of Inverse Problems
Low Complexity Regularization of Inverse Problems
 
Signal Processing Course : Inverse Problems Regularization
Signal Processing Course : Inverse Problems RegularizationSignal Processing Course : Inverse Problems Regularization
Signal Processing Course : Inverse Problems Regularization
 
GradStudentSeminarSept30
GradStudentSeminarSept30GradStudentSeminarSept30
GradStudentSeminarSept30
 
Comparing estimation algorithms for block clustering models
Comparing estimation algorithms for block clustering modelsComparing estimation algorithms for block clustering models
Comparing estimation algorithms for block clustering models
 
Actuarial Science Reference Sheet
Actuarial Science Reference SheetActuarial Science Reference Sheet
Actuarial Science Reference Sheet
 
Low Complexity Regularization of Inverse Problems - Course #3 Proximal Splitt...
Low Complexity Regularization of Inverse Problems - Course #3 Proximal Splitt...Low Complexity Regularization of Inverse Problems - Course #3 Proximal Splitt...
Low Complexity Regularization of Inverse Problems - Course #3 Proximal Splitt...
 
Fdtd
FdtdFdtd
Fdtd
 
Scientific Computing with Python Webinar 9/18/2009:Curve Fitting
Scientific Computing with Python Webinar 9/18/2009:Curve FittingScientific Computing with Python Webinar 9/18/2009:Curve Fitting
Scientific Computing with Python Webinar 9/18/2009:Curve Fitting
 
Low Complexity Regularization of Inverse Problems - Course #2 Recovery Guaran...
Low Complexity Regularization of Inverse Problems - Course #2 Recovery Guaran...Low Complexity Regularization of Inverse Problems - Course #2 Recovery Guaran...
Low Complexity Regularization of Inverse Problems - Course #2 Recovery Guaran...
 
Datamining 6th Svm
Datamining 6th SvmDatamining 6th Svm
Datamining 6th Svm
 
Model Selection with Piecewise Regular Gauges
Model Selection with Piecewise Regular GaugesModel Selection with Piecewise Regular Gauges
Model Selection with Piecewise Regular Gauges
 
2018 MUMS Fall Course - Statistical and Mathematical Techniques for Sensitivi...
2018 MUMS Fall Course - Statistical and Mathematical Techniques for Sensitivi...2018 MUMS Fall Course - Statistical and Mathematical Techniques for Sensitivi...
2018 MUMS Fall Course - Statistical and Mathematical Techniques for Sensitivi...
 
rinko2011-agh
rinko2011-aghrinko2011-agh
rinko2011-agh
 
Reflect tsukuba524
Reflect tsukuba524Reflect tsukuba524
Reflect tsukuba524
 
Quantitative norm convergence of some ergodic averages
Quantitative norm convergence of some ergodic averagesQuantitative norm convergence of some ergodic averages
Quantitative norm convergence of some ergodic averages
 
Cheat Sheet
Cheat SheetCheat Sheet
Cheat Sheet
 

Viewers also liked

tho chong tham tai tphcm
tho chong tham tai tphcmtho chong tham tai tphcm
tho chong tham tai tphcm
thochongthamtaitphcm
 
Banking deregulation
Banking deregulationBanking deregulation
Banking deregulation
Dino, llc
 
Lucas Group Military Transition Division
Lucas Group Military Transition DivisionLucas Group Military Transition Division
Lucas Group Military Transition Division
Brian Finnegan
 

Viewers also liked (20)

Open, Linked, Hacked
Open, Linked, HackedOpen, Linked, Hacked
Open, Linked, Hacked
 
The power of i
The power of iThe power of i
The power of i
 
tho chong tham tai tphcm
tho chong tham tai tphcmtho chong tham tai tphcm
tho chong tham tai tphcm
 
35-Part 1- Earthsoft- Path Ahead- Guidance to Professionals
35-Part 1- Earthsoft- Path Ahead- Guidance to Professionals35-Part 1- Earthsoft- Path Ahead- Guidance to Professionals
35-Part 1- Earthsoft- Path Ahead- Guidance to Professionals
 
Possible Ripple in LIGO MIT NSF Announcement of Gravitational Wave "Ripples i...
Possible Ripple in LIGO MIT NSF Announcement of Gravitational Wave "Ripples i...Possible Ripple in LIGO MIT NSF Announcement of Gravitational Wave "Ripples i...
Possible Ripple in LIGO MIT NSF Announcement of Gravitational Wave "Ripples i...
 
Criterios DOAJ para la promoción de la transparencia y buenas prácticas edito...
Criterios DOAJ para la promoción de la transparencia y buenas prácticas edito...Criterios DOAJ para la promoción de la transparencia y buenas prácticas edito...
Criterios DOAJ para la promoción de la transparencia y buenas prácticas edito...
 
Listado de víctimas izquierda
Listado de víctimas izquierdaListado de víctimas izquierda
Listado de víctimas izquierda
 
La abuela materna
La abuela maternaLa abuela materna
La abuela materna
 
Explosiones en la amia y en la embajada de israel en argentina
Explosiones en la amia y en la embajada de israel en argentinaExplosiones en la amia y en la embajada de israel en argentina
Explosiones en la amia y en la embajada de israel en argentina
 
Banking deregulation
Banking deregulationBanking deregulation
Banking deregulation
 
2016 Georgia State Bar Convocation on Professionalism - John Mayer
2016 Georgia State Bar Convocation on Professionalism - John Mayer2016 Georgia State Bar Convocation on Professionalism - John Mayer
2016 Georgia State Bar Convocation on Professionalism - John Mayer
 
The future of work and life on Robotics Ages
The future of work and life on Robotics AgesThe future of work and life on Robotics Ages
The future of work and life on Robotics Ages
 
Margaret Thatcher: Poll Rating Trends
Margaret Thatcher: Poll Rating TrendsMargaret Thatcher: Poll Rating Trends
Margaret Thatcher: Poll Rating Trends
 
G42 The Blog of the 42nd Generation - By Seth Barnes
G42 The Blog of the 42nd Generation - By Seth BarnesG42 The Blog of the 42nd Generation - By Seth Barnes
G42 The Blog of the 42nd Generation - By Seth Barnes
 
Lucas Group Military Transition Division
Lucas Group Military Transition DivisionLucas Group Military Transition Division
Lucas Group Military Transition Division
 
Cztery Bieguny Zarządzania [HEURISTICA]
Cztery Bieguny Zarządzania [HEURISTICA]Cztery Bieguny Zarządzania [HEURISTICA]
Cztery Bieguny Zarządzania [HEURISTICA]
 
Ecologia e economia nao se contrapoem
Ecologia e economia nao se contrapoemEcologia e economia nao se contrapoem
Ecologia e economia nao se contrapoem
 
Catalog NCE Kitako Shimada Hs4200i english
Catalog NCE Kitako Shimada Hs4200i englishCatalog NCE Kitako Shimada Hs4200i english
Catalog NCE Kitako Shimada Hs4200i english
 
Shimada Kitako VT-350 brochure
Shimada Kitako VT-350 brochureShimada Kitako VT-350 brochure
Shimada Kitako VT-350 brochure
 
Docker birthday #4 Cluj Meetup Intro Deck
Docker birthday #4 Cluj Meetup Intro DeckDocker birthday #4 Cluj Meetup Intro Deck
Docker birthday #4 Cluj Meetup Intro Deck
 

Similar to Query Suggestion @ tokyotextmining#2

分かりやすいパターン認識第8章 学習アルゴリズムの一般化
分かりやすいパターン認識第8章 学習アルゴリズムの一般化分かりやすいパターン認識第8章 学習アルゴリズムの一般化
分かりやすいパターン認識第8章 学習アルゴリズムの一般化
Yohei Sato
 
DissertationSlides169
DissertationSlides169DissertationSlides169
DissertationSlides169
Ryan White
 

Similar to Query Suggestion @ tokyotextmining#2 (20)

Preserving Personalized Pagerank in Subgraphs(ICML 2011)
Preserving Personalized Pagerank in Subgraphs(ICML 2011) Preserving Personalized Pagerank in Subgraphs(ICML 2011)
Preserving Personalized Pagerank in Subgraphs(ICML 2011)
 
[Paper Reading] Causal Bandits: Learning Good Interventions via Causal Inference
[Paper Reading] Causal Bandits: Learning Good Interventions via Causal Inference[Paper Reading] Causal Bandits: Learning Good Interventions via Causal Inference
[Paper Reading] Causal Bandits: Learning Good Interventions via Causal Inference
 
QMC Program: Trends and Advances in Monte Carlo Sampling Algorithms Workshop,...
QMC Program: Trends and Advances in Monte Carlo Sampling Algorithms Workshop,...QMC Program: Trends and Advances in Monte Carlo Sampling Algorithms Workshop,...
QMC Program: Trends and Advances in Monte Carlo Sampling Algorithms Workshop,...
 
Signals and Systems Formula Sheet
Signals and Systems Formula SheetSignals and Systems Formula Sheet
Signals and Systems Formula Sheet
 
Lowest common ancestor
Lowest common ancestorLowest common ancestor
Lowest common ancestor
 
Notes.on.popularity.versus.similarity.model
Notes.on.popularity.versus.similarity.modelNotes.on.popularity.versus.similarity.model
Notes.on.popularity.versus.similarity.model
 
分かりやすいパターン認識第8章 学習アルゴリズムの一般化
分かりやすいパターン認識第8章 学習アルゴリズムの一般化分かりやすいパターン認識第8章 学習アルゴリズムの一般化
分かりやすいパターン認識第8章 学習アルゴリズムの一般化
 
CME Deliverable Interest Rate Swap Future
CME Deliverable Interest Rate Swap FutureCME Deliverable Interest Rate Swap Future
CME Deliverable Interest Rate Swap Future
 
統計的学習の基礎 4章 前半
統計的学習の基礎 4章 前半統計的学習の基礎 4章 前半
統計的学習の基礎 4章 前半
 
Scattering theory analogues of several classical estimates in Fourier analysis
Scattering theory analogues of several classical estimates in Fourier analysisScattering theory analogues of several classical estimates in Fourier analysis
Scattering theory analogues of several classical estimates in Fourier analysis
 
Markov Tutorial CDC Shanghai 2009
Markov Tutorial CDC Shanghai 2009Markov Tutorial CDC Shanghai 2009
Markov Tutorial CDC Shanghai 2009
 
Bai tap-prolog-da-tap-hop-9889
Bai tap-prolog-da-tap-hop-9889Bai tap-prolog-da-tap-hop-9889
Bai tap-prolog-da-tap-hop-9889
 
HMM, MEMM, CRF メモ
HMM, MEMM, CRF メモHMM, MEMM, CRF メモ
HMM, MEMM, CRF メモ
 
確率的推論と行動選択
確率的推論と行動選択確率的推論と行動選択
確率的推論と行動選択
 
test
testtest
test
 
2018 MUMS Fall Course - Sampling-based techniques for uncertainty propagation...
2018 MUMS Fall Course - Sampling-based techniques for uncertainty propagation...2018 MUMS Fall Course - Sampling-based techniques for uncertainty propagation...
2018 MUMS Fall Course - Sampling-based techniques for uncertainty propagation...
 
DissertationSlides169
DissertationSlides169DissertationSlides169
DissertationSlides169
 
脳の計算論 第3章「リズム活動と位相応答」
脳の計算論 第3章「リズム活動と位相応答」脳の計算論 第3章「リズム活動と位相応答」
脳の計算論 第3章「リズム活動と位相応答」
 
A derivation of the sampling formulas for An Entity-Topic Model for Entity Li...
A derivation of the sampling formulas for An Entity-Topic Model for Entity Li...A derivation of the sampling formulas for An Entity-Topic Model for Entity Li...
A derivation of the sampling formulas for An Entity-Topic Model for Entity Li...
 
Hidden Markov Models common probability formulas
Hidden Markov Models common probability formulasHidden Markov Models common probability formulas
Hidden Markov Models common probability formulas
 

More from ybenjo

Nonlinear latent factorization by embedding multiple user interests(Recsys 2013)
Nonlinear latent factorization by embedding multiple user interests(Recsys 2013)Nonlinear latent factorization by embedding multiple user interests(Recsys 2013)
Nonlinear latent factorization by embedding multiple user interests(Recsys 2013)
ybenjo
 
Predicting Cancel Users in Offline Events
Predicting Cancel Users in Offline EventsPredicting Cancel Users in Offline Events
Predicting Cancel Users in Offline Events
ybenjo
 
Overcoming browser cookie churn with clustering in wsdm2012 reading
Overcoming browser cookie churn with clustering in wsdm2012 readingOvercoming browser cookie churn with clustering in wsdm2012 reading
Overcoming browser cookie churn with clustering in wsdm2012 reading
ybenjo
 
Link prediction
Link predictionLink prediction
Link prediction
ybenjo
 
AJACS HONGO8 (mining in DBCLS)
AJACS HONGO8 (mining in DBCLS)AJACS HONGO8 (mining in DBCLS)
AJACS HONGO8 (mining in DBCLS)
ybenjo
 

More from ybenjo (16)

Modeling intransitivity in matchup and comparison data (WSDM 2016)
Modeling intransitivity in matchup and comparison data (WSDM 2016)Modeling intransitivity in matchup and comparison data (WSDM 2016)
Modeling intransitivity in matchup and comparison data (WSDM 2016)
 
Nonlinear latent factorization by embedding multiple user interests(Recsys 2013)
Nonlinear latent factorization by embedding multiple user interests(Recsys 2013)Nonlinear latent factorization by embedding multiple user interests(Recsys 2013)
Nonlinear latent factorization by embedding multiple user interests(Recsys 2013)
 
Personalized next-song recommendation in online karaokes(Recsys 2013)
Personalized next-song recommendation in online karaokes(Recsys 2013)Personalized next-song recommendation in online karaokes(Recsys 2013)
Personalized next-song recommendation in online karaokes(Recsys 2013)
 
Predicting Cancel Users in Offline Events
Predicting Cancel Users in Offline EventsPredicting Cancel Users in Offline Events
Predicting Cancel Users in Offline Events
 
首都圏における帰宅困難者のモデリング 最終報告
首都圏における帰宅困難者のモデリング 最終報告首都圏における帰宅困難者のモデリング 最終報告
首都圏における帰宅困難者のモデリング 最終報告
 
首都圏における帰宅困難者のモデリング 中間報告
首都圏における帰宅困難者のモデリング 中間報告首都圏における帰宅困難者のモデリング 中間報告
首都圏における帰宅困難者のモデリング 中間報告
 
Topic Model Survey (wsdm2012)
Topic Model Survey (wsdm2012)Topic Model Survey (wsdm2012)
Topic Model Survey (wsdm2012)
 
Overcoming browser cookie churn with clustering in wsdm2012 reading
Overcoming browser cookie churn with clustering in wsdm2012 readingOvercoming browser cookie churn with clustering in wsdm2012 reading
Overcoming browser cookie churn with clustering in wsdm2012 reading
 
Link prediction
Link predictionLink prediction
Link prediction
 
anohana
anohanaanohana
anohana
 
AJACS HONGO8 (mining in DBCLS)
AJACS HONGO8 (mining in DBCLS)AJACS HONGO8 (mining in DBCLS)
AJACS HONGO8 (mining in DBCLS)
 
patent analysis(LDA) and spotfire
patent analysis(LDA) and spotfirepatent analysis(LDA) and spotfire
patent analysis(LDA) and spotfire
 
useR!2010 matome
useR!2010 matomeuseR!2010 matome
useR!2010 matome
 
AJACS17
AJACS17AJACS17
AJACS17
 
R's anti sparseness
R's anti sparsenessR's anti sparseness
R's anti sparseness
 
とあるサイトの禁書目録(アクセスログ)
とあるサイトの禁書目録(アクセスログ)とあるサイトの禁書目録(アクセスログ)
とあるサイトの禁書目録(アクセスログ)
 

Recently uploaded

Modular Monolith - a Practical Alternative to Microservices @ Devoxx UK 2024
Modular Monolith - a Practical Alternative to Microservices @ Devoxx UK 2024Modular Monolith - a Practical Alternative to Microservices @ Devoxx UK 2024
Modular Monolith - a Practical Alternative to Microservices @ Devoxx UK 2024
Victor Rentea
 
Cloud Frontiers: A Deep Dive into Serverless Spatial Data and FME
Cloud Frontiers:  A Deep Dive into Serverless Spatial Data and FMECloud Frontiers:  A Deep Dive into Serverless Spatial Data and FME
Cloud Frontiers: A Deep Dive into Serverless Spatial Data and FME
Safe Software
 

Recently uploaded (20)

ICT role in 21st century education and its challenges
ICT role in 21st century education and its challengesICT role in 21st century education and its challenges
ICT role in 21st century education and its challenges
 
Strategies for Landing an Oracle DBA Job as a Fresher
Strategies for Landing an Oracle DBA Job as a FresherStrategies for Landing an Oracle DBA Job as a Fresher
Strategies for Landing an Oracle DBA Job as a Fresher
 
Exploring Multimodal Embeddings with Milvus
Exploring Multimodal Embeddings with MilvusExploring Multimodal Embeddings with Milvus
Exploring Multimodal Embeddings with Milvus
 
Elevate Developer Efficiency & build GenAI Application with Amazon Q​
Elevate Developer Efficiency & build GenAI Application with Amazon Q​Elevate Developer Efficiency & build GenAI Application with Amazon Q​
Elevate Developer Efficiency & build GenAI Application with Amazon Q​
 
Modular Monolith - a Practical Alternative to Microservices @ Devoxx UK 2024
Modular Monolith - a Practical Alternative to Microservices @ Devoxx UK 2024Modular Monolith - a Practical Alternative to Microservices @ Devoxx UK 2024
Modular Monolith - a Practical Alternative to Microservices @ Devoxx UK 2024
 
FWD Group - Insurer Innovation Award 2024
FWD Group - Insurer Innovation Award 2024FWD Group - Insurer Innovation Award 2024
FWD Group - Insurer Innovation Award 2024
 
Apidays New York 2024 - Scaling API-first by Ian Reasor and Radu Cotescu, Adobe
Apidays New York 2024 - Scaling API-first by Ian Reasor and Radu Cotescu, AdobeApidays New York 2024 - Scaling API-first by Ian Reasor and Radu Cotescu, Adobe
Apidays New York 2024 - Scaling API-first by Ian Reasor and Radu Cotescu, Adobe
 
How to Troubleshoot Apps for the Modern Connected Worker
How to Troubleshoot Apps for the Modern Connected WorkerHow to Troubleshoot Apps for the Modern Connected Worker
How to Troubleshoot Apps for the Modern Connected Worker
 
Six Myths about Ontologies: The Basics of Formal Ontology
Six Myths about Ontologies: The Basics of Formal OntologySix Myths about Ontologies: The Basics of Formal Ontology
Six Myths about Ontologies: The Basics of Formal Ontology
 
Apidays New York 2024 - The value of a flexible API Management solution for O...
Apidays New York 2024 - The value of a flexible API Management solution for O...Apidays New York 2024 - The value of a flexible API Management solution for O...
Apidays New York 2024 - The value of a flexible API Management solution for O...
 
Cloud Frontiers: A Deep Dive into Serverless Spatial Data and FME
Cloud Frontiers:  A Deep Dive into Serverless Spatial Data and FMECloud Frontiers:  A Deep Dive into Serverless Spatial Data and FME
Cloud Frontiers: A Deep Dive into Serverless Spatial Data and FME
 
Mcleodganj Call Girls 🥰 8617370543 Service Offer VIP Hot Model
Mcleodganj Call Girls 🥰 8617370543 Service Offer VIP Hot ModelMcleodganj Call Girls 🥰 8617370543 Service Offer VIP Hot Model
Mcleodganj Call Girls 🥰 8617370543 Service Offer VIP Hot Model
 
WSO2's API Vision: Unifying Control, Empowering Developers
WSO2's API Vision: Unifying Control, Empowering DevelopersWSO2's API Vision: Unifying Control, Empowering Developers
WSO2's API Vision: Unifying Control, Empowering Developers
 
MINDCTI Revenue Release Quarter One 2024
MINDCTI Revenue Release Quarter One 2024MINDCTI Revenue Release Quarter One 2024
MINDCTI Revenue Release Quarter One 2024
 
Navigating the Deluge_ Dubai Floods and the Resilience of Dubai International...
Navigating the Deluge_ Dubai Floods and the Resilience of Dubai International...Navigating the Deluge_ Dubai Floods and the Resilience of Dubai International...
Navigating the Deluge_ Dubai Floods and the Resilience of Dubai International...
 
Apidays New York 2024 - The Good, the Bad and the Governed by David O'Neill, ...
Apidays New York 2024 - The Good, the Bad and the Governed by David O'Neill, ...Apidays New York 2024 - The Good, the Bad and the Governed by David O'Neill, ...
Apidays New York 2024 - The Good, the Bad and the Governed by David O'Neill, ...
 
Apidays New York 2024 - APIs in 2030: The Risk of Technological Sleepwalk by ...
Apidays New York 2024 - APIs in 2030: The Risk of Technological Sleepwalk by ...Apidays New York 2024 - APIs in 2030: The Risk of Technological Sleepwalk by ...
Apidays New York 2024 - APIs in 2030: The Risk of Technological Sleepwalk by ...
 
Corporate and higher education May webinar.pptx
Corporate and higher education May webinar.pptxCorporate and higher education May webinar.pptx
Corporate and higher education May webinar.pptx
 
DEV meet-up UiPath Document Understanding May 7 2024 Amsterdam
DEV meet-up UiPath Document Understanding May 7 2024 AmsterdamDEV meet-up UiPath Document Understanding May 7 2024 Amsterdam
DEV meet-up UiPath Document Understanding May 7 2024 Amsterdam
 
ProductAnonymous-April2024-WinProductDiscovery-MelissaKlemke
ProductAnonymous-April2024-WinProductDiscovery-MelissaKlemkeProductAnonymous-April2024-WinProductDiscovery-MelissaKlemke
ProductAnonymous-April2024-WinProductDiscovery-MelissaKlemke
 

Query Suggestion @ tokyotextmining#2

  • 1.
  • 3.
  • 4.
  • 5.
  • 6.
  • 7.
  • 8.
  • 9.
  • 10.
  • 11.
  • 12.
  • 13.
  • 14.
  • 15.
  • 16.
  • 17. Suggestion Reformulation http://www.london-eating.co.uk/newsletter/2006/may/images/wine.jpg
  • 18. Teaching Math or Something / foundphotoslj
  • 19.
  • 20.
  • 22. • Mei Q, Zhou D, Church K. Query suggestion using hitting time. Proceeding of the 17th ACM conference on Information and knowledge mining - CIKM '08. 2008:469. • Herdagdelen A, Ciaramita M, Mahler D, et al. Generalized syntactic and semantic models of query reformulation. In: Proceedings of the 33rd ACM SIGIR Conference, Geneva, Switzerland.; 2010.
  • 23. Query suggestion using hitting time (CIKM 2008)
  • 24.
  • 28. V1 W V2
  • 29. P V1 W V2 w(i, j) pij = di di = w(i, j) j∈V2 30 p11 = 52 15 p12 = 52 7 p13 = 52
  • 30.
  • 31. V1 V1 V2 V1 w(i, k) w(k, j) pij = di dk k∈V2 = pik pkj k∈V2
  • 32.
  • 33. A V Xt t TA A T A = min{t : Xt ∈ A, t ≥ 0}
  • 34. i P [T A = m|X0 = i] = P [X1 = j|X0 = i] j∈V ·P [T A = m − 1|X0 = j] = pij P [T A = m − 1|X0 = j] j∈V TA = m m-1 A
  • 35. A X0 = i TA hi ∞ A hi = mP [T A = m|X0 = i] m=1 ∞ = m pij P [T A = m − 1|X0 = j] m=1 j∈V ∞ = (m − 1)pij P [T A = m − 1|X0 = j] j∈V m=1 ∞ + pij P [T A = m − 1|X0 = j] j∈V m=1
  • 36. (m − 1)pij P [T A = m − 1|X0 = j] j∈V m=1 ∞ = npij P [T A = n|X0 = j] j∈V n=1 = A pij hj j∈V
  • 37. P [T A = m − 1|X0 = j] = 1 m=1 ∞ pij P [T A = m − 1|X0 = j] = pij = 1 j∈V m=1 j∈V A hi = A pij hj +1 A hi = 0, f or i ∈ A j∈V
  • 38. w(i, k) w(k, j) pij = di dk k∈V2 hi (t + 1) = pij hj (t) + 1, hi (0) = 0 j=s
  • 40.
  • 41.
  • 42.
  • 43.
  • 44.
  • 45.
  • 47. c(QT , U RL, U ser) p(QT |U RL, U ser) = Q c(Q, U RL, U ser) p(U RL|Q, U ser) ˆ
  • 48. p(U RL|QT , U ser)p(QT |U ser) ˆ p(QT |U RL, U ser) = p(U RL|U ser) p(QT |U RL, U ser) k=j wik wij = 1 − p(QT |U RL, U ser) ˆ p 4 p(U RL|Q, IP ) = ˆ λi p(U RL|Q, IPi ) i=0
  • 49.
  • 50.
  • 51.
  • 52.
  • 53. Generalized syntactic and semantic models of query reformulation (SIGIR 2010)
  • 54.
  • 56.
  • 57. p(x, y) P M I(x, y) = log p(x)p(y) P M I(x, y) P M I(J)(x, y) = − log p(x, y) P M I(x, y) P M I(S)(x, y) = − log p(x) P M I(x, y) P M I(G)(x, y) = − log(p(y))
  • 60. Ns Nt Ns,t p(qs ) = , p(qt ) = , p(qs , qt ) = N N N P M IW eb (qs , qt )
  • 61. dA (x, y) ∀a, b ∈ T, cE1 (a, b) = 1 if a = b ∀a, b ∈ T, cE2 (a, b) = dA (a, b) if a = N U LL||b = N U LL
  • 62.
  • 63. s(wi , wj ) = 2 − 2f (wi , wj ) + (wi , wj ) ∀a, b ∈ T, cGE (a, b) = s(a, b) if a = N U LL||b = N U LL
  • 64. qs = qs qt , qt = qt qs  1  if wi = wj ∧ wi ∈ qs ∧ wj ∈ qt ni,j (qs , qt ) = 1 if wi ∈ qs ∧ wj ∈ qt  (|qs ||qt |)  0 otherwise Ni,j = ni,j (qs , qt ) qs ,qt
  • 65. Ni,· = Ni,j , N·, = Ni,j , N = Ni,j j i i,j Ni,· N·,j Ni,j P (i, ·) = , P (·, j) = , P (i, j) = N N N
  • 66.
  • 67. ∀xi S(yj |xi ) = 1, S(λ|ξ) = 0 yj ∈T ∪{λ}
  • 68. m n+z G(z)n!z! p(y|x) = S(yk , xk ) (n + z)! z=max(0,m−n) x y k=1
  • 69.
  • 71.
  • 72.
  • 73.
  • 74. Similarity Spearman NN 0.500 GenEdit(G) 0.380 Oommen-Kashyap 0.470 GenEdit(J) 0.365 DistSim 0.438 SortedEdit2 0.320 Mean all 0.435 SortedEdit1 0.314 SortedGenEdit(S) 0.429 PMIWeb(G) 0.283 SortedGenEdit(G) 0.428 Edit2 0.270 PMIWeb(S) 0.417 Edit1 0.252 PMIWeb(J) 0.409 Length-target(Char) 0.139 SortedGenEdit(J) 0.408 Length-target(Term) 0.112 GenEdit(S) 0.382 log-prob target -0.161
  • 75. Similarity Function Spearman Mean all 0.386 NN 0.432 PMIWeb(G) 0.369 GenEdit(G) 0.424 PMIWeb(J) 0.330 SortedGenEdit(G) 0.419 DistSim 0.322 GenEdit(S) 0.414 Edit1 0.299 SortedGenEdit(S) 0.407 SortedEdit1 0.298 GenEdit(J) 0.402 Edit2 0.292 Oommen-Kashyap 0.391 SortedEdit2 0.288 SortedGenEdit(J) 0.391 PMIWeb(S) 0.264 log-prob target 0.114 Length- -0.036 target(Char) Length- -0.077 target(Term)
  • 76. Similarity Measure QS1500 CC2000 Oommen-Kashyap 0.470* 0.391*(6) SortedGenEdit(S) 0.429* 0.407* (4) SortedGenEdit(G) 0.428* 0.419* (2) SortedGenEdit(J) 0.408 0.391* (7) GenEdit(S) 0.382 0.414* (3) GenEdit(G) 0.380 0.424* (1) GenEdit(J) 0.365 0.402* (5) SortedEdit2 0.320 0.288 (11) SortedEdit1 0.314 0.298 (9) Edit2 0.270 0.292 (10) Edit1 0.252 0.299 (8)
  • 77.
  • 78.
  • 80.
  • 81.

Editor's Notes