.png){kind=icon}
返回
Mining generalized knowledge from ordered data through attribute-oriented induction techniques
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2004.04.029.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The attribute-oriented induction (AOI for short) method is one of the most important data mining methods. The input of the AOI method contains a relational table and a concept tree (con\cept hierarchy) for each attribute, and the output is a small relation summarizing the general characteristics of the task-relevant data. Although AOI is very useful for inducing general characteristics, it has the limitation that it can only be applied to relational data, where there is no order among the data items. If the data are ordered, the existing AOI methods are unable to find the generalized knowledge. In view of this weakness, this paper proposes a dynamic programming algorithm, based on AOI techniques, to find generalized knowledge from an ordered list of data. By using the algorithm, we can discover a sequence of K generalized tuples describing the general characteristics of different segments of data along the list, where K is a parameter specified by users. (c) 2004 Elsevier B.V. All rights reserved.
Keyword:
attribute-oriented induction
concept hierarchy
data mining
relational data
ordered data
dynamic programming
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
暂无机构信息
引用论文
Immunology ofStaphylococcalBiofilm Infections in the Eye: New Tools to Study Biofilm Endophthalmitis
.png){kind=icon}
PREAI
分享收藏
System identification of a linear series elastic actuator using a recursive taguchi-based algorithm
PREAI
分享收藏分享收藏
查看更多内容