progress report
DESCRIPTION
Progress Report. ekker. Problem Definition. In cases such as object recognition , we can not include all possible objects for training . So transfer learning could deal with this kind of problem. - PowerPoint PPT PresentationTRANSCRIPT
![Page 1: Progress Report](https://reader036.vdocument.in/reader036/viewer/2022062501/56816207550346895dd23096/html5/thumbnails/1.jpg)
Progress Report
ekker
![Page 2: Progress Report](https://reader036.vdocument.in/reader036/viewer/2022062501/56816207550346895dd23096/html5/thumbnails/2.jpg)
Problem Definition
• In cases such as object recognition , we can not include all possible objects for training . So transfer learning could deal with this kind of problem.
• Here we divide the complete transfer learning into two steps: node(link) classification ,transfer to other domain.
![Page 3: Progress Report](https://reader036.vdocument.in/reader036/viewer/2022062501/56816207550346895dd23096/html5/thumbnails/3.jpg)
Related Solution
• Graph labeling– SNARE : A Link Analytic System for Graph Labeling
and Risk Detection,Mary McGlohon et al. KDD 2009.
• Markov Logic Network– Markov logic network ,Matthew
Richarson,PedroDomingos,Machine Learning 2006
![Page 4: Progress Report](https://reader036.vdocument.in/reader036/viewer/2022062501/56816207550346895dd23096/html5/thumbnails/4.jpg)
Overview of Graph Labeling
![Page 5: Progress Report](https://reader036.vdocument.in/reader036/viewer/2022062501/56816207550346895dd23096/html5/thumbnails/5.jpg)
Overview of Graph Labeling1.A graph G=(V,E),V is the entities, E is the interactions between them.2.Binary Class label X.3. A set of flags based on node attributes
G=(V,E)
Given:
Output:A mapping between each node and its class label.
Information about this node is inferred from its neighbors.
![Page 6: Progress Report](https://reader036.vdocument.in/reader036/viewer/2022062501/56816207550346895dd23096/html5/thumbnails/6.jpg)
Overview of Graph Labeling
G=(V,E)
Vi
Vj
Information about this node is inferred from its neighbors.
jiNk
dkicdijXx
dicij xmxxxxmd \)(
)(),()()(
Upon convergence , belief scores are determined by :
)(
)()()(ij vNv
cjiicci xmvkxb
Message to node i
edge potential from I to j
node i potential
![Page 7: Progress Report](https://reader036.vdocument.in/reader036/viewer/2022062501/56816207550346895dd23096/html5/thumbnails/7.jpg)
Overview of Markov Logic Network
• Using the first-order logic to capture the relation(attributes) of data .
• Using the entities(constant in predicate) and formulas build up the MLN network.
• Learn the weight of each formula .• Using MLN to inference the query probability.
![Page 8: Progress Report](https://reader036.vdocument.in/reader036/viewer/2022062501/56816207550346895dd23096/html5/thumbnails/8.jpg)
Overview of Markov Logic Network
)()(),(,)()(
ySmokesxSmokesyxFriendsyxxCancerxSmokesx
Cancer(A)
Smokes(A)Friends(A,A)
Friends(B,A)
Smokes(B)
Friends(A,B)
Cancer(B)
Friends(B,B)
Two constants: Anna (A) and Bob (B)Constants
1.15.1
Weights
1.
2.
3.
4. Using MLN to inference query , such as P(Smokes(A)=>Cancer(A)|MLN)
![Page 9: Progress Report](https://reader036.vdocument.in/reader036/viewer/2022062501/56816207550346895dd23096/html5/thumbnails/9.jpg)
Ideas
• But for MLN using the weight and first order to capture the characteristic of data.
• Could we extend the graph labeling method with more generality.– In real data , the relation between nodes is not
only one type and the node type is node only binary ,too. => How to do graph labeling on heterogeneous network.
![Page 10: Progress Report](https://reader036.vdocument.in/reader036/viewer/2022062501/56816207550346895dd23096/html5/thumbnails/10.jpg)
Recommendation over a heterogeneous Social Network
• Recommendation over a heterogeneous Social Network,Jin Zhang,Jie,Tang, et al. , WAIM08
• This papers goal is to investigated the recommendation system on a general heterogeneous Web social network.– Browsing : do recommendation s when a person is
browsing one object– Search : do recommendation of different types of
object when a person searches for one type of object by query.
![Page 11: Progress Report](https://reader036.vdocument.in/reader036/viewer/2022062501/56816207550346895dd23096/html5/thumbnails/11.jpg)
Approach
• Global importance estimation.– Similar to PageRank.– Concerned with a homogenous graph.
![Page 12: Progress Report](https://reader036.vdocument.in/reader036/viewer/2022062501/56816207550346895dd23096/html5/thumbnails/12.jpg)
Pair-wise learning Algorithm
Build up a transition graph of the homogenous graph.
![Page 13: Progress Report](https://reader036.vdocument.in/reader036/viewer/2022062501/56816207550346895dd23096/html5/thumbnails/13.jpg)
Pair-wise learning Algorithm
• Build up a transition matrix between each pair of two types of nodes.– For example, in the previous figure , we may have
13 transition matrixes.• Then it can using the transition probability and
the transition matrix to compute the score.– But for compute the score we need to compute
the transition probability.
![Page 14: Progress Report](https://reader036.vdocument.in/reader036/viewer/2022062501/56816207550346895dd23096/html5/thumbnails/14.jpg)
Pair-wise learning Algorithm
• To learn the transition probability λ.– Using the training data A ={(i,j)} the selected pair
of object of the same type which important score of i larger than j.
– Try to make the importance score in random walk algorithm as in training data.