International Peer-Reviewed Open Access Journal ISSN (Online): 2395-5325
IJCRCST Logo

International Journal of Contemporary Research in Computer Science and Technology

Peer Reviewed Open Access Fully Refereed Journal Since 2015
Download Full PDF
Article Information
  • Published In Volume 2, Issue 3 (2016)
  • Publication Date July 28, 2026
  • Manuscript ID IJCRCST-MARCH16-28
  • Article Type Research Paper
  • Pages 588 - 590
  • 6 Views 0 Downloads

Abstract

One-to-many data linkage is an essential task in many domains, yet only a handful of prior publications have addressed this issue. Furthermore, while traditionally data linkage is performed among entities of the same type, it is extremely necessary to develop linkage techniques that link between matching entities of different types as well. In this paper we propose a new one-to-many data linkage method that links between entities of different natures. The proposed method is based on a one-class clustering tree (OCCT) which characterizes the entities that should be linked together. The tree is built such that it is easy to understand and transform into association rules, i.e., the inner nodes consist only of features describing the first set of entities, while the leaves of the tree represent features of their matching entities from the second dataset. We propose four splitting criteria and two different pruning methods which can be used for inducing the OCCT.The method was evaluated using datasets from three different domains. The results affirm the effectiveness of the proposed method and show that the OCCT yields better performance in terms of precision and recall (in most cases it is statistically significant) when compared to a C4.5 decision tree-based linkage

Keywords

Text mining Text feature extraction Text classification

Authors

I.Anisha Agnes
K.Nivetha
M.Rajeswari
How to Cite this Article

I.Anisha Agnes, K.Nivetha, M.Rajeswari (2016). "EFFECTIVE CLASSIFICATION OF TEXT AND IMPROVING LEARNING EXPERIENCE". International Journal of Contemporary Research in Computer Science and Technology, 2(3), pp. 588-590.