decoupled smoothing on graphs - stanford universitystanford.edu/~jugander/papers/decoupled smoothing...
TRANSCRIPT
![Page 1: Decoupled smoothing on graphs - Stanford Universitystanford.edu/~jugander/papers/Decoupled smoothing on graphs Alex Chin, Yatong Chen, Kristen M. Altenburger, Johan Ugander Stanford](https://reader033.vdocuments.us/reader033/viewer/2022060708/6074b76e52b8ed65565ceee7/html5/thumbnails/1.jpg)
Decoupled smoothing on graphs
Alex Chin, Yatong Chen, Kristen M. Altenburger, Johan Ugander
Stanford University
1
The Web Conference, San FranciscoMay 17, 2019
![Page 2: Decoupled smoothing on graphs - Stanford Universitystanford.edu/~jugander/papers/Decoupled smoothing on graphs Alex Chin, Yatong Chen, Kristen M. Altenburger, Johan Ugander Stanford](https://reader033.vdocuments.us/reader033/viewer/2022060708/6074b76e52b8ed65565ceee7/html5/thumbnails/2.jpg)
Attribute prediction on graphs
2
![Page 3: Decoupled smoothing on graphs - Stanford Universitystanford.edu/~jugander/papers/Decoupled smoothing on graphs Alex Chin, Yatong Chen, Kristen M. Altenburger, Johan Ugander Stanford](https://reader033.vdocuments.us/reader033/viewer/2022060708/6074b76e52b8ed65565ceee7/html5/thumbnails/3.jpg)
Attribute prediction on graphsGiven:
● Social Network
3Yatong Chen, Stanford University, WWW 2019
![Page 4: Decoupled smoothing on graphs - Stanford Universitystanford.edu/~jugander/papers/Decoupled smoothing on graphs Alex Chin, Yatong Chen, Kristen M. Altenburger, Johan Ugander Stanford](https://reader033.vdocuments.us/reader033/viewer/2022060708/6074b76e52b8ed65565ceee7/html5/thumbnails/4.jpg)
Attribute prediction on graphsGiven:
● Social Network
● Labels for some subset nodes
Male
Female
4Yatong Chen, Stanford University, WWW 2019
![Page 5: Decoupled smoothing on graphs - Stanford Universitystanford.edu/~jugander/papers/Decoupled smoothing on graphs Alex Chin, Yatong Chen, Kristen M. Altenburger, Johan Ugander Stanford](https://reader033.vdocuments.us/reader033/viewer/2022060708/6074b76e52b8ed65565ceee7/html5/thumbnails/5.jpg)
Given:
● Social Network
● Labels for some subset nodes
Goal:
● Infer labels for unlabeled nodes
Attribute prediction on graphs
Male
Female ?
?
?
5Yatong Chen, Stanford University, WWW 2019
![Page 6: Decoupled smoothing on graphs - Stanford Universitystanford.edu/~jugander/papers/Decoupled smoothing on graphs Alex Chin, Yatong Chen, Kristen M. Altenburger, Johan Ugander Stanford](https://reader033.vdocuments.us/reader033/viewer/2022060708/6074b76e52b8ed65565ceee7/html5/thumbnails/6.jpg)
Semi-supervised learning ProblemGiven:
● Social Network
● Labels for some subset nodes
Goal:
● Infer labels for unlabeled nodes
Male
Female ?
?
?
6Yatong Chen, Stanford University, WWW 2019
![Page 7: Decoupled smoothing on graphs - Stanford Universitystanford.edu/~jugander/papers/Decoupled smoothing on graphs Alex Chin, Yatong Chen, Kristen M. Altenburger, Johan Ugander Stanford](https://reader033.vdocuments.us/reader033/viewer/2022060708/6074b76e52b8ed65565ceee7/html5/thumbnails/7.jpg)
Approaches for attribute prediction● Approach 1: Graph Smoothing based on Gaussian
Random Field [Zhu, Ghahramani, Lafferty 2003]○ Assumption: Gaussian Markov Random Field Prior on true
label of all the nodes
○ Get the Bayes estimator of on unlabeled nodes under the
GMRF prior
○ Be referred as ZGL later
![Page 8: Decoupled smoothing on graphs - Stanford Universitystanford.edu/~jugander/papers/Decoupled smoothing on graphs Alex Chin, Yatong Chen, Kristen M. Altenburger, Johan Ugander Stanford](https://reader033.vdocuments.us/reader033/viewer/2022060708/6074b76e52b8ed65565ceee7/html5/thumbnails/8.jpg)
Approaches for attribute prediction● Approach 2: LINK classification [Lu-Getoor 2003]
○ Learn a function F:
F(row i in adjacency matrix) = i’s label
○ Example F: regularized logistic regression
8
?[1,0,...0,1]
[0,1, ...0,1]
?[1,0,...0,1]
[0,1, ...0,1]
[0,0,..,0,1][0,0,..,0,1]
Labeled
Labeled
regularizedlogistic
regression
![Page 9: Decoupled smoothing on graphs - Stanford Universitystanford.edu/~jugander/papers/Decoupled smoothing on graphs Alex Chin, Yatong Chen, Kristen M. Altenburger, Johan Ugander Stanford](https://reader033.vdocuments.us/reader033/viewer/2022060708/6074b76e52b8ed65565ceee7/html5/thumbnails/9.jpg)
ZGL’s assumption: Homophily
● Homophily [one-hop similarity]:○ Individuals are similar to their friends
9Yatong Chen, Stanford University, WWW 2019
![Page 10: Decoupled smoothing on graphs - Stanford Universitystanford.edu/~jugander/papers/Decoupled smoothing on graphs Alex Chin, Yatong Chen, Kristen M. Altenburger, Johan Ugander Stanford](https://reader033.vdocuments.us/reader033/viewer/2022060708/6074b76e52b8ed65565ceee7/html5/thumbnails/10.jpg)
ZGL’s assumption: Homophily
● Homophily [one-hop similarity]:○ ZGL assumes information of a given node decays
smoothly across the topology of the graph (by imposing the GMRF prior)
1010
? ? ?? ? ? ?
Labeled Labeled
smooth!
![Page 11: Decoupled smoothing on graphs - Stanford Universitystanford.edu/~jugander/papers/Decoupled smoothing on graphs Alex Chin, Yatong Chen, Kristen M. Altenburger, Johan Ugander Stanford](https://reader033.vdocuments.us/reader033/viewer/2022060708/6074b76e52b8ed65565ceee7/html5/thumbnails/11.jpg)
Homophily Assumption: NOT always necessary!
● [Altenburger-Ugander 2018]:○ LINK does well even without assuming homophily○ Homophily assumption is not necessary for
inference to succeed● ...but ZGL and a lot of other graph smoothing methods
all assumes homophily. Can we do graph smoothing without it? ○ Yes (this talk)
11Yatong Chen, Stanford University, WWW 2019
![Page 12: Decoupled smoothing on graphs - Stanford Universitystanford.edu/~jugander/papers/Decoupled smoothing on graphs Alex Chin, Yatong Chen, Kristen M. Altenburger, Johan Ugander Stanford](https://reader033.vdocuments.us/reader033/viewer/2022060708/6074b76e52b8ed65565ceee7/html5/thumbnails/12.jpg)
● Gender example:
12
MaleFemale
Yatong Chen, Stanford University, WWW 2019
A situation where Homophily assumption fails
![Page 13: Decoupled smoothing on graphs - Stanford Universitystanford.edu/~jugander/papers/Decoupled smoothing on graphs Alex Chin, Yatong Chen, Kristen M. Altenburger, Johan Ugander Stanford](https://reader033.vdocuments.us/reader033/viewer/2022060708/6074b76e52b8ed65565ceee7/html5/thumbnails/13.jpg)
A situation where Homophily assumption fails
● Gender example:○ Want to predict the gender of the center node
13
MaleFemale
Yatong Chen, Stanford University, WWW 2019
?
![Page 14: Decoupled smoothing on graphs - Stanford Universitystanford.edu/~jugander/papers/Decoupled smoothing on graphs Alex Chin, Yatong Chen, Kristen M. Altenburger, Johan Ugander Stanford](https://reader033.vdocuments.us/reader033/viewer/2022060708/6074b76e52b8ed65565ceee7/html5/thumbnails/14.jpg)
A situation where Homophily assumption fails
● Gender example:○ Want to predict the gender of the center node:
■ Assume Homophily (1-hop majority vote): false
14
MaleFemale
Yatong Chen, Stanford University, WWW 2019
? ?
![Page 15: Decoupled smoothing on graphs - Stanford Universitystanford.edu/~jugander/papers/Decoupled smoothing on graphs Alex Chin, Yatong Chen, Kristen M. Altenburger, Johan Ugander Stanford](https://reader033.vdocuments.us/reader033/viewer/2022060708/6074b76e52b8ed65565ceee7/html5/thumbnails/15.jpg)
A situation where Homophily assumption fails
● Observation: there are difference between one’s
identity and preference
15
Identity: malePreference: female
MaleFemale
Yatong Chen, Stanford University, WWW 2019
![Page 16: Decoupled smoothing on graphs - Stanford Universitystanford.edu/~jugander/papers/Decoupled smoothing on graphs Alex Chin, Yatong Chen, Kristen M. Altenburger, Johan Ugander Stanford](https://reader033.vdocuments.us/reader033/viewer/2022060708/6074b76e52b8ed65565ceee7/html5/thumbnails/16.jpg)
Decoupled smoothing Method
16
![Page 17: Decoupled smoothing on graphs - Stanford Universitystanford.edu/~jugander/papers/Decoupled smoothing on graphs Alex Chin, Yatong Chen, Kristen M. Altenburger, Johan Ugander Stanford](https://reader033.vdocuments.us/reader033/viewer/2022060708/6074b76e52b8ed65565ceee7/html5/thumbnails/17.jpg)
Decoupled smoothing: idea● Idea: decoupling one’s “identity” and “preference”
● Use separate parameters to model them accordingly!
17
Identity: malePreference: female
MaleFemale
Without homophily (or heterophily) assumption
Yatong Chen, Stanford University, WWW 2019
![Page 18: Decoupled smoothing on graphs - Stanford Universitystanford.edu/~jugander/papers/Decoupled smoothing on graphs Alex Chin, Yatong Chen, Kristen M. Altenburger, Johan Ugander Stanford](https://reader033.vdocuments.us/reader033/viewer/2022060708/6074b76e52b8ed65565ceee7/html5/thumbnails/18.jpg)
Decoupled smoothing: idea● Idea: decoupling one’s “identity” and “preference”
18Yatong Chen, Stanford University, WWW 2019
![Page 19: Decoupled smoothing on graphs - Stanford Universitystanford.edu/~jugander/papers/Decoupled smoothing on graphs Alex Chin, Yatong Chen, Kristen M. Altenburger, Johan Ugander Stanford](https://reader033.vdocuments.us/reader033/viewer/2022060708/6074b76e52b8ed65565ceee7/html5/thumbnails/19.jpg)
Decoupled smoothing: idea● Idea: decoupling one’s “identity” and “preference”
● Intuition: a person’s identity will reveal information about their friend’s preference, and vice versa
identity preference
19
![Page 20: Decoupled smoothing on graphs - Stanford Universitystanford.edu/~jugander/papers/Decoupled smoothing on graphs Alex Chin, Yatong Chen, Kristen M. Altenburger, Johan Ugander Stanford](https://reader033.vdocuments.us/reader033/viewer/2022060708/6074b76e52b8ed65565ceee7/html5/thumbnails/20.jpg)
Decoupled smoothing: idea● Idea: decoupling one’s “identity” and “preference”
● Intuition: a person’s identity will reveal information about their friend’s preference, and vice versa
identity preference: can’t observe, how to reveal?
20
?
![Page 21: Decoupled smoothing on graphs - Stanford Universitystanford.edu/~jugander/papers/Decoupled smoothing on graphs Alex Chin, Yatong Chen, Kristen M. Altenburger, Johan Ugander Stanford](https://reader033.vdocuments.us/reader033/viewer/2022060708/6074b76e52b8ed65565ceee7/html5/thumbnails/21.jpg)
Decoupled smoothing: model● Intuition: a person’s identity will reveal information
about their friend’s preference, and vice versa● Assumption:
21Yatong Chen, Stanford University, WWW 2019
![Page 22: Decoupled smoothing on graphs - Stanford Universitystanford.edu/~jugander/papers/Decoupled smoothing on graphs Alex Chin, Yatong Chen, Kristen M. Altenburger, Johan Ugander Stanford](https://reader033.vdocuments.us/reader033/viewer/2022060708/6074b76e52b8ed65565ceee7/html5/thumbnails/22.jpg)
Decoupled smoothing: model● Intuition: a person’s identity will reveal information
about their friend’s preference, and vice versa● Assumption:
● Goal: to obtain predictions for the identity ○ the preference is nuisance!
● Get the marginal prior for : ○
22Yatong Chen, Stanford University, WWW 2019
![Page 23: Decoupled smoothing on graphs - Stanford Universitystanford.edu/~jugander/papers/Decoupled smoothing on graphs Alex Chin, Yatong Chen, Kristen M. Altenburger, Johan Ugander Stanford](https://reader033.vdocuments.us/reader033/viewer/2022060708/6074b76e52b8ed65565ceee7/html5/thumbnails/23.jpg)
How to estimate W?
23Yatong Chen, Stanford University, WWW 2019
Decoupled smoothing: impose a prior
![Page 24: Decoupled smoothing on graphs - Stanford Universitystanford.edu/~jugander/papers/Decoupled smoothing on graphs Alex Chin, Yatong Chen, Kristen M. Altenburger, Johan Ugander Stanford](https://reader033.vdocuments.us/reader033/viewer/2022060708/6074b76e52b8ed65565ceee7/html5/thumbnails/24.jpg)
How to estimate W?
● Intuition: ○ Node j’th preference will imply a 2-hop similarity between
node i and node k’s identities
24Node i
Node j Node k
?
![Page 25: Decoupled smoothing on graphs - Stanford Universitystanford.edu/~jugander/papers/Decoupled smoothing on graphs Alex Chin, Yatong Chen, Kristen M. Altenburger, Johan Ugander Stanford](https://reader033.vdocuments.us/reader033/viewer/2022060708/6074b76e52b8ed65565ceee7/html5/thumbnails/25.jpg)
How to estimate W?
● Intuition: ○ Node j’th preference will imply a 2-hop similarity between
node i and node k’s identities○ Make use of the information of k when predicting i
25Node i
Node j Node k
?
![Page 26: Decoupled smoothing on graphs - Stanford Universitystanford.edu/~jugander/papers/Decoupled smoothing on graphs Alex Chin, Yatong Chen, Kristen M. Altenburger, Johan Ugander Stanford](https://reader033.vdocuments.us/reader033/viewer/2022060708/6074b76e52b8ed65565ceee7/html5/thumbnails/26.jpg)
How to estimate W?
● Intuition: ○ Node j’th preference will imply a 2-hop similarity between
node i and node k’s identities○ Make use of the information of k when predicting i
● Assumption: ○ i’s 2-hop friend k has the distribution:
26Node i
Node j Node k
?
![Page 27: Decoupled smoothing on graphs - Stanford Universitystanford.edu/~jugander/papers/Decoupled smoothing on graphs Alex Chin, Yatong Chen, Kristen M. Altenburger, Johan Ugander Stanford](https://reader033.vdocuments.us/reader033/viewer/2022060708/6074b76e52b8ed65565ceee7/html5/thumbnails/27.jpg)
How to estimate W?
● Why as mean: ○ Similarity among i and k
● Why as variance? ○ The more friends j have→ the better its preference being
revealed → the less uncertainty about the similarity between i and k
27Node i
Node j Node k
Trust More!
![Page 28: Decoupled smoothing on graphs - Stanford Universitystanford.edu/~jugander/papers/Decoupled smoothing on graphs Alex Chin, Yatong Chen, Kristen M. Altenburger, Johan Ugander Stanford](https://reader033.vdocuments.us/reader033/viewer/2022060708/6074b76e52b8ed65565ceee7/html5/thumbnails/28.jpg)
How to estimate W?
● Assumption: ○ 2-hop friend k has the distribution○ Homogeneous standard error
● Then W can be reduced to
28
We get W!
![Page 29: Decoupled smoothing on graphs - Stanford Universitystanford.edu/~jugander/papers/Decoupled smoothing on graphs Alex Chin, Yatong Chen, Kristen M. Altenburger, Johan Ugander Stanford](https://reader033.vdocuments.us/reader033/viewer/2022060708/6074b76e52b8ed65565ceee7/html5/thumbnails/29.jpg)
Decoupled smoothing: model● Now we know everything about the marginal prior for :
○ ● Next step:
○ Compute the Bayes estimator of for unlabeled node and then make the prediction (recall ZGL)
● Done!
29Yatong Chen, Stanford University, WWW 2019
![Page 30: Decoupled smoothing on graphs - Stanford Universitystanford.edu/~jugander/papers/Decoupled smoothing on graphs Alex Chin, Yatong Chen, Kristen M. Altenburger, Johan Ugander Stanford](https://reader033.vdocuments.us/reader033/viewer/2022060708/6074b76e52b8ed65565ceee7/html5/thumbnails/30.jpg)
Relationship between Decoupled smoothing and some phenomenon/concept/method that
are related to it
30
![Page 31: Decoupled smoothing on graphs - Stanford Universitystanford.edu/~jugander/papers/Decoupled smoothing on graphs Alex Chin, Yatong Chen, Kristen M. Altenburger, Johan Ugander Stanford](https://reader033.vdocuments.us/reader033/viewer/2022060708/6074b76e52b8ed65565ceee7/html5/thumbnails/31.jpg)
Decoupled smoothing and Monophily● The phenomenon of Monophily [Altenburger-Ugander 2018]
○ Two-hop similarity: individuals are similar to their friends’
friends
○ Innovative concept compared to Homophily
31
Identity: malePreference: female
MaleFemale
![Page 32: Decoupled smoothing on graphs - Stanford Universitystanford.edu/~jugander/papers/Decoupled smoothing on graphs Alex Chin, Yatong Chen, Kristen M. Altenburger, Johan Ugander Stanford](https://reader033.vdocuments.us/reader033/viewer/2022060708/6074b76e52b8ed65565ceee7/html5/thumbnails/32.jpg)
Decoupled smoothing implies Monophily
● The phenomenon of Monophily [Altenburger-Ugander 2018]
○ Two-hop similarity:
■ similarity among the friends of a person is the result of
personal preference
○ The 2 hop similarity phenomenon is implied by our
decoupling smoothing idea!
32
Identity: malePreference: female
MaleFemale
![Page 33: Decoupled smoothing on graphs - Stanford Universitystanford.edu/~jugander/papers/Decoupled smoothing on graphs Alex Chin, Yatong Chen, Kristen M. Altenburger, Johan Ugander Stanford](https://reader033.vdocuments.us/reader033/viewer/2022060708/6074b76e52b8ed65565ceee7/html5/thumbnails/33.jpg)
Decoupled smoothing and 2-hop MV
● Decoupled smoothing reduces to iterative 2-hop majority vote (under homogeneous standard error):
33
2 hop Majority Vote (MV): Average over the labeled nodes in 2-hop friend sets
![Page 34: Decoupled smoothing on graphs - Stanford Universitystanford.edu/~jugander/papers/Decoupled smoothing on graphs Alex Chin, Yatong Chen, Kristen M. Altenburger, Johan Ugander Stanford](https://reader033.vdocuments.us/reader033/viewer/2022060708/6074b76e52b8ed65565ceee7/html5/thumbnails/34.jpg)
Decoupled smoothing and ZGL
● ZGL:● Assume Homophily● Prior:
● Matrix A:
adjacency matrix● Reduce to iteratively
1-hop majority vote update method!
34
● Decoupled smoothing:○ Don’t assume Homophily○ Prior:
○ Auxiliary matrix:
○ Reduce to iteratively 2-hop majority vote update method!
Decoupled smoothing and ZGL
![Page 35: Decoupled smoothing on graphs - Stanford Universitystanford.edu/~jugander/papers/Decoupled smoothing on graphs Alex Chin, Yatong Chen, Kristen M. Altenburger, Johan Ugander Stanford](https://reader033.vdocuments.us/reader033/viewer/2022060708/6074b76e52b8ed65565ceee7/html5/thumbnails/35.jpg)
35
Empirical Results
Yatong Chen, Stanford University, WWW 2019
![Page 36: Decoupled smoothing on graphs - Stanford Universitystanford.edu/~jugander/papers/Decoupled smoothing on graphs Alex Chin, Yatong Chen, Kristen M. Altenburger, Johan Ugander Stanford](https://reader033.vdocuments.us/reader033/viewer/2022060708/6074b76e52b8ed65565ceee7/html5/thumbnails/36.jpg)
Dataset● Facebook 100: Single-day snapshots of Facebook in
September 2005.
● Goal: gender prediction
36
School Name Number of Nodes Number of Edges
Amherst 2032 78733
Reed 962 18812
Haverford 1350 53904
Swarthmore 1517 53725
![Page 37: Decoupled smoothing on graphs - Stanford Universitystanford.edu/~jugander/papers/Decoupled smoothing on graphs Alex Chin, Yatong Chen, Kristen M. Altenburger, Johan Ugander Stanford](https://reader033.vdocuments.us/reader033/viewer/2022060708/6074b76e52b8ed65565ceee7/html5/thumbnails/37.jpg)
Decoupled smoothing: empirical result
37
Reed Swarthmore
Yatong Chen, Stanford University, WWW 2019
![Page 38: Decoupled smoothing on graphs - Stanford Universitystanford.edu/~jugander/papers/Decoupled smoothing on graphs Alex Chin, Yatong Chen, Kristen M. Altenburger, Johan Ugander Stanford](https://reader033.vdocuments.us/reader033/viewer/2022060708/6074b76e52b8ed65565ceee7/html5/thumbnails/38.jpg)
Decoupled smoothing: empirical result
38
Reed
Yatong Chen, Stanford University, WWW 2019
Swarthmore
ZGL ZGL
![Page 39: Decoupled smoothing on graphs - Stanford Universitystanford.edu/~jugander/papers/Decoupled smoothing on graphs Alex Chin, Yatong Chen, Kristen M. Altenburger, Johan Ugander Stanford](https://reader033.vdocuments.us/reader033/viewer/2022060708/6074b76e52b8ed65565ceee7/html5/thumbnails/39.jpg)
Decoupled smoothing: empirical result
39
Reed
Yatong Chen, Stanford University, WWW 2019
Swarthmore
ZGL ZGL
![Page 40: Decoupled smoothing on graphs - Stanford Universitystanford.edu/~jugander/papers/Decoupled smoothing on graphs Alex Chin, Yatong Chen, Kristen M. Altenburger, Johan Ugander Stanford](https://reader033.vdocuments.us/reader033/viewer/2022060708/6074b76e52b8ed65565ceee7/html5/thumbnails/40.jpg)
Decoupled smoothing: empirical result
40
HaverfordAmherst
Yatong Chen, Stanford University, WWW 2019
ZGL ZGL
![Page 41: Decoupled smoothing on graphs - Stanford Universitystanford.edu/~jugander/papers/Decoupled smoothing on graphs Alex Chin, Yatong Chen, Kristen M. Altenburger, Johan Ugander Stanford](https://reader033.vdocuments.us/reader033/viewer/2022060708/6074b76e52b8ed65565ceee7/html5/thumbnails/41.jpg)
Why 2-hop Majority Vote beats Decoupled Smoothing?
41
Amherst
Yatong Chen, Stanford University, WWW 2019
ZGL
![Page 42: Decoupled smoothing on graphs - Stanford Universitystanford.edu/~jugander/papers/Decoupled smoothing on graphs Alex Chin, Yatong Chen, Kristen M. Altenburger, Johan Ugander Stanford](https://reader033.vdocuments.us/reader033/viewer/2022060708/6074b76e52b8ed65565ceee7/html5/thumbnails/42.jpg)
Summary● Introduce the idea of decoupling one’s “identity”
and “preference”● Justify/explain the phenomenon of 2-hop similarity
without assuming homophily● Open questions:
○ How to choose the weighted matrix W?○ Why 2-hop Majority Vote outperforms decoupled
smoothing: can you do better?
42Yatong Chen, Stanford University, WWW 2019
![Page 43: Decoupled smoothing on graphs - Stanford Universitystanford.edu/~jugander/papers/Decoupled smoothing on graphs Alex Chin, Yatong Chen, Kristen M. Altenburger, Johan Ugander Stanford](https://reader033.vdocuments.us/reader033/viewer/2022060708/6074b76e52b8ed65565ceee7/html5/thumbnails/43.jpg)
Questions?
43
![Page 44: Decoupled smoothing on graphs - Stanford Universitystanford.edu/~jugander/papers/Decoupled smoothing on graphs Alex Chin, Yatong Chen, Kristen M. Altenburger, Johan Ugander Stanford](https://reader033.vdocuments.us/reader033/viewer/2022060708/6074b76e52b8ed65565ceee7/html5/thumbnails/44.jpg)
Thank you for your attention!
44