Sökning: id:"swepub:oai:DiVA.org:ltu-72928" >
Applying graph matc...
Applying graph matching techniques to enhance reuse of plant design information
-
- Rantala, Miia (författare)
- Semantum Oy, Espoo, Finland
-
- Niemistö, Hannu (författare)
- Semantum Oy, Espoo, Finland
-
- Karhela, Tommi (författare)
- Semantum Oy, Espoo, Finland; Aalto University, Helsinki, Finland
-
visa fler...
-
- Sierla, Seppo (författare)
- Aalto University, Helsinki, Finland
-
- Vyatkin, Valeriy (författare)
- Luleå tekniska universitet,Datavetenskap
-
visa färre...
-
(creator_code:org_t)
- Elsevier, 2019
- 2019
- Engelska.
-
Ingår i: Computers in industry (Print). - : Elsevier. - 0166-3615 .- 1872-6194. ; 107, s. 81-98
- Relaterad länk:
-
https://research.aal...
-
visa fler...
-
https://urn.kb.se/re...
-
https://doi.org/10.1...
-
visa färre...
Abstract
Ämnesord
Stäng
- This article investigates how graph matching can be applied to process plant design data in order to support the reuse of previous designs. A literature review of existing graph matching algorithms is performed, and a group of algorithms is chosen for further testing. A use case from early phase plant design is presented. A methodology for addressing the use case is proposed, including graph simplification algorithms and node similarity measures, so that existing graph matching algorithms can be applied in the process plant domain. The proposed methodology is evaluated empirically on an industrial case consisting of design data from several pulp and paper plants.
Ämnesord
- NATURVETENSKAP -- Data- och informationsvetenskap -- Datavetenskap (hsv//swe)
- NATURAL SCIENCES -- Computer and Information Sciences -- Computer Sciences (hsv//eng)
Nyckelord
- Design reuse
- Engineering design
- Inexact graph matching
- Node similarity
- Process plant
- Pulp and paper
- Dependable Communication and Computation Systems
- Kommunikations- och beräkningssystem
Publikations- och innehållstyp
- ref (ämneskategori)
- art (ämneskategori)
Hitta via bibliotek
Till lärosätets databas