全文获取类型
收费全文 | 30519篇 |
免费 | 4093篇 |
国内免费 | 2508篇 |
学科分类
工业技术 | 37120篇 |
出版年
2024年 | 139篇 |
2023年 | 458篇 |
2022年 | 888篇 |
2021年 | 1212篇 |
2020年 | 1402篇 |
2019年 | 953篇 |
2018年 | 887篇 |
2017年 | 969篇 |
2016年 | 1117篇 |
2015年 | 1201篇 |
2014年 | 2345篇 |
2013年 | 1866篇 |
2012年 | 2724篇 |
2011年 | 2502篇 |
2010年 | 1980篇 |
2009年 | 2055篇 |
2008年 | 2075篇 |
2007年 | 2270篇 |
2006年 | 2021篇 |
2005年 | 1717篇 |
2004年 | 1390篇 |
2003年 | 1310篇 |
2002年 | 904篇 |
2001年 | 653篇 |
2000年 | 562篇 |
1999年 | 377篇 |
1998年 | 270篇 |
1997年 | 172篇 |
1996年 | 146篇 |
1995年 | 126篇 |
1994年 | 110篇 |
1993年 | 84篇 |
1992年 | 70篇 |
1991年 | 54篇 |
1990年 | 31篇 |
1989年 | 23篇 |
1988年 | 18篇 |
1987年 | 16篇 |
1986年 | 6篇 |
1985年 | 4篇 |
1984年 | 3篇 |
1983年 | 1篇 |
1980年 | 3篇 |
1979年 | 2篇 |
1976年 | 1篇 |
1974年 | 2篇 |
1951年 | 1篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
51.
In this paper, we propose an efficient method for mining all frequent inter-transaction patterns. The method consists of two phases. First, we devise two data structures: a dat-list, which stores the item information used to find frequent inter-transaction patterns; and an ITP-tree, which stores the discovered frequent inter-transaction patterns. In the second phase, we apply an algorithm, called ITP-Miner (Inter-Transaction Patterns Miner), to mine all frequent inter-transaction patterns. By using the ITP-tree, the algorithm requires only one database scan and can localize joining, pruning, and support counting to a small number of dat-lists. The experiment results show that the ITP-Miner algorithm outperforms the FITI (First Intra Then Inter) algorithm by one order of magnitude. 相似文献
52.
GU Qiang ZHONG Rui JU Dong-ying 《中国有色金属学会会刊》2006,16(B02):572-576
Computer simulation for materials processing needs of materials. In order to employ the accumulated large data on a huge database containing a great deal of various physical properties materials heat treatment in the past years, it is significant to develop an intelligent database system. Based on the data mining technology for data analysis, an intelligent database web tool system of computer simulation for heat treatment process named as IndBASEweb-HT was built up. The architecture and the arithmetic of this system as well as its application were introduced. 相似文献
53.
阐述了绿色友好润滑剂的生物降解性和摩擦化学特点,提出了绿色润滑剂在发展过程中存在的主要问题,并对未来的发展趋势进行了预测。 相似文献
54.
Impacts of green roofs and rain water use on the water balance and groundwater levels in urban areas 总被引:1,自引:0,他引:1
Dr. P. Göbel Prof. Dr. W.G. Coldewey Dr.-Ing. C. Dierkes Dipl.-Math. H. Kories Dr. J. Meßer Dr.-Ing. E. Meißner 《Grundwasser》2007,12(3):189-200
Ohne Zusammenfassung
Impacts of green roofs and rain water use on the water balance and groundwater levels in urban areas
相似文献
55.
We explore in this paper the efficient clustering of market-basket data. Different from those of the traditional data, the features of market-basket data are known to be of high dimensionality and sparsity. Without explicitly considering the presence of the taxonomy, most prior efforts on clustering market-basket data can be viewed as dealing with items in the leaf level of the taxonomy tree. Clustering transactions across different levels of the taxonomy is of great importance for marketing strategies as well as for the result representation of the clustering techniques for market-basket data. In view of the features of market-basket data, we devise in this paper a novel measurement, called the category-based adherence, and utilize this measurement to perform the clustering. With this category-based adherence measurement, we develop an efficient clustering algorithm, called algorithm k-todes, for market-basket data with the objective to minimize the category-based adherence. The distance of an item to a given cluster is defined as the number of links between this item and its nearest tode. The category-based adherence of a transaction to a cluster is then defined as the average distance of the items in this transaction to that cluster. A validation model based on information gain is also devised to assess the quality of clustering for market-basket data. As validated by both real and synthetic datasets, it is shown by our experimental results, with the taxonomy information, algorithm k-todes devised in this paper significantly outperforms the prior works in both the execution efficiency and the clustering quality as measured by information gain, indicating the usefulness of category-based adherence in market-basket data clustering. 相似文献
56.
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. 相似文献
57.
58.
重症监护病房中的病人身体状况通常很不稳定,常出现各种需要医护人员介入治疗的紧急状况。由于医疗资源有限,医护人员可能无法及时发现并处理这些紧急状况,给病人的存活率带来严重的负面影响。如果可以预测这些紧急状况的发生,并及时通知相关医护人员,将大大提高病人的存活率。常见重症监护病房紧急状况包括突然死亡、败血症、肺部感染、急性低血压、以及器官衰竭等。紧急状况预警建模主要采用病人的长时间生命体征监测数据,预测在一定时间之后发生某种紧急状况的可能性。预警模型所采用的监测数据分为静态数据、事件数据和时间序列数据等三类。静态数据具有容易采集、但预测准确性偏低的特点。事件数据或时间序列数据、以及多种类型数据的混合数据对于紧急状况预警模型的预测性能的提高有重要作用,将会获得更广泛的应用。 相似文献
59.
数据挖掘作为一种发现大量数据中潜在信息的数据分析技术,受到各界的密切关注。SAS数据挖掘技术是众多数据挖掘方法中的佼佼者,它在大型企业中得到很好的应用。本文介绍数据挖掘的背景知识,并利用SAS/EM工具,对该技术在冷轧酸洗卷质量缺陷原因分析作了初步尝试。 相似文献
60.
OLAM(On-line Analytical Mining)是当前的热点技术,是融合了联机分析处理(OLAP)和数据挖掘(Data Mining)的一种新的数据挖掘技术。本文主要研究数据仓库中OLAP,On-line Analytical Processing和数据挖掘技术,这两个技术是商业智能中的核心技术和主要内容,在两者的基础上引入OLAM的概念,并阐述其基本原理和核心技术。基于微软的SQL Server平台,为一个商业案例建立数据仓库,利用Analysis Services服务,建立销售分析的多维数据集,利用OLAM的基本模型实现OLAP和聚类挖掘技术的结合,借助两者的各自优势,得到很好的客户聚类分析结果。 相似文献