forked from SleepyBag/Statistical-Learning-Methods
-
Notifications
You must be signed in to change notification settings - Fork 0
/
LSA.py
47 lines (44 loc) · 1.62 KB
/
LSA.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
import numpy as np
import sys
import os
from pathlib import Path
sys.path.append(str(Path(os.path.abspath(__file__)).parent.parent))
from utils import *
def lsa(word_text, k=5, max_iteration=1000):
"""
given a word-text matrix
the dimension of the principle component, k
optimize using the algorithm proposed by Lee and Seung
return the word-topic matrix and text-topic matrix
"""
n_word, n_text = word_text.shape
word_topic = np.random.rand(n_word, k)
topic_text = np.random.rand(k, n_text)
for i in range(max_iteration):
word_topic *= (word_text @ topic_text.T) / (word_topic @ topic_text @ topic_text.T)
topic_text *= (word_topic.T @ word_text) / (word_topic.T @ word_topic @ topic_text)
return word_topic, topic_text.T
if __name__ == '__main__':
def demonstrate(X, k, desc):
print(desc)
word_topic, text_topic = lsa(X, k=k)
print("The topic vectors of all the words are")
print(word_topic)
print("The topic vectors of all the texts are")
print(text_topic)
print("The recovered word-text matrix is")
print(np.round(word_topic @ text_topic.T))
X = np.array([
[0, 0, 1, 1, 0, 0, 0, 0, 0],
[0, 0, 0, 0, 0, 1, 0, 0, 1],
[0, 1, 0, 0, 0, 0, 0, 1, 0],
[0, 0, 0, 0, 0, 0, 1, 0, 1],
[1, 0, 0, 0, 0, 1, 0, 0, 0],
[1, 1, 1, 1, 1, 1, 1, 1, 1],
[1, 0, 1, 0, 0, 0, 0, 0, 0],
[0, 0, 0, 0, 0, 0, 1, 0, 1],
[0, 0, 0, 0, 0, 2, 0, 0, 1],
[1, 0, 1, 0, 0, 0, 0, 1, 0],
[0, 0, 0, 1, 1, 0, 0, 0, 0],
]).astype(float)
demonstrate(X, 3, 'Example 1')