scholarly journals ADDRESSING THE ELEPHANT IN THE UNDERGROUND: AN ARGUMENT FOR THE INTEGRATION OF HETEROGENEOUS DATA SOURCES FOR RECONCILIATION OF SUBSURFACE UTILITY DATA

2021 ◽  
Vol XLVI-4/W4-2021 ◽  
pp. 43-48
Author(s):  
L. H. Hansen ◽  
R. van Son ◽  
A. Wieser ◽  
E. Kjems
Keyword(s):  
Heterogeneous Data ◽  
Data Sources ◽  
Data Reconciliation ◽  
Future Research ◽  
Technological Readiness ◽  
Heterogeneous Data Sources ◽  
Master Data ◽  
Master Data Management ◽  
Legacy Data ◽  
3D Scans

Abstract. In this paper we address the issue of unreliable subsurface utility information. Data on subsurface utilities are often positionally inaccurate, not up to date, and incomplete, leading to increased uncertainty, costs, and delays incurred in underground-related projects. Despite opportunities for improvement, the quality of legacy data remains unaddressed. We address the legacy data issue by making an argument for an approach towards subsurface utility data reconciliation that relies on the integration of heterogeneous data sources. These data sources can be collected at opportunities that occur throughout the life cycle of subsurface utilities and include as-built GIS records, GPR scans, and open excavation 3D scans. By integrating legacy data with newly captured data sources, it is possible to verify, (re)classify and update the data and improve it for future use. To demonstrate the potential of an integration-driven data reconciliation approach, we present real-world use cases from Denmark and Singapore. From these cases, challenges towards implementation of the approach were identified that include a lack of technological readiness, a lack of incentive to capture and share the data, increased cost, and data sharing concerns. Future research should investigate in detail how various data sources lead to improved data quality, develop a data model that brings together all necessary data sources for integration, and a framework for governance and master data management to ensure roles and responsibilities can be feasibly enacted.

scholarly journals A multi-agent conversational system with heterogeneous data sources access

2016 ◽  
Vol 53 ◽  
pp. 172-191 ◽  
Author(s):  
Eduardo M. Eisman ◽  
María Navarro ◽  
Juan Luis Castro
Keyword(s):  
Heterogeneous Data ◽  
Data Sources ◽  
Heterogeneous Data Sources ◽  
Multi Agent

scholarly journals Prediction of RNA subcellular localization: learning from heterogeneous data sources

iScience ◽  
2021 ◽  
pp. 103298
Author(s):  
Anca Flavia Savulescu ◽  
Emmanuel Bouilhol ◽  
Nicolas Beaume ◽  
Macha Nikolski
Keyword(s):  
Subcellular Localization ◽  
Heterogeneous Data ◽  
Data Sources ◽  
Heterogeneous Data Sources

scholarly journals Learning from heterogeneous data sources: an application in spatial proteomics

2015 ◽  
Author(s):  
Lisa M. Breckels ◽  
Sean Holden ◽  
David Wojnar ◽  
Claire M. Mulvey ◽  
Andy Christoforou ◽  
...  
Keyword(s):  
Mass Spectrometry ◽  
Support Vector Machine ◽  
Transfer Learning ◽  
High Throughput ◽  
Cell Biology ◽  
Heterogeneous Data ◽  
Data Sources ◽  
Support Vector ◽  
Proteomics Data ◽  
Heterogeneous Data Sources

AbstractSub-cellular localisation of proteins is an essential post-translational regulatory mechanism that can be assayed using high-throughput mass spectrometry (MS). These MS-based spatial proteomics experiments enable us to pinpoint the sub-cellular distribution of thousands of proteins in a specific system under controlled conditions. Recent advances in high-throughput MS methods have yielded a plethora of experimental spatial proteomics data for the cell biology community. Yet, there are many third-party data sources, such as immunofluorescence microscopy or protein annotations and sequences, which represent a rich and vast source of complementary information. We present a unique transfer learning classification framework that utilises a nearest-neighbour or support vector machine system, to integrate heterogeneous data sources to considerably improve on the quantity and quality of sub-cellular protein assignment. We demonstrate the utility of our algorithms through evaluation of five experimental datasets, from four different species in conjunction with four different auxiliary data sources to classify proteins to tens of sub-cellular compartments with high generalisation accuracy. We further apply the method to an experiment on pluripotent mouse embryonic stem cells to classify a set of previously unknown proteins, and validate our findings against a recent high resolution map of the mouse stem cell proteome. The methodology is distributed as part of the open-source Bioconductor pRoloc suite for spatial proteomics data analysis.AbbreviationsLOPITLocalisation of Organelle Proteins by Isotope TaggingPCPProtein Correlation ProfilingMLMachine learningTLTransfer learningSVMSupport vector machinePCAPrincipal component analysisGOGene OntologyCCCellular compartmentiTRAQIsobaric tags for relative and absolute quantitationTMTTandem mass tagsMSMass spectrometry

scholarly journals An Iterative Automatic Final Alignment Method in the Ontology Matching System

2018 ◽  
Vol 42 (1) ◽  
pp. 39-61 ◽  
Author(s):  
Marko Gulić ◽  
Marin Vuković
Keyword(s):  
Heterogeneous Data ◽  
Data Sources ◽  
Ontology Matching ◽  
Alignment Method ◽  
Automatic Adjustment ◽  
Matching Process ◽  
Heterogeneous Data Sources ◽  
Final Alignment

Ontology matching plays an important role in the integration of heterogeneous data sources that are described by ontologies. In order to determine correspondences between ontologies, a set of matchers can be used. After the execution of these matchers and the aggregation of the results obtained by these matchers, a final alignment method is executed in order to select appropriate correspondences between entities of compared ontologies. The final alignment method is an important part of the ontology matching process because it directly determines the output result of this process. In this paper we improve our iterative final alignment method by introducing an automatic adjustment of final alignment threshold as well as a new rule for determining false correspondences with similarity values greater than adjusted threshold. An evaluation of the method is performed on the test ontologies of the OAEI evaluation contest and a comparison with other final alignment methods is given.

Sign in / Sign up

Export Citation Format

Share Document