The IRMA Community
Newsletters
Research IRM
Click a keyword to search titles using our InfoSci-OnDemand powered search:
|
On Semantic Relation Extraction Over Enterprise Data
|
|
Author(s): Wei Shen (Nankai University, China), Jianyong Wang (Tsinghua University, China & Jiangsu Normal University, China), Ping Luo (Chinese Academy of Sciences, China)and Min Wang (Visa Inc., USA)
Copyright: 2018
Pages: 23
Source title:
Innovations, Developments, and Applications of Semantic Web and Information Systems
Source Author(s)/Editor(s): Miltiadis D. Lytras (American College of Greece, Greece), Naif Aljohani (King Abdulaziz University, Saudi Arabia), Ernesto Damiani (University of Milan, Italy)and Kwok Tai Chui (The Open University of Hong Kong, Hong Kong)
DOI: 10.4018/978-1-5225-5042-6.ch003
PurchaseView on the publisher's website for pricing and purchasing information.
|
Abstract
Relation extraction from the Web data has attracted a lot of attention recently. However, little work has been done when it comes to the enterprise data regardless of the urgent needs to such work in real applications (e.g., E-discovery). One distinct characteristic of the enterprise data (in comparison with the Web data) is its low redundancy. Previous work on relation extraction from the Web data largely relies on the data's high redundancy level and thus cannot be applied to the enterprise data effectively. This chapter reviews related work on relation extraction and introduces an unsupervised hybrid framework REACTOR for semantic relation extraction over enterprise data. REACTOR combines a statistical method, classification, and clustering to identify various types of relations among entities appearing in the enterprise data automatically. REACTOR was evaluated over a real-world enterprise data set from HP that contains over three million pages and the experimental results show its effectiveness.
Related Content
|
.
© 2020.
58 pages.
|
|
.
© 2020.
52 pages.
|
|
.
© 2020.
10 pages.
|
|
.
© 2020.
14 pages.
|
|
.
© 2020.
33 pages.
|
|
.
© 2020.
13 pages.
|
|
.
© 2020.
36 pages.
|
|
|