图 书 馆
利用背景文本从稀疏文本数据中挖掘频繁字符串的特殊成分Mining Peculiar Compositions of Frequent Substrings from Sparse Text Data Using Background Texts |
|
| 课程网址: | http://videolectures.net/ecmlpkdd09_ikeda_mpcfsstdubt/ |
| 主讲教师: | Daisuke Ikeda |
| 开课单位: | 东京大学 |
| 开课时间: | 2009-10-20 |
| 课程语种: | 日语 |
| 中文简介: |  |
| 课程简介: | We consider mining unusual patterns from text T. Unlike existing methods which assume probabilistic models and use simple estimation methods, we employ a set B of background text in addition to T and compositions w=xy of x and y as patterns. A string w is peculiar if there exist x and y such that w=xy, each of x and y is more frequent in B than in T, and conversely w=xy is more frequent in T. The frequency of xy in T is very small since x and y are infrequent in T, but xy is relatively abundant in T compared to xy in B. Despite these complex conditions for peculiar compositions, we develop a fast algorithm to find peculiar compositions using the suffix tree. Experiments using DNA sequences show scalability of our algorithm due to our pruning techniques and the superiority of the concept of the peculiar composition. |
| 关 键 词: | 假定概率模型; 简单估计; 背景文本 |
| 课程来源: | 视频讲座网 |
| 最后编审: | 2019-03-27：lxf |
| 阅读次数: | 37 |