Web document summarization by exploiting social context with matrix co-factorization     

Minh-Tien Nguyen  Viet Cuong Tran  Xuan Hoai Nguyen  Le-Minh Nguyen 《Information processing & management》2019,56(3):495-515

In the context of social media, users usually post relevant information corresponding to the contents of events mentioned in a Web document. This information posses two important values in that (i) it reflects the content of an event and (ii) it shares hidden topics with sentences in the main document. In this paper, we present a novel model to capture the nature of relationships between document sentences and post information (comments or tweets) in sharing hidden topics for summarization of Web documents by utilizing relevant post information. Unlike previous methods which are usually based on hand-crafted features, our approach ranks document sentences and user posts based on their importance to the topics. The sentence-user-post relation is formulated in a share topic matrix, which presents their mutual reinforcement support. Our proposed matrix co-factorization algorithm computes the score of each document sentence and user post and extracts the top ranked document sentences and comments (or tweets) as a summary. We apply the model to the task of summarization on three datasets in two languages, English and Vietnamese, of social context summarization and also on DUC 2004 (a standard corpus of the traditional summarization task). According to the experimental results, our model significantly outperforms the basic matrix factorization and achieves competitive ROUGE-scores with state-of-the-art methods.  相似文献   

The effect of use and access on citations     

Michael J. Kurtz  Guenther Eichhorn  Alberto Accomazzi  Carolyn Grant  Markus Demleitner  Edwin Henneken  Stephen S. Murray 《Information processing & management》2005,41(6):1395-1402

It has been shown (Lawrence, S. (2001). Online or invisible? Nature, 411, 521) that journal articles which have been posted without charge on the internet are more heavily cited than those which have not been. Using data from the NASA Astrophysics Data System (ads.harvard.edu) and from the ArXiv e-print archive at Cornell University (arXiv.org) we examine the causes of this effect.  相似文献   

地区文献资源共建共享的优化平台——天津市高校联合图书馆运行模式   总被引：7，自引：0，他引：7  

刘家新 《情报科学》2002,20(11):1176-1178

本文介绍了天津市高校联合图书馆自动化系统解决方案，阐明对地区高校文献资源共建共享的设计思想，同时对这一过程中出现的问题提出了 解决的方法。  相似文献   

A relevance feedback mechanism for cluster-based retrieval     

Niall Rooney  David Patterson  Mykola Galushka  Vladimir Dobrynin 《Information processing & management》2006

Contextual document clustering is a novel approach which uses information theoretic measures to cluster semantically related documents bound together by an implicit set of concepts or themes of narrow specificity. It facilitates cluster-based retrieval by assessing the similarity between a query and the cluster themes’ probability distribution. In this paper, we assess a relevance feedback mechanism, based on query refinement, that modifies the query’s probability distribution using a small number of documents that have been judged relevant to the query. We demonstrate that by providing only one relevance judgment, a performance improvement of 33% was obtained.  相似文献   

高等院校现代化图书馆秒科文献信息中心建设   总被引：1，自引：0，他引：1  

方万国 《情报科学》1998,16(5):403-405

本文以高等教育实施211工程为出发点,探讨了高等院校图书馆现代化学科文献信息中心建设的目标、结构及其功能。  相似文献   

广东省科技文献资源状况与发展思考   总被引：5，自引：0，他引：5  

周虹 《情报科学》2004,22(6):695-698

调查广东省最具代表的15个科技文献情报机构，分析广东省科技文献资源建设、数字化共建共享、信息开发利用状况，指出该省文献资源建设发展面临的挑战，最后提出广东省科技文献资源发展的措施建议．  相似文献   

中国农业:报酬递增与"剩余之谜"     

刘金山 《未来与发展》2007,(6):25-28

本文在综述我国农业增长"剩余之谜"研究基础上,从报酬递增角度考察农业发展,分析我国农业报酬递增的源泉,探讨农业发展中的逆报酬递增行为,最后提出实现农业报酬递增的政策含义。  相似文献   

基于网络环境的高校图书馆文献资源建设     

索君莉 《中国科技信息》2005,(3):7-7

网络环境下高校图书馆的文献资源建设要加强多层次的数据库建设,重视利用网上资源,建立与专家的合作机制,加强馆际协作,实现资源共享,并应兼顾传统文献与电子文献。  相似文献   

中文科技文献的网络检索及其资源   总被引：2，自引：0，他引：2  

林立 《情报科学》2001,19(10):1075-1077

简述科技文献检索工具的发展过程，分析网络检索的优势与制约因素，介绍因特网上大型中文科技文献数据库资源，并从检索应用的角度对它们进行了比较。  相似文献   

一个K-均值文档聚类的改进算法     

吴景岚  刘燕  朱文兴 《闽江学院学报》2004,25(2):48-52

k均值算法是一个常用的局部搜索算法，它的主要缺陷是容易陷入局部极小，并且该局部极小解与全局最优解往往有很大的偏差。本文提出一个基于K-均值的迭代局部搜索文档聚类算法。该算法以k均值算法所得到的解作为初始解，从该初始解开始作局部搜索。在搜索过程中接受部分劣解。当解无法改进时，算法对所得到的局部极小解做适当强度的扰动后进行下一次的迭代，以跳出局部极小，从而拓展了搜索的范围。实验结果表明该算法对文档数据集聚类的正确性迭99％以上。  相似文献