Skip to main content

"Python package classifications of the util workflow stage of the BONSAI database"

Project description

BONSAI classifications

The BONSAI classifications Python package is a part of the Getting The Data Right project.

Here, all the classifications, which are used in the Bonsai database, are created and stored as csv files. The csv files can be found under /src/classifications/data. The structure of organising these files follows the Bonsai ontology and thus has the following folders:

  • activitytype (includes: industry_activity, government_activity, treatment_activity, non_profit_institution_serving_household, household_production, household_consumption, market_activity, natural_activity, auxiliary_production_activity, change_in_stock_activity, other_activity)
  • flowobject (includes industry_product, material_for_treatment, market_product, government_product, household_product, needs_satisfaction, emission, direct_physical_change, natural_resource, economic_flow, social_flow)
  • location
  • unit
  • time

Since the Bonsai ontology does not cover all required topics, additional folders are added:

  • dataquality
  • uncertainty

A comprehensive documentation of the classification package is availbale here

Format

The csv files (tables) of each folder (datapackage) are organised in tabular format. Each of the mentioned folders represents a valid dataio.datapackage created with the Python package dataio. The following types of tables with its prefixes are used:

  • tree table tree_
  • concordance table conc_
  • dimension table dim_
  • pairwise cocncordance table concpair_

tree table

Tree tables are used for classifications which have a tree structure, meaning that the classification is structured hierarchically with multiple levels. The classification starts with broad categories at the top level and then branches out into more specific subcategories as you move down the hierarchy.

The following column names are used:

  • code: code of the item
  • parent_code: code of the items parent
  • name: name of the item
  • level: the items level in the tree structure (from 0 to n)
  • prefixed_id: unique id (uuid4)

concordance table

A concordance table is used to establish equivalences or relationships between different classification systems. It provides mappings between codes of a classification system and codes from another classification system. A relationship between codes can have four different types:

  • one-to-one (1:1) correspondence: In a one-to-one correspondence, each category or code in one classification system is mapped to exactly one category or code in another classification system, and vice versa. This type of mapping implies a direct and unambiguous correspondence between the two systems. The skos uri is http://www.w3.org/2004/02/skos/core#exactMatch

  • one-to-many (1:M) correspondence: In a one-to-many correspondence, each category or code in one classification system is mapped to multiple categories or codes in another classification system. However, each category or code in the second system is only mapped to one category or code in the first system. This type of mapping implies that one category or code in the first system may encompass multiple categories or codes in the second system. The skos uri is http://www.w3.org/2004/02/skos/core#narrowMatch . Indicating <A> skos:narrowMatch <B> means "B is narrower than A"

  • many-to-one (M:1) correspondence: In a many-to-one correspondence, multiple categories or codes in one classification system are mapped to a single category or code in another classification system. However, each category or code in the second system is only mapped to one category or code in the first system. This type of mapping implies that multiple categories or codes in the first system are aggregated or collapsed into a single category or code in the second system. The skos uri is http://www.w3.org/2004/02/skos/core#broadMatch . Indicating <A> skos:broadwMatch <B> means "B is broader than A"

  • many-to-many (M:M) correspondence: In a many-to-many correspondence, multiple categories or codes in one classification system are mapped to multiple categories or codes in another classification system. This type of mapping indicates complex relationships where neither a straightforward one-to-one correspondence exists, nor a parent-child relationship. The skos uri is http://www.w3.org/2004/02/skos/core#relatedMatch

The following column names are used:

  • <tree_classification_A>: code of classification A
  • <tree_classification_A>: code of classification B which is mapped to the code of classification A
  • comment: comment on the type of concordance
  • prefixed_id: unique id (uuid4)
  • skos_uri: skos uri

The requirements for these table types are specified here.

dimension table

A dimension table is used for classifications which do not have a tree structure.

The following column names are used:

  • code: code of the item
  • name: name of the item
  • description: description of the item
  • prefixed_id: unique id (uuid4)

pairwise concordance table (for Bonsai)

This type of concordance table is used to map pairwise codes. For instance, some data providers such as UNdata and IEA are using combined codes for an activity (e.g. for "production of", "electricity production by") and flowobject (e.g. "coal") to express a bonsai_activitytype ("A_COAL", "A_PowC"). In some cases, when the conc_ tables for activitytype and flowobject, which map single relations, are not sufficient to create these pairwise concordances, it is reasonable to make it explicit. The mapping relationships between the pairwise codes can be the same as in the conc_ tables.

The following column names are used: activitytype_from,flowobject_from,activitytype_to,flowobject_to,classification_from,classification_to

  • activitytype_from: code for activitytype of <from> classification
  • flowobject_from: code for flowobject of <from> classification
  • activitytype_to: code for the activitytype of <other> classification
  • flowobject_to: code for the flowobject of <other> classification
  • classification_from: name of the <from> classification schema
  • classification_to: name of the <other> classification schema
  • skos_uri: skos uri
  • comment: comment on the type of concordance
  • prefixed_id: unique id (created by uuid4)

Usage

To use the classification, you can install the package via pip. Replace <version> by a specific tag or branch name.

pip install git+ssh://git@gitlab.com/bonsamurais/bonsai/util/classifications@<version>

From pypi, do:

pip install bonsai_classifications

All classifications are provided as dataio.datapackage which include the tables as pandas.DataFrame. E.g., you can do the following get the classification tree for industry activities of Bonsai:

import classifications

bosai_tree = classifications.activitytype.datapackage.tree_bonsai

:::{note} The datapackage object includes also the tables of other classifications. :::

You can also get the concordance tables and external classifications in the similar way, using the datapackage object.

The activities and flowobjects of Bonsai can be also used directly as objects. By doing the following, you would get the name of the A_Chick activity.

classifications.activitytype.bonsai.A_Chick.name

Special methods

  • lookup() for searching strings in code names
  • get_children() to get all codes that have the same parent code
  • create_conc() to create a concordance table
  • disaggregate_bonsai() for adding new codes, which disaggregate an existing code
  • get_bonsai_schemas_mapping() returns a dict that maps Bonsai schemas to Bonsai codes
  • print_tree() prints the tree structure of a given code

To search for certain key words in a table, you can use the line of code below. This returns a pandas DataFrame with rows that have "coal" in the name column. Note that this lookup is case sensitive.

bonsai_tree.lookup("coal")

To get all children of a certain code (here for treatment activities in Bonsai), you can do use the following method. By setting the option deep=True, you get all descandents. With deep=False you get only the direct children. The option return_parent=True will include the selected parent code. The option exclude_sut_children=True will return only the children that are included by another code in the SUT.

classifications.activitytype.datapackage.tree_bonsai.get_children(parent_code="at", deep=True, return_parent=False, exclude_sut_children=False)

The package also helps to create new concordance tables. When having two concordance tables, one for mapping codes of classification a to b, and the other for mapping b to c, you can use the following:

df_1:

a b
01.01 x
... ...

df_2:

b c
x YXDA
... ...
df_3 = classifications.create_conc(df_1, df_2, source="a", target="c", intermediate="c")

df_3:

a c
01.01 YXDA
... ...

To disaggregate existing codes of the Bonsai classification, you can use the disaggregate_bonsai() method. Depending on the category, e.g. activitytype or flowobject, you can call that method. To indicate the which code you want to disaggregate, you need to provide a dictionary, with the old code of Bonsai as keys. The value corresponding to that key is a list of tuples. Each tuple represents a new code. The first entry of that tuple is the code, the second entry is the name, and the third is a mapping dictionary. This mapping dictionary includes the name of another classification scheme (other than Bonsai) as key, and a list of strings, which are the codes of the other classification now represented by the new code.

codes = {"disaggregations":
          [
            {"old_code" : "A_Paper",
             "new_codes":
               [
                {"code": "New_Paper1",
                 "description": "new paper production 1",
                 "mappings": {"nace_rev2": ["10.02","01.13"]}
                },
                {"code": "New_Paper2",
                 "description": "new paper production 2",
                 "mappings": {}
                }
                ]
            }
          ]
}

d = classifications.activitytype.datapackage.disaggregate_bonsai(codes)

Get the pandas DataFrames that are modified.

d["tree_bonsai"]
d["conc_bonsai_nace_rev2"]

To use that function via terminal, execute python disaggregate_bonsai.py <bonsai_categorty> <path/to/disaggregaion.yaml> <directory/for/updated/files>. <bonsai_category> can be for instance activitytype or flowobject.

:::{note} To disaggregate an existing code, you need to provide at least 2 new codes. It is assumed that all entities covered by the new codes are equal to the entities of the existing code. :::

The print_tree(toplevelcode) method helps to inspect the tree structure for a given code.

classifications.flowobject.datapackage.tree_bonsai.print_tree("C_Wine")

The differentiation between bold and italic text is only relevant for the Bonsai-SUT. Italic written codes are "not part" of the inspected toplevelcode, since these are explicitly in the SUTs. Since these codes are seperatly in the SUT, the definition of the toplevelcode is thus "code, excluding the the italic children".

𝐂_𝐖𝐢𝐧𝐞
├── 𝐟𝐢_𝟐𝟒𝟐𝟏𝟏
├── 𝘊_𝘎𝘳𝘢𝘱𝘵

Project details


Download files

Download the file for your platform. If you're not sure which to choose, learn more about installing packages.

Source Distribution

bonsai_classifications-0.3.9.tar.gz (3.8 MB view details)

Uploaded Source

Built Distribution

If you're not sure about the file name format, learn more about wheel file names.

bonsai_classifications-0.3.9-py3-none-any.whl (2.9 MB view details)

Uploaded Python 3

File details

Details for the file bonsai_classifications-0.3.9.tar.gz.

File metadata

  • Download URL: bonsai_classifications-0.3.9.tar.gz
  • Upload date:
  • Size: 3.8 MB
  • Tags: Source
  • Uploaded using Trusted Publishing? No
  • Uploaded via: twine/6.0.1 CPython/3.12.8

File hashes

Hashes for bonsai_classifications-0.3.9.tar.gz
Algorithm Hash digest
SHA256 365ebfab661bf0cccce9146065c8e9bc6b2247da98c375126f9e4769026eef35
MD5 cfaf2938fa6469fb6230e04966f18a3b
BLAKE2b-256 939358c0bbba891df72413d6b431a1bf9cdba3a29fe99b68ae26839505565391

See more details on using hashes here.

File details

Details for the file bonsai_classifications-0.3.9-py3-none-any.whl.

File metadata

File hashes

Hashes for bonsai_classifications-0.3.9-py3-none-any.whl
Algorithm Hash digest
SHA256 05196e194f5e31a8b09e13f7f04a02a854bb6e2cb59c69b5cd8927da910e442b
MD5 eaf793e39b4dc48ab95338f8d30c3591
BLAKE2b-256 42ac493571b6ac4369cd65180bc8bb717d46ea8c1bd12fc40121216f12017030

See more details on using hashes here.

Supported by

AWS Cloud computing and Security Sponsor Datadog Monitoring Depot Continuous Integration Fastly CDN Google Download Analytics Pingdom Monitoring Sentry Error logging StatusPage Status page