全文获取类型
收费全文 | 1652篇 |
免费 | 104篇 |
国内免费 | 69篇 |
学科分类
工业技术 | 1825篇 |
出版年
2024年 | 2篇 |
2023年 | 3篇 |
2022年 | 7篇 |
2021年 | 16篇 |
2020年 | 22篇 |
2019年 | 29篇 |
2018年 | 21篇 |
2017年 | 41篇 |
2016年 | 37篇 |
2015年 | 51篇 |
2014年 | 50篇 |
2013年 | 80篇 |
2012年 | 83篇 |
2011年 | 119篇 |
2010年 | 105篇 |
2009年 | 131篇 |
2008年 | 150篇 |
2007年 | 197篇 |
2006年 | 183篇 |
2005年 | 117篇 |
2004年 | 87篇 |
2003年 | 128篇 |
2002年 | 51篇 |
2001年 | 30篇 |
2000年 | 28篇 |
1999年 | 19篇 |
1998年 | 14篇 |
1997年 | 7篇 |
1996年 | 4篇 |
1995年 | 3篇 |
1994年 | 1篇 |
1993年 | 1篇 |
1992年 | 3篇 |
1990年 | 2篇 |
1988年 | 1篇 |
1987年 | 2篇 |
排序方式: 共有1825条查询结果,搜索用时 46 毫秒
31.
熵理论是信息系统中不确定性研究的有效工具之一。首先给出了集值信息系统的拟序关系,在此基础上引入了粗糙熵,讨论了粗糙熵的最大、最小值,并证明了粗糙熵的单调性。 相似文献
32.
短时交通流预测是实现智能交通控制的前提与基础.提出了一种基于粗神经网络的RBF短时交通流预测算法,该算法在交通流量预测方面明显优于常规RBF神经网络,且具有较高的实时性. 相似文献
33.
欧萍 《电脑编程技巧与维护》2011,1(16):36-37
介绍粗糙集理论和在关系数据库方面的应用,分析和研究了应用中粗糙关系数据库模型,以及关系操作、完整性约束和粗糙查询等. 相似文献
34.
Generalized rough sets over fuzzy lattices 总被引:2,自引:0,他引:2
Guilong Liu 《Information Sciences》2008,178(6):1651-1662
This paper studies generalized rough sets over fuzzy lattices through both the constructive and axiomatic approaches. From the viewpoint of the constructive approach, the basic properties of generalized rough sets over fuzzy lattices are obtained. The matrix representation of the lower and upper approximations is given. According to this matrix view, a simple algorithm is obtained for computing the lower and upper approximations. As for the axiomatic approach, a set of axioms is constructed to characterize the upper approximation of generalized rough sets over fuzzy lattices. 相似文献
35.
By introducing the rough set theory into the support vector machine (SVM), a rough margin based SVM (RMSVM) is proposed to deal with the overfitting problem due to outliers. Similar to the classical SVM, the RMSVM searches for the separating hyper-plane that maximizes the rough margin, defined by the lower and upper margin. In this way, more data points are adaptively considered rather than the few extreme value points used in the classical SVM. In addition, different support vectors may have different effects on the learning of the separating hyper-plane depending on their positions in the rough margin. Points in the lower margin have more effects than those in the boundary of the rough margin. From experimental results on six benchmark datasets, the classification accuracy of this algorithm is improved without additional computational expense compared with the classical ν-SVM. 相似文献
36.
Eric C.C. Tsang Chen Degang Daniel S. Yeung 《Computers & Mathematics with Applications》2008,56(1):279-289
The covering generalized rough sets are an improvement of traditional rough set model to deal with more complex practical problems which the traditional one cannot handle. It is well known that any generalization of traditional rough set theory should first have practical applied background and two important theoretical issues must be addressed. The first one is to present reasonable definitions of set approximations, and the second one is to develop reasonable algorithms for attributes reduct. The existing covering generalized rough sets, however, mainly pay attention to constructing approximation operators. The ideas of constructing lower approximations are similar but the ideas of constructing upper approximations are different and they all seem to be unreasonable. Furthermore, less effort has been put on the discussion of the applied background and the attributes reduct of covering generalized rough sets. In this paper we concentrate our discussion on the above two issues. We first discuss the applied background of covering generalized rough sets by proposing three kinds of datasets which the traditional rough sets cannot handle and improve the definition of upper approximation for covering generalized rough sets to make it more reasonable than the existing ones. Then we study the attributes reduct with covering generalized rough sets and present an algorithm by using discernibility matrix to compute all the attributes reducts with covering generalized rough sets. With these discussions we can set up a basic foundation of the covering generalized rough set theory and broaden its applications. 相似文献
37.
Wei-Chou Chen Shian-Shyong Tseng Tzung-Pei Hong 《Expert systems with applications》2008,34(4):2858-2869
Feature selection is about finding useful (relevant) features to describe an application domain. Selecting relevant and enough features to effectively represent and index the given dataset is an important task to solve the classification and clustering problems intelligently. This task is, however, quite difficult to carry out since it usually needs a very time-consuming search to get the features desired. This paper proposes a bit-based feature selection method to find the smallest feature set to represent the indexes of a given dataset. The proposed approach originates from the bitmap indexing and rough set techniques. It consists of two-phases. In the first phase, the given dataset is transformed into a bitmap indexing matrix with some additional data information. In the second phase, a set of relevant and enough features are selected and used to represent the classification indexes of the given dataset. After the relevant and enough features are selected, they can be judged by the domain expertise and the final feature set of the given dataset is thus proposed. Finally, the experimental results on different data sets also show the efficiency and accuracy of the proposed approach. 相似文献
38.
属性约简是Rough集理论研究中的一个关键问题,已有的算法大致可以分为增加策略和删除策略2类,都是采用不同的启发式或适应值函数来选择属性。该文提出一种基于属性在可辨识矩阵中出现频率的新算法,以核为基础,不断从可辨识矩阵中选入出现频率最高的属性,直到可辨识矩阵元素集为空。为了得到Pawlak约简,算法增加了反向删除操作。实验分析表明该方法比其他方法快且有效。 相似文献
39.
基于粗糙集的案例推理在网络行为安全审计监控中的应用 总被引:1,自引:0,他引:1
针对互联网用户的网络行为产生的虚拟身份信息和虚拟身份轨迹的管理,提出网络虚拟人口库的组织方法;对网络虚拟人口库的管理提出一种基于粗糙集案例推理方法,该方法将粗糙集处理不确定知识的优点和案例推理相结合,提出基于粗糙集权重发现算法、案例索引建立、案例检索,同时给出实例,验证有效性和准确性. 相似文献
40.
基于遗传算法的粗糙集属性约简算法 总被引:1,自引:0,他引:1
为了研究粗糙集理论中属性约简问题,给出了一种属性相对重要度定义,证明了其合理性,并将它应用到基于遗传算法的约简算法中,提出一种启发式遗传算法.算法采用修正策略保证群体进化收敛于最小约简,同时引入属性相对重要度作为启发信息,加快算法的收敛速度.对算法进行的时间复杂度和完备性分析以及数值实验表明,基于遗传算法的粗糙集属性约简算法具有完备、快速收敛等特点. 相似文献