期刊文献+
共找到5篇文章
< 1 >
每页显示 20 50 100
Finding Recently Frequent Items over Online Data Streams
1
作者 尹志武 黄上腾 《Journal of Donghua University(English Edition)》 EI CAS 2006年第6期53-56,共4页
In this paper, a new algorithm HCOUNT + is proposed to find frequent items over data stream based on the HCOUNT algorithm. The new algorithm adopts aided measures to improve the precision of HCOUNT greatly. In additi... In this paper, a new algorithm HCOUNT + is proposed to find frequent items over data stream based on the HCOUNT algorithm. The new algorithm adopts aided measures to improve the precision of HCOUNT greatly. In addition,HCOUNT + is introduced to time critical applications and a novel sliding windows-based algorithm SL-HCOUNT + is proposed to mine the most frequent items occurring recently.This algorithm uses limited memory (nB · (1 +α) · e/ε·In(-M/lnρ)(α〈1) counters), requires constant processing time per packet (only (1+α) · ln(-M/lnρ(α〈1)) counters are updated), makes only one pass over the streaming data,and is shown to work well in the experimental results. 展开更多
关键词 frequent items data streams HCOUNT.
在线阅读 下载PDF
Frequent item sets mining from high-dimensional dataset based on a novel binary particle swarm optimization 被引量:2
2
作者 张中杰 黄健 卫莹 《Journal of Central South University》 SCIE EI CAS CSCD 2016年第7期1700-1708,共9页
A novel binary particle swarm optimization for frequent item sets mining from high-dimensional dataset(BPSO-HD) was proposed, where two improvements were joined. Firstly, the dimensionality reduction of initial partic... A novel binary particle swarm optimization for frequent item sets mining from high-dimensional dataset(BPSO-HD) was proposed, where two improvements were joined. Firstly, the dimensionality reduction of initial particles was designed to ensure the reasonable initial fitness, and then, the dynamically dimensionality cutting of dataset was built to decrease the search space. Based on four high-dimensional datasets, BPSO-HD was compared with Apriori to test its reliability, and was compared with the ordinary BPSO and quantum swarm evolutionary(QSE) to prove its advantages. The experiments show that the results given by BPSO-HD is reliable and better than the results generated by BPSO and QSE. 展开更多
关键词 data mining frequent item sets particle swarm optimization
在线阅读 下载PDF
用Visual Foxpro实现Apriori算法的研究 被引量:2
3
作者 罗可 黄园芳 郭锋 《长沙水电师院学报(自然科学版)》 2001年第4期16-19,共4页
采掘关联规则是数据采掘领域的一个重要问题 .探讨了Apriori算法 ,基于该算法 ,提出了 1种用VisualFoxpro求频繁项目集的方法 ,并编写了求频繁项目集的程序 .
关键词 数据采掘 关联规则 频繁项目集 VISUAL FOXPRO 数据库 APRIORI算法
在线阅读 下载PDF
Outlier Detection Method based on Hybrid Rough - Negative Algorithm
4
作者 Faizah Shaari Azmi Ahmad Zalizah A.Long 《Journal of Mathematics and System Science》 2014年第6期391-397,共7页
This paper discusses on the detection of outliers by hybridizing Rough_Outlier Algorithm with Negative Association Rules. An optimization algorithm named Binary Particle Swarm Optimization is used to improve the compu... This paper discusses on the detection of outliers by hybridizing Rough_Outlier Algorithm with Negative Association Rules. An optimization algorithm named Binary Particle Swarm Optimization is used to improve the computation of Non_Reduct in order to detect outliers.By using Binary PSO algorithm, the rules generated from Rough_Outliers algorithm is optimized, giving significant outliers object detected. The detection ofoutliers process is then enhanced by hybridizing it with Negative Association Rules. Frequent and Infrequent item sets from outlier rules are generated. Results show that the hybrid Rough_Negative algorithm is able to uncover meaningful knowledge of outliers from the frequent and infrequent item sets. These knowledge can then be used by experts in their field of domain for better decision making. 展开更多
关键词 Negative association rules association rules mining OUTLIER non-reduct infrequent item sets frequent item sets rare.
在线阅读 下载PDF
An efficient spatial high-utility occupancy frequent itemmining algorithm for mission system integration architecture design using the MBSEmethod
5
作者 Xiaoxu Dong Miao Wang +3 位作者 Yongqi Liu Gang Xiao Dan Huang Guoqing Wang 《Aerospace Systems》 2022年第3期377-392,共16页
Future airspace operations require the integration of various types of comprehensive combat forces,which belong to systematic combat.At present,integrated systems are oriented to the single platform system.Systematic ... Future airspace operations require the integration of various types of comprehensive combat forces,which belong to systematic combat.At present,integrated systems are oriented to the single platform system.Systematic integrated mission system is more complex,which not only considers the utility and efficiency of the single platform,but also considers multi-platform collaboration.Therefore,it is more complicated and difficult to obtain requirements and design mission system architecture,which requires multiple design scenarios.Due to the large amount of data of the scenarios model,the efficiency of manual analysis is too low,so data mining method is needed to analyze the scenarios data.However,traditional data mining methods cannot simultaneously mine item location information and utility occupancy.This paper proposes an algorithm:SHUO-FI,to mine utility occupancy threshold under specified distance constraints and a new pruning strategy based on support and maximum utility occupancy constraints.Compared with other algorithms,it is found that the proposed algorithm has higher efficiency.Since the algorithm considers the location,weight,profit,utility and other parameters of the project,it can be better applied in the field of forward design MBSE than the previous algorithm.Finally,the algorithm is applied to the actual coordination of manned and unmanned aircraft model.By data mining the utility,profit and real-time position of each operational unit at each time,the optimal operational function scheduling mode under the same operational mission can be obtained. 展开更多
关键词 Spatial high-utility occupancy item frequent item mining Model-based system engineering Mission system
在线阅读 下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部