Automated One-To Many Data Linkage |
Author(s): |
| Shahid Anwar , G.H.Raisoni academy college of engineering nagpur india; Prof. Deepak Kapgate, G.H.Raisoni academy college of engineering nagpur india |
Keywords: |
| Clustering, Data Linkage, Data Matching |
Abstract |
|
One-to-many information linkage is an important task in several domains nevertheless solely a couple of previous publications have addressed this issue. Moreover, whereas historically data linkage is performed among entities of constant sort, it's very necessary to develop linkage techniques that link between matching entities of various varieties further. We have a tendency to propose a replacement one-to-many data linkage technique that links between entities of various natures. The projected technique is predicated on a one-class clustering tree (OCCT) that characterizes the entities that ought to be joined along. The tree is made such it's simple to know and remodel into association rules, i.e., the inner nodes consist solely of options describing the primary set of entities, whereas the leaves of the tree represent features of their matching entities from the second data set. We have a tendency to propose four splitting criteria and two totally different pruning ways that can be used for causation the OCCT. The strategy was evaluated mistreatment data sets from three totally different domains. The results affirm the effectiveness of the projected technique and show that the OCCT yields higher performance. |
Other Details |
|
Paper ID: IJSRDV3I41045 Published in: Volume : 3, Issue : 4 Publication Date: 01/07/2015 Page(s): 1788-1791 |
Article Preview |
|
|
|
|
