Dataset Information

Machine part data with part-of relations and part dissimilarities for planted partition generation.

ABSTRACT: Identifying relationships between entities in data is a central topic across various industries and businesses, from social networks to supply chain and heavy manufacturing industries. In this paper we present data from a database of machinery represented in terms of machine parts. The machine parts are originally organised in tree structures where the vertices are machine part types, and the edges are "part-of" relations. Hence, each tree represents a type of machinery broken down into its machine part constituent types. The data we present is the union over these trees, making up a directed acyclic graph describing the type hierarchy of the machine parts. The motivation for publishing the dataset is the following real-world industry problem: Each tree represents a mechanical design, and over time some designs have been copy-pasted with minor modifications. The new instances have been given new identifiers with no reference to where from they were copied. In hindsight, it is desirable to recover the copy-paste links to for interchange between essentially identical designs. However, telling which parts are copies of which other parts has turned out to be difficult. In particular, the metadata has a tendency of displaying higher similarities within a composite part than between a part and its copy. Due to non-disclosure, we cannot provide the metadata, but we provide element wise dissimilarities that are generated based on the metadata using classical methods such as Jaccard similarity on description texts, material types etc. The dissimilarities are obtained from a data science project in the company owning the data, trying to tackle the very problem of recovering the copy-paste links. Availability of labeled data on this data set is limited, so based on our in-depth knowledge of the problem domain, we present a data synthesisation method that can generate arbitrarily large problem instances of the copy-paste problem based on the sample data, that provides a realistic representation of the real world problem. The problems are presented as planted partitions of vertices of directed acyclic graphs with vertex dissimilarities, and thus constitutes a typical classification problem along the lines of graph- or network clustering. The type of industry data we present is usually company confidential, bound by intellectual property rights, and generally not available to scientists. We therefore publish this anonymised dataset to offer real world sample data and generated problem instances for researchers that are interested in this type of classification problems, and on which theories and algorithms can be tested. The data and the problem generation methodology are backed by a Python implementation, providing both data access and an API for parameterised problem generation. The data is also available as raw files.

SUBMITTER: Bakkelund D

PROVIDER: S-EPMC8971586 | biostudies-literature | 2022 Jun

REPOSITORIES: biostudies-literature

ACCESS DATA

Publications

Machine part data with part-of relations and part dissimilarities for planted partition generation.

Bakkelund Daniel D

Data in brief 20220321

Identifying relationships between entities in data is a central topic across various industries and businesses, from social networks to supply chain and heavy manufacturing industries. In this paper we present data from a database of machinery represented in terms of machine parts. The machine parts are originally organised in tree structures where the vertices are machine part types, and the edges are "part-of" relations. Hence, each tree represents a type of machinery broken down into its mach ...[more]

PMID: 35372649

Similar Datasets

Project description:For decades, researchers have used the concepts of rate of change and differential equations to model and forecast neoplastic processes. This expressive mathematical apparatus brought significant insights in oncology by describing the unregulated proliferation and host interactions of cancer cells, as well as their response to treatments. Now, these theories have been given a new life and found new applications. With the advent of routine cancer genome sequencing and the resulting abundance of data, oncology now builds an "arsenal" of new modeling and analysis tools. Models describing the governing physical laws of tumor-host-drug interactions can be now challenged with biological data to make predictions about cancer progression. Our study joins the efforts of the mathematical and computational oncology community by introducing a novel machine learning system for data-driven discovery of mathematical and physical relations in oncology. The system utilizes computational mechanisms such as competition, cooperation, and adaptation in neural networks to simultaneously learn the statistics and the governing relations between multiple clinical data covariates. Targeting an easy adoption in clinical oncology, the solutions of our system reveal human-understandable properties and features hidden in the data. As our experiments demonstrate, our system can describe nonlinear conservation laws in cancer kinetics and growth curves, symmetries in tumor's phenotypic staging transitions, the preoperative spatial tumor distribution, and up to the nonlinear intracellular and extracellular pharmacokinetics of neoadjuvant therapies. The primary goal of our work is to enhance or improve the mechanistic understanding of cancer dynamics by exploiting heterogeneous clinical data. We demonstrate through multiple instantiations that our system is extracting an accurate human-understandable representation of the underlying dynamics of physical interactions central to typical oncology problems. Our results and evaluation demonstrate that, using simple-yet powerful-computational mechanisms, such a machine learning system can support clinical decision-making. To this end, our system is a representative tool of the field of mathematical and computational oncology and offers a bridge between the data, the modeler, the data scientist, and the practicing clinician.

Project description:BackgroundWith the development of the technology of single-cell sequence, revealing homogeneity and heterogeneity between cells has become a new area of computational systems biology research. However, the clustering of cell types becomes more complex with the mutual penetration between different types of cells and the instability of gene expression. One way of overcoming this problem is to group similar, related single cells together by the means of various clustering analysis methods. Although some methods such as spectral clustering can do well in the identification of cell types, they only consider the similarities between cells and ignore the influence of dissimilarities on clustering results. This methodology may limit the performance of most of the conventional clustering algorithms for the identification of clusters, it needs to develop special methods for high-dimensional sparse categorical data.ResultsInspired by the phenomenon that same type cells have similar gene expression patterns, but different types of cells evoke dissimilar gene expression patterns, we improve the existing spectral clustering method for clustering single-cell data that is based on both similarities and dissimilarities between cells. The method first measures the similarity/dissimilarity among cells, then constructs the incidence matrix by fusing similarity matrix with dissimilarity matrix, and, finally, uses the eigenvalues of the incidence matrix to perform dimensionality reduction and employs the K-means algorithm in the low dimensional space to achieve clustering. The proposed improved spectral clustering method is compared with the conventional spectral clustering method in recognizing cell types on several real single-cell RNA-seq datasets.ConclusionsIn summary, we show that adding intercellular dissimilarity can effectively improve accuracy and achieve robustness and that improved spectral clustering method outperforms the traditional spectral clustering method in grouping cells.

Dataset Information

Machine part data with part-of relations and part dissimilarities for planted partition generation.

Publications

Machine part data with part-of relations and part dissimilarities for planted partition generation.

Similar Datasets

OmicsDI is part of the ELIXIR infrastructure

Tweets