| 基于粗糙集的Web事务聚类算法 |
| |
| 引用本文： | 邱波.基于粗糙集的Web事务聚类算法[J].微型电脑应用,2014(2):56-58. |
| |
| 作者姓名： | 邱波 |
| |
| 作者单位： | 江苏师范大学现代教育技术中心,徐州221116 |
| |
| 摘 要： | 针对现有Web数据挖掘方法发现的知识和规则存在不精确或不完全的问题,将粗糙集引入到Web挖掘中,进行Web事务聚类.粗糙近似算法基于用户访问序列的顺序和内容建立用户事务相似度矩阵,运用基于相似度矩阵的粗糙上近似提取初始类,使用相对相似性的条件作为合并准则,基于约束相似性的上近似形成后续类.粗糙近似算法能够有效挖掘Web访问日志,聚类Web事务,发现用户访问Web页面的模式.
|
| 关 键 词： | Web挖掘 粗糙集 相似上近似 约束相似性上近似 事务聚类 |
Web Transactions Clustering Algorithm on Rough Set |
| |
| Qiu Bo.Web Transactions Clustering Algorithm on Rough Set[J].Microcomputer Applications,2014(2):56-58. |
| |
| Authors: | Qiu Bo |
| |
| Affiliation: | Qiu Bo( 1.Modem Educational Technology Center, Xuzhou Normal University, Xuzhou, 221116, China;) |
| |
| Abstract: | Web usage mining can mine useful information from web access log.The discovered knowledge or unexpected rules are likely to be imprecise or incomplete.Rough set is introduced into the web mining to cluster web transactions.The set as well as sequence similarity of users＇ sessions is considered to form similarity matrix.Initial clusters are formed using a similarity upper approximation.Subsequent clusters are formed using the concept of constrained-similarity upper approximation wherein a condition of relative similarity is used as a merging criterion.Using this approach,users can effectively mine web log records to discover web page access patterns. |
| |
| Keywords: | Web Mining Rough Set Similarity Upper Approximation Constrained-similarity Upper Approximation Transaction Clustering |
| 本文献已被 CNKI 维普 等数据库收录！ |
|
