期刊文献+

基于关联规则挖掘的伴随车辆发现算法 被引量:9

ACCOMPANY VEHICLE DISCOVERY ALGORITHM BASED ON ASSOCIATION RULE MINING
下载PDF
导出
摘要 伴随车辆是公安刑侦部门对海量车辆通行信息检索的一类实战需求,目的是通过模糊条件查询得到潜在的结伴作案车辆,究其本质,可将此类查询转化为数据挖掘中关联规则挖掘问题。通过对公路车辆智能监测记录系统采集的过车数据进行分析,将伴随车辆查询转化为关联规则挖掘,利用数据挖掘技术对过车数据查询问题进行综合分析,实现高效率的伴随车辆查询算法AVD(Accompany Vehicles D iscovery)。算法分析表明,AVD不但能提供准确的伴随车辆查询结果,而且效率高、扩展性强,具有较高的可行性。 Accompany vehicle query is a kind of practices need of police criminal investigation department with regard to massive vehicle traffic information retrieval,it is intended to acquire potential accompany committing vehicles through fuzzy condition query.And by studying its nature,such query can be transformed into association rules mining of data mining.In this paper,we convert the vehicle query to association rules mining by analysing passing vehicle data collected by smart highway traffics monitoring and recording system,make use of data mining technology to comprehensively analyse the passing vehicle data query,and realise the efficient accompany vehicles discovery(AVD) algorithm.It is shown in the section of algorithm analysis that the proposed algorithm AVD can provide precise outcomes of accompany vehicle query,and is also highly efficient,scalable,and with good practicability.
出处 《计算机应用与软件》 CSCD 北大核心 2012年第2期94-96,144,共4页 Computer Applications and Software
基金 国家科技支撑计划课题(2009BAG13A06)
关键词 关联规则 伴随车辆 数据挖掘 过车数据 Association rules Accompanying vehicle Data mining Passing vehicle data
  • 相关文献

参考文献6

  • 1Agrawal R, Imielinski T, Swami A. In Mining association rules be- tween sets of times in large databases [ C ]//ACM SIGMOD Conference on Management of Data, ACM Order Deparment : 1993:207 - 216.
  • 2Agrawal R, Shafer JC. ParaUel mining of association rules [ J ]. IEEE Transactions on Knowledge and Data Engineering, 1996, 8 (6) :962 - 969.
  • 3张静,阮永华,张磊,等.嫌疑车辆关联查找方法:中国,CNl01593418[P].2009-12-02.
  • 4黄解军,潘和平,万幼川.数据挖掘技术的应用研究[J].计算机工程与应用,2003,39(2):45-48. 被引量:76
  • 5Jiawei Han, Jian Pei, Yiwen Yin. Mining Frequent Patterns without Candidate Generation [ C ]//Proc. Special Interest Groups on Manage- ment of Data, 2000 ( SIGMOD 2000), Dallas, Texas, United States. 2000:1-12.
  • 6YunXiong, et al. Mining Peculiarity Groups in Day-by-Day Behavioral Dataset[ C ]//Proceeding on International Conference of Data Mining (ICDM09) , 2009:578 - 587.

二级参考文献10

  • 1[1]Robert Groth. Data Mining:Building competitive advantage[M].USA: Prentiee-Hall Ptr, 1999
  • 2[2]Chen Lei-da et al.Data mining methods,applications,tools[J].Information Systems Management ,2000; 17( 1 ) :65~70
  • 3[3]H Mannila,Ht Toivonen et al.Efficient algorithms for discovering as sociation rules[C].In: Knowledge Discovery in Databases (KDD'94), AAAI Press, 1994:181~192
  • 4[4]F H Grupe,M M Owrang.data base mining[J].Information SystemsManagement, 1995; 12 (4): 26~31
  • 5[5]R L Scheier. Finding pearls in an ocean of data[J].Computerworld,2001 ;35(30) :49~50
  • 6[6]N Melab. Data mining:A key eontribution to E-business[J].Information & Communications Technology Law,2001; 10(3) :309~318
  • 7[7]L Scott Tillett. Banks mine customer data[J].InternetWeek,2000;831: 45 ~46
  • 8[8]Larry Stevens.It sharpens data mining's focus[J].InternetWeek,2001; 872:29~30
  • 9[9]Neena Buck. Eureka!Knowledge discovery[J].Software Magazine.2000-12/ 2001-01 ;20(6) :24~29
  • 10[10]M J Norton. Knowledge discovery in databases[J].Library Trends. 1999 ;48( 1 ) :9~21

共引文献75

同被引文献57

  • 1李传冰.基于Elasticsearch的HBase大数据二级索引方案[J].电脑知识与技术,2020,0(4):1-2. 被引量:2
  • 2蒋盛益,李庆华,李新.数据流挖掘算法研究综述[J].计算机工程与设计,2005,26(5):1130-1132. 被引量:21
  • 3陈慧萍,王建东,王煜.一种高效的最大频繁项集挖掘算法DFMFI-Miner[J].计算机仿真,2006,23(7):79-83. 被引量:1
  • 4张静,阮永华,张磊,等.嫌疑车辆关联查找方法:中国,CNl01593418[P].2009-12-02.
  • 5贾澎涛,何华灿,刘丽,孙涛.时间序列数据挖掘综述[J].计算机应用研究,2007,24(11):15-18. 被引量:77
  • 6丁锐,孟小峰,杨楠.一种高效的移动对象相似轨迹查询方法[J].计算机科学,2003,30(10):386-403.
  • 7Jeung H, Yiu Man-lung, Zhou Xiao-fang. Discovery of convoys in trajectory databases [C]//VLDB'08, 2008: 1068-1080.
  • 8Yun Xiong, et al. Mining Peculiarity Groups in Day-by- Day Behavioral Dataset[C]//Proceeding on International Corderence of Data Mining(ICDM09 ), 2009 : 578-587.
  • 9Agrawal R, Imielinski T, Swami A. Database min- ing:a performance perspective[J]. IEEE Transactions on Knowledge and Data Engineering, 1993,5 (6) : 914- 925.
  • 10AGRAWAL R, RALOUTSOS C, SWAMI A. Efficient similarity search in sequence databases[ C 1//Proc of the 4th International Con- ference on Foundations of Data Organization and Algorithms. Berlin: Springer-Verlag, 1993:69- 84.

引证文献9

二级引证文献30

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部