Metadata-Version: 2.1
Name: graphrole
Version: 1.0.1
Summary: Automatic feature extraction and node role assignment for transfer learning on graphs
Home-page: https://github.com/dkaslovsky/GraphRole
Author: Daniel Kaslovsky
Author-email: dkaslovsky@gmail.com
License: MIT
Description: # GraphRole
        
        [![Build Status](https://travis-ci.org/dkaslovsky/GraphRole.svg?branch=master)](https://travis-ci.org/dkaslovsky/GraphRole)
        [![Coverage Status](https://coveralls.io/repos/github/dkaslovsky/GraphRole/badge.svg?branch=master)](https://coveralls.io/github/dkaslovsky/GraphRole?branch=master)
        ![PyPI - Python Version](https://img.shields.io/pypi/pyversions/GraphRole)
        
        Automatic feature extraction and node role assignment for transfer learning on graphs; based on the ReFeX/RolX algorithms [1, 2] of Henderson, et al.
        
        <p align="center">
        <img src="./examples/karate_graph.png" width=600>
        </p>
        
        ### Overview
        A fundamental problem for learning on graphs is extracting meaningful features.  `GraphRole` provides the `RecursiveFeatureExtractor` class to automate this process by extracting recursive features capturing local and neighborhood ("regional") structural properties of a given graph.  The specific implementation follows that of the ReFeX algorithm [1].  Node features (e.g., degree) and ego-net features (e.g., neighbors, number of internal vs. external edges) are extracted and then recursively aggregated over each node's neighbors' features until no additional information is encoded.  As is shown in [1], these recursive, "regional" features facilitate node classification and perform quite well in transfer learning tasks.
        
        `GraphRole` also provides the `RoleExtractor` class for node role assignment (a form of classification).  Different nodes play different structural roles in a graph, and using recursive regional features, these roles can be identified and assigned to collections of nodes.  As they are structural in nature, node roles differ from and are often more intuitive than the commonly used communities of nodes.  In particular, roles can generalize across graphs whereas the notion of communities cannot [2].  Identification and assignment of node roles has been shown to facilitate many graph learning tasks.
        
        Please see [1, 2] for more technical details.
        
        ### Installation
        This package is hosted on PyPI and can be installed via `pip`:
        ```
        $ pip install graphrole
        ```
        To instead install from source:
        ```
        $ git clone https://github.com/dkaslovsky/GraphRole.git
        $ cd GraphRole
        $ python setup.py install
        ```
        
        ### Example
        An example of `GraphRole` usage is found in the `examples` directory.  The notebook
        [example.ipynb](./examples/example.ipynb)
        (also available via [nbviewer](https://nbviewer.jupyter.org/github/dkaslovsky/GraphRole/blob/master/examples/example.ipynb))
        walks through feature extraction and role assignment for the well-known `karate_club_graph` that is included with `NetworkX`.  Recursive features are extracted and used to learn role assignments for each node in the graph.  The graph is shown above with each node colored corresponding to its role.
        
        The extracted roles reflect structural properties of the graph at the node level.  The nodes `0` and `33` (dark green) are central to the graph and are connected to many other nodes.  Nodes `1`, `2`, `3`, and `32` are assigned to a similar role (red).  In contrast, the roles colored as dark blue, light blue, and pink are found at the periphery of the graph.  Notably, nodes need not be near one another to be assigned to the same role; instead nodes with similar properties are grouped together across the graph by their role assignments.
        
        Although not reflected by this example, weighted and directed graphs are also supported and will yield weighted and directed variants of the extracted features.
        
        ### Usage
        For general usage, begin by importing the two feature and role extraction classes:
        ```
        >>> from graphrole import RecursiveFeatureExtractor, RoleExtractor
        ```
        Features are then extracted from a graph `G` into a `pandas.DataFrame`:
        ```
        >>> feature_extractor = RecursiveFeatureExtractor(G)
        >>> features = feature_extractor.extract_features()
        ```
        Next, these features are used to learn roles.  The number of roles is automatically determined by
        a model selection procedure when `n_roles=None` is passed to the `RoleExtractor` class instance.
        Alternatively, `n_roles` can be set to a desired number of roles to be extracted.
        ```
        >>> role_extractor = RoleExtractor(n_roles=None)
        >>> role_extractor.extract_role_factors(features)
        ```
        The role assignment for each node can be retrieved as a dictionary:
        ```
        >>> role_extractor.roles
        ```
        Alternatively, roles can be viewed as a soft assignment and a node's percent membership to each role
        can be retrieved as a `pandas.DataFrame`:
        ```
        >>> role_extractor.role_percentage
        ```
        
        ### Graph Interfaces
        An interface for graph data structures is provided in the `graphrole.graph.interface` module.  Implementations for `networkx` and `igraph` are included.
        
        The `igraph` package is not included in `requirements.txt` and thus will need to be manually installed
        if desired.  This is due to additional installation requirements beyond `pip install python-igraph`; see
        the [igraph documentation](https://igraph.org/python/#pyinstall) for more details.  Note that all tests
        that require `igraph` will be skipped if it is not installed.
        
        To add an implementation of an additional graph library or data structure:
        1. Subclass the `BaseGraphInterface` ABC in `graphrole.graph.interface.base.py` and implement the required methods
        1. Update the `INTERFACES` dict in `graphrole.graph.interface.__init__.py` to make the new subclass discoverable
        1. Add tests by trivially implementing a `setUpClass()` classmethod of a subclass of `BaseGraphInterfaceTest.BaseGraphInterfaceTestCases` in the `tests.test_graph.test_interface.py` module
        1. If desired, a similar procedure allows the feature extraction tests to be run using the added interface
        by again trivially implementing a `setUpClass()` classmethod of a subclass of `BaseRecursiveFeatureExtractorTest.TestCases` in the `tests.test_features.test_extract.py` module
        
        ### Future Development
        Model explanation ("sense making") will be added to the `RoleExtractor` class in a future release.
        
        ### Tests
        To run tests:
        ```
        $ python -m unittest discover -v
        ```
        As noted above, the tests for the `igraph` interface are skipped when `igraph` is not installed.  Because this package is intentionally not required, the  test coverage reported above is much lower than when `igraph` is installed and its interface tests are not skipped (__97% coverage__ to date).
        
        ### References
        [1] Henderson, et al. [It’s Who You Know: Graph Mining Using Recursive Structural Features](http://www.cs.cmu.edu/~leili/pubs/henderson-kdd2011.pdf).
        
        [2] Henderson, et al. [RolX: Structural Role Extraction & Mining in Large Graphs](https://static.googleusercontent.com/media/research.google.com/en//pubs/archive/46591.pdf).
        
Keywords: graph,feature extraction,transfer learning,network,graph analysis,network analysis,refex,rolx
Platform: UNKNOWN
Classifier: Environment :: Console
Classifier: License :: OSI Approved :: MIT License
Classifier: Natural Language :: English
Classifier: Operating System :: OS Independent
Classifier: Programming Language :: Python :: 3.6
Classifier: Programming Language :: Python :: 3.7
Classifier: Programming Language :: Python :: 3.8
Description-Content-Type: text/markdown
