期刊文献+
共找到920篇文章
< 1 2 46 >
每页显示 20 50 100
A related degree-based frequent pattern mining algorithm for railway fault data
1
作者 Jiaxu Guo Ding Ding +2 位作者 Peihan Yang Qi Zou Yaping Huang 《High-Speed Railway》 2024年第2期101-109,共9页
It is of great significance to improve the efficiency of railway production and operation by realizing the fault knowledge association through the efficient data mining algorithm.However,high utility quantitative freq... It is of great significance to improve the efficiency of railway production and operation by realizing the fault knowledge association through the efficient data mining algorithm.However,high utility quantitative frequent pattern mining algorithms in the field of data mining still suffer from the problems of low time-memory performance and are not easy to scale up.In the context of such needs,we propose a related degree-based frequent pattern mining algorithm,named Related High Utility Quantitative Item set Mining(RHUQI-Miner),to enable the effective mining of railway fault data.The algorithm constructs the item-related degree structure of fault data and gives a pruning optimization strategy to find frequent patterns with higher related degrees,reducing redundancy and invalid frequent patterns.Subsequently,it uses the fixed pattern length strategy to modify the utility information of the item in the mining process so that the algorithm can control the length of the output frequent pattern according to the actual data situation and further improve the performance and practicability of the algorithm.The experimental results on the real fault dataset show that RHUQI-Miner can effectively reduce the time and memory consumption in the mining process,thus providing data support for differentiated and precise maintenance strategies. 展开更多
关键词 High utility QUANTITATIVE frequent pattern mining Related degree pruning Fixed pattern length
下载PDF
Co-occurrence Patterns of Above-ground and Below-ground Mite Communities in Farmland of Sanjiang Plain, Northeast China 被引量:7
2
作者 LIN Lin GAO Meixiang +3 位作者 LIU Dong ZHANG Xueping WU Haitao WU Donghui 《Chinese Geographical Science》 SCIE CSCD 2014年第3期339-347,共9页
One of the fundamental questions in community ecology is whether communities are random or formed by deterministic mechanisms. Although many efforts have been made to verify non-randomness in community structure, litt... One of the fundamental questions in community ecology is whether communities are random or formed by deterministic mechanisms. Although many efforts have been made to verify non-randomness in community structure, little is known with regard to co-occurrence patterns in above-ground and below-ground communities. In this paper, we used a null model to test non-randomness in the structure of the above-ground and below-ground mite communities in farmland of the Sanjiang Plain, Northeast China. Then, we used four tests for non-randomness to recognize species pairs that would be demonstrated as significantly aggregated or segregated co-occurrences of the above-ground and below-ground mite communities. The pattern of the above-ground mite commu- nity was significantly non-random in October, suggesting species segregation and hence interspecific competition. Additionally, species co-occurrence patterns did not differ from randomness in the above-ground mite community in August or in below-ground mite com- munities in August and October. Only one significant species pair was detected in the above-ground mite community in August, while no significant species pairs were recognized in the above-ground mite community in October or in the below-ground mite communities in August and October. The results indicate that non-randomness and significant species pairs may not be the general rule in the above-ground and below-ground mite communities in farmland of the Sanjiang Plain at the fine scale. 展开更多
关键词 above-ground mite below-ground mite mite communities co-occurrence patterns interspecific competition species pairassociations
下载PDF
High Utility Periodic Frequent Pattern Mining in Multiple Sequences
3
作者 Chien-Ming Chen Zhenzhou Zhang +1 位作者 Jimmy Ming-Tai Wu Kuruva Lakshmanna 《Computer Modeling in Engineering & Sciences》 SCIE EI 2023年第10期733-759,共27页
Periodic patternmining has become a popular research subject in recent years;this approach involves the discoveryof frequently recurring patterns in a transaction sequence. However, previous algorithms for periodic pa... Periodic patternmining has become a popular research subject in recent years;this approach involves the discoveryof frequently recurring patterns in a transaction sequence. However, previous algorithms for periodic patternmining have ignored the utility (profit, value) of patterns. Additionally, these algorithms only identify periodicpatterns in a single sequence. However, identifying patterns of high utility that are common to a set of sequencesis more valuable. In several fields, identifying high-utility periodic frequent patterns in multiple sequences isimportant. In this study, an efficient algorithm called MHUPFPS was proposed to identify such patterns. To addressexisting problems, three new measures are defined: the utility, high support, and high-utility period sequenceratios. Further, a new upper bound, upSeqRa, and two new pruning properties were proposed. MHUPFPS usesa newly defined HUPFPS-list structure to significantly accelerate the reduction of the search space and improvethe overall performance of the algorithm. Furthermore, the proposed algorithmis evaluated using several datasets.The experimental results indicate that the algorithm is accurate and effective in filtering several non-high-utilityperiodic frequent patterns. 展开更多
关键词 Decision making frequent periodic pattern multi-sequence database sequential rules utility mining
下载PDF
Association RuleMining Frequent-Pattern-Based Intrusion Detection in Network
4
作者 S.Sivanantham V.Mohanraj +1 位作者 Y.Suresh J.Senthilkumar 《Computer Systems Science & Engineering》 SCIE EI 2023年第2期1617-1631,共15页
In the network security system,intrusion detection plays a significant role.The network security system detects the malicious actions in the network and also conforms the availability,integrity and confidentiality of da... In the network security system,intrusion detection plays a significant role.The network security system detects the malicious actions in the network and also conforms the availability,integrity and confidentiality of data informa-tion resources.Intrusion identification system can easily detect the false positive alerts.If large number of false positive alerts are created then it makes intrusion detection system as difficult to differentiate the false positive alerts from genuine attacks.Many research works have been done.The issues in the existing algo-rithms are more memory space and need more time to execute the transactions of records.This paper proposes a novel framework of network security Intrusion Detection System(IDS)using Modified Frequent Pattern(MFP-Tree)via K-means algorithm.The accuracy rate of Modified Frequent Pattern Tree(MFPT)-K means method infinding the various attacks are Normal 94.89%,for DoS based attack 98.34%,for User to Root(U2R)attacks got 96.73%,Remote to Local(R2L)got 95.89%and Probe attack got 92.67%and is optimal when it is compared with other existing algorithms of K-Means and APRIORI. 展开更多
关键词 IDS K-MEANS frequent pattern tree false alert MINING L1-norm
下载PDF
Assembly and co-occurrence patterns of rare and abundant bacterial sub-communities in rice rhizosphere soil under short-term nitrogen deep placement 被引量:2
5
作者 LI Gui-long WU Meng +5 位作者 LI Peng-fa WEI Shi-ping LIU Jia JIANG Chun-yu LIU Ming LI Zhong-pei 《Journal of Integrative Agriculture》 SCIE CAS CSCD 2021年第12期3299-3311,共13页
Nitrogen(N)deep placement has been found to reduce N leaching and increase N use efficiency in paddy fields.However,relatively little is known how bacterial consortia,especially abundant and rare taxa,respond to N dee... Nitrogen(N)deep placement has been found to reduce N leaching and increase N use efficiency in paddy fields.However,relatively little is known how bacterial consortia,especially abundant and rare taxa,respond to N deep placement,which is critical for understanding the biodiversity and function of agricultural ecosystem.In this study,lllumina sequencing and ecological models were conducted to examine the diversity patterns and underlying assembly mechanisms of abundant and rare taxa in rice rhizosphere soil under different N fertilization regimes at four rice growth stages in paddy fields.The results showed that abundant and rare bacteria had distinct distribution patterns in rhizosphere samples.Abundant bacteria showed ubiquitous distribution;while rare taxa exhibited uneven distribution across all samples.Stochastic processes dominated community assembly of both abundant and rare bacteria,with dispersal limitation playing a more vital role in abundant bacteria,and undominated processes playing a more important role in rare bacteria.The N deep placement was associated with a greater influence of dispersal limitation than the broadcast N fertilizer(BN)and no N fertilizer(NN)treatments in abundant and rare taxa of rhizosphere soil;while greater contributions from homogenizing dispersal were observed for BN and NN in rare taxa.Network analysis indicated that abundant taxa with closer relationships were usually more likely to occupy the central position of the network than rare taxa.Nevertheless,most of the keystone species were rare taxa and might have played essential roles in maintaining the network stability.Overall,these findings highlighted that the ecological mechanisms and co-occurrence patterns of abundant and rare bacteria in rhizosphere soil under N deep placement. 展开更多
关键词 rare bacteria community assembly network analysis co-occurrence patterns N deep placement
下载PDF
Quantum Algorithm for Mining Frequent Patterns for Association Rule Mining
6
作者 Abdirahman Alasow Marek Perkowski 《Journal of Quantum Information Science》 CAS 2023年第1期1-23,共23页
Maximum frequent pattern generation from a large database of transactions and items for association rule mining is an important research topic in data mining. Association rule mining aims to discover interesting corre... Maximum frequent pattern generation from a large database of transactions and items for association rule mining is an important research topic in data mining. Association rule mining aims to discover interesting correlations, frequent patterns, associations, or causal structures between items hidden in a large database. By exploiting quantum computing, we propose an efficient quantum search algorithm design to discover the maximum frequent patterns. We modified Grover’s search algorithm so that a subspace of arbitrary symmetric states is used instead of the whole search space. We presented a novel quantum oracle design that employs a quantum counter to count the maximum frequent items and a quantum comparator to check with a minimum support threshold. The proposed derived algorithm increases the rate of the correct solutions since the search is only in a subspace. Furthermore, our algorithm significantly scales and optimizes the required number of qubits in design, which directly reflected positively on the performance. Our proposed design can accommodate more transactions and items and still have a good performance with a small number of qubits. 展开更多
关键词 Data Mining Association Rule Mining frequent pattern Apriori Algorithm Quantum Counter Quantum Comparator Grover’s Search Algorithm
下载PDF
Spatio-Temporal Variations in Co-Occurrence Patterns of Fish Communities in Haizhou Bay, China: Null Model Analysis
7
作者 WANG Jiao ZHANG Chongliang +3 位作者 XUE Ying CHEN Yong REN Yiping XU Binduo 《Journal of Ocean University of China》 SCIE CAS CSCD 2019年第6期1497-1506,共10页
Co-occurrence pattern of fish species plays an important role in understanding the spatio-temporal structure and the stability of fish community.Species coexistence may vary with time and space.The co-occurrence patte... Co-occurrence pattern of fish species plays an important role in understanding the spatio-temporal structure and the stability of fish community.Species coexistence may vary with time and space.The co-occurrence patterns of fish species were examined using the C-score under fixed-fixed null model for fish communities in spring and autumn over different years in the Haizhou Bay,China.The results showed that fish assemblages in the whole bay had non-random patterns in spring and autumn over different years.However,the fish co-occurrence patterns were different for the northern and southern fish assemblages in spring and autumn.The northern fish assemblage showed structured pattern,whereas the southern assemblage were randomly assembled in spring.The co-occurrence patterns of fish communities were relatively stable over different years,and the number of significant species pairs in northern assemblage was more than that in the southern assemblage.Environmental heterogeneity played an important role in determining the distributions of fish species that formed significant species pairs,which might affect the co-occurrence patterns of northern and southern assemblages further in the Haizhou Bay. 展开更多
关键词 FISH COMMUNITY Haizhou BAY NULL model analysis SPECIES co-occurrence pattern
下载PDF
A New Algorithm for Mining Frequent Pattern 被引量:2
8
作者 李力 靳蕃 《Journal of Southwest Jiaotong University(English Edition)》 2002年第1期10-20,共11页
Mining frequent pattern in transaction database, time series databases, and many other kinds of databases have been studied popularly in data mining research. Most of the previous studies adopt Apriori like candidat... Mining frequent pattern in transaction database, time series databases, and many other kinds of databases have been studied popularly in data mining research. Most of the previous studies adopt Apriori like candidate set generation and test approach. However, candidate set generation is very costly. Han J. proposed a novel algorithm FP growth that could generate frequent pattern without candidate set. Based on the analysis of the algorithm FP growth, this paper proposes a concept of equivalent FP tree and proposes an improved algorithm, denoted as FP growth * , which is much faster in speed, and easy to realize. FP growth * adopts a modified structure of FP tree and header table, and only generates a header table in each recursive operation and projects the tree to the original FP tree. The two algorithms get the same frequent pattern set in the same transaction database, but the performance study on computer shows that the speed of the improved algorithm, FP growth * , is at least two times as fast as that of FP growth. 展开更多
关键词 data mining algorithm frequent pattern set FP growth
下载PDF
An Efficient Hybrid Algorithm for Mining Web Frequent Access Patterns 被引量:1
9
作者 ZHANLi-qiang LIUDa-xin 《Wuhan University Journal of Natural Sciences》 EI CAS 2004年第5期557-560,共4页
We propose an efficient hybrid algorithm WDHP in this paper for mining frequent access patterns. WDHP adopts the techniques of DHP to optimize its performance, which is using hash table to filter candidate set and tri... We propose an efficient hybrid algorithm WDHP in this paper for mining frequent access patterns. WDHP adopts the techniques of DHP to optimize its performance, which is using hash table to filter candidate set and trimming database. Whenever the database is trimmed to a size less than a specified threshold, the algorithm puts the database into main memory by constructing a tree, and finds frequent patterns on the tree. The experiment shows that WDHP outperform algorithm DHP and main memory based algorithm WAP in execution efficiency. 展开更多
关键词 frequent access pattern AP-tree hash-table
下载PDF
A Novel Incremental Mining Algorithm of Frequent Patterns for Web Usage Mining 被引量:1
10
作者 DONG Yihong ZHUANG Yueting TAI Xiaoying 《Wuhan University Journal of Natural Sciences》 CAS 2007年第5期777-782,共6页
Because data warehouse is frequently changing, incremental data leads to old knowledge which is mined formerly unavailable. In order to maintain the discovered knowledge and patterns dynamically, this study presents a... Because data warehouse is frequently changing, incremental data leads to old knowledge which is mined formerly unavailable. In order to maintain the discovered knowledge and patterns dynamically, this study presents a novel algorithm updating for global frequent patterns-IPARUC. A rapid clustering method is introduced to divide database into n parts in IPARUC firstly, where the data are similar in the same part. Then, the nodes in the tree are adjusted dynamically in inserting process by "pruning and laying back" to keep the frequency descending order so that they can be shared to approaching optimization. Finally local frequent itemsets mined from each local dataset are merged into global frequent itemsets. The results of experimental study are very encouraging. It is obvious from experiment that IPARUC is more effective and efficient than other two contrastive methods. Furthermore, there is significant application potential to a prototype of Web log Analyzer in web usage mining that can help us to discover useful knowledge effectively, even help managers making decision. 展开更多
关键词 incremental algorithm association rule frequent pattern tree web usage mining
下载PDF
Mining Maximal Frequent Patterns in a Unidirectional FP-tree 被引量:1
11
作者 宋晶晶 刘瑞新 +1 位作者 王艳 姜保庆 《Journal of Donghua University(English Edition)》 EI CAS 2006年第6期105-109,共5页
Because mining complete set of frequent patterns from dense database could be impractical, an interesting alternative has been proposed recently. Instead of mining the complete set of frequent patterns, the new model ... Because mining complete set of frequent patterns from dense database could be impractical, an interesting alternative has been proposed recently. Instead of mining the complete set of frequent patterns, the new model only finds out the maximal frequent patterns, which can generate all frequent patterns. FP-growth algorithm is one of the most efficient frequent-pattern mining methods published so far. However, because FP-tree and conditional FP-trees must be two-way traversable, a great deal memory is needed in process of mining. This paper proposes an efficient algorithm Unid_FP-Max for mining maximal frequent patterns based on unidirectional FP-tree. Because of generation method of unidirectional FP-tree and conditional unidirectional FP-trees, the algorithm reduces the space consumption to the fullest extent. With the development of two techniques: single path pruning and header table pruning which can cut down many conditional unidirectional FP-trees generated recursively in mining process, Unid_FP-Max further lowers the expense of time and space. 展开更多
关键词 data mining frequent pattern the maximal frequent pattern Unid _ FP-tree conditional Unid _ FP-tree.
下载PDF
GTK:A Hybrid-Search Algorithm of Top-Rank-k Frequent Patterns Based on Greedy Strategy 被引量:1
12
作者 Yuhang Long Wensheng Tang +4 位作者 Bo Yang Xinyu Wang Hua Ma Hang Shi Xueyu Cheng 《Computers, Materials & Continua》 SCIE EI 2020年第6期1445-1469,共25页
Currently,the top-rank-k has been widely applied to mine frequent patterns with a rank not exceeding k.In the existing algorithms,although a level-wise-search could fully mine the target patterns,it usually leads to t... Currently,the top-rank-k has been widely applied to mine frequent patterns with a rank not exceeding k.In the existing algorithms,although a level-wise-search could fully mine the target patterns,it usually leads to the delay of high rank patterns generation,resulting in the slow growth of the support threshold and the mining efficiency.Aiming at this problem,a greedy-strategy-based top-rank-k frequent patterns hybrid mining algorithm(GTK)is proposed in this paper.In this algorithm,top-rank-k patterns are stored in a static doubly linked list called RSL,and the patterns are divided into short patterns and long patterns.The short patterns generated by a rank-first-search always joins the two patterns of the highest rank in RSL that have not yet been joined.On the basis of the short patterns satisfying specific conditions,the long patterns are extracted through level-wise-search.To reduce redundancy,GTK improves the generation method of subsume index and designs the new pruning strategies of candidates.This algorithm also takes the use of reasonable pruning strategies to reduce the amount of computation to improve the computational speed.Real datasets and synthetic datasets are adopted in experiments to evaluate the proposed algorithm.The experimental results show the obvious advantages in both time efficiency and space efficiency of GTK. 展开更多
关键词 Top-rank-k frequent patterns greedy strategy hybrid-search
下载PDF
Fast Discovering Frequent Patterns for Incremental XML Queries
13
作者 PENGDun-lu QIUYang 《Wuhan University Journal of Natural Sciences》 EI CAS 2004年第5期638-646,共9页
It is nontrivial to maintain such discovered frequent query patterns in real XML-DBMS because the transaction database of queries may allow frequent updates and such updates may not only invalidate some existing frequ... It is nontrivial to maintain such discovered frequent query patterns in real XML-DBMS because the transaction database of queries may allow frequent updates and such updates may not only invalidate some existing frequent query patterns but also generate some new frequent query patterns. In this paper, two incremental updating algorithms, FUX-QMiner and FUXQMiner, are proposed for efficient maintenance of discovered frequent query patterns and generation the new frequent query patterns when new XMI, queries are added into the database. Experimental results from our implementation show that the proposed algorithms have good performance. Key words XML - frequent query pattern - incremental algorithm - data mining CLC number TP 311 Foudation item: Supported by the Youthful Foundation for Scientific Research of University of Shanghai for Science and TechnologyBiography: PENG Dun-lu (1974-), male, Associate professor, Ph.D, research direction: data mining, Web service and its application, peerto-peer computing. 展开更多
关键词 XML frequent query pattern incremental algorithm data mining
下载PDF
Adaptive associative classification with emerging frequent patterns
14
作者 Wang Xiaofeng Zhang Dapeng Shi Zhongzhi 《High Technology Letters》 EI CAS 2012年第1期38-44,共7页
In this paper, we propose an enhanced associative classification method by integrating the dynamic property in the process of associative classification. In the proposed method, we employ a support vector machine(SVM... In this paper, we propose an enhanced associative classification method by integrating the dynamic property in the process of associative classification. In the proposed method, we employ a support vector machine(SVM) based method to refine the discovered emerging ~equent patterns for classification rule extension for class label prediction. The empirical study shows that our method can be used to classify increasing resources efficiently and effectively. 展开更多
关键词 associative classification RULE frequent pattern mining emerging frequent pattern supportvector machine (SVM)
下载PDF
SWFP-Miner: an efficient algorithm for mining weighted frequent pattern over data streams
15
作者 Wang Jie Zeng Yu 《High Technology Letters》 EI CAS 2012年第3期289-294,共6页
Previous weighted frequent pattern (WFP) mining algorithms are not suitable for data streams for they need multiple database scans. In this paper, we present an efficient algorithm SWFP-Miner to mine weighted freque... Previous weighted frequent pattern (WFP) mining algorithms are not suitable for data streams for they need multiple database scans. In this paper, we present an efficient algorithm SWFP-Miner to mine weighted frequent pattern over data streams. SWFP-Miner is based on sliding window and can discover important frequent pattern from the recent data. A new refined weight definition is proposed to keep the downward closure property, and two pruning strategies are presented to prune the weighted infrequent pattern. Experimental studies are performed to evaluate the effectiveness and efficiency of SWFP-Miner. 展开更多
关键词 weighted frequent pattern (WFP) mining data streams data mining slidingwindow SWFP-Miner
下载PDF
Hybrid Recommender System Using Systolic Tree for Pattern Mining
16
作者 S.Rajalakshmi K.R.Santha 《Computer Systems Science & Engineering》 SCIE EI 2023年第2期1251-1262,共12页
A recommender system is an approach performed by e-commerce for increasing smooth users’experience.Sequential pattern mining is a technique of data mining used to identify the co-occurrence relationships by taking in... A recommender system is an approach performed by e-commerce for increasing smooth users’experience.Sequential pattern mining is a technique of data mining used to identify the co-occurrence relationships by taking into account the order of transactions.This work will present the implementation of sequence pattern mining for recommender systems within the domain of e-com-merce.This work will execute the Systolic tree algorithm for mining the frequent patterns to yield feasible rules for the recommender system.The feature selec-tion's objective is to pick a feature subset having the least feature similarity as well as highest relevancy with the target class.This will mitigate the feature vector's dimensionality by eliminating redundant,irrelevant,or noisy data.This work pre-sents a new hybrid recommender system based on optimized feature selection and systolic tree.The features were extracted using Term Frequency-Inverse Docu-ment Frequency(TF-IDF),feature selection with the utilization of River Forma-tion Dynamics(RFD),and the Particle Swarm Optimization(PSO)algorithm.The systolic tree is used for pattern mining,and based on this,the recommendations are given.The proposed methods were evaluated using the MovieLens dataset,and the experimental outcomes confirmed the efficiency of the techniques.It was observed that the RFD feature selection with systolic tree frequent pattern mining with collaborativefiltering,the precision of 0.89 was achieved. 展开更多
关键词 Recommender systems hybrid recommender systems frequent pattern mining collaborativefiltering systolic tree river formation dynamics particle swarm optimization
下载PDF
一种基于关联程度的高效用数量比频繁模式挖掘算法
17
作者 王辉 李燕 +2 位作者 丁丁 吴坤 黄雅平 《计算机工程与科学》 CSCD 北大核心 2024年第9期1702-1710,共9页
高效用频繁模式挖掘算法运用数据项的重要度信息,能够从数据中挖掘出更重要的频繁模式,而高效用数量比频繁模式挖掘算法可以进一步研究频繁模式中数据项的数量比例关系,是目前数据挖掘领域中的研究课题。从提高算法性能和实用性的角度... 高效用频繁模式挖掘算法运用数据项的重要度信息,能够从数据中挖掘出更重要的频繁模式,而高效用数量比频繁模式挖掘算法可以进一步研究频繁模式中数据项的数量比例关系,是目前数据挖掘领域中的研究课题。从提高算法性能和实用性的角度出发对高效用数量比频繁模式挖掘算法进行优化,提出了一种基于关联程度的高效用数量比频繁模式挖掘算法RHUQI-Miner。RHUQI-Miner首先提出关联程度的概念,依据关联程度构建项目关联程度结构,并给出关联剪枝优化策略,寻找关联程度更高的项目集合,减少冗余和无效的频繁模式;随后运用修正模式长度策略,修正挖掘过程中项集的效用信息,使算法可根据实际数据情况控制输出频繁模式的长度,进一步提升算法的性能,提高算法的实用性。通过对RHUQI-Miner在动车组PHM系统车载故障数据集上的实验结果进行分析,表明该算法能够有效减少挖掘过程中的时间以及内存消耗,可以得出该算法适用于铁路实际数据和业务的有效结论。 展开更多
关键词 高效用 数量比 频繁模式挖掘 关联剪枝 修正模式长度
下载PDF
基于频繁模式挖掘算法的中医问诊策略研究
18
作者 李瑞珍 夏春明 +2 位作者 王忆勤 许朝霞 熊玉洁 《世界科学技术-中医药现代化》 CSCD 北大核心 2024年第6期1608-1617,共10页
目的研究中医问诊策略,实现快速捕捉患者的关键病情信息,推进中医问诊客观化的发展。方法采用基于关联分析中频繁模式挖掘算法的症状提问模型,并使用交叉合并的方法建立中医单系统症状提问与多系统综合症状提问的中医症状问诊策略,达到... 目的研究中医问诊策略,实现快速捕捉患者的关键病情信息,推进中医问诊客观化的发展。方法采用基于关联分析中频繁模式挖掘算法的症状提问模型,并使用交叉合并的方法建立中医单系统症状提问与多系统综合症状提问的中医症状问诊策略,达到通过最短的时间、最高的效率来获取到患者关键病情信息。结果实现了从单系统问诊到五系统综合问诊的突破,通过单系统与五系统两种症状提问模式实现了高效获取患者病情信息的过程,且对比传统量表提问方式,系统减少了65%的提问次数就可获取到患者92%的症状信息,大大提高了对患者症状信息获取的效率。结论在两种不同的症状提问模式下,打破了中医基于量表来询问患者的传统问诊模式,缩短了对患者症状获取的时间,简化了问诊流程,减少了由于经验不足或人为主观造成的差异,能够用于中医临床辅助诊断中。 展开更多
关键词 中医问诊 频繁模式挖掘算法 症状关联性 问诊策略
下载PDF
Novel Algorithm for Mining Frequent Patterns of Moving Objects Based on Dictionary Tree Improvement
19
作者 Yi Chen Yulan Dong Dechang Pi 《国际计算机前沿大会会议论文集》 2018年第1期20-20,共1页
下载PDF
基于滑动窗口含负项的高效用模式挖掘
20
作者 武妍 荀亚玲 马煜 《计算机工程与设计》 北大核心 2024年第3期845-851,共7页
针对传统高效用模式挖掘均未考虑项的效用值为负,以及对流数据处理的时效性问题,提出一种基于滑动窗口的高效用挖掘算法HUPN_SW。利用一种新定义的滑动窗口正负效用列表PNSWU-List,维护挖掘最近批次高效用模式集所需的所有信息,实现有... 针对传统高效用模式挖掘均未考虑项的效用值为负,以及对流数据处理的时效性问题,提出一种基于滑动窗口的高效用挖掘算法HUPN_SW。利用一种新定义的滑动窗口正负效用列表PNSWU-List,维护挖掘最近批次高效用模式集所需的所有信息,实现有效的逐批次挖掘,避免重复的数据库扫描,在不产生候选效用模式集的情况下,直接挖掘出高效用模式,使HUPN_SW有效适应于动态流数据。实验结果表明,HUPN_SW算法在运行时间和可扩展性方面有良好表现。 展开更多
关键词 频繁模式挖掘 滑动窗口 高效用模式挖掘 高效用项集 负效用 流数据 效用列表
下载PDF
上一页 1 2 46 下一页 到第
使用帮助 返回顶部