基于航空运输的关联规则快速发现应用研究

Jiang Hong-bo, Yang De-li
{"title":"基于航空运输的关联规则快速发现应用研究","authors":"Jiang Hong-bo, Yang De-li","doi":"10.1109/ICSSSM.2007.4280165","DOIUrl":null,"url":null,"abstract":"In this paper the popular Apriori algorithm and its improvements were introduced and a great many complex data in air transportation were used to fast discover the association rules. For too many rules are produced in the traditional association rules and the Apriori algorithm is not used widely, this paper chooses the improvement algorithm to prune redundant rules based on traditional association rules, which simplifies the rules and overcomes the disadvantages of traditional association rules, like the redundant rules and difficult application.","PeriodicalId":153603,"journal":{"name":"2007 International Conference on Service Systems and Service Management","volume":"106 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"Application Research on Fast Discovery of Association Rules Based on Air Transportation\",\"authors\":\"Jiang Hong-bo, Yang De-li\",\"doi\":\"10.1109/ICSSSM.2007.4280165\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper the popular Apriori algorithm and its improvements were introduced and a great many complex data in air transportation were used to fast discover the association rules. For too many rules are produced in the traditional association rules and the Apriori algorithm is not used widely, this paper chooses the improvement algorithm to prune redundant rules based on traditional association rules, which simplifies the rules and overcomes the disadvantages of traditional association rules, like the redundant rules and difficult application.\",\"PeriodicalId\":153603,\"journal\":{\"name\":\"2007 International Conference on Service Systems and Service Management\",\"volume\":\"106 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-06-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2007 International Conference on Service Systems and Service Management\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICSSSM.2007.4280165\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 International Conference on Service Systems and Service Management","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICSSSM.2007.4280165","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8

摘要

本文介绍了目前流行的Apriori算法及其改进,并利用航空运输中大量复杂数据快速发现关联规则。针对传统关联规则中产生的规则过多,Apriori算法应用不广泛的问题,本文选择改进算法在传统关联规则的基础上对冗余规则进行裁剪,简化了规则,克服了传统关联规则存在的规则冗余、应用困难等缺点。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Application Research on Fast Discovery of Association Rules Based on Air Transportation
In this paper the popular Apriori algorithm and its improvements were introduced and a great many complex data in air transportation were used to fast discover the association rules. For too many rules are produced in the traditional association rules and the Apriori algorithm is not used widely, this paper chooses the improvement algorithm to prune redundant rules based on traditional association rules, which simplifies the rules and overcomes the disadvantages of traditional association rules, like the redundant rules and difficult application.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信