全文获取类型
收费全文 | 10976篇 |
免费 | 2699篇 |
国内免费 | 2453篇 |
专业分类
电工技术 | 976篇 |
技术理论 | 2篇 |
综合类 | 1294篇 |
化学工业 | 188篇 |
金属工艺 | 95篇 |
机械仪表 | 482篇 |
建筑科学 | 326篇 |
矿业工程 | 159篇 |
能源动力 | 138篇 |
轻工业 | 202篇 |
水利工程 | 122篇 |
石油天然气 | 109篇 |
武器工业 | 124篇 |
无线电 | 1859篇 |
一般工业技术 | 515篇 |
冶金工业 | 146篇 |
原子能技术 | 19篇 |
自动化技术 | 9372篇 |
出版年
2024年 | 120篇 |
2023年 | 323篇 |
2022年 | 546篇 |
2021年 | 629篇 |
2020年 | 668篇 |
2019年 | 570篇 |
2018年 | 590篇 |
2017年 | 616篇 |
2016年 | 672篇 |
2015年 | 741篇 |
2014年 | 900篇 |
2013年 | 836篇 |
2012年 | 1115篇 |
2011年 | 1175篇 |
2010年 | 984篇 |
2009年 | 895篇 |
2008年 | 976篇 |
2007年 | 1012篇 |
2006年 | 656篇 |
2005年 | 529篇 |
2004年 | 407篇 |
2003年 | 279篇 |
2002年 | 221篇 |
2001年 | 150篇 |
2000年 | 112篇 |
1999年 | 95篇 |
1998年 | 48篇 |
1997年 | 41篇 |
1996年 | 41篇 |
1995年 | 31篇 |
1994年 | 19篇 |
1993年 | 16篇 |
1992年 | 7篇 |
1991年 | 9篇 |
1990年 | 12篇 |
1989年 | 10篇 |
1988年 | 8篇 |
1987年 | 8篇 |
1986年 | 4篇 |
1985年 | 10篇 |
1984年 | 11篇 |
1983年 | 7篇 |
1982年 | 5篇 |
1981年 | 4篇 |
1980年 | 3篇 |
1979年 | 6篇 |
1978年 | 2篇 |
1977年 | 3篇 |
1976年 | 2篇 |
1974年 | 2篇 |
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
31.
32.
33.
《Expert systems with applications》2014,41(6):3134-3142
Partitioning the universe of discourse and determining intervals containing useful temporal information and coming with better interpretability are critical for forecasting in fuzzy time series. In the existing literature, researchers seldom consider the effect of time variable when they partition the universe of discourse. As a result, and there is a lack of interpretability of the resulting temporal intervals. In this paper, we take the temporal information into account to partition the universe of discourse into intervals with unequal length. As a result, the performance improves forecasting quality. First, time variable is involved in partitioning the universe through Gath–Geva clustering-based time series segmentation and obtain the prototypes of data, then determine suitable intervals according to the prototypes by means of information granules. An effective method of partitioning and determining intervals is proposed. We show that these intervals carry well-defined semantics. To verify the effectiveness of the approach, we apply the proposed method to forecast enrollment of students of Alabama University and the Taiwan Stock Exchange Capitalization Weighted Stock Index. The experimental results show that the partitioning with temporal information can greatly improve accuracy of forecasting. Furthermore, the proposed method is not sensitive to its parameters. 相似文献
34.
《Expert systems with applications》2014,41(7):3261-3275
Recommender systems apply data mining and machine learning techniques for filtering unseen information and can predict whether a user would like a given item. This paper focuses on gray-sheep users problem responsible for the increased error rate in collaborative filtering based recommender systems. This paper makes the following contributions: we show that (1) the presence of gray-sheep users can affect the performance – accuracy and coverage – of the collaborative filtering based algorithms, depending on the data sparsity and distribution; (2) gray-sheep users can be identified using clustering algorithms in offline fashion, where the similarity threshold to isolate these users from the rest of community can be found empirically. We propose various improved centroid selection approaches and distance measures for the K-means clustering algorithm; (3) content-based profile of gray-sheep users can be used for making accurate recommendations. We offer a hybrid recommendation algorithm to make reliable recommendations for gray-sheep users. To the best of our knowledge, this is the first attempt to propose a formal solution for gray-sheep users problem. By extensive experimental results on two different datasets (MovieLens and community of movie fans in the FilmTrust website), we showed that the proposed approach reduces the recommendation error rate for the gray-sheep users while maintaining reasonable computational performance. 相似文献
35.
In multi-class queueing systems, customers of different classes can enter the system. When studying such systems, it is traditionally assumed that the different classes of customers occur randomly and independently in the arrival stream of customers in the system. This is often in contrast to the actual situation. Therefore, we study a multi-class system with so-called class clustering in the customer arrival stream, i.e., (Markovian) correlation occurs in the classes of consecutive customers. The system under investigation consists of one server that is able to serve two classes of customers. In addition, the service-time distribution of a customer depends on the equality or non-equality of its class with the class of the previous customer. This latter feature occurs frequently in practice. For instance, execution of the same task again can lead to both faster or slower processing times. The first case can occur when the execution of a different task entails resetting a machine, or loading new data, et cetera. The opposite situation appears, for instance, when execution of the same task requires postprocessing (such as cooling down or reinitialization of a machine). We deduce the probability generating function (pgf) of the system content, from which we can extract various performance measures, among which the mean values of the system content and the customer delay. We demonstrate that class clustering has a tremendous impact on the system performance, which highlights the necessity to include it in the performance assessment of any system in which it occurs. 相似文献
36.
37.
《Expert systems with applications》2014,41(13):5780-5787
The massive quantity of data available today in the Internet has reached such a huge volume that it has become humanly unfeasible to efficiently sieve useful information from it. One solution to this problem is offered by using text summarization techniques. Text summarization, the process of automatically creating a shorter version of one or more text documents, is an important way of finding relevant information in large text libraries or in the Internet. This paper presents a multi-document summarization system that concisely extracts the main aspects of a set of documents, trying to avoid the typical problems of this type of summarization: information redundancy and diversity. Such a purpose is achieved through a new sentence clustering algorithm based on a graph model that makes use of statistic similarities and linguistic treatment. The DUC 2002 dataset was used to assess the performance of the proposed system, surpassing DUC competitors by a 50% margin of f-measure, in the best case. 相似文献
38.
针对网络流量特征选择过程中存在的样本标记瓶颈问题,以及现有半监督方法无法选择强相关的特征的不足,提出一种基于类标记扩展的多类半监督特征选择(SFSEL)算法。该算法首先从少量的标记样本出发,通过K-means算法对未标记样本进行类标记扩展;然后结合基于双重正则的支持向量机(MDrSVM)算法实现多类数据的特征选择。与半监督特征选择算法Spectral、PCFRSC和SEFR在Moore数据集进行了对比实验,SFSEL得到的分类准确率和召回率明显都要高于其他算法,而且SFSEL算法选择的特征个数明显少于其他算法。实验结果表明: SFSEL算法能够有效地提高所选特征的相关性,获取更好的网络流量分类性能。 相似文献
39.
传统K-means算法对初始聚类中心选择较敏感, 结果有可能收敛于一般次优解, 为些提出一种结合双粒子群和K-means的混合文本聚类算法。设计了自调整惯性权值策略, 根据最优适应度值的变化率动态调整惯性权值。两子群分别采用基于不同惯性权值策略的粒子群算法进化, 子代间及子代与父代信息交流, 共享最优粒子, 替换最劣粒子, 完成进化, 该算法命名为双粒子群算法。将能平衡全局与局部搜索能力的双粒子群算法与高效的K-means算法结合, 每个粒子是一组聚类中心, 类内离散度之和的倒数是适应度函数, 用K-means算法优化新生粒子, 即为结合双粒子群和K-means的混合文本聚类算法。实验结果表明, 该算法相对于K-means、PSO等文本聚类算法具有更强鲁棒性, 聚类效果也有明显的改善。 相似文献
40.
利用局部线性嵌入(LLE)算法中获得局部邻域之间的重构关系与使用最小角回归方法解决L1归一化问题都使用回归方法,针对在通过映射获得低维嵌入空间与通过特征选择获得低维空间上有着一致的思想,提出一种能保持局部重构关系的无监督谱特征选择方法.该方法利用最小二乘法计算样本的邻域重构系数,并用这些系数表示样本之间的关系,通过解决稀疏特征值问题获得能够保持样本间关系的低维嵌入空间,最后通过解决L1归一化问题实现自动特征选择.通过在四个不同数据集上的聚类实验结果证明,该方法能更准确地评价每个特征的重要性,能自动适应不同的数据集,受参数影响更小,可以明显提升聚类效果. 相似文献