Managing the Acronym/Expansion Identi cation Process for Text-Mining Applications

This paper deals with an acronym/de nition extraction approach from textual data (corpora) and the disambiguation of these de nitions (or expansions). Both steps of our global process of acquisition and management of acronyms are precisely described. The first step consists in using markers such as brackets to identify expansion candidates. The alignment of the letters allows to select the acronym/de nition couples. The second step is to de ne the relevant expansion of an acronym in a given context. Our method is based on statistical measurements (Mutual Information, Cubic Mutual Information, Dice Measure) and the results provided by search engines. This paper presents an evaluation of the global process from real data (general and specialized domains).     

采用构造后缀树方法的在线挖掘浏览模式

在构建个性化服务中常常通过需要挖掘用户的浏览模式来改进站点的结构,使得客户访问站点变得容易。问题的关键就在于如何从Web日志中发现用户浏览模式。该文就此提出一种算法,通过为Web日志数据构造后缀树进行序列挖掘,找出最大频繁序列,进而发现有意义的浏览模式。该算法的重要特点是可以在线进行。