QQ客服 官方微博 反馈留言

	A way to improve graph-based keyword extraction
	Cao, Jian ; Jiang, Zhiheng ; Huang, May ; Wang, Karl
	2015
英文摘要	Keyword extraction aims to find representative phrases for a document. Graph-based keyword extraction represent the input document as a graph and rank its nodes according to their score using graph-based ranking method. In this paper, we propose a method to compute importance of co-occurrence word in document and apply it in graph approach to find more representative phrases; introduce words correlation degree in document language network to improve performance when extracting average number of keyword in document. The experiment results show the effectiveness of proposed approach. ? 2015 IEEE.; EI; 166-170
语种	英语
出处	IEEE International Conference on Computer and Communications, ICCC 2015
DOI标识	10.1109/CompComm.2015.7387561
内容类型	其他
源URL	[http://ir.pku.edu.cn/handle/20.500.11897/436326]
专题	软件与微电子学院
推荐引用方式 GB/T 7714	Cao, Jian,Jiang, Zhiheng,Huang, May,et al. A way to improve graph-based keyword extraction. 2015-01-01.

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。