全文获取类型
收费全文 | 7282篇 |
免费 | 405篇 |
国内免费 | 452篇 |
学科分类
工业技术 | 8139篇 |
出版年
2024年 | 21篇 |
2023年 | 116篇 |
2022年 | 159篇 |
2021年 | 205篇 |
2020年 | 205篇 |
2019年 | 150篇 |
2018年 | 159篇 |
2017年 | 199篇 |
2016年 | 247篇 |
2015年 | 245篇 |
2014年 | 404篇 |
2013年 | 417篇 |
2012年 | 399篇 |
2011年 | 494篇 |
2010年 | 371篇 |
2009年 | 389篇 |
2008年 | 331篇 |
2007年 | 445篇 |
2006年 | 433篇 |
2005年 | 349篇 |
2004年 | 331篇 |
2003年 | 344篇 |
2002年 | 290篇 |
2001年 | 205篇 |
2000年 | 182篇 |
1999年 | 187篇 |
1998年 | 171篇 |
1997年 | 121篇 |
1996年 | 112篇 |
1995年 | 75篇 |
1994年 | 48篇 |
1993年 | 61篇 |
1992年 | 48篇 |
1991年 | 32篇 |
1990年 | 23篇 |
1989年 | 22篇 |
1988年 | 18篇 |
1987年 | 18篇 |
1986年 | 22篇 |
1985年 | 14篇 |
1984年 | 12篇 |
1983年 | 12篇 |
1982年 | 12篇 |
1981年 | 11篇 |
1980年 | 6篇 |
1979年 | 5篇 |
1978年 | 7篇 |
1977年 | 2篇 |
1976年 | 6篇 |
1974年 | 3篇 |
排序方式: 共有8139条查询结果,搜索用时 15 毫秒
91.
Bo Li Author Vitae Chun-Hou Zheng Author Vitae Author Vitae 《Pattern recognition》2008,41(12):3813-3821
In this paper an efficient feature extraction method named as locally linear discriminant embedding (LLDE) is proposed for face recognition. It is well known that a point can be linearly reconstructed by its neighbors and the reconstruction weights are under the sum-to-one constraint in the classical locally linear embedding (LLE). So the constrained weights obey an important symmetry: for any particular data point, they are invariant to rotations, rescalings and translations. The latter two are introduced to the proposed method to strengthen the classification ability of the original LLE. The data with different class labels are translated by the corresponding vectors and those belonging to the same class are translated by the same vector. In order to cluster the data with the same label closer, they are also rescaled to some extent. So after translation and rescaling, the discriminability of the data will be improved significantly. The proposed method is compared with some related feature extraction methods such as maximum margin criterion (MMC), as well as other supervised manifold learning-based approaches, for example ensemble unified LLE and linear discriminant analysis (En-ULLELDA), locally linear discriminant analysis (LLDA). Experimental results on Yale and CMU PIE face databases convince us that the proposed method provides a better representation of the class information and obtains much higher recognition accuracies. 相似文献
92.
We present an approach for extracting extremal feature lines of scalar indicators on surface meshes, based on discrete Morse Theory. By computing initial Morse‐Smale complexes of the scalar indicators of the mesh, we obtain a candidate set of extremal feature lines of the surface. A hierarchy of Morse‐Smale complexes is computed by prioritizing feature lines according to a novel criterion and applying a cancellation procedure that allows us to select the most significant lines. Given the scalar indicators on the vertices of the mesh, the presented feature line extraction scheme is interpolation free and needs no derivative estimates. The technique is insensitive to noise and depends only on one parameter: the feature significance. We use the technique to extract surface features yielding impressive, non photorealistic images. 相似文献
93.
Feature selection is an important aspect of solving data-mining and machine-learning problems. This paper proposes a feature-selection
method for the Support Vector Machine (SVM) learning. Like most feature-selection methods, the proposed method ranks all features
in decreasing order of importance so that more relevant features can be identified. It uses a novel criterion based on the
probabilistic outputs of SVM. This criterion, termed Feature-based Sensitivity of Posterior Probabilities (FSPP), evaluates
the importance of a specific feature by computing the aggregate value, over the feature space, of the absolute difference
of the probabilistic outputs of SVM with and without the feature. The exact form of this criterion is not easily computable
and approximation is needed. Four approximations, FSPP1-FSPP4, are proposed for this purpose. The first two approximations
evaluate the criterion by randomly permuting the values of the feature among samples of the training data. They differ in
their choices of the mapping function from standard SVM output to its probabilistic output: FSPP1 uses a simple threshold
function while FSPP2 uses a sigmoid function. The second two directly approximate the criterion but differ in the smoothness
assumptions of criterion with respect to the features. The performance of these approximations, used in an overall feature-selection
scheme, is then evaluated on various artificial problems and real-world problems, including datasets from the recent Neural
Information Processing Systems (NIPS) feature selection competition. FSPP1-3 show good performance consistently with FSPP2
being the best overall by a slight margin. The performance of FSPP2 is competitive with some of the best performing feature-selection
methods in the literature on the datasets that we have tested. Its associated computations are modest and hence it is suitable
as a feature-selection method for SVM applications.
Editor: Risto Miikkulainen. 相似文献
94.
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. 相似文献
95.
96.
提出了一种基于支持向量机的改进的降维方法.在输入和特征空间中,特征子集的选取分别根据原始特征每一维对分类的贡献来获得.最后,通过将输入和特征空间中的特征选取联合起来,得到了一种改进的降维方法.实验表明:使用这种方法,在保持对分类准确率不受明显的影响的同时,能大大地提高训练和预测的速度. 相似文献
97.
根据特征编码的思想,首次提出了一种基于文字下划线特征变化的脆弱型文本水印算法.该算法利用字符的内码特征信息生成水印,然后按照特定的顺序插入水印或检测水印.理论分析和实验表明,算法具有良好的不可感知性,能准确地检测各类水印攻击,在大部分情况下能对篡改进行精确定位. 相似文献
98.
张惠春 《数字社区&智能家居》2009,(8)
中文名词短语识别在自然语言处理已经得到了广泛应用。该文首先对名词短语识别问题进行描述,然后利用最大熵模型建立名词短语识别系统,通过实验选取最大熵模型的特征,最后利用选取的特征进行名词短语识别,实验结果表明系统达到了较高的准确率和召回率。 相似文献
99.
近年来由于人脸检测技术在身份验证、视频监控等领域日益广泛的应用,对于人脸检测的研究越来越受到人们的重视。该文对各发展阶段的方法进行介绍比较,指出其优劣性。 相似文献
100.
传统的Isomap算法仅侧重于当前数据的分析,不能提供由高维空间到低维空间的快速直接映射,因此无法用于特征提取和高维数据检索.针对这一问题,文中提出一种基于Isornap的快速数据检索算法.该算法能够快速得到新样本的低维嵌入坐标,并基于此坐标检索与输入样本最相似的参考样本.在典型测试集上的实验结果表明,该算法在实现新样本到低维流形快速映射的同时,能较好保留样本的近邻关系. 相似文献