graphembed-rs 0.1.0__cp311-cp311-macosx_11_0_arm64.whl

graphembed/__init__.py

@@ -0,0 +1,5 @@
+from .graphembed import *
+
+__doc__ = graphembed.__doc__
+if hasattr(graphembed, "__all__"):
+    __all__ = graphembed.__all__

graphembed/__init__.pyi

@@ -0,0 +1,79 @@
+from typing import Optional
+
+# ----------  Embedding  ----------
+def embed_hope_rank(
+    csv: str,
+    symetric: bool,
+    target_rank: int,
+    nbiter: int,
+    output: Optional[str] = None,
+) -> None: ...
+def embed_hope_precision(
+    csv: str,
+    symetric: bool,
+    epsil: float,
+    maxrank: int,
+    blockiter: int,
+    output: Optional[str] = None,
+) -> None: ...
+def embed_sketching(
+    csv: str,
+    symetric: bool,
+    decay: float,
+    dim: int,
+    nbiter: int,
+    output: Optional[str] = None,
+) -> None: ...
+
+# ----------  Validation (returns mean AUC) ----------
+def validate_hope_rank(
+    csv: str,
+    symetric: bool,
+    target_rank: int,
+    nbiter: int,
+    nbpass: int = 10,
+    skip_frac: float = 0.1,
+    centric: bool = False,
+) -> float: ...
+def validate_hope_precision(
+    csv: str,
+    symetric: bool,
+    epsil: float,
+    maxrank: int,
+    blockiter: int,
+    nbpass: int = 10,
+    skip_frac: float = 0.1,
+    centric: bool = False,
+) -> float: ...
+def validate_sketching(
+    csv: str,
+    symetric: bool,
+    decay: float,
+    dim: int,
+    nbiter: int,
+    nbpass: int = 10,
+    skip_frac: float = 0.1,
+    centric: bool = False,
+) -> float: ...
+
+# ---------- VCMPR (precision/recall curves) ----------
+def estimate_vcmpr_hope_rank(
+    csv: str,
+    symetric: bool,
+    target_rank: int,
+    nbiter: int,
+    nbpass: int = 2,
+    topk: int = 10,
+    skip_frac: float = 0.1,
+) -> None: ...
+def estimate_vcmpr_sketching(
+    csv: str,
+    symetric: bool,
+    decay: float,
+    dim: int,
+    nbiter: int,
+    nbpass: int = 2,
+    topk: int = 10,
+    skip_frac: float = 0.1,
+) -> None: ...
+

graphembed_rs-0.1.0.dist-info/METADATA

@@ -0,0 +1,193 @@
+Metadata-Version: 2.4
+Name: graphembed_rs
+Version: 0.1.0
+Summary: Python bindings for the high‑performance Rust graph/network embedding library graphembed
+Keywords: graph,embedding,hash
+Author: Jianshu Zhao
+Author-email: jeanpierre.both@gmail.com, jianshuzhao@yahoo.com
+License: MIT OR Apache-2.0
+Requires-Python: >=3.8
+Description-Content-Type: text/markdown; charset=UTF-8; variant=GFM
+Project-URL: Source Code, https://github.com/jean-pierreBoth/graphembed
+
+# Graphembed
+
+This crate provides ,as a library and an executable,embedding of directed or undirected graphs with positively weighted edges.
+
+
+  - For simple graphs, without data attached to nodes/labels, there are 2 (rust) modules **nodesketch** and **atp**. A simple executable with a validation option based on link prediction is also provided.
+
+  - To complement the embeddings we provide also core decomposition of graphs (see the module **structure**). We give try to analyze how Orkut communities are preserved through an embedding. (See Notebooks directory).
+
+  - The module **gkernel** is dedicated to graphs with discrete labels attached to nodes/edges. We use the *petgraph* crate for graph description.
+    The algorithm is based on an extension of the hashing strategy used in the module **nodesketch**.  
+    In the undirected case, this module also computes a global embedding vector for the whole graph. **It is still in an early version**.
+
+## Methods
+
+### The embedding algorithms used in this crate are based on the following papers
+
+- **nodesketch**
+
+*NodeSketch : Highly-Efficient Graph Embeddings via Recursive Sketching KDD 2019*.  see [nodesketch](https://dl.acm.org/doi/10.1145/3292500.3330951)  
+    D. Yang,P. Rosso,Bin-Li, P. Cudre-Mauroux.
+
+It is based on multi hop neighbourhood identification via sensitive hashing based on the recent algorithm **probminhash**. See [arxiv](https://arxiv.org/abs/1911.00675) or  [ieee-2022](https://ieeexplore.ieee.org/document/9185081).
+
+The algorithm associates a probability distribution on neighbours of each point depending on edge weights and distance to the point.
+Then this distribution is hashed to build a (discrete) embedding vector consisting in nodes identifiers.  
+The distance between embedded vectors is the Jaccard distance so we get
+a real distance on the embedding space for the symetric embedding.  
+
+An extension of the paper is also implemented to get asymetric embedding for directed graph. The similarity is also based on the hash of sets (nodes going to or from) a given node but then the dissimilarity is no more a distance (no symetry and some discrepancy with the triangular inequality).
+
+**The orkut graph with 3 millions nodes and 100 millions of edge is embedded in 5' with a 24 core i9 laptop with this algorithm giving an AUC of 0.95**.
+
+
+- **atp**
+
+*Asymetric Transitivity Preserving Graph Embedding 2016*.
+    M. Ou, P Cui, J. Pei, Z. Zhang and W. Zhu. See [hope](https://dl.acm.org/doi/10.1145/2939672.2939751).
+
+The objective is to provide an asymetric graph embedding and get estimate of the precision of the embedding in function of its dimension.  
+
+We use the Adamic-Adar matricial representation of the graph. (It must be noted that the ponderation of a node by the number of couples joined by it is called Resource Allocation in the Graph Kernel litterature).
+The asymetric embedding is obtained from the left and right singular eigenvectors of the Adamic-Adar representation of the graph.
+Source node are related to left singular vectors and target nodes to the right ones.  
+The similarity measure is the dot product, so it is not a norm.  
+The svd is approximated by randomization as described in Halko-Tropp 2011 as implemented in the [annembed crate](https://crates.io/crates/annembed).
+
+### The core decomposition algorithms
+
+- **Density-friendly decomposition**
+
+*Large Scale decomposition via convex programming  2017*  
+    M.Danisch T.H Hubert Chan and M.Sozio
+
+The decomposition of the graph in maximally dense groups of nodes is implemented and used to assess the quality of the embeddings in a structural way. See module *validation* and the comments on the embedding of the *Orkut* graph where we can use the community data provided with the graph to analyze the behaviour of embedded edge lengths.  
+
+In particular it is shown that :
+  - embedding of edges internal to a community are consistently smaller than embedded edges crossing a block frontier. 
+  - The transition probabilities of edge from one block to another are similar (low kullback divergence) in the original graph and in the embedded graph.
+ 
+  See results in [orkut.md](./orkut.md) and examples directory together with a small Rust notebook in directory [Notebooks](./Notebooks/orkutrs.ipynb)
+
+## Validation
+
+Validation of embeddings is assessed via standard Auc with random deletion of edges. See documentation in the *link* module and *embed* binary.
+We give also a variation based on centric quality assessment as explained at [cauc](http://github.com/jean-pierreBoth/linkauc)
+## Some data sets
+
+### Without labels
+
+Small datasets are given in the Data subdirectory (with 7z compression) to run tests.  
+Larger datasets can be downloaded from the SNAP data collections <https://snap.stanford.edu/data>
+
+#### Some small test graphs are provided in a Data subdirectory
+
+- Symetric graphs
+
+  - Les miserables  <http://konect.cc/networks/moreno_lesmis>.  
+    This is the graph of co-occurence of characters in Victor Hugo's novel 'Les Misérables'.
+
+- Asymetric graphs
+
+  - wiki-vote <https://snap.stanford.edu/data/wiki-Vote.html>
+         7115 nodes 103689 edges
+
+  - Cora : <http://konect.cc/networks/subelj_cora>
+        citation network 23166 nodes 91500 edges
+
+#### Some larger data tests for user to download
+
+These graphs were used in results see below.
+
+Beware of the possible need to convert from Windows to Linux End Of Line, see the dos2unix utility.  
+Possibly some data can need to be converted from Tsv format to Csv, before being read by the program.
+
+- Symetric
+
+  - Amazon.   Nodes: 334 863   Edges: 925 872  <https://snap.stanford.edu/data/amazon0601.html>
+  - youtube.  Nodes: 1 134 890 Edges: 2 987 624 <https://snap.stanford.edu/data/com-Youtube.html>
+  - orkut.    Nodes: 3 072 441 Edges: 117 185 083 <https://snap.stanford.edu/data/com-Orkut.html>
+
+- Asymetric
+
+  - twitter as tested in Hope  <http://konect.cc/networks/munmun_twitter_social>
+        465017 nodes 834797 edges
+
+## Some results
+
+### results for the *atp* and *nodesketch* modules
+
+Embedding and link prediction evaluation for the above data sets are given in file [resultats.md](./resultats.md)
+A more global analysis of the embedding with the nodesketch module is done for the orkut graph in file [orkut.md](./orkut.md)
+
+A preliminary of node centric quality estimation is provided in the validation module (see documentation in validation::link).  
+
+### Some qualitative comments
+
+- For the embedding using the randomized svd, increasing the embedding dimension is interesting as far as the corresponding eigenvalues continue to decrease significantly.
+
+- The munmun_twitter_social graph shows that treating a directed graph as an undirected graph give significantly different results in terms of link prediction AUC.
+
+
+
+
+## Generalized Svd
+
+An implementation of Generalized Svd comes as a by-product in module [gsvd](./src/atp/gsvd.rs).
+
+## Installation and Usage
+
+### Installation
+
+The crate provides features (with a default configuration), required by the *annembed* dependency, to specify which version of lapack you want to use or the choice of simd implementation.
+- For example compilation is done by :
+*cargo build --release --features="openblas-system"* to  use a dynamic link with openblas.
+The choice of one feature is mandatory to provide required linear algebra library.  
+- On Intel the simdeez_f feature can be used. On other cpus the stdsimd feature can be chosen but it requires compiler >= 1.79
+
+### Usage
+
+The embed module can be generated with the standard : cargo doc --no-deps --bin embed.  
+
+- The Hope embedding relying on matrices computations limits the size of the graph to some hundred thousands nodes.
+It is intrinsically asymetric in nature. It nevertheless gives access to the spectrum of Adamic Adar matrix representing the graph and
+so to the required dimension to get a valid embedding in $R^{n}$.  
+
+- The Sketching embedding is much faster for large graphs but embeds in a space consisting in sequences of node id equipped with the Jaccard distance. It is particularly efficient in low degrees graph.
+
+- The *embed* module takes embedding and possibly validation commands (link prediction task) in one directive.  
+The general syntax is :
+
+    embed file_description [validation_command --validation_arguments] sketching mode  --embedding_arguments  
+    for example:  
+
+  For a symetric graph we get:
+
+- just embedding:
+        embed --csv ./Data/Graphs/Orkut/com-orkut.ungraph.txt --symetric  sketching --decay 0.2  --dim 200 --nbiter 
+
+- embedding and validation:
+ 
+        embed --csv ./Data/Graphs/Orkut/com-orkut.ungraph.txt  --symetric  validation --nbpass 5 --skip 0.15 sketching --decay 0.2  --dim 200 --nbiter 5
+
+For an asymetric graph we get 
+
+       embed --csv ./Data/Graphs/asymetric.csv  validation --nbpass 5 --skip 0.15 sketching --decay 0.2  --dim 200 --nbiter 5 
+
+
+    More details can be found in docs of the embed module. Use cargo doc --no-dep --bin embed (and cargo doc --no-dep) as usual.
+
+- Use the environment variable RUST_LOG gives access to some information at various level (debug, info, error)  via the **log** and **env_logger** crates.
+
+## License
+
+Licensed under either of
+
+* Apache License, Version 2.0, [LICENSE-APACHE](LICENSE-APACHE) or <http://www.apache.org/licenses/LICENSE-2.0>
+* MIT license [LICENSE-MIT](LICENSE-MIT) or <http://opensource.org/licenses/MIT>
+
+at your option.
+

graphembed_rs-0.1.0.dist-info/RECORD

@@ -0,0 +1,7 @@
+graphembed_rs-0.1.0.dist-info/METADATA,sha256=1bBA8fy75z8I6YGAsPAMoB-67zpAHW66cHywSb-hPj8,9901
+graphembed_rs-0.1.0.dist-info/WHEEL,sha256=wsVBlw9xyAuHecZeOYqJ_tA7emUKfXYOn-_180uZRi4,104
+graphembed/__init__.py,sha256=RCcLraveWf-myTsDQGePMYq-scNNfz-3Mv1baSbgAmM,123
+graphembed/__init__.pyi,sha256=3_KBFG4g9akylo32CHlm9bZStcLwxIY2X4si21ilD3w,1626
+graphembed/py.typed,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
+graphembed/graphembed.cpython-311-darwin.so,sha256=02KwhQh5VZBhzUc7zl-JdfWhSjb1sQ40V4KSbqSsi9o,5158016
+graphembed_rs-0.1.0.dist-info/RECORD,,

graphembed_rs-0.1.0.dist-info/WHEEL

@@ -0,0 +1,4 @@
+Wheel-Version: 1.0
+Generator: maturin (1.8.3)
+Root-Is-Purelib: false
+Tag: cp311-cp311-macosx_11_0_arm64