2020
DOI: 10.48550/arxiv.2003.04819
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Karate Club: An API Oriented Open-source Python Framework for Unsupervised Learning on Graphs

Abstract: We present Karate Club a Python framework combining more than 30 state-of-the-art graph mining algorithms which can solve unsupervised machine learning tasks. The primary goal of the package is to make community detection, node and whole graph embedding available to a wide audience of machine learning researchers and practitioners. We designed Karate Club with an emphasis on a consistent application interface, scalability, ease of use, sensible out of the box model behaviour, standardized dataset ingestion, an… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
4
0

Year Published

2021
2021
2021
2021

Publication Types

Select...
3
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(4 citation statements)
references
References 22 publications
0
4
0
Order By: Relevance
“…This is achieved by learning a mapping function between a vertex attribute vector and a role, represented by vertex connectivity patterns, such that two vertices belong to the same role if they are structurally similar or equivalent. The embeddings have been computed using the karateclub [34] Python library. The network embeddings are trained using the hyperparameter configuration of the package shown in Table 2.…”
Section: Network Embeddingsmentioning
confidence: 99%
“…This is achieved by learning a mapping function between a vertex attribute vector and a role, represented by vertex connectivity patterns, such that two vertices belong to the same role if they are structurally similar or equivalent. The embeddings have been computed using the karateclub [34] Python library. The network embeddings are trained using the hyperparameter configuration of the package shown in Table 2.…”
Section: Network Embeddingsmentioning
confidence: 99%
“…Such structures can also be found in the legal citation graph in the form of different topics or jurisdictions. For DeepWalk, Walklets, BoostNe, we use the Karate Club implementation [45].…”
Section: 24mentioning
confidence: 99%
“…Data. Our experiments are carried out using the datasets DBLP_v1 Pan et al [2013], IMDB-MULTI Yanardag and Vishwanathan [2015], and deezer_ego_nets Rozemberczki et al [2020] from the TUD graph benchmark database Morris et al [2020]. Graphs whose maximum clique contained less than 3 nodes were excluded, and for the deezer_ego_nets, we excluded those graphs that had more than 30 nodes, giving the dataset statistics shown in Table 1.…”
Section: Experiments and Evaluationmentioning
confidence: 99%