结合DL-safe规则发现日志本体频繁模式的方法  

An Approach for Discovering Frequent Patterns from Log Ontologies with DL-safe Rules

作　　者：孙明[1] 陈波[1] 周明天[1] 

机构地区：[1]电子科技大学计算机科学与工程学院,四川成都610051

出　　处：《电子学报》2010年第2期376-381,共6页Acta Electronica Sinica

基　　金：国家'十一五'科技支撑计划重大资助项目(NO.2006BAH02A0407);国家自然科学基金(NO.90604033)

摘　　要：为发现语义Web使用记录中所蕴含的有效信息,本文提出了一种挖掘日志本体频繁Web访问模式的方法.该方法引入应用访问规则集和观察集分别表示日志信息动态变化的语义规则和使用事实,并在DL安全的限定下将日志本体和应用访问规则集相结合构成一个推理过程可判定的混合知识库.在此基础上,利用日志本体中事件整分关系的语义构建访问模式学习的事务模型,并采用ILP的方法学习生成频繁用户访问模式树,解决了推理访问模式中非描述逻辑原子的问题.实验结果表明该方法的可用性和有效性.In order to discover the useful information from semantic Web usage records, we present an approach for mining the frequent Web access pattems from log ontologies. This method adopts application access-rules to represent the dynamic semantics rules of user-access and adopts observations to represent the usage facts. With the restriction of DL-safety, it combines log ontologies and application user-access rules into a decidable hybrid knowledge base. The transaction mode of access-pattern learning can be extracted form the semantics of the part-whole relations between events in log ontologies. A frequent Web access-pattern tree can be generated by an ILP method from the hybrid knowledge base. This method also solves the problem of reasoning the Web access - patterns with non-DL atoms. The experimental results show that this method is effective and it is quite feasible to solve practical problems.

关 键 词：语义网使用挖掘 日志本体 频繁Web访问模式 DL-safe规则 归纳逻辑编程 

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程]