Close category search window
 

Analysis of co-occurrence relationship between named entity in Web page

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

2 Author(s)
Weiyun Lin ; Sch. of Comput. Sci., Beijing Univ. of Technol., Beijing, China ; Zongli Jiang

In order to analyze the closeness of named entities in massive web pages, the word co-occurrence algorithm FDC(frequency, term distance, co-collection ratio) is employed to evaluate the co-occurrence relationships between the named entities by their co-occurrence frequency, relative position and the ratio of co-occurrence among a document. And by employing the proper value of named entities' co-occurrence frequency and the relative distances between the two named entities, the FDC algorithm is improved. Experiments show that the improved FDC algorithm has better performance.

Published in:
Computer Science and Service System (CSSS), 2011 International Conference on

Date of Conference: 27-29 June 2011

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.