Research on Entity Resolution Algorithm Based on Domain Ontology Using MapReduce

2013 ◽  
Vol 385-386 ◽  
pp. 1669-1674
Author(s):  
Peng Xia Zhou ◽  
Shi Hang Huang ◽  
Xue Jiang ◽  
Jun Jie Wang ◽  
De Peng Dang
Keyword(s):  
Input Data ◽  
Entity Resolution ◽  
Domain Ontology ◽  
Leaf Node ◽  
Merging Algorithm ◽  
Resolution Algorithm ◽  
Hierarchical Relationships

DO-Swoosh algorithm maps the input data to domain ontology and count the amount of data for each leaf node. Then define the distance between nodes according to the hierarchical relationships reflected by domain ontology and propose a node merging algorithm based on the principles of data balance and nearest merge. At last, perform entity resolution for each group according to the node merging result. DO-Swoosh still keeps the good generality and gets better performance and scalability with the aid of MapReduce.

Transmission Electron Diffraction Analysis by Computer

1970 ◽  
Vol 28 ◽  
pp. 40-41
Author(s):  
R.A. Ploc ◽  
G.H. Keech
Keyword(s):  
Electron Diffraction ◽  
Input Data ◽  
Reciprocal Lattice ◽  
Computer Programme ◽  
Transmission Electron Diffraction ◽  
Usual Procedure ◽  
Transmission Electron ◽  
Complex Shapes ◽  
Computer Input ◽  
Diffraction Effects

An unambiguous analysis of transmission electron diffraction effects requires two samplings of the reciprocal lattice (RL). However, extracting definitive information from the patterns is difficult even for a general orthorhombic case. The usual procedure has been to deduce the approximate variables controlling the formation of the patterns from qualitative observations. Our present purpose is to illustrate two applications of a computer programme written for the analysis of transmission, selected area diffraction (SAD) patterns; the studies of RL spot shapes and epitaxy.When a specimen contains fine structure the RL spots become complex shapes with extensions in one or more directions. If the number and directions of these extensions can be estimated from an SAD pattern the exact spot shape can be determined by a series of refinements of the computer input data.

Bankruptcy Model Construction and its Limitation in Input Data Quality

2019 ◽  
Vol 10 (2) ◽  
pp. 117-125
Author(s):  
Dana Kubíčková ◽  
◽  
Vladimír Nulíček ◽  
Keyword(s):  
Data Quality ◽  
Normal Distribution ◽  
Input Data ◽  
Model Construction ◽  
The Third ◽  
Third Stage ◽  
Discriminant Analyses ◽  
One Year ◽  
The University ◽  
Multivariate Discriminant

The aim of the research project solved at the University of Finance and administration is to construct a new bankruptcy model. The intention is to use data of the firms that have to cease their activities due to bankruptcy. The most common method for bankruptcy model construction is multivariate discriminant analyses (MDA). It allows to derive the indicators most sensitive to the future companies’ failure as a parts of the bankruptcy model. One of the assumptions for using the MDA method and reassuring the reliable results is the normal distribution and independence of the input data. The results of verification of this assumption as the third stage of the project are presented in this article. We have revealed that this assumption is met only in a few selected indicators. Better results were achieved in the indicators in the set of prosperous companies and one year prior the failure. The selected indicators intended for the bankruptcy model construction thus cannot be considered as suitable for using the MDA method.

Sign in / Sign up

Export Citation Format

Share Document