Efficient Data Mining from Large Text Databases
説明
In this paper, we consider the problem of discovering a simple class of combinatorial patterns from a large collection of unstructured text data. As a framework of data mining, we adopted optimized pattern discovery in which a mining algorithm discovers the best patterns that optimize a given statistical measure within a class of hypothesis patterns on a given data set. We present effcient algorithms for the classes of proximity word association patterns and report the experiments on the keyword discovery from Web data.