By Topic

Accommodating New Relations for e-Business Text Mining Applications

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Ki Chan ; Dept. of Syst. Eng. & Eng. Manage., Chinese Univ. of Hong Kong, Hong Kong, China ; Wai Lam ; Tak-Lam Wong

We investigate an approach of accommodating new logic relations, represented in Markov Logic Networks (MLN), from a source domain to a target domain automatically. One characteristic of this problem setting is that logic relations, which are expressed as logic formulae, previously prepared for the source domain dealing with a text mining application are not sufficient for the target domain. Therefore, new logic formulae for the target domain are automatically discovered by capturing the core logic relations for both domains and the candidate relations in the target domain using the unlabeled data in the target domain. Experimental results demonstrate that the new formulae discovered improve the performance on the target domain.

Published in:

Networking and Distributed Computing (ICNDC), 2010 First International Conference on

Date of Conference:

21-24 Oct. 2010