Using An Ant Colony Optimization Algorithm For Monotonic Regression Rule Discovery

GECCO '16: Genetic and Evolutionary Computation Conference Denver Colorado USA July, 2016(2016)

引用 2|浏览11
暂无评分
摘要
Many data mining algorithms do not make use of existing domain knowledge when constructing their models. This can lead to model rejection as users may not trust models that behave contrary to their expectations. Semantic constraints provide a way to encapsulate this knowledge which can then be used to guide the construction of models. One of the most studied semantic constraints in the literature is monotonicity, however current monotonically-aware algorithms have focused on ordinal classification problems. This paper proposes an extension to an AGO-based regression algorithm in order to extract a list of monotonic regression rules. We compared the proposed algorithm against a greedy regression rule induction algorithm that preserves monotonic constraints and the well-known M5' Rules. Our experiments using eight publicly available data sets show that the proposed algorithm successfully creates monotonic rules while maintaining predictive accuracy.
更多
查看译文
关键词
ant colony optimization,semantic constraints,monotonic,data mining,regression rules,sequential covering
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要