Proceedings of the 29th ACM International Conference on Information &Amp; Knowledge Management 2020
DOI: 10.1145/3340531.3412757
|View full text |Cite
|
Sign up to set email alerts
|

Karate Club

Abstract: Graphs encode important structural properties of complex systems. Machine learning on graphs has therefore emerged as an important technique in research and applications. We present Karate Club-a Python framework combining more than 30 state-of-the-art graph mining algorithms. These unsupervised techniques make it easy to identify and represent common graph features. The primary goal of the package is to make community detection, node and whole graph embedding available to a wide audience of machine learning r… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3

Citation Types

0
11
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
5
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 92 publications
(11 citation statements)
references
References 39 publications
0
11
0
Order By: Relevance
“…Here, we chose to focus only on potential gain-of-interaction edges and first filtered each patient specific-network accordingly. We then grabbed the largest connected component and ran the FEATHER 36 algorithm from the KarateClub NetworkX extension library 37 to generate an embedding for each network.…”
Section: Methodsmentioning
confidence: 99%
“…Here, we chose to focus only on potential gain-of-interaction edges and first filtered each patient specific-network accordingly. We then grabbed the largest connected component and ran the FEATHER 36 algorithm from the KarateClub NetworkX extension library 37 to generate an embedding for each network.…”
Section: Methodsmentioning
confidence: 99%
“…We treated the network as an unweighted graph to generate the embedding vectors. 1 To select the node embedding method, we evaluated five types of embeddings: node2vec [15], RandNE [16], GLEE [17], NodeSketch [18], and DeepWalk [19] [20] based on the implementation by Rozemberczki et al [20].…”
Section: Methodsmentioning
confidence: 99%
“…This model offers community identification, node integration, and whole graph incorporation techniques, particularly data mining. [42]. The programming language embraces refinement, aggregation, interpolation, eigenvalues problems, algebraic equations, differential equations, and many other problems.…”
Section: Methodsmentioning
confidence: 99%