Document recommendation for knowledge sharing in personal folder environments

Sharing sustainable and valuable knowledge among knowledge workers is a fundamental aspect of knowledge management. In organizations, knowledge workers usually have personal folders in which they organize and store needed codified knowledge (textual documents) in categories. In such personal folder environments, providing knowledge workers with needed knowledge from other workers’ folders is important because it increases the workers’ productivity and the possibility of reusing and sharing knowledge. Conventional recommendation methods can be used to recommend relevant documents to workers; however, those methods recommend knowledge items without considering whether the items are assigned to the appropriate category in the target user’s personal folders. In this paper, we propose novel document recommendation methods, including content-based filtering and categorization, collaborative filtering and categorization, and hybrid methods, which integrate text categorization techniques, to recommend documents to target worker’s personalized categories. Our experiment results show that the hybrid methods outperform the pure content-based and the collaborative filtering and categorization methods. The proposed methods not only proactively notify knowledge workers about relevant documents held by their peers, but also facilitate push-mode knowledge sharing.     

关联规则剪枝的运用

该文重点介绍了最新的一种关联规则后处理的方法,并且我们提出了这种方法的优化算法,能够有效去除关联规则集合中的无趣模式,并且为模式的可视化提供了良好的工具。相关实验表明该方法具有更好的模式后处理能力。     

基于数据库划分的关联规则算法

关联规则是数据挖掘的一个重要研究方向.分析了FP算法的优缺点,提出了一种基于数据库划分的算法PFp算法,从理论上证明了该算法的正确性.该方法将事务数据库划分为子事务数据库,在子事务数据库中挖掘局部频繁项集,并入到全局频繁项集中,采用连接和剪枝策略有效挖掘出局部不频繁但全局频繁的频繁项集.实验结果表明,该算法比FP算法更加有效.     

存储最优的连续MAX查询方法

考虑滑动窗口数据流上的连续MAX查询问题,提出了一种存储最优的方法.该方法只需保存数据集中可能成为极大值点的部分数据(候选点集),而将所有完全不可能成为极值点的数据进行丢弃,从而可以有效降低存储开销;提出了一个动态维护候选点集的方法,当数据独立分布时,处理一个新到数据所需的时间为O(1og N),处理数据失效的时间开销为O(1),其中N为滑动窗口包含的全部数据数目.理论分析和实验结果表明了该方法能够适应流速很快的场景,具有较高的效率.     

一种基于DOM的Web文档主题划分方法

主题划分是多主题文档自动摘要中的一个重要问题,提出了一种以网页结构为指导,利用页面对应DOM树中节点的自然分割功能以及相邻边界节点语义相似度的比较进行网页主题划分的方法.实验结果表明该方法具有较高的划分准确率,在此基础上抽取的网页摘要可显著增加文摘内容对原文的覆盖率、有效解决Web文档摘要分布不平衡问题.     

基于关系权重的文本表示法

提出一种基于关系权重的文本表示方法.通过优化关系权重,在文本向量中体现了不同特征项在不同类别中重要程度的差异,使得在此权重下不同类别的文本得到更准确的区分.运用SVM分类实验表明,基于关系权重的文本表示方法,较之传统的 TF-IDF 文本表示法,有更高的准确率和召回率.     

基于权值的骨架修剪算法

针对传统骨架提取算法中出现影响骨架识别的毛刺问题,特别是其中对物体形状的描述会产生很大影响的绷带骨架,在骨架的权值的基础上提出了一种新的骨架修剪算法.算法的核心是通过距离变换获取骨架权值并在骨架修剪过程中把表征骨架重要性的权值作为骨架分支是否被去除的依据.实验结果表明,作为目标骨架表示和识别的预处理手段,基于权值的骨架修剪算法能使骨架更能准确的反应目标物体的稳定结构.     

第三方在线支付市场的企业进／退博弈模型与算法

分析了第三方支付研究现状,提出了第三方在线支付企业市场进退问题;针对第三方在线支付企业市场进退的时机、机制、策略选择等,构建了基于博弈论的逆向剪枝模型与算法,并就企业市场进退战略提出了相应对策:1)对于市场占有率极低且其提供的产品服务同质性很高的较小在线第三方支付企业,应尽早退出在线支付市场或将营业中心进行转移;2)对尚无第三方在线支付强劲实力的未到位新企业,尤应力戒盲目进入.     

Versioning XML-based office documents

The ability to reliably merge independent updates of a document is a crucial prerequisite to efficient collaboration in office work. However, merge support for common office document standards like OpenDocument or OfficeOpenXML is still in its infancy. In this paper, we present a consistent versioning model for XML documents in general including merge support. This is achieved by using context-aware fingerprints that identify edit operations and allow for a conflict detection. We show how to extract tracked changes from office documents and map them on our delta model. Experimental results indicate that our fingerprinting technique is efficient and reliable.     

Automated analysis of images in documents for intelligent document search

Authors use images to present a wide variety of important information in documents. For example, two-dimensional (2-D) plots display important data in scientific publications. Often, end-users seek to extract this data and convert it into a machine-processible form so that the data can be analyzed automatically or compared with other existing data. Existing document data extraction tools are semi-automatic and require users to provide metadata and interactively extract the data. In this paper, we describe a system that extracts data from documents fully automatically, completely eliminating the need for human intervention. The system uses a supervised learning-based algorithm to classify figures in digital documents into five classes: photographs, 2-D plots, 3-D plots, diagrams, and others. Then, an integrated algorithm is used to extract numerical data from data points and lines in the 2-D plot images along with the axes and their labels, the data symbols in the figure’s legend and their associated labels. We demonstrate that the proposed system and its component algorithms are effective via an empirical evaluation. Our data extraction system has the potential to be a vital component in high volume digital libraries.