全文获取类型
收费全文 | 3554篇 |
免费 | 96篇 |
国内免费 | 123篇 |
学科分类
工业技术 | 3773篇 |
出版年
2024年 | 6篇 |
2023年 | 50篇 |
2022年 | 68篇 |
2021年 | 89篇 |
2020年 | 60篇 |
2019年 | 47篇 |
2018年 | 56篇 |
2017年 | 44篇 |
2016年 | 88篇 |
2015年 | 88篇 |
2014年 | 166篇 |
2013年 | 167篇 |
2012年 | 140篇 |
2011年 | 189篇 |
2010年 | 139篇 |
2009年 | 162篇 |
2008年 | 198篇 |
2007年 | 222篇 |
2006年 | 243篇 |
2005年 | 180篇 |
2004年 | 181篇 |
2003年 | 193篇 |
2002年 | 180篇 |
2001年 | 143篇 |
2000年 | 119篇 |
1999年 | 142篇 |
1998年 | 80篇 |
1997年 | 60篇 |
1996年 | 42篇 |
1995年 | 41篇 |
1994年 | 41篇 |
1993年 | 45篇 |
1992年 | 31篇 |
1991年 | 17篇 |
1990年 | 9篇 |
1989年 | 16篇 |
1988年 | 3篇 |
1987年 | 7篇 |
1986年 | 1篇 |
1985年 | 11篇 |
1984年 | 1篇 |
1983年 | 3篇 |
1981年 | 1篇 |
1980年 | 1篇 |
1978年 | 1篇 |
1960年 | 1篇 |
1956年 | 1篇 |
排序方式: 共有3773条查询结果,搜索用时 15 毫秒
91.
Semantic-based web service discovery and chaining for building an Arctic spatial data infrastructure 总被引:2,自引:0,他引:2
W. Li C. Yang D. NebertR. Raskin P. HouserH. Wu Z. Li 《Computers & Geosciences》2011,37(11):1752-1762
Increasing interests in a global environment and climate change have led to studies focused on the changes in the multinational Arctic region. To facilitate Arctic research, a spatial data infrastructure (SDI), where Arctic data, information, and services are shared and integrated in a seamless manner, particularly in light of today's climate change scenarios, is urgently needed. In this paper, we utilize the knowledge-based approach and the spatial web portal technology to prototype an Arctic SDI (ASDI) by proposing (1) a hybrid approach for efficient service discovery from distributed web catalogs and the dynamic Internet; (2) a domain knowledge base to model the latent semantic relationships among scientific data and services; and (3) an intelligent logic reasoning mechanism for (semi-)automatic service selection and chaining. A study of the influence of solid water dynamics to the bio-habitat of the Arctic region is used as an example to demonstrate the prototype. 相似文献
92.
Johan HuysmansAuthor VitaeKarel DejaegerAuthor Vitae Christophe MuesAuthor Vitae 《Decision Support Systems》2011,51(1):141-154
An important objective of data mining is the development of predictive models. Based on a number of observations, a model is constructed that allows the analysts to provide classifications or predictions for new observations. Currently, most research focuses on improving the accuracy or precision of these models and comparatively little research has been undertaken to increase their comprehensibility to the analyst or end-user. This is mainly due to the subjective nature of ‘comprehensibility’, which depends on many factors outside the model, such as the user's experience and his/her prior knowledge. Despite this influence of the observer, some representation formats are generally considered to be more easily interpretable than others. In this paper, an empirical study is presented which investigates the suitability of a number of alternative representation formats for classification when interpretability is a key requirement. The formats under consideration are decision tables, (binary) decision trees, propositional rules, and oblique rules. An end-user experiment was designed to test the accuracy, response time, and answer confidence for a set of problem-solving tasks involving the former representations. Analysis of the results reveals that decision tables perform significantly better on all three criteria, while post-test voting also reveals a clear preference of users for decision tables in terms of ease of use. 相似文献
93.
Yue XuAuthor Vitae Yuefeng Li Author VitaeGavin Shaw Author Vitae 《Data & Knowledge Engineering》2011,70(6):555-575
Association rule mining has contributed to many advances in the area of knowledge discovery. However, the quality of the discovered association rules is a big concern and has drawn more and more attention recently. One problem with the quality of the discovered association rules is the huge size of the extracted rule set. Often for a dataset, a huge number of rules can be extracted, but many of them can be redundant to other rules and thus useless in practice. Mining non-redundant rules is a promising approach to solve this problem. In this paper, we first propose a definition for redundancy, then propose a concise representation, called a Reliable basis, for representing non-redundant association rules. The Reliable basis contains a set of non-redundant rules which are derived using frequent closed itemsets and their generators instead of using frequent itemsets that are usually used by traditional association rule mining approaches. An important contribution of this paper is that we propose to use the certainty factor as the criterion to measure the strength of the discovered association rules. Using this criterion, we can ensure the elimination of as many redundant rules as possible without reducing the inference capacity of the remaining extracted non-redundant rules. We prove that the redundancy elimination, based on the proposed Reliable basis, does not reduce the strength of belief in the extracted rules. We also prove that all association rules, their supports and confidences, can be retrieved from the Reliable basis without accessing the dataset. Therefore the Reliable basis is a lossless representation of association rules. Experimental results show that the proposed Reliable basis can significantly reduce the number of extracted rules. We also conduct experiments on the application of association rules to the area of product recommendation. The experimental results show that the non-redundant association rules extracted using the proposed method retain the same inference capacity as the entire rule set. This result indicates that using non-redundant rules only is sufficient to solve real problems needless using the entire rule set. 相似文献
94.
95.
96.
一个高效的关联规则增量式更新算法 总被引:9,自引:0,他引:9
针对关联规则的维护问题,设计了一个高效的增量式更新算法FIUA,并将FIUA和已有的IUA算法进行了比较,并通过实验证实了FIUA算法的高效性。 相似文献
97.
关于KDD的一类开放系统KDD的研究 总被引:5,自引:0,他引:5
On the basis of KDD(Knowledge Discovery based on Database),the paper proposes the general framework of the open KDD system-KDD*, discusses its theoretical foundation and realization of its key technology-double base cooperating mechanism. The result of initial illustration shows that the structure of KDD' is effective and available. 相似文献
98.
粗集理论中的容错关系及其构造方法 总被引:1,自引:1,他引:0
粗集理论(Rough Sets Theory,RST)在许多领域已得到成功的应用,它在处理不完全、不精确、不确定性智能信息问题中表现出优秀品质。然而在标准RST理论中存在有局限性,比如对等价关系的定义使得知识约简相对复杂化。论文提出了基于RST的容错粗集的概念,给出了容错粗集上的性质,使得在进行知识约简时无需进行量化。从而大大提高了知识发现的效率。 相似文献
99.
J. B. Noh K. C. Lee J. K. Kim J. K. Lee S. H. Kim 《Expert systems with applications》2000,19(4):249-259
Knowledge is at the heart of knowledge management. In literature, a lot of studies have been suggested covering the role of knowledge in improving the performance of management. However, there are few studies about investigating knowledge itself in the arena of knowledge management. Knowledge circulating in an organization may be explicit or tacit. Until now, literature in knowledge management shows that it has mainly focused on explicit knowledge. On the other hand, tacit knowledge plays an important role in the success of knowledge management. It is relatively hard to formalize and reuse tacit knowledge. Therefore, research proposing the explication and reuse of tacit knowledge would contribute significantly to knowledge management research. In this sense, we propose using cognitive map (CM) as a main vehicle of formalizing tacit knowledge, and case-based reasoning as a tool for storing CM-driven tacit knowledge in the form of frame-typed cases, and retrieving appropriate tacit knowledge from the case base according to a new problem. Our proposed methodology was applied to a credit analysis problem in which decision-makers need tacit knowledge to assess whether a firm under consideration is healthy or not. Experiment results showed that our methodology for tacit knowledge management can provide decision makers with robust knowledge-based support. 相似文献
100.