Spaces:
Runtime error
Runtime error
Upload 11 files
Browse files- .gitignore +132 -0
- Functionalities/KeywordAdgroupPredict.py +67 -0
- Functionalities/NLP_Helper.py +107 -0
- Functionalities/Streamlit_helpers.py +83 -0
- Functionalities/TopicClustering.py +50 -0
- LICENSE +674 -0
- README.md +11 -11
- app.py +11 -0
- pages/1_New Keyword Ad grouper.py +105 -0
- pages/2_Topic_Cluster.py +98 -0
- requirements.txt +103 -0
.gitignore
ADDED
@@ -0,0 +1,132 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
1 |
+
# Byte-compiled / optimized / DLL files
|
2 |
+
__pycache__/
|
3 |
+
*.py[cod]
|
4 |
+
*$py.class
|
5 |
+
|
6 |
+
# C extensions
|
7 |
+
*.so
|
8 |
+
|
9 |
+
# Distribution / packaging
|
10 |
+
.Python
|
11 |
+
build/
|
12 |
+
develop-eggs/
|
13 |
+
dist/
|
14 |
+
downloads/
|
15 |
+
eggs/
|
16 |
+
.eggs/
|
17 |
+
lib/
|
18 |
+
lib64/
|
19 |
+
parts/
|
20 |
+
sdist/
|
21 |
+
var/
|
22 |
+
wheels/
|
23 |
+
pip-wheel-metadata/
|
24 |
+
share/python-wheels/
|
25 |
+
*.egg-info/
|
26 |
+
.installed.cfg
|
27 |
+
*.egg
|
28 |
+
MANIFEST
|
29 |
+
|
30 |
+
# PyInstaller
|
31 |
+
# Usually these files are written by a python script from a template
|
32 |
+
# before PyInstaller builds the exe, so as to inject date/other infos into it.
|
33 |
+
*.manifest
|
34 |
+
*.spec
|
35 |
+
|
36 |
+
# Installer logs
|
37 |
+
pip-log.txt
|
38 |
+
pip-delete-this-directory.txt
|
39 |
+
|
40 |
+
# Unit test / coverage reports
|
41 |
+
htmlcov/
|
42 |
+
.tox/
|
43 |
+
.nox/
|
44 |
+
.coverage
|
45 |
+
.coverage.*
|
46 |
+
.cache
|
47 |
+
nosetests.xml
|
48 |
+
coverage.xml
|
49 |
+
*.cover
|
50 |
+
*.py,cover
|
51 |
+
.hypothesis/
|
52 |
+
.pytest_cache/
|
53 |
+
|
54 |
+
# Translations
|
55 |
+
*.mo
|
56 |
+
*.pot
|
57 |
+
|
58 |
+
# Django stuff:
|
59 |
+
*.log
|
60 |
+
local_settings.py
|
61 |
+
db.sqlite3
|
62 |
+
db.sqlite3-journal
|
63 |
+
|
64 |
+
# Flask stuff:
|
65 |
+
instance/
|
66 |
+
.webassets-cache
|
67 |
+
|
68 |
+
# Scrapy stuff:
|
69 |
+
.scrapy
|
70 |
+
|
71 |
+
# Sphinx documentation
|
72 |
+
docs/_build/
|
73 |
+
|
74 |
+
# PyBuilder
|
75 |
+
target/
|
76 |
+
|
77 |
+
# Jupyter Notebook
|
78 |
+
.ipynb_checkpoints
|
79 |
+
|
80 |
+
# IPython
|
81 |
+
profile_default/
|
82 |
+
ipython_config.py
|
83 |
+
|
84 |
+
# pyenv
|
85 |
+
.python-version
|
86 |
+
|
87 |
+
# pipenv
|
88 |
+
# According to pypa/pipenv#598, it is recommended to include Pipfile.lock in version control.
|
89 |
+
# However, in case of collaboration, if having platform-specific dependencies or dependencies
|
90 |
+
# having no cross-platform support, pipenv may install dependencies that don't work, or not
|
91 |
+
# install all needed dependencies.
|
92 |
+
#Pipfile.lock
|
93 |
+
|
94 |
+
# PEP 582; used by e.g. github.com/David-OConnor/pyflow
|
95 |
+
__pypackages__/
|
96 |
+
|
97 |
+
# Celery stuff
|
98 |
+
celerybeat-schedule
|
99 |
+
celerybeat.pid
|
100 |
+
|
101 |
+
# SageMath parsed files
|
102 |
+
*.sage.py
|
103 |
+
|
104 |
+
# Environments
|
105 |
+
.env
|
106 |
+
.venv
|
107 |
+
env/
|
108 |
+
venv/
|
109 |
+
ENV/
|
110 |
+
env.bak/
|
111 |
+
venv.bak/
|
112 |
+
|
113 |
+
# Spyder project settings
|
114 |
+
.spyderproject
|
115 |
+
.spyproject
|
116 |
+
|
117 |
+
# Rope project settings
|
118 |
+
.ropeproject
|
119 |
+
|
120 |
+
# mkdocs documentation
|
121 |
+
/site
|
122 |
+
|
123 |
+
# mypy
|
124 |
+
.mypy_cache/
|
125 |
+
.dmypy.json
|
126 |
+
dmypy.json
|
127 |
+
|
128 |
+
# Pyre type checker
|
129 |
+
.pyre/
|
130 |
+
|
131 |
+
# jetbrains
|
132 |
+
.idea/
|
Functionalities/KeywordAdgroupPredict.py
ADDED
@@ -0,0 +1,67 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
1 |
+
import numpy as np
|
2 |
+
import pandas as pd
|
3 |
+
|
4 |
+
from Functionalities import NLP_Helper
|
5 |
+
|
6 |
+
|
7 |
+
class KeywordAdgroupPredict:
|
8 |
+
|
9 |
+
def predict_ad_group_for_keywords(self, candidate_kw_df, cur_kw_df, features, new_kw_col,
|
10 |
+
cur_kw_col, cur_adg_col, cur_camp_col, extra_stopwords=['_']) -> pd.DataFrame:
|
11 |
+
"""
|
12 |
+
predicts ad group from current keyword and their ad groups
|
13 |
+
:param candidate_kw_df: keywords dataframe that we want to predict ad groups for
|
14 |
+
:param cur_kw_df: keywords details dataframe from current campaign
|
15 |
+
:param features: features/columns to use for finding relevancy
|
16 |
+
:param new_kw_col: the column in candidate_kw_df which holds the keywords
|
17 |
+
:param cur_kw_col: the column in cur_kw_df which holds the keywords
|
18 |
+
:param cur_adg_col: the column in cur_kw_df which holds the corresponding ad groups
|
19 |
+
:param cur_camp_col: the column in cur_kw_df which holds the corresponding campaigns
|
20 |
+
:param extra_stopwords: any extra terms that we want to avoid while finding relevancy
|
21 |
+
:return: dataframe similar to candidate_kw_df with two extra columns ['Recommended Ad group', 'relevance score']
|
22 |
+
"""
|
23 |
+
output_cols = list(candidate_kw_df.columns) + ['Recommended Ad group', 'relevance score']
|
24 |
+
|
25 |
+
sentence_model = NLP_Helper.get_embedding_model()
|
26 |
+
|
27 |
+
cur_kw_df = cur_kw_df[[cur_kw_col, cur_adg_col, cur_camp_col]]
|
28 |
+
|
29 |
+
# cleanup
|
30 |
+
cur_kw_df[cur_kw_col].replace('[\[\]\"\']', '', regex=True, inplace=True)
|
31 |
+
|
32 |
+
# joining features per ad group to one column, for vectorization step
|
33 |
+
cur_kw_df = cur_kw_df.groupby([cur_camp_col, cur_adg_col]).agg(
|
34 |
+
{cur_kw_col: ', '.join}).reset_index()
|
35 |
+
cur_kw_df['Ad group contents'] = cur_kw_df[features].astype(str).agg(' ,'.join, axis=1)
|
36 |
+
|
37 |
+
NLP_Helper.remove_unnecessary_tokens_from_df(cur_kw_df, ['Ad group contents'],
|
38 |
+
extra_stopwords=extra_stopwords)
|
39 |
+
|
40 |
+
# vectorization
|
41 |
+
candidate_kw_df['Keyword vector'] = NLP_Helper.str_to_vector_list(
|
42 |
+
candidate_kw_df[new_kw_col].tolist(), sentence_model)
|
43 |
+
cur_kw_df['Ad group vector'] = NLP_Helper.str_to_vector_list(
|
44 |
+
cur_kw_df['Ad group contents'].tolist(), sentence_model)
|
45 |
+
|
46 |
+
# cosine similarity calc
|
47 |
+
cosine_sim_matrix = NLP_Helper.cosine_sim_matrix(candidate_kw_df['Keyword vector'],
|
48 |
+
cur_kw_df['Ad group vector'])
|
49 |
+
cosine_sim_max_indices = np.argmax(cosine_sim_matrix, axis=1)
|
50 |
+
cosine_sim_max_values = np.amax(cosine_sim_matrix, axis=1)
|
51 |
+
selected_ad_groups = cur_kw_df.iloc[cosine_sim_max_indices]
|
52 |
+
selected_ad_groups['relevance score'] = cosine_sim_max_values
|
53 |
+
selected_ad_groups.rename(columns={cur_adg_col: 'Recommended Ad group'}, inplace=True)
|
54 |
+
selected_ad_groups.reset_index(inplace=True)
|
55 |
+
|
56 |
+
# merge the columns
|
57 |
+
new_kw_adgroup_relevance_df = pd.concat([candidate_kw_df,
|
58 |
+
selected_ad_groups[['Recommended Ad group', 'relevance score']]],
|
59 |
+
axis=1)
|
60 |
+
|
61 |
+
new_kw_adgroup_relevance_df = new_kw_adgroup_relevance_df[list(output_cols)]
|
62 |
+
|
63 |
+
new_kw_adgroup_relevance_df['relevance score'] = new_kw_adgroup_relevance_df['relevance score'].astype(float)
|
64 |
+
new_kw_adgroup_relevance_df = new_kw_adgroup_relevance_df.sort_values(by='relevance score',
|
65 |
+
ascending=False)
|
66 |
+
|
67 |
+
return new_kw_adgroup_relevance_df
|
Functionalities/NLP_Helper.py
ADDED
@@ -0,0 +1,107 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
1 |
+
import numpy as np
|
2 |
+
from sentence_transformers import SentenceTransformer, util
|
3 |
+
from bertopic.representation import KeyBERTInspired, MaximalMarginalRelevance
|
4 |
+
import nltk
|
5 |
+
from nltk.corpus import stopwords
|
6 |
+
from nltk.tokenize import word_tokenize
|
7 |
+
import string
|
8 |
+
import re
|
9 |
+
|
10 |
+
nltk.download('stopwords')
|
11 |
+
nltk.download('punkt')
|
12 |
+
|
13 |
+
STOP_WORDS = list(stopwords.words('english'))
|
14 |
+
BERTOPIC_REPRESENTATIONS = [
|
15 |
+
"KeyBERTInspired",
|
16 |
+
"MaximalMarginalRelevance",
|
17 |
+
]
|
18 |
+
|
19 |
+
TRANSFORMERS = ["all-mpnet-base-v2", "multi-qa-mpnet-base-dot-v1"]
|
20 |
+
TRANSFORMERS_INFO = ["all-mpnet-base-v2: All-round model tuned for many use-cases. "
|
21 |
+
"Trained on a large and diverse dataset of over 1 billion training pairs",
|
22 |
+
|
23 |
+
"multi-qa-mpnet-base-dot-v1: This model was tuned for semantic search: Given a query/question, "
|
24 |
+
"if can find relevant passages. "
|
25 |
+
"It was trained on a large and diverse set of (question, answer) pairs."
|
26 |
+
]
|
27 |
+
|
28 |
+
|
29 |
+
def get_bertopic_representation(representation: str):
|
30 |
+
if representation == BERTOPIC_REPRESENTATIONS[0]:
|
31 |
+
return KeyBERTInspired()
|
32 |
+
elif representation == BERTOPIC_REPRESENTATIONS[1]:
|
33 |
+
return MaximalMarginalRelevance()
|
34 |
+
else:
|
35 |
+
return None
|
36 |
+
|
37 |
+
|
38 |
+
def tokenize_explode(df, col):
|
39 |
+
df['tokenized'] = df[col].apply(word_tokenize)
|
40 |
+
df = df.explode('tokenized')
|
41 |
+
df['tokenized'] = df['tokenized'].str.strip()
|
42 |
+
df['tokenized'] = df['tokenized'].str.lower()
|
43 |
+
|
44 |
+
return df
|
45 |
+
|
46 |
+
|
47 |
+
def cleanup_tokens(df, col):
|
48 |
+
df = df[df[col].apply(lambda x: len(x) > 2)]
|
49 |
+
df = df[~df[col].str.contains(r'^(\d+\.?\d*)$', regex=True)]
|
50 |
+
df = df[~df[col].isin([p for p in string.punctuation])]
|
51 |
+
df = df[df[col].isin(STOP_WORDS) == False]
|
52 |
+
|
53 |
+
return df
|
54 |
+
|
55 |
+
|
56 |
+
def get_embedding_model(transformer=BERTOPIC_REPRESENTATIONS[0]) -> SentenceTransformer:
|
57 |
+
"""
|
58 |
+
get given sentence transformer model
|
59 |
+
:param transformer:
|
60 |
+
:return:
|
61 |
+
"""
|
62 |
+
sentence_model = SentenceTransformer(transformer)
|
63 |
+
return sentence_model
|
64 |
+
|
65 |
+
|
66 |
+
def str_to_vector_list(text_list, sentence_model, replace_dict=None):
|
67 |
+
"""
|
68 |
+
embedding for the given text list using provided embedding model
|
69 |
+
:param text_list:
|
70 |
+
:param sentence_model:
|
71 |
+
:param replace_dict: any values in the string that we may need to replace
|
72 |
+
:return:
|
73 |
+
"""
|
74 |
+
text_list = [str(x).replace('[^\w\s]', '') for x in text_list]
|
75 |
+
if replace_dict:
|
76 |
+
for stp in replace_dict:
|
77 |
+
text_list = [str(x).replace(stp, replace_dict[stp]) for x in text_list]
|
78 |
+
|
79 |
+
embeddings = sentence_model.encode(text_list, show_progress_bar=True, batch_size=1000)
|
80 |
+
return embeddings.tolist()
|
81 |
+
|
82 |
+
|
83 |
+
def remove_unnecessary_tokens_from_df(df, columns, extra_stopwords=None) -> None:
|
84 |
+
"""
|
85 |
+
removes unnecessary token from the given columns of the dataframe
|
86 |
+
:param df:
|
87 |
+
:param columns:
|
88 |
+
:param extra_stopwords:
|
89 |
+
:return:
|
90 |
+
"""
|
91 |
+
df[columns] = df[columns].apply(lambda x: x.str.replace('[^\w\s]', ''))
|
92 |
+
|
93 |
+
if extra_stopwords:
|
94 |
+
for stp in extra_stopwords:
|
95 |
+
df[columns] = df[columns].apply(lambda x: x.str.replace(stp, ' '))
|
96 |
+
|
97 |
+
|
98 |
+
def cosine_sim_matrix(embeddings_a, embeddings_b) -> np.array:
|
99 |
+
"""
|
100 |
+
finds out cosine similarity matrix for the given embeddings
|
101 |
+
:param embeddings_a:
|
102 |
+
:param embeddings_b:
|
103 |
+
:return: numpy array showing the cosine similarity matrix
|
104 |
+
"""
|
105 |
+
return np.array(
|
106 |
+
util.pytorch_cos_sim(embeddings_a, embeddings_b)
|
107 |
+
)
|
Functionalities/Streamlit_helpers.py
ADDED
@@ -0,0 +1,83 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
1 |
+
import pandas as pd
|
2 |
+
import streamlit as st
|
3 |
+
from pandas.api.types import (
|
4 |
+
is_categorical_dtype,
|
5 |
+
is_datetime64_any_dtype,
|
6 |
+
is_numeric_dtype,
|
7 |
+
is_object_dtype,
|
8 |
+
)
|
9 |
+
|
10 |
+
|
11 |
+
def filter_dataframe(df: pd.DataFrame) -> pd.DataFrame:
|
12 |
+
"""
|
13 |
+
Adds a UI on top of a dataframe to let viewers filter columns
|
14 |
+
Args:
|
15 |
+
df (pd.DataFrame): Original dataframe
|
16 |
+
Returns:
|
17 |
+
pd.DataFrame: Filtered dataframe
|
18 |
+
"""
|
19 |
+
modify = st.checkbox("Add filters")
|
20 |
+
|
21 |
+
if not modify:
|
22 |
+
return df
|
23 |
+
|
24 |
+
df = df.copy()
|
25 |
+
|
26 |
+
# Try to convert datetimes into a standard format (datetime, no timezone)
|
27 |
+
for col in df.columns:
|
28 |
+
if is_object_dtype(df[col]):
|
29 |
+
try:
|
30 |
+
df[col] = pd.to_datetime(df[col])
|
31 |
+
except Exception:
|
32 |
+
pass
|
33 |
+
|
34 |
+
if is_datetime64_any_dtype(df[col]):
|
35 |
+
df[col] = df[col].dt.tz_localize(None)
|
36 |
+
|
37 |
+
modification_container = st.container()
|
38 |
+
|
39 |
+
with modification_container:
|
40 |
+
to_filter_columns = st.multiselect("Filter dataframe on", df.columns)
|
41 |
+
for column in to_filter_columns:
|
42 |
+
left, right = st.columns((1, 20))
|
43 |
+
left.write("↳")
|
44 |
+
# Treat columns with < 10 unique values as categorical
|
45 |
+
if is_categorical_dtype(df[column]) or df[column].nunique() < 10:
|
46 |
+
user_cat_input = right.multiselect(
|
47 |
+
f"Values for {column}",
|
48 |
+
df[column].unique(),
|
49 |
+
default=list(df[column].unique()),
|
50 |
+
)
|
51 |
+
df = df[df[column].isin(user_cat_input)]
|
52 |
+
elif is_numeric_dtype(df[column]):
|
53 |
+
_min = float(df[column].min())
|
54 |
+
_max = float(df[column].max())
|
55 |
+
step = (_max - _min) / 100
|
56 |
+
user_num_input = right.slider(
|
57 |
+
f"Values for {column}",
|
58 |
+
_min,
|
59 |
+
_max,
|
60 |
+
(_min, _max),
|
61 |
+
step=step,
|
62 |
+
)
|
63 |
+
df = df[df[column].between(*user_num_input)]
|
64 |
+
elif is_datetime64_any_dtype(df[column]):
|
65 |
+
user_date_input = right.date_input(
|
66 |
+
f"Values for {column}",
|
67 |
+
value=(
|
68 |
+
df[column].min(),
|
69 |
+
df[column].max(),
|
70 |
+
),
|
71 |
+
)
|
72 |
+
if len(user_date_input) == 2:
|
73 |
+
user_date_input = tuple(map(pd.to_datetime, user_date_input))
|
74 |
+
start_date, end_date = user_date_input
|
75 |
+
df = df.loc[df[column].between(start_date, end_date)]
|
76 |
+
else:
|
77 |
+
user_text_input = right.text_input(
|
78 |
+
f"Substring or regex in {column}",
|
79 |
+
)
|
80 |
+
if user_text_input:
|
81 |
+
df = df[df[column].str.contains(user_text_input)]
|
82 |
+
|
83 |
+
return df
|
Functionalities/TopicClustering.py
ADDED
@@ -0,0 +1,50 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
1 |
+
import pandas as pd
|
2 |
+
from sentence_transformers import SentenceTransformer
|
3 |
+
from bertopic import BERTopic
|
4 |
+
from umap import UMAP
|
5 |
+
from Functionalities import NLP_Helper
|
6 |
+
# Visualization
|
7 |
+
import plotly.graph_objects as go
|
8 |
+
|
9 |
+
|
10 |
+
class TopicClustering:
|
11 |
+
def __init__(self, keyword_df, text_col, representation_model, sentence_model):
|
12 |
+
self.topic_model = None
|
13 |
+
self.embeddings = None
|
14 |
+
self.keyword_df, self.text_col = keyword_df, text_col
|
15 |
+
self.sentence_model = SentenceTransformer(sentence_model)
|
16 |
+
self.representation_model = NLP_Helper.get_bertopic_representation(representation_model)
|
17 |
+
|
18 |
+
def topic_cluster_bert(self) -> None:
|
19 |
+
self.embeddings = self.sentence_model.encode(self.keyword_df[self.text_col], show_progress_bar=False)
|
20 |
+
self.topic_model = BERTopic(representation_model=self.representation_model,
|
21 |
+
embedding_model=self.sentence_model,
|
22 |
+
n_gram_range=(1, 3), top_n_words=2)
|
23 |
+
topics, _ = self.topic_model.fit_transform(self.keyword_df[self.text_col])
|
24 |
+
topic_labels = self.topic_model.generate_topic_labels(nr_words=1, topic_prefix=False)
|
25 |
+
|
26 |
+
if self.topic_model.get_topic_info()['Topic'].values[0] == -1:
|
27 |
+
topic_labels[0] = 'Unknown'
|
28 |
+
self.topic_model.set_topic_labels(topic_labels)
|
29 |
+
|
30 |
+
self.keyword_df['Topic'] = topics
|
31 |
+
topic_info = self.topic_model.get_topic_info()
|
32 |
+
|
33 |
+
topic_info['Name'] = topic_labels
|
34 |
+
self.keyword_df = pd.merge(topic_info, self.keyword_df, on=['Topic'])
|
35 |
+
self.keyword_df.rename(columns={'Name': 'Topic Name'}, inplace=True)
|
36 |
+
self.keyword_df.drop(columns=['CustomName'], inplace=True)
|
37 |
+
|
38 |
+
|
39 |
+
def visualize_documents(self, n_neighbors) -> go.Figure:
|
40 |
+
reduced_embeddings = UMAP(n_neighbors=n_neighbors, n_components=2, min_dist=0.0, metric='cosine').fit_transform(
|
41 |
+
self.embeddings)
|
42 |
+
|
43 |
+
fig = self.topic_model.visualize_documents(self.keyword_df[self.text_col],
|
44 |
+
reduced_embeddings=reduced_embeddings,
|
45 |
+
custom_labels=True)
|
46 |
+
return fig
|
47 |
+
|
48 |
+
def visualize_topic_distribution(self) -> go.Figure:
|
49 |
+
fig = self.topic_model.visualize_barchart(custom_labels=True, top_n_topics=5, n_words=20, title='Topic Distribution')
|
50 |
+
return fig
|
LICENSE
ADDED
@@ -0,0 +1,674 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
1 |
+
GNU GENERAL PUBLIC LICENSE
|
2 |
+
Version 3, 29 June 2007
|
3 |
+
|
4 |
+
Copyright (C) 2007 Free Software Foundation, Inc. <https://fsf.org/>
|
5 |
+
Everyone is permitted to copy and distribute verbatim copies
|
6 |
+
of this license document, but changing it is not allowed.
|
7 |
+
|
8 |
+
Preamble
|
9 |
+
|
10 |
+
The GNU General Public License is a free, copyleft license for
|
11 |
+
software and other kinds of works.
|
12 |
+
|
13 |
+
The licenses for most software and other practical works are designed
|
14 |
+
to take away your freedom to share and change the works. By contrast,
|
15 |
+
the GNU General Public License is intended to guarantee your freedom to
|
16 |
+
share and change all versions of a program--to make sure it remains free
|
17 |
+
software for all its users. We, the Free Software Foundation, use the
|
18 |
+
GNU General Public License for most of our software; it applies also to
|
19 |
+
any other work released this way by its authors. You can apply it to
|
20 |
+
your programs, too.
|
21 |
+
|
22 |
+
When we speak of free software, we are referring to freedom, not
|
23 |
+
price. Our General Public Licenses are designed to make sure that you
|
24 |
+
have the freedom to distribute copies of free software (and charge for
|
25 |
+
them if you wish), that you receive source code or can get it if you
|
26 |
+
want it, that you can change the software or use pieces of it in new
|
27 |
+
free programs, and that you know you can do these things.
|
28 |
+
|
29 |
+
To protect your rights, we need to prevent others from denying you
|
30 |
+
these rights or asking you to surrender the rights. Therefore, you have
|
31 |
+
certain responsibilities if you distribute copies of the software, or if
|
32 |
+
you modify it: responsibilities to respect the freedom of others.
|
33 |
+
|
34 |
+
For example, if you distribute copies of such a program, whether
|
35 |
+
gratis or for a fee, you must pass on to the recipients the same
|
36 |
+
freedoms that you received. You must make sure that they, too, receive
|
37 |
+
or can get the source code. And you must show them these terms so they
|
38 |
+
know their rights.
|
39 |
+
|
40 |
+
Developers that use the GNU GPL protect your rights with two steps:
|
41 |
+
(1) assert copyright on the software, and (2) offer you this License
|
42 |
+
giving you legal permission to copy, distribute and/or modify it.
|
43 |
+
|
44 |
+
For the developers' and authors' protection, the GPL clearly explains
|
45 |
+
that there is no warranty for this free software. For both users' and
|
46 |
+
authors' sake, the GPL requires that modified versions be marked as
|
47 |
+
changed, so that their problems will not be attributed erroneously to
|
48 |
+
authors of previous versions.
|
49 |
+
|
50 |
+
Some devices are designed to deny users access to install or run
|
51 |
+
modified versions of the software inside them, although the manufacturer
|
52 |
+
can do so. This is fundamentally incompatible with the aim of
|
53 |
+
protecting users' freedom to change the software. The systematic
|
54 |
+
pattern of such abuse occurs in the area of products for individuals to
|
55 |
+
use, which is precisely where it is most unacceptable. Therefore, we
|
56 |
+
have designed this version of the GPL to prohibit the practice for those
|
57 |
+
products. If such problems arise substantially in other domains, we
|
58 |
+
stand ready to extend this provision to those domains in future versions
|
59 |
+
of the GPL, as needed to protect the freedom of users.
|
60 |
+
|
61 |
+
Finally, every program is threatened constantly by software patents.
|
62 |
+
States should not allow patents to restrict development and use of
|
63 |
+
software on general-purpose computers, but in those that do, we wish to
|
64 |
+
avoid the special danger that patents applied to a free program could
|
65 |
+
make it effectively proprietary. To prevent this, the GPL assures that
|
66 |
+
patents cannot be used to render the program non-free.
|
67 |
+
|
68 |
+
The precise terms and conditions for copying, distribution and
|
69 |
+
modification follow.
|
70 |
+
|
71 |
+
TERMS AND CONDITIONS
|
72 |
+
|
73 |
+
0. Definitions.
|
74 |
+
|
75 |
+
"This License" refers to version 3 of the GNU General Public License.
|
76 |
+
|
77 |
+
"Copyright" also means copyright-like laws that apply to other kinds of
|
78 |
+
works, such as semiconductor masks.
|
79 |
+
|
80 |
+
"The Program" refers to any copyrightable work licensed under this
|
81 |
+
License. Each licensee is addressed as "you". "Licensees" and
|
82 |
+
"recipients" may be individuals or organizations.
|
83 |
+
|
84 |
+
To "modify" a work means to copy from or adapt all or part of the work
|
85 |
+
in a fashion requiring copyright permission, other than the making of an
|
86 |
+
exact copy. The resulting work is called a "modified version" of the
|
87 |
+
earlier work or a work "based on" the earlier work.
|
88 |
+
|
89 |
+
A "covered work" means either the unmodified Program or a work based
|
90 |
+
on the Program.
|
91 |
+
|
92 |
+
To "propagate" a work means to do anything with it that, without
|
93 |
+
permission, would make you directly or secondarily liable for
|
94 |
+
infringement under applicable copyright law, except executing it on a
|
95 |
+
computer or modifying a private copy. Propagation includes copying,
|
96 |
+
distribution (with or without modification), making available to the
|
97 |
+
public, and in some countries other activities as well.
|
98 |
+
|
99 |
+
To "convey" a work means any kind of propagation that enables other
|
100 |
+
parties to make or receive copies. Mere interaction with a user through
|
101 |
+
a computer network, with no transfer of a copy, is not conveying.
|
102 |
+
|
103 |
+
An interactive user interface displays "Appropriate Legal Notices"
|
104 |
+
to the extent that it includes a convenient and prominently visible
|
105 |
+
feature that (1) displays an appropriate copyright notice, and (2)
|
106 |
+
tells the user that there is no warranty for the work (except to the
|
107 |
+
extent that warranties are provided), that licensees may convey the
|
108 |
+
work under this License, and how to view a copy of this License. If
|
109 |
+
the interface presents a list of user commands or options, such as a
|
110 |
+
menu, a prominent item in the list meets this criterion.
|
111 |
+
|
112 |
+
1. Source Code.
|
113 |
+
|
114 |
+
The "source code" for a work means the preferred form of the work
|
115 |
+
for making modifications to it. "Object code" means any non-source
|
116 |
+
form of a work.
|
117 |
+
|
118 |
+
A "Standard Interface" means an interface that either is an official
|
119 |
+
standard defined by a recognized standards body, or, in the case of
|
120 |
+
interfaces specified for a particular programming language, one that
|
121 |
+
is widely used among developers working in that language.
|
122 |
+
|
123 |
+
The "System Libraries" of an executable work include anything, other
|
124 |
+
than the work as a whole, that (a) is included in the normal form of
|
125 |
+
packaging a Major Component, but which is not part of that Major
|
126 |
+
Component, and (b) serves only to enable use of the work with that
|
127 |
+
Major Component, or to implement a Standard Interface for which an
|
128 |
+
implementation is available to the public in source code form. A
|
129 |
+
"Major Component", in this context, means a major essential component
|
130 |
+
(kernel, window system, and so on) of the specific operating system
|
131 |
+
(if any) on which the executable work runs, or a compiler used to
|
132 |
+
produce the work, or an object code interpreter used to run it.
|
133 |
+
|
134 |
+
The "Corresponding Source" for a work in object code form means all
|
135 |
+
the source code needed to generate, install, and (for an executable
|
136 |
+
work) run the object code and to modify the work, including scripts to
|
137 |
+
control those activities. However, it does not include the work's
|
138 |
+
System Libraries, or general-purpose tools or generally available free
|
139 |
+
programs which are used unmodified in performing those activities but
|
140 |
+
which are not part of the work. For example, Corresponding Source
|
141 |
+
includes interface definition files associated with source files for
|
142 |
+
the work, and the source code for shared libraries and dynamically
|
143 |
+
linked subprograms that the work is specifically designed to require,
|
144 |
+
such as by intimate data communication or control flow between those
|
145 |
+
subprograms and other parts of the work.
|
146 |
+
|
147 |
+
The Corresponding Source need not include anything that users
|
148 |
+
can regenerate automatically from other parts of the Corresponding
|
149 |
+
Source.
|
150 |
+
|
151 |
+
The Corresponding Source for a work in source code form is that
|
152 |
+
same work.
|
153 |
+
|
154 |
+
2. Basic Permissions.
|
155 |
+
|
156 |
+
All rights granted under this License are granted for the term of
|
157 |
+
copyright on the Program, and are irrevocable provided the stated
|
158 |
+
conditions are met. This License explicitly affirms your unlimited
|
159 |
+
permission to run the unmodified Program. The output from running a
|
160 |
+
covered work is covered by this License only if the output, given its
|
161 |
+
content, constitutes a covered work. This License acknowledges your
|
162 |
+
rights of fair use or other equivalent, as provided by copyright law.
|
163 |
+
|
164 |
+
You may make, run and propagate covered works that you do not
|
165 |
+
convey, without conditions so long as your license otherwise remains
|
166 |
+
in force. You may convey covered works to others for the sole purpose
|
167 |
+
of having them make modifications exclusively for you, or provide you
|
168 |
+
with facilities for running those works, provided that you comply with
|
169 |
+
the terms of this License in conveying all material for which you do
|
170 |
+
not control copyright. Those thus making or running the covered works
|
171 |
+
for you must do so exclusively on your behalf, under your direction
|
172 |
+
and control, on terms that prohibit them from making any copies of
|
173 |
+
your copyrighted material outside their relationship with you.
|
174 |
+
|
175 |
+
Conveying under any other circumstances is permitted solely under
|
176 |
+
the conditions stated below. Sublicensing is not allowed; section 10
|
177 |
+
makes it unnecessary.
|
178 |
+
|
179 |
+
3. Protecting Users' Legal Rights From Anti-Circumvention Law.
|
180 |
+
|
181 |
+
No covered work shall be deemed part of an effective technological
|
182 |
+
measure under any applicable law fulfilling obligations under article
|
183 |
+
11 of the WIPO copyright treaty adopted on 20 December 1996, or
|
184 |
+
similar laws prohibiting or restricting circumvention of such
|
185 |
+
measures.
|
186 |
+
|
187 |
+
When you convey a covered work, you waive any legal power to forbid
|
188 |
+
circumvention of technological measures to the extent such circumvention
|
189 |
+
is effected by exercising rights under this License with respect to
|
190 |
+
the covered work, and you disclaim any intention to limit operation or
|
191 |
+
modification of the work as a means of enforcing, against the work's
|
192 |
+
users, your or third parties' legal rights to forbid circumvention of
|
193 |
+
technological measures.
|
194 |
+
|
195 |
+
4. Conveying Verbatim Copies.
|
196 |
+
|
197 |
+
You may convey verbatim copies of the Program's source code as you
|
198 |
+
receive it, in any medium, provided that you conspicuously and
|
199 |
+
appropriately publish on each copy an appropriate copyright notice;
|
200 |
+
keep intact all notices stating that this License and any
|
201 |
+
non-permissive terms added in accord with section 7 apply to the code;
|
202 |
+
keep intact all notices of the absence of any warranty; and give all
|
203 |
+
recipients a copy of this License along with the Program.
|
204 |
+
|
205 |
+
You may charge any price or no price for each copy that you convey,
|
206 |
+
and you may offer support or warranty protection for a fee.
|
207 |
+
|
208 |
+
5. Conveying Modified Source Versions.
|
209 |
+
|
210 |
+
You may convey a work based on the Program, or the modifications to
|
211 |
+
produce it from the Program, in the form of source code under the
|
212 |
+
terms of section 4, provided that you also meet all of these conditions:
|
213 |
+
|
214 |
+
a) The work must carry prominent notices stating that you modified
|
215 |
+
it, and giving a relevant date.
|
216 |
+
|
217 |
+
b) The work must carry prominent notices stating that it is
|
218 |
+
released under this License and any conditions added under section
|
219 |
+
7. This requirement modifies the requirement in section 4 to
|
220 |
+
"keep intact all notices".
|
221 |
+
|
222 |
+
c) You must license the entire work, as a whole, under this
|
223 |
+
License to anyone who comes into possession of a copy. This
|
224 |
+
License will therefore apply, along with any applicable section 7
|
225 |
+
additional terms, to the whole of the work, and all its parts,
|
226 |
+
regardless of how they are packaged. This License gives no
|
227 |
+
permission to license the work in any other way, but it does not
|
228 |
+
invalidate such permission if you have separately received it.
|
229 |
+
|
230 |
+
d) If the work has interactive user interfaces, each must display
|
231 |
+
Appropriate Legal Notices; however, if the Program has interactive
|
232 |
+
interfaces that do not display Appropriate Legal Notices, your
|
233 |
+
work need not make them do so.
|
234 |
+
|
235 |
+
A compilation of a covered work with other separate and independent
|
236 |
+
works, which are not by their nature extensions of the covered work,
|
237 |
+
and which are not combined with it such as to form a larger program,
|
238 |
+
in or on a volume of a storage or distribution medium, is called an
|
239 |
+
"aggregate" if the compilation and its resulting copyright are not
|
240 |
+
used to limit the access or legal rights of the compilation's users
|
241 |
+
beyond what the individual works permit. Inclusion of a covered work
|
242 |
+
in an aggregate does not cause this License to apply to the other
|
243 |
+
parts of the aggregate.
|
244 |
+
|
245 |
+
6. Conveying Non-Source Forms.
|
246 |
+
|
247 |
+
You may convey a covered work in object code form under the terms
|
248 |
+
of sections 4 and 5, provided that you also convey the
|
249 |
+
machine-readable Corresponding Source under the terms of this License,
|
250 |
+
in one of these ways:
|
251 |
+
|
252 |
+
a) Convey the object code in, or embodied in, a physical product
|
253 |
+
(including a physical distribution medium), accompanied by the
|
254 |
+
Corresponding Source fixed on a durable physical medium
|
255 |
+
customarily used for software interchange.
|
256 |
+
|
257 |
+
b) Convey the object code in, or embodied in, a physical product
|
258 |
+
(including a physical distribution medium), accompanied by a
|
259 |
+
written offer, valid for at least three years and valid for as
|
260 |
+
long as you offer spare parts or customer support for that product
|
261 |
+
model, to give anyone who possesses the object code either (1) a
|
262 |
+
copy of the Corresponding Source for all the software in the
|
263 |
+
product that is covered by this License, on a durable physical
|
264 |
+
medium customarily used for software interchange, for a price no
|
265 |
+
more than your reasonable cost of physically performing this
|
266 |
+
conveying of source, or (2) access to copy the
|
267 |
+
Corresponding Source from a network server at no charge.
|
268 |
+
|
269 |
+
c) Convey individual copies of the object code with a copy of the
|
270 |
+
written offer to provide the Corresponding Source. This
|
271 |
+
alternative is allowed only occasionally and noncommercially, and
|
272 |
+
only if you received the object code with such an offer, in accord
|
273 |
+
with subsection 6b.
|
274 |
+
|
275 |
+
d) Convey the object code by offering access from a designated
|
276 |
+
place (gratis or for a charge), and offer equivalent access to the
|
277 |
+
Corresponding Source in the same way through the same place at no
|
278 |
+
further charge. You need not require recipients to copy the
|
279 |
+
Corresponding Source along with the object code. If the place to
|
280 |
+
copy the object code is a network server, the Corresponding Source
|
281 |
+
may be on a different server (operated by you or a third party)
|
282 |
+
that supports equivalent copying facilities, provided you maintain
|
283 |
+
clear directions next to the object code saying where to find the
|
284 |
+
Corresponding Source. Regardless of what server hosts the
|
285 |
+
Corresponding Source, you remain obligated to ensure that it is
|
286 |
+
available for as long as needed to satisfy these requirements.
|
287 |
+
|
288 |
+
e) Convey the object code using peer-to-peer transmission, provided
|
289 |
+
you inform other peers where the object code and Corresponding
|
290 |
+
Source of the work are being offered to the general public at no
|
291 |
+
charge under subsection 6d.
|
292 |
+
|
293 |
+
A separable portion of the object code, whose source code is excluded
|
294 |
+
from the Corresponding Source as a System Library, need not be
|
295 |
+
included in conveying the object code work.
|
296 |
+
|
297 |
+
A "User Product" is either (1) a "consumer product", which means any
|
298 |
+
tangible personal property which is normally used for personal, family,
|
299 |
+
or household purposes, or (2) anything designed or sold for incorporation
|
300 |
+
into a dwelling. In determining whether a product is a consumer product,
|
301 |
+
doubtful cases shall be resolved in favor of coverage. For a particular
|
302 |
+
product received by a particular user, "normally used" refers to a
|
303 |
+
typical or common use of that class of product, regardless of the status
|
304 |
+
of the particular user or of the way in which the particular user
|
305 |
+
actually uses, or expects or is expected to use, the product. A product
|
306 |
+
is a consumer product regardless of whether the product has substantial
|
307 |
+
commercial, industrial or non-consumer uses, unless such uses represent
|
308 |
+
the only significant mode of use of the product.
|
309 |
+
|
310 |
+
"Installation Information" for a User Product means any methods,
|
311 |
+
procedures, authorization keys, or other information required to install
|
312 |
+
and execute modified versions of a covered work in that User Product from
|
313 |
+
a modified version of its Corresponding Source. The information must
|
314 |
+
suffice to ensure that the continued functioning of the modified object
|
315 |
+
code is in no case prevented or interfered with solely because
|
316 |
+
modification has been made.
|
317 |
+
|
318 |
+
If you convey an object code work under this section in, or with, or
|
319 |
+
specifically for use in, a User Product, and the conveying occurs as
|
320 |
+
part of a transaction in which the right of possession and use of the
|
321 |
+
User Product is transferred to the recipient in perpetuity or for a
|
322 |
+
fixed term (regardless of how the transaction is characterized), the
|
323 |
+
Corresponding Source conveyed under this section must be accompanied
|
324 |
+
by the Installation Information. But this requirement does not apply
|
325 |
+
if neither you nor any third party retains the ability to install
|
326 |
+
modified object code on the User Product (for example, the work has
|
327 |
+
been installed in ROM).
|
328 |
+
|
329 |
+
The requirement to provide Installation Information does not include a
|
330 |
+
requirement to continue to provide support service, warranty, or updates
|
331 |
+
for a work that has been modified or installed by the recipient, or for
|
332 |
+
the User Product in which it has been modified or installed. Access to a
|
333 |
+
network may be denied when the modification itself materially and
|
334 |
+
adversely affects the operation of the network or violates the rules and
|
335 |
+
protocols for communication across the network.
|
336 |
+
|
337 |
+
Corresponding Source conveyed, and Installation Information provided,
|
338 |
+
in accord with this section must be in a format that is publicly
|
339 |
+
documented (and with an implementation available to the public in
|
340 |
+
source code form), and must require no special password or key for
|
341 |
+
unpacking, reading or copying.
|
342 |
+
|
343 |
+
7. Additional Terms.
|
344 |
+
|
345 |
+
"Additional permissions" are terms that supplement the terms of this
|
346 |
+
License by making exceptions from one or more of its conditions.
|
347 |
+
Additional permissions that are applicable to the entire Program shall
|
348 |
+
be treated as though they were included in this License, to the extent
|
349 |
+
that they are valid under applicable law. If additional permissions
|
350 |
+
apply only to part of the Program, that part may be used separately
|
351 |
+
under those permissions, but the entire Program remains governed by
|
352 |
+
this License without regard to the additional permissions.
|
353 |
+
|
354 |
+
When you convey a copy of a covered work, you may at your option
|
355 |
+
remove any additional permissions from that copy, or from any part of
|
356 |
+
it. (Additional permissions may be written to require their own
|
357 |
+
removal in certain cases when you modify the work.) You may place
|
358 |
+
additional permissions on material, added by you to a covered work,
|
359 |
+
for which you have or can give appropriate copyright permission.
|
360 |
+
|
361 |
+
Notwithstanding any other provision of this License, for material you
|
362 |
+
add to a covered work, you may (if authorized by the copyright holders of
|
363 |
+
that material) supplement the terms of this License with terms:
|
364 |
+
|
365 |
+
a) Disclaiming warranty or limiting liability differently from the
|
366 |
+
terms of sections 15 and 16 of this License; or
|
367 |
+
|
368 |
+
b) Requiring preservation of specified reasonable legal notices or
|
369 |
+
author attributions in that material or in the Appropriate Legal
|
370 |
+
Notices displayed by works containing it; or
|
371 |
+
|
372 |
+
c) Prohibiting misrepresentation of the origin of that material, or
|
373 |
+
requiring that modified versions of such material be marked in
|
374 |
+
reasonable ways as different from the original version; or
|
375 |
+
|
376 |
+
d) Limiting the use for publicity purposes of names of licensors or
|
377 |
+
authors of the material; or
|
378 |
+
|
379 |
+
e) Declining to grant rights under trademark law for use of some
|
380 |
+
trade names, trademarks, or service marks; or
|
381 |
+
|
382 |
+
f) Requiring indemnification of licensors and authors of that
|
383 |
+
material by anyone who conveys the material (or modified versions of
|
384 |
+
it) with contractual assumptions of liability to the recipient, for
|
385 |
+
any liability that these contractual assumptions directly impose on
|
386 |
+
those licensors and authors.
|
387 |
+
|
388 |
+
All other non-permissive additional terms are considered "further
|
389 |
+
restrictions" within the meaning of section 10. If the Program as you
|
390 |
+
received it, or any part of it, contains a notice stating that it is
|
391 |
+
governed by this License along with a term that is a further
|
392 |
+
restriction, you may remove that term. If a license document contains
|
393 |
+
a further restriction but permits relicensing or conveying under this
|
394 |
+
License, you may add to a covered work material governed by the terms
|
395 |
+
of that license document, provided that the further restriction does
|
396 |
+
not survive such relicensing or conveying.
|
397 |
+
|
398 |
+
If you add terms to a covered work in accord with this section, you
|
399 |
+
must place, in the relevant source files, a statement of the
|
400 |
+
additional terms that apply to those files, or a notice indicating
|
401 |
+
where to find the applicable terms.
|
402 |
+
|
403 |
+
Additional terms, permissive or non-permissive, may be stated in the
|
404 |
+
form of a separately written license, or stated as exceptions;
|
405 |
+
the above requirements apply either way.
|
406 |
+
|
407 |
+
8. Termination.
|
408 |
+
|
409 |
+
You may not propagate or modify a covered work except as expressly
|
410 |
+
provided under this License. Any attempt otherwise to propagate or
|
411 |
+
modify it is void, and will automatically terminate your rights under
|
412 |
+
this License (including any patent licenses granted under the third
|
413 |
+
paragraph of section 11).
|
414 |
+
|
415 |
+
However, if you cease all violation of this License, then your
|
416 |
+
license from a particular copyright holder is reinstated (a)
|
417 |
+
provisionally, unless and until the copyright holder explicitly and
|
418 |
+
finally terminates your license, and (b) permanently, if the copyright
|
419 |
+
holder fails to notify you of the violation by some reasonable means
|
420 |
+
prior to 60 days after the cessation.
|
421 |
+
|
422 |
+
Moreover, your license from a particular copyright holder is
|
423 |
+
reinstated permanently if the copyright holder notifies you of the
|
424 |
+
violation by some reasonable means, this is the first time you have
|
425 |
+
received notice of violation of this License (for any work) from that
|
426 |
+
copyright holder, and you cure the violation prior to 30 days after
|
427 |
+
your receipt of the notice.
|
428 |
+
|
429 |
+
Termination of your rights under this section does not terminate the
|
430 |
+
licenses of parties who have received copies or rights from you under
|
431 |
+
this License. If your rights have been terminated and not permanently
|
432 |
+
reinstated, you do not qualify to receive new licenses for the same
|
433 |
+
material under section 10.
|
434 |
+
|
435 |
+
9. Acceptance Not Required for Having Copies.
|
436 |
+
|
437 |
+
You are not required to accept this License in order to receive or
|
438 |
+
run a copy of the Program. Ancillary propagation of a covered work
|
439 |
+
occurring solely as a consequence of using peer-to-peer transmission
|
440 |
+
to receive a copy likewise does not require acceptance. However,
|
441 |
+
nothing other than this License grants you permission to propagate or
|
442 |
+
modify any covered work. These actions infringe copyright if you do
|
443 |
+
not accept this License. Therefore, by modifying or propagating a
|
444 |
+
covered work, you indicate your acceptance of this License to do so.
|
445 |
+
|
446 |
+
10. Automatic Licensing of Downstream Recipients.
|
447 |
+
|
448 |
+
Each time you convey a covered work, the recipient automatically
|
449 |
+
receives a license from the original licensors, to run, modify and
|
450 |
+
propagate that work, subject to this License. You are not responsible
|
451 |
+
for enforcing compliance by third parties with this License.
|
452 |
+
|
453 |
+
An "entity transaction" is a transaction transferring control of an
|
454 |
+
organization, or substantially all assets of one, or subdividing an
|
455 |
+
organization, or merging organizations. If propagation of a covered
|
456 |
+
work results from an entity transaction, each party to that
|
457 |
+
transaction who receives a copy of the work also receives whatever
|
458 |
+
licenses to the work the party's predecessor in interest had or could
|
459 |
+
give under the previous paragraph, plus a right to possession of the
|
460 |
+
Corresponding Source of the work from the predecessor in interest, if
|
461 |
+
the predecessor has it or can get it with reasonable efforts.
|
462 |
+
|
463 |
+
You may not impose any further restrictions on the exercise of the
|
464 |
+
rights granted or affirmed under this License. For example, you may
|
465 |
+
not impose a license fee, royalty, or other charge for exercise of
|
466 |
+
rights granted under this License, and you may not initiate litigation
|
467 |
+
(including a cross-claim or counterclaim in a lawsuit) alleging that
|
468 |
+
any patent claim is infringed by making, using, selling, offering for
|
469 |
+
sale, or importing the Program or any portion of it.
|
470 |
+
|
471 |
+
11. Patents.
|
472 |
+
|
473 |
+
A "contributor" is a copyright holder who authorizes use under this
|
474 |
+
License of the Program or a work on which the Program is based. The
|
475 |
+
work thus licensed is called the contributor's "contributor version".
|
476 |
+
|
477 |
+
A contributor's "essential patent claims" are all patent claims
|
478 |
+
owned or controlled by the contributor, whether already acquired or
|
479 |
+
hereafter acquired, that would be infringed by some manner, permitted
|
480 |
+
by this License, of making, using, or selling its contributor version,
|
481 |
+
but do not include claims that would be infringed only as a
|
482 |
+
consequence of further modification of the contributor version. For
|
483 |
+
purposes of this definition, "control" includes the right to grant
|
484 |
+
patent sublicenses in a manner consistent with the requirements of
|
485 |
+
this License.
|
486 |
+
|
487 |
+
Each contributor grants you a non-exclusive, worldwide, royalty-free
|
488 |
+
patent license under the contributor's essential patent claims, to
|
489 |
+
make, use, sell, offer for sale, import and otherwise run, modify and
|
490 |
+
propagate the contents of its contributor version.
|
491 |
+
|
492 |
+
In the following three paragraphs, a "patent license" is any express
|
493 |
+
agreement or commitment, however denominated, not to enforce a patent
|
494 |
+
(such as an express permission to practice a patent or covenant not to
|
495 |
+
sue for patent infringement). To "grant" such a patent license to a
|
496 |
+
party means to make such an agreement or commitment not to enforce a
|
497 |
+
patent against the party.
|
498 |
+
|
499 |
+
If you convey a covered work, knowingly relying on a patent license,
|
500 |
+
and the Corresponding Source of the work is not available for anyone
|
501 |
+
to copy, free of charge and under the terms of this License, through a
|
502 |
+
publicly available network server or other readily accessible means,
|
503 |
+
then you must either (1) cause the Corresponding Source to be so
|
504 |
+
available, or (2) arrange to deprive yourself of the benefit of the
|
505 |
+
patent license for this particular work, or (3) arrange, in a manner
|
506 |
+
consistent with the requirements of this License, to extend the patent
|
507 |
+
license to downstream recipients. "Knowingly relying" means you have
|
508 |
+
actual knowledge that, but for the patent license, your conveying the
|
509 |
+
covered work in a country, or your recipient's use of the covered work
|
510 |
+
in a country, would infringe one or more identifiable patents in that
|
511 |
+
country that you have reason to believe are valid.
|
512 |
+
|
513 |
+
If, pursuant to or in connection with a single transaction or
|
514 |
+
arrangement, you convey, or propagate by procuring conveyance of, a
|
515 |
+
covered work, and grant a patent license to some of the parties
|
516 |
+
receiving the covered work authorizing them to use, propagate, modify
|
517 |
+
or convey a specific copy of the covered work, then the patent license
|
518 |
+
you grant is automatically extended to all recipients of the covered
|
519 |
+
work and works based on it.
|
520 |
+
|
521 |
+
A patent license is "discriminatory" if it does not include within
|
522 |
+
the scope of its coverage, prohibits the exercise of, or is
|
523 |
+
conditioned on the non-exercise of one or more of the rights that are
|
524 |
+
specifically granted under this License. You may not convey a covered
|
525 |
+
work if you are a party to an arrangement with a third party that is
|
526 |
+
in the business of distributing software, under which you make payment
|
527 |
+
to the third party based on the extent of your activity of conveying
|
528 |
+
the work, and under which the third party grants, to any of the
|
529 |
+
parties who would receive the covered work from you, a discriminatory
|
530 |
+
patent license (a) in connection with copies of the covered work
|
531 |
+
conveyed by you (or copies made from those copies), or (b) primarily
|
532 |
+
for and in connection with specific products or compilations that
|
533 |
+
contain the covered work, unless you entered into that arrangement,
|
534 |
+
or that patent license was granted, prior to 28 March 2007.
|
535 |
+
|
536 |
+
Nothing in this License shall be construed as excluding or limiting
|
537 |
+
any implied license or other defenses to infringement that may
|
538 |
+
otherwise be available to you under applicable patent law.
|
539 |
+
|
540 |
+
12. No Surrender of Others' Freedom.
|
541 |
+
|
542 |
+
If conditions are imposed on you (whether by court order, agreement or
|
543 |
+
otherwise) that contradict the conditions of this License, they do not
|
544 |
+
excuse you from the conditions of this License. If you cannot convey a
|
545 |
+
covered work so as to satisfy simultaneously your obligations under this
|
546 |
+
License and any other pertinent obligations, then as a consequence you may
|
547 |
+
not convey it at all. For example, if you agree to terms that obligate you
|
548 |
+
to collect a royalty for further conveying from those to whom you convey
|
549 |
+
the Program, the only way you could satisfy both those terms and this
|
550 |
+
License would be to refrain entirely from conveying the Program.
|
551 |
+
|
552 |
+
13. Use with the GNU Affero General Public License.
|
553 |
+
|
554 |
+
Notwithstanding any other provision of this License, you have
|
555 |
+
permission to link or combine any covered work with a work licensed
|
556 |
+
under version 3 of the GNU Affero General Public License into a single
|
557 |
+
combined work, and to convey the resulting work. The terms of this
|
558 |
+
License will continue to apply to the part which is the covered work,
|
559 |
+
but the special requirements of the GNU Affero General Public License,
|
560 |
+
section 13, concerning interaction through a network will apply to the
|
561 |
+
combination as such.
|
562 |
+
|
563 |
+
14. Revised Versions of this License.
|
564 |
+
|
565 |
+
The Free Software Foundation may publish revised and/or new versions of
|
566 |
+
the GNU General Public License from time to time. Such new versions will
|
567 |
+
be similar in spirit to the present version, but may differ in detail to
|
568 |
+
address new problems or concerns.
|
569 |
+
|
570 |
+
Each version is given a distinguishing version number. If the
|
571 |
+
Program specifies that a certain numbered version of the GNU General
|
572 |
+
Public License "or any later version" applies to it, you have the
|
573 |
+
option of following the terms and conditions either of that numbered
|
574 |
+
version or of any later version published by the Free Software
|
575 |
+
Foundation. If the Program does not specify a version number of the
|
576 |
+
GNU General Public License, you may choose any version ever published
|
577 |
+
by the Free Software Foundation.
|
578 |
+
|
579 |
+
If the Program specifies that a proxy can decide which future
|
580 |
+
versions of the GNU General Public License can be used, that proxy's
|
581 |
+
public statement of acceptance of a version permanently authorizes you
|
582 |
+
to choose that version for the Program.
|
583 |
+
|
584 |
+
Later license versions may give you additional or different
|
585 |
+
permissions. However, no additional obligations are imposed on any
|
586 |
+
author or copyright holder as a result of your choosing to follow a
|
587 |
+
later version.
|
588 |
+
|
589 |
+
15. Disclaimer of Warranty.
|
590 |
+
|
591 |
+
THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
|
592 |
+
APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
|
593 |
+
HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
|
594 |
+
OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
|
595 |
+
THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
|
596 |
+
PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
|
597 |
+
IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
|
598 |
+
ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
|
599 |
+
|
600 |
+
16. Limitation of Liability.
|
601 |
+
|
602 |
+
IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
|
603 |
+
WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
|
604 |
+
THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
|
605 |
+
GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
|
606 |
+
USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
|
607 |
+
DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
|
608 |
+
PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
|
609 |
+
EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
|
610 |
+
SUCH DAMAGES.
|
611 |
+
|
612 |
+
17. Interpretation of Sections 15 and 16.
|
613 |
+
|
614 |
+
If the disclaimer of warranty and limitation of liability provided
|
615 |
+
above cannot be given local legal effect according to their terms,
|
616 |
+
reviewing courts shall apply local law that most closely approximates
|
617 |
+
an absolute waiver of all civil liability in connection with the
|
618 |
+
Program, unless a warranty or assumption of liability accompanies a
|
619 |
+
copy of the Program in return for a fee.
|
620 |
+
|
621 |
+
END OF TERMS AND CONDITIONS
|
622 |
+
|
623 |
+
How to Apply These Terms to Your New Programs
|
624 |
+
|
625 |
+
If you develop a new program, and you want it to be of the greatest
|
626 |
+
possible use to the public, the best way to achieve this is to make it
|
627 |
+
free software which everyone can redistribute and change under these terms.
|
628 |
+
|
629 |
+
To do so, attach the following notices to the program. It is safest
|
630 |
+
to attach them to the start of each source file to most effectively
|
631 |
+
state the exclusion of warranty; and each file should have at least
|
632 |
+
the "copyright" line and a pointer to where the full notice is found.
|
633 |
+
|
634 |
+
<one line to give the program's name and a brief idea of what it does.>
|
635 |
+
Copyright (C) <year> <name of author>
|
636 |
+
|
637 |
+
This program is free software: you can redistribute it and/or modify
|
638 |
+
it under the terms of the GNU General Public License as published by
|
639 |
+
the Free Software Foundation, either version 3 of the License, or
|
640 |
+
(at your option) any later version.
|
641 |
+
|
642 |
+
This program is distributed in the hope that it will be useful,
|
643 |
+
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
644 |
+
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
645 |
+
GNU General Public License for more details.
|
646 |
+
|
647 |
+
You should have received a copy of the GNU General Public License
|
648 |
+
along with this program. If not, see <https://www.gnu.org/licenses/>.
|
649 |
+
|
650 |
+
Also add information on how to contact you by electronic and paper mail.
|
651 |
+
|
652 |
+
If the program does terminal interaction, make it output a short
|
653 |
+
notice like this when it starts in an interactive mode:
|
654 |
+
|
655 |
+
<program> Copyright (C) <year> <name of author>
|
656 |
+
This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
|
657 |
+
This is free software, and you are welcome to redistribute it
|
658 |
+
under certain conditions; type `show c' for details.
|
659 |
+
|
660 |
+
The hypothetical commands `show w' and `show c' should show the appropriate
|
661 |
+
parts of the General Public License. Of course, your program's commands
|
662 |
+
might be different; for a GUI interface, you would use an "about box".
|
663 |
+
|
664 |
+
You should also get your employer (if you work as a programmer) or school,
|
665 |
+
if any, to sign a "copyright disclaimer" for the program, if necessary.
|
666 |
+
For more information on this, and how to apply and follow the GNU GPL, see
|
667 |
+
<https://www.gnu.org/licenses/>.
|
668 |
+
|
669 |
+
The GNU General Public License does not permit incorporating your program
|
670 |
+
into proprietary programs. If your program is a subroutine library, you
|
671 |
+
may consider it more useful to permit linking proprietary applications with
|
672 |
+
the library. If this is what you want to do, use the GNU Lesser General
|
673 |
+
Public License instead of this License. But first, please read
|
674 |
+
<https://www.gnu.org/licenses/why-not-lgpl.html>.
|
README.md
CHANGED
@@ -1,12 +1,12 @@
|
|
1 |
-
|
2 |
-
|
3 |
-
emoji: 🌖
|
4 |
-
colorFrom: blue
|
5 |
-
colorTo: green
|
6 |
-
sdk: streamlit
|
7 |
-
sdk_version: 1.19.0
|
8 |
-
app_file: app.py
|
9 |
-
pinned: false
|
10 |
-
---
|
11 |
|
12 |
-
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
1 |
+
# Google Ads Keyword Adgrouper
|
2 |
+
Predicts Ad group for new keywords in google ads campaign.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
3 |
|
4 |
+
# How to Use
|
5 |
+
|
6 |
+
# TODO
|
7 |
+
- Handle exceptions
|
8 |
+
- Write tests
|
9 |
+
|
10 |
+
# Helper repositories
|
11 |
+
(Thanks for these resources!)
|
12 |
+
- https://github.com/tylerjrichards/st-filter-dataframe
|
app.py
ADDED
@@ -0,0 +1,11 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
1 |
+
import streamlit as st
|
2 |
+
from streamlit_extras.switch_page_button import switch_page
|
3 |
+
|
4 |
+
st.set_page_config(page_title='Google Ads NLP Tasks', layout="wide")
|
5 |
+
st.markdown("## Google Ads Tasks")
|
6 |
+
new_kw_grouper_btn = st.button("New Keyword Ad grouper")
|
7 |
+
topic_clustering_btn = st.button("Topic Clustering")
|
8 |
+
if new_kw_grouper_btn:
|
9 |
+
switch_page("New Keyword Ad grouper")
|
10 |
+
elif topic_clustering_btn:
|
11 |
+
switch_page("Topic Cluster")
|
pages/1_New Keyword Ad grouper.py
ADDED
@@ -0,0 +1,105 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
1 |
+
import pandas as pd
|
2 |
+
import streamlit as st
|
3 |
+
|
4 |
+
from Functionalities.Streamlit_helpers import filter_dataframe
|
5 |
+
from Functionalities.KeywordAdgroupPredict import KeywordAdgroupPredict
|
6 |
+
|
7 |
+
|
8 |
+
class NewKeywordAdGrouper:
|
9 |
+
|
10 |
+
def __init__(self):
|
11 |
+
self.new_kw_df = None
|
12 |
+
self.cur_kw_df = None
|
13 |
+
self.selected_features = None
|
14 |
+
self.features = None
|
15 |
+
self.cur_kw_file_camp_col = None
|
16 |
+
self.cur_kw_file_adg_col = None
|
17 |
+
self.new_kw_file = None
|
18 |
+
self.cur_kw_file = None
|
19 |
+
self.new_kw_file_kw_col = None
|
20 |
+
self.cur_kw_file_kw_col = None
|
21 |
+
st.session_state.predict_df = pd.DataFrame() \
|
22 |
+
if 'predict_df' not in st.session_state else st.session_state.predict_df
|
23 |
+
|
24 |
+
st.set_page_config(page_title='Google Ads Keyword Ad grouper', layout="wide")
|
25 |
+
st.header("Google Ads Keyword Ad grouper")
|
26 |
+
st.write(f"This page tries to predict the suitable ad group for new keywords "
|
27 |
+
f"based on the keywords already existing in the campaign.")
|
28 |
+
st.write(f"Please make sure you DON'T have the following column names in the New Keyword CSV\n"
|
29 |
+
f"1. Recommended Ad group\n2. relevance score")
|
30 |
+
|
31 |
+
def input_file_features(self) -> None:
|
32 |
+
"""
|
33 |
+
Takes 2 file inputs, 1 feature input using checkboxes, 1 button for running prediction
|
34 |
+
:return:
|
35 |
+
"""
|
36 |
+
self.new_kw_file = st.file_uploader(label="Upload the CSV file containing the new keywords")
|
37 |
+
|
38 |
+
if self.new_kw_file:
|
39 |
+
self.new_kw_df = pd.read_csv(self.new_kw_file)
|
40 |
+
if 'Recommended Ad group' in self.new_kw_df.columns or 'relevance score' in self.new_kw_df.columns:
|
41 |
+
st.error(f"Please make sure you DON'T have the following column names in the New Keyword CSV\n"
|
42 |
+
f"1. Recommended Ad group\n2. relevance score")
|
43 |
+
self.new_kw_file_kw_col = st.selectbox(
|
44 |
+
label=f"Select the Keyword Column in **{self.new_kw_file.name}**", options=self.new_kw_df.columns
|
45 |
+
)
|
46 |
+
|
47 |
+
self.cur_kw_file = st.file_uploader(label="Upload the CSV file containing the current keywords, "
|
48 |
+
"their ad group, and campaign (Search keyword report)")
|
49 |
+
|
50 |
+
if self.cur_kw_file:
|
51 |
+
self.cur_kw_df = pd.read_csv(self.cur_kw_file)
|
52 |
+
self.cur_kw_file_kw_col = st.selectbox(label=f"Select the Keyword Column in **{self.cur_kw_file.name}**",
|
53 |
+
options=self.cur_kw_df.columns, index=0)
|
54 |
+
self.cur_kw_file_adg_col = st.selectbox(label=f"Select Ad Group Column in **{self.cur_kw_file.name}**",
|
55 |
+
options=self.cur_kw_df.columns, index=3)
|
56 |
+
self.cur_kw_file_camp_col = st.selectbox(label=f"Select Campaign Column in **{self.cur_kw_file.name}**",
|
57 |
+
options=self.cur_kw_df.columns, index=2)
|
58 |
+
|
59 |
+
if self.new_kw_file and self.cur_kw_file:
|
60 |
+
self.features = {self.cur_kw_file_kw_col: False, self.cur_kw_file_adg_col: False}
|
61 |
+
st.write('Select the features you want to use for finding relevant ad group for new keywords:')
|
62 |
+
self.features[self.cur_kw_file_kw_col] = st.checkbox('Ad group Keywords', value=True)
|
63 |
+
self.features[self.cur_kw_file_adg_col] = st.checkbox('Ad group name')
|
64 |
+
|
65 |
+
self.selected_features = [key for key, value in self.features.items() if value == True]
|
66 |
+
|
67 |
+
st.button("Predict", on_click=self.run_prediction)
|
68 |
+
else:
|
69 |
+
st.info("Please upload necessary files")
|
70 |
+
|
71 |
+
def run_prediction(self) -> None:
|
72 |
+
"""
|
73 |
+
runs ad group prediction for given inputs on button press
|
74 |
+
:return:
|
75 |
+
"""
|
76 |
+
if not (self.features[self.cur_kw_file_kw_col] or self.features[self.cur_kw_file_adg_col]):
|
77 |
+
st.error("Please select at least one feature")
|
78 |
+
else:
|
79 |
+
kw_adg_predict = KeywordAdgroupPredict()
|
80 |
+
st.session_state.predict_df = kw_adg_predict.predict_ad_group_for_keywords(
|
81 |
+
candidate_kw_df=self.new_kw_df, cur_kw_df=self.cur_kw_df, features=self.selected_features,
|
82 |
+
new_kw_col=self.new_kw_file_kw_col, cur_kw_col=self.cur_kw_file_kw_col,
|
83 |
+
cur_adg_col=self.cur_kw_file_adg_col, cur_camp_col=self.cur_kw_file_camp_col)
|
84 |
+
|
85 |
+
def output(self) -> None:
|
86 |
+
"""
|
87 |
+
Outputs the dataframe containing ad group prediction and relevance score
|
88 |
+
:return:
|
89 |
+
"""
|
90 |
+
if not st.session_state.predict_df.empty:
|
91 |
+
filtered_df = filter_dataframe(st.session_state.predict_df)
|
92 |
+
st.dataframe(filtered_df)
|
93 |
+
st.download_button(
|
94 |
+
"Press to Download",
|
95 |
+
filtered_df.to_csv(index=False).encode('utf-8'),
|
96 |
+
"Keyword Ad group Prediction.csv",
|
97 |
+
"text/csv",
|
98 |
+
key='download-csv'
|
99 |
+
)
|
100 |
+
|
101 |
+
|
102 |
+
if __name__ == '__main__':
|
103 |
+
new_kw_ad_grouper = NewKeywordAdGrouper()
|
104 |
+
new_kw_ad_grouper.input_file_features()
|
105 |
+
new_kw_ad_grouper.output()
|
pages/2_Topic_Cluster.py
ADDED
@@ -0,0 +1,98 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
1 |
+
import pandas as pd
|
2 |
+
import streamlit as st
|
3 |
+
from Functionalities import NLP_Helper
|
4 |
+
from Functionalities.TopicClustering import TopicClustering
|
5 |
+
from streamlit_extras.dataframe_explorer import dataframe_explorer
|
6 |
+
|
7 |
+
class TopicClusterView:
|
8 |
+
def __init__(self):
|
9 |
+
self.n_neighbors = 10
|
10 |
+
self.topic_cluster = None
|
11 |
+
self.representation_model = None
|
12 |
+
self.sentence_model = None
|
13 |
+
self.text_col = None
|
14 |
+
self.text_df = None
|
15 |
+
self.text_file = None
|
16 |
+
|
17 |
+
st.session_state.topic_cluster = None \
|
18 |
+
if 'topic_cluster' not in st.session_state else st.session_state.topic_cluster
|
19 |
+
|
20 |
+
st.set_page_config(page_title='Topic Clustering', layout="wide")
|
21 |
+
st.header("Topic Clustering")
|
22 |
+
# st.write(f"This page tries to predict the suitable ad group for new keywords "
|
23 |
+
# f"based on the keywords already existing in the campaign.")
|
24 |
+
|
25 |
+
def input_params(self) -> None:
|
26 |
+
"""
|
27 |
+
Takes csv file input, name of text col, select option for sentence model and representation model
|
28 |
+
:return:
|
29 |
+
"""
|
30 |
+
self.text_file = st.file_uploader(label="Upload the CSV file containing the texts to cluster")
|
31 |
+
if self.text_file:
|
32 |
+
self.text_df = pd.read_csv(self.text_file)
|
33 |
+
self.text_col = st.selectbox(
|
34 |
+
label=f"Choose the column to use for topic clustering in **{self.text_file.name}**",
|
35 |
+
options=self.text_df.columns
|
36 |
+
)
|
37 |
+
|
38 |
+
self.sentence_model = st.selectbox(
|
39 |
+
label=f"Choose the text embedding model",
|
40 |
+
options=NLP_Helper.TRANSFORMERS,
|
41 |
+
help="; ".join(NLP_Helper.TRANSFORMERS_INFO)
|
42 |
+
)
|
43 |
+
|
44 |
+
self.representation_model = st.selectbox(
|
45 |
+
label=f"Choose the representation model",
|
46 |
+
options=NLP_Helper.BERTOPIC_REPRESENTATIONS,
|
47 |
+
)
|
48 |
+
|
49 |
+
st.button("Cluster", on_click=self.run_clustering)
|
50 |
+
|
51 |
+
def run_clustering(self) -> None:
|
52 |
+
self.topic_cluster = TopicClustering(keyword_df=self.text_df, text_col=self.text_col,
|
53 |
+
representation_model=self.representation_model,
|
54 |
+
sentence_model=self.sentence_model)
|
55 |
+
|
56 |
+
self.topic_cluster.topic_cluster_bert()
|
57 |
+
st.session_state.topic_cluster = self.topic_cluster
|
58 |
+
|
59 |
+
def show_and_download_df(self):
|
60 |
+
if (st.session_state.topic_cluster is not None) and (st.session_state.topic_cluster.topic_model is not None):
|
61 |
+
filtered_df = dataframe_explorer(st.session_state.topic_cluster.keyword_df)
|
62 |
+
st.dataframe(filtered_df)
|
63 |
+
st.download_button(
|
64 |
+
"Press to Download",
|
65 |
+
st.session_state.topic_cluster.keyword_df.to_csv(index=False).encode('utf-8'),
|
66 |
+
"Clustered.csv",
|
67 |
+
"text/csv",
|
68 |
+
key='download-csv'
|
69 |
+
)
|
70 |
+
|
71 |
+
def visualize_clusters(self):
|
72 |
+
if (st.session_state.topic_cluster is not None) and (st.session_state.topic_cluster.topic_model is not None):
|
73 |
+
self.n_neighbors = st.slider(label='Size of the local neighborhood', min_value=2, max_value=100, step=1)
|
74 |
+
if st.button("Visualize Topic Clusters"):
|
75 |
+
if (st.session_state.topic_cluster is not None) and (
|
76 |
+
st.session_state.topic_cluster.topic_model is not None):
|
77 |
+
fig = st.session_state.topic_cluster.visualize_documents(n_neighbors=self.n_neighbors)
|
78 |
+
fig.update_layout(title=None)
|
79 |
+
st.plotly_chart(fig, use_container_width=True, theme=None)
|
80 |
+
|
81 |
+
def visualize_topic_distribution(self):
|
82 |
+
if (st.session_state.topic_cluster is not None) and (st.session_state.topic_cluster.topic_model is not None):
|
83 |
+
if (st.session_state.topic_cluster is not None) and (
|
84 |
+
st.session_state.topic_cluster.topic_model is not None):
|
85 |
+
fig = st.session_state.topic_cluster.visualize_topic_distribution()
|
86 |
+
st.plotly_chart(fig, use_container_width=True, theme=None)
|
87 |
+
|
88 |
+
if __name__ == '__main__':
|
89 |
+
topic_cluster_view = TopicClusterView()
|
90 |
+
# tab1, tab2, tab3 = st.tabs(['Clustering Process', 'Cluster Visualization', 'Topic Distribution'])
|
91 |
+
tab1, tab2 = st.tabs(['Clustering Process', 'Cluster Visualization'])
|
92 |
+
with tab1:
|
93 |
+
topic_cluster_view.input_params()
|
94 |
+
topic_cluster_view.show_and_download_df()
|
95 |
+
with tab2:
|
96 |
+
topic_cluster_view.visualize_clusters()
|
97 |
+
# with tab3:
|
98 |
+
# topic_cluster_view.visualize_topic_distribution()
|
requirements.txt
ADDED
@@ -0,0 +1,103 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
1 |
+
accelerate==0.18.0
|
2 |
+
altair==4.2.2
|
3 |
+
attrs==22.2.0
|
4 |
+
beautifulsoup4==4.12.0
|
5 |
+
bertopic==0.14.1
|
6 |
+
blinker==1.5
|
7 |
+
cachetools==5.3.0
|
8 |
+
certifi==2022.12.7
|
9 |
+
charset-normalizer==3.1.0
|
10 |
+
click==8.1.3
|
11 |
+
contourpy==1.0.7
|
12 |
+
cycler==0.11.0
|
13 |
+
Cython==0.29.34
|
14 |
+
decorator==5.1.1
|
15 |
+
entrypoints==0.4
|
16 |
+
Faker==18.3.1
|
17 |
+
favicon==0.7.0
|
18 |
+
filelock==3.10.7
|
19 |
+
fonttools==4.39.3
|
20 |
+
gitdb==4.0.10
|
21 |
+
GitPython==3.1.31
|
22 |
+
hdbscan==0.8.29
|
23 |
+
htbuilder==0.6.1
|
24 |
+
huggingface-hub==0.13.3
|
25 |
+
idna==3.4
|
26 |
+
importlib-metadata==6.1.0
|
27 |
+
install==1.3.5
|
28 |
+
Jinja2==3.1.2
|
29 |
+
joblib==1.2.0
|
30 |
+
jsonschema==4.17.3
|
31 |
+
kiwisolver==1.4.4
|
32 |
+
llvmlite==0.39.1
|
33 |
+
lxml==4.9.2
|
34 |
+
Markdown==3.4.3
|
35 |
+
markdown-it-py==2.2.0
|
36 |
+
markdownlit==0.0.5
|
37 |
+
MarkupSafe==2.1.2
|
38 |
+
matplotlib==3.7.1
|
39 |
+
mdurl==0.1.2
|
40 |
+
more-itertools==9.1.0
|
41 |
+
mpmath==1.3.0
|
42 |
+
networkx==3.0
|
43 |
+
nltk==3.8.1
|
44 |
+
numba==0.56.4
|
45 |
+
numpy==1.23.5
|
46 |
+
packaging==23.0
|
47 |
+
pandas==1.5.3
|
48 |
+
Pillow==9.4.0
|
49 |
+
plotly==5.14.1
|
50 |
+
protobuf==3.20.3
|
51 |
+
psutil==5.9.5
|
52 |
+
pyarrow==11.0.0
|
53 |
+
pydeck==0.8.0
|
54 |
+
Pygments==2.14.0
|
55 |
+
pymdown-extensions==9.10
|
56 |
+
Pympler==1.0.1
|
57 |
+
pynndescent==0.5.9
|
58 |
+
pyparsing==3.0.9
|
59 |
+
pyrsistent==0.19.3
|
60 |
+
python-dateutil==2.8.2
|
61 |
+
pytz==2023.3
|
62 |
+
pytz-deprecation-shim==0.1.0.post0
|
63 |
+
PyYAML==6.0
|
64 |
+
regex==2023.3.23
|
65 |
+
requests==2.28.2
|
66 |
+
rich==13.3.3
|
67 |
+
scikit-learn==1.2.2
|
68 |
+
scipy==1.10.1
|
69 |
+
semver==2.13.0
|
70 |
+
sentence-transformers==2.2.2
|
71 |
+
sentencepiece==0.1.97
|
72 |
+
six==1.16.0
|
73 |
+
smmap==5.0.0
|
74 |
+
soupsieve==2.4
|
75 |
+
st-annotated-text==3.0.0
|
76 |
+
streamlit==1.20.0
|
77 |
+
streamlit-camera-input-live==0.2.0
|
78 |
+
streamlit-card==0.0.4
|
79 |
+
streamlit-embedcode==0.1.2
|
80 |
+
streamlit-extras==0.2.6
|
81 |
+
streamlit-faker==0.0.2
|
82 |
+
streamlit-image-coordinates==0.1.3
|
83 |
+
streamlit-keyup==0.2.0
|
84 |
+
streamlit-toggle-switch==1.0.2
|
85 |
+
streamlit-vertical-slider==1.0.2
|
86 |
+
sympy==1.11.1
|
87 |
+
tenacity==8.2.2
|
88 |
+
threadpoolctl==3.1.0
|
89 |
+
tokenizers==0.13.2
|
90 |
+
toml==0.10.2
|
91 |
+
toolz==0.12.0
|
92 |
+
torch==2.0.0
|
93 |
+
torchvision==0.15.1
|
94 |
+
tornado==6.2
|
95 |
+
tqdm==4.65.0
|
96 |
+
transformers==4.25.1
|
97 |
+
typing_extensions==4.5.0
|
98 |
+
tzdata==2023.3
|
99 |
+
tzlocal==4.3
|
100 |
+
umap-learn==0.5.3
|
101 |
+
urllib3==1.26.15
|
102 |
+
validators==0.20.0
|
103 |
+
zipp==3.15.0
|