Difference between revisions of "Correlational Learning"
From Cohen Courses
Jump to navigationJump to search (Created page with 'The singular value decomposition of user-tag network M is given by <math>M= U\Sigma V^{T}</math>, where columns of U and V are the left and right singular vectors and <math>\Sigm…') |
(No difference)
|
Latest revision as of 13:22, 3 April 2011
The singular value decomposition of user-tag network M is given by , where columns of U and V are the left and right singular vectors and is the diagonal matrix whose elements are singular values.
So we can get
where and , Parameter α (0 ≤ α ≤ 1) controls the weights of users and tags. Considering the balance between user similarity and tag similarity, α is set to 0.5.