mlsanityData to 14 Oct 2026

Representation Learning of Complex Assemblies, An Effort to Improve Corporate Scope 3 Emissions Calculation

arXiv 2409.03769 ↗First posted 21 Aug 2024cs.CY cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

Climate change is a pressing global concern for governments, corporations, and citizens alike. This concern underscores the necessity for these entities to accurately assess the climate impact of manufacturing goods and providing services. Tools like process life cycle analysis (pLCA) are used to evaluate the climate impact of production, use, and disposal, from raw material mining through end-of-life. pLCA further enables practitioners to look deeply into material choices or manufacturing processes for individual parts, sub-assemblies, assemblies, and the final product. Reliable and detailed data on the life cycle stages and processes of the product or service under study are not always available or accessible, resulting in inaccurate assessment of climate impact. To overcome the data limitation and enhance the effectiveness of pLCA to generate an improved environmental impact profile, we are adopting an innovative strategy to identify alternative parts, products, and components that share similarities in terms of their form, function, and performance to serve as qualified substitutes. Focusing on enterprise electronics hardware, we propose a semi-supervised learning-based framework to identify substitute parts that leverages product bill of material (BOM) data and a small amount of component-level qualified substitute data (positive samples) to generate machine knowledge graph (MKG) and learn effective embeddings of the components that constitute electronic hardware. Our methodology is grounded in attributed graph embeddings and introduces a strategy to generate biased negative samples to significantly enhance the training process. We demonstrate improved performance and generalization over existing published models.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 22 of its 48 references that are in the map. First posted on arXiv 21 Aug 2024.

Builds on

22 of 48 references.

References · 22

  1. 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,361
  2. 2017Graph Attention Networkscited by 8,923
  3. 2017Inductive Representation Learning on Large Graphscited by 6,320
  4. 2019Fast Graph Representation Learning with PyTorch Geometriccited by 2,434
  5. 2019Simplifying Graph Convolutional Networkscited by 1,477
  6. 2018Relational inductive biases, deep learning, and graph networkscited by 1,360
  7. 2014Embedding Entities and Relations for Learning and Inference in Knowledge Basescited by 932
  8. 2016Complex Embeddings for Simple Link Predictioncited by 902
  9. 2020Simple and Deep Graph Convolutional Networkscited by 860
  10. 2020Adaptive Universal Generalized PageRank Graph Neural Networkcited by 595
  11. 2019Multi-scale Attributed Node Embeddingcited by 548
  12. 2019MixHop: Higher-Order Graph Convolutional Architectures via Sparsified Neighborhood Mixingcited by 443
10 more
  1. 2021Large Scale Learning on Non-Homophilous Graphs: New Benchmarks and Strong Simple Methodscited by 311
  2. 2019Revisiting Graph Neural Networks: All We Have is Low-Pass Filterscited by 261
  3. 2020Graph Neural Networks with Heterophilycited by 202
  4. 2021Two Sides of the Same Coin: Heterophily and Oversmoothing in Graph Convolutional Neural Networkscited by 182
  5. 2020Node Similarity Preserving Graph Convolutional Networkscited by 112
  6. 2022How to Find Your Friendly Neighborhood: Graph Attention Design with Self-Supervisioncited by 102
  7. 2020Non-Local Graph Neural Networkscited by 91
  8. 2018Incorporating Literals into Knowledge Graph Embeddingscited by 29
  9. 2020Friend or Faux: Graph-Based Early Detection of Fake Accounts on Social Networkscited by 19
  10. 2022Link Prediction on Heterophilic Graphs via Disentangled Representation Learningcited by 13

Built on by

Not cited yet.