全文获取类型
收费全文 | 537篇 |
免费 | 73篇 |
国内免费 | 87篇 |
专业分类
电工技术 | 6篇 |
综合类 | 25篇 |
化学工业 | 1篇 |
金属工艺 | 1篇 |
机械仪表 | 2篇 |
建筑科学 | 1篇 |
矿业工程 | 1篇 |
能源动力 | 1篇 |
轻工业 | 16篇 |
石油天然气 | 1篇 |
无线电 | 44篇 |
一般工业技术 | 10篇 |
自动化技术 | 588篇 |
出版年
2024年 | 1篇 |
2023年 | 2篇 |
2022年 | 3篇 |
2021年 | 4篇 |
2020年 | 6篇 |
2019年 | 11篇 |
2018年 | 15篇 |
2017年 | 14篇 |
2016年 | 12篇 |
2015年 | 28篇 |
2014年 | 29篇 |
2013年 | 22篇 |
2012年 | 38篇 |
2011年 | 50篇 |
2010年 | 50篇 |
2009年 | 61篇 |
2008年 | 64篇 |
2007年 | 59篇 |
2006年 | 58篇 |
2005年 | 60篇 |
2004年 | 45篇 |
2003年 | 27篇 |
2002年 | 14篇 |
2001年 | 12篇 |
2000年 | 8篇 |
1999年 | 1篇 |
1998年 | 1篇 |
1997年 | 1篇 |
1990年 | 1篇 |
排序方式: 共有697条查询结果,搜索用时 31 毫秒
1.
基于Apriori算法改进的关联规则提取算法 总被引:11,自引:2,他引:9
通过对Apriori算法的基本思想和性能的研究分析,认为Apriori算法存在一些不足。并且根据这些不足提出了相应的改进算法对Apriori算法进行优化,从而得到一种改进的Apriori算法,与原算法相比运算效率大大提高。 相似文献
2.
3.
Mining frequent itemsets has emerged as a fundamental problem in data mining and plays an essential role in many important data mining tasks.In this paper,we propose a novel vertical data representation called N-list,which originates from an FP-tree-like coding prefix tree called PPC-tree that stores crucial information about frequent itemsets.Based on the N-list data structure,we develop an efficient mining algorithm,PrePost,for mining all frequent itemsets.Efficiency of PrePost is achieved by the following three reasons.First,N-list is compact since transactions with common prefixes share the same nodes of the PPC-tree.Second,the counting of itemsets’ supports is transformed into the intersection of N-lists and the complexity of intersecting two N-lists can be reduced to O(m + n) by an efficient strategy,where m and n are the cardinalities of the two N-lists respectively.Third,PrePost can directly find frequent itemsets without generating candidate itemsets in some cases by making use of the single path property of N-list.We have experimentally evaluated PrePost against four state-of-the-art algorithms for mining frequent itemsets on a variety of real and synthetic datasets.The experimental results show that the PrePost algorithm is the fastest in most cases.Even though the algorithm consumes more memory when the datasets are sparse,it is still the fastest one. 相似文献
4.
《Expert systems with applications》2014,41(6):2703-2712
A concept lattice is an ordered structure between concepts. It is particularly effective in mining association rules. However, a concept lattice is not efficient for large databases because the lattice size increases with the number of transactions. Finding an efficient strategy for dynamically updating the lattice is an important issue for real-world applications, where new transactions are constantly inserted into databases. To build an efficient storage structure for mining association rules, this study proposes a method for building the initial frequent closed itemset lattice from the original database. The lattice is updated when new transactions are inserted. The number of database rescans over the entire database is reduced in the maintenance process. The proposed algorithm is compared with building a lattice in batch mode to demonstrate the effectiveness of the proposed algorithm. 相似文献
5.
Manuel Baena-García José M. Carmona-Cejudo Rafael Morales-Bueno 《Journal of Computer and System Sciences》2014
Discovering frequent factors from long strings is an important problem in many applications, such as biosequence mining. In classical approaches, the algorithms process a vast database of small strings. However, in this paper we analyze a small database of long strings. The main difference resides in the high number of patterns to analyze. To tackle the problem, we have developed a new algorithm for discovering frequent factors in long strings. We present an Apriori-like solution which exploits the fact that any super-pattern of a non-frequent pattern cannot be frequent. The SANSPOS algorithm does a multiple-pass, candidate generation and test approach. Multiple length patterns can be generated in a pass. This algorithm uses a new data structure to arrange nodes in a trie. A Positioning Matrix is defined as a new positioning strategy. By using Positioning Matrices, we can apply advanced prune heuristics in a trie with a minimal computational cost. The Positioning Matrices let us process strings including Short Tandem Repeats and calculate different interestingness measures efficiently. Furthermore, in our algorithm we apply parallelism to transverse different sections of the input strings concurrently, speeding up the resulting running time. The algorithm has been successfully used in natural language and biological sequence contexts. 相似文献
6.
Laszlo Szathmary Petko Valtchev Amedeo Napoli 《International Journal of Software and Informatics》2010,4(3):219-238
Rare association rules correspond to rare, or infrequent, itemsets, as opposed
to frequent ones that are targeted by conventional pattern miners. Rare rules reflect regularities
of local, rather than global, scope that can nevertheless provide valuable insights
to an expert, especially in areas such as genetics and medical diagnosis where some specific
deviations/illnesses occur only in a small number of cases. The work presented here is motivated
by the long-standing open question of efficiently mining strong rare rules, i.e., rules
with high confidence and low support. We also propose an efficient solution for finding the
set of minimal rare itemsets. This set serves as a basis for generating rare association rules. 相似文献
7.
双聚类的关联规则挖掘方法 总被引:1,自引:0,他引:1
为了使所有关联规则算法都可用于双聚类挖掘,将双聚类问题转化为关联规则的频繁集挖掘问题.在为双聚类挖掘提供大量算法的同时,不但能获得双聚类,而且还能得到额外的双聚类关联信息.基因表达数据的实验结果证明了其有效性. 相似文献
8.
Fuzzy utility mining has been an emerging research issue because of its simplicity and comprehensibility. Different from traditional fuzzy data mining, fuzzy utility mining considers not only quantities of items in transactions but also their profits for deriving high fuzzy utility itemsets. In this paper, we introduce a new fuzzy utility measure with the fuzzy minimum operator to evaluate the fuzzy utilities of itemsets. Besides, an effective fuzzy utility upper-bound model based on the proposed measure is designed to provide the downward-closure property in fuzzy sets, thus reducing the search space of finding high fuzzy utility itemsets. A two-phase fuzzy utility mining algorithm, named TPFU, is also proposed and described for solving the problem of fuzzy utility mining. At last, the experimental results on both synthetic and real datasets show that the proposed algorithm has good performance. 相似文献
9.
FP-growth算法用于关联规则挖掘分成两个阶段:构建频繁模式树和进行频繁模式挖掘;对这两个阶段分别进行改进,若项头表中存在同频度的频繁项,在构建FP-tree的过程动态调整其位置,构建压缩的最优化FP-tree,提出了IMFP-tree算法。在进行频繁模式挖掘阶段,提出CFP-mine算法,CFP-mine算法采用一种新方法构建条件模式基,且采用组合方式挖掘频繁项集,有别于传统FP-growth算法的挖掘过程,理论上证明和实验验证本算法的正确性和高效性。 相似文献
10.
如何从海量数据信息中挖掘出有用的关联规则已经成为人们广泛关注的问题,而在关联规则挖掘中,首要的问题就是如何高效地挖掘出频繁项集。针对已有FIMM算法作出改进,提出了一种改进的基于矩阵的频繁项集挖掘算法N—FIMM,该算法在FIMM基础上去除大量冗余的非频繁项集的项集,减少计算可能频繁项集的工作量,同时缩小了矩阵规模,提高了空间效率。通过对矩阵操作,一次性地产生所有的频繁项集。试验结果表明,该算法对已有的基于矩阵的频繁项集挖掘算法有了很大的改进,提高了挖掘效率。 相似文献