检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
出 处:《计算机应用》2008年第3期726-728,741,共4页journal of Computer Applications
基 金:国家自然科学基金资助项目(60575035;60673060)
摘 要:为了有效地挖掘用户所需的序列模式,在序列数据库中对每个项目引入了兴趣度值以示其不同的重要程度。在对概念格模型进行扩展的基础上,提出了基于兴趣度的序列概念格模型及其构建算法。实例表明算法能减少冗余序列的产生,挖掘出满足用户需求的序列模式。In order to mine efficiently the sequential patterns according to user's requirements, the interest measure for every item was introduced to reveal the different importance in the sequence database. And on the basis of extending the concept lattice model, the sequence concept lattice model with interest measure and its construction algorithm were presented. The instance shows that the algorithm can reduce the redundant sequences and mine the sequential patterns that satisfy user's requirements.
分 类 号:TP311.13[自动化与计算机技术—计算机软件与理论]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.149.238.207