全文获取类型
收费全文 | 88篇 |
免费 | 0篇 |
专业分类
化学工业 | 5篇 |
建筑科学 | 1篇 |
轻工业 | 14篇 |
无线电 | 4篇 |
一般工业技术 | 5篇 |
冶金工业 | 38篇 |
自动化技术 | 21篇 |
出版年
2023年 | 1篇 |
2022年 | 2篇 |
2019年 | 1篇 |
2013年 | 2篇 |
2012年 | 3篇 |
2010年 | 3篇 |
2009年 | 3篇 |
2008年 | 2篇 |
2007年 | 2篇 |
2006年 | 3篇 |
2005年 | 1篇 |
2004年 | 1篇 |
2003年 | 5篇 |
2002年 | 6篇 |
2001年 | 4篇 |
2000年 | 1篇 |
1999年 | 3篇 |
1998年 | 13篇 |
1997年 | 5篇 |
1996年 | 11篇 |
1995年 | 1篇 |
1993年 | 4篇 |
1992年 | 1篇 |
1991年 | 2篇 |
1990年 | 1篇 |
1988年 | 1篇 |
1985年 | 1篇 |
1977年 | 2篇 |
1976年 | 3篇 |
排序方式: 共有88条查询结果,搜索用时 0 毫秒
1.
2.
Simon Rogers Arto Klami Janne Sinkkonen Mark Girolami Samuel Kaski 《Machine Learning》2010,79(1-2):201-226
Combined analysis of multiple data sources has increasing application interest, in particular for distinguishing shared and source-specific aspects. We extend this rationale to the generative and non-parametric clustering setting by introducing a novel non-parametric hierarchical mixture model. The lower level of the model describes each source with a flexible non-parametric mixture, and the top level combines these to describe commonalities of the sources. The lower-level clusters arise from hierarchical Dirichlet Processes, inducing an infinite-dimensional contingency table between the sources. The commonalities between the sources are modeled by an infinite component model of the contingency table, interpretable as non-negative factorization of infinite matrices, or as a prior for infinite contingency tables. With Gaussian mixture components plugged in for continuous measurements, the model is applied to two views of genes, mRNA expression and abundance of the produced proteins, to expose groups of genes that are co-regulated in either or both of the views. We discover complex relationships between the marginals (that are multimodal in both marginals) that would remain undetected by simpler models. Cluster analysis of co-expression is a standard method of screening for co-regulation, and the two-view analysis extends the approach to distinguishing between pre- and post-translational regulation. 相似文献
3.
Theodoros Damoulas Author Vitae Mark A. Girolami Author Vitae 《Pattern recognition》2009,42(11):2671-2683
In this paper we offer a variational Bayes approximation to the multinomial probit model for basis expansion and kernel combination. Our model is well-founded within a hierarchical Bayesian framework and is able to instructively combine available sources of information for multinomial classification. The proposed framework enables informative integration of possibly heterogeneous sources in a multitude of ways, from the simple summation of feature expansions to weighted product of kernels, and it is shown to match and in certain cases outperform the well-known ensemble learning approaches of combining individual classifiers. At the same time the approximation reduces considerably the CPU time and resources required with respect to both the ensemble learning methods and the full Markov chain Monte Carlo, Metropolis-Hastings within Gibbs solution of our model. We present our proposed framework together with extensive experimental studies on synthetic and benchmark datasets and also for the first time report a comparison between summation and product of individual kernels as possible different methods for constructing the composite kernel matrix. 相似文献
4.
M Girolami 《Neural computation》2001,13(11):2517-2532
An expectation-maximization algorithm for learning sparse and overcomplete data representations is presented. The proposed algorithm exploits a variational approximation to a range of heavy-tailed distributions whose limit is the Laplacian. A rigorous lower bound on the sparse prior distribution is derived, which enables the analytic marginalization of a lower bound on the data likelihood. This lower bound enables the development of an expectation-maximization algorithm for learning the overcomplete basis vectors and inferring the most probable basis coefficients. 相似文献
5.
Roman Rosipal Mark Girolami Leonard J. Trejo Andrzej Cichocki 《Neural computing & applications》2001,10(3):231-243
In this paper, we propose the application of the Kernel Principal Component Analysis (PCA) technique for feature selection
in a high-dimensional feature space, where input variables are mapped by a Gaussian kernel. The extracted features are employed
in the regression problems of chaotic Mackey–Glass time-series prediction in a noisy environment and estimating human signal
detection performance from brain event-related potentials elicited by task relevant signals. We compared results obtained
using either Kernel PCA or linear PCA as data preprocessing steps. On the human signal detection task, we report the superiority
of Kernel PCA feature extraction over linear PCA. Similar to linear PCA, we demonstrate de-noising of the original data by
the appropriate selection of various nonlinear principal components. The theoretical relation and experimental comparison
of Kernel Principal Components Regression, Kernel Ridge Regression and ε-insensitive Support Vector Regression is also provided. 相似文献
6.
This letter considers how a number of modern Markov chain Monte Carlo (MCMC) methods can be applied for parameter estimation and inference in state-space models with point process observations. We quantified the efficiencies of these MCMC methods on synthetic data, and our results suggest that the Reimannian manifold Hamiltonian Monte Carlo method offers the best performance. We further compared such a method with a previously tested variational Bayes method on two experimental data sets. Results indicate similar performance on the large data sets and superior performance on small ones. The work offers an extensive suite of MCMC algorithms evaluated on an important class of models for physiological signal analysis. 相似文献
7.
Girolami M. Chao He 《IEEE transactions on pattern analysis and machine intelligence》2003,25(10):1253-1264
The requirement to reduce the computational cost of evaluating a point probability density estimate when employing a Parzen window estimator is a well-known problem. This paper presents the Reduced Set Density Estimator that provides a kernel-based density estimator which employs a small percentage of the available data sample and is optimal in the L/sub 2/ sense. While only requiring /spl Oscr/(N/sup 2/) optimization routines to estimate the required kernel weighting coefficients, the proposed method provides similar levels of performance accuracy and sparseness of representation as Support Vector Machine density estimation, which requires /spl Oscr/(N/sup 3/) optimization routines, and which has previously been shown to consistently outperform Gaussian Mixture Models. It is also demonstrated that the proposed density estimator consistently provides superior density estimates for similar levels of data reduction to that provided by the recently proposed Density-Based Multiscale Data Condensation algorithm and, in addition, has comparable computational scaling. The additional advantage of the proposed method is that no extra free parameters are introduced such as regularization, bin width, or condensation ratios, making this method a very simple and straightforward approach to providing a reduced set density estimator with comparable accuracy to that of the full sample Parzen density estimator. 相似文献
8.
Topic Identification in Dynamical Text by Complexity Pursuit 总被引:4,自引:0,他引:4
The problem of analysing dynamically evolving textual data has arisen within the last few years. An example of such data is
the discussion appearing in Internet chat lines. In this Letter a recently introduced source separation method, termed as
complexity pursuit, is applied to the problem of finding topics in dynamical text and is compared against several blind separation algorithms
for the problem considered. Complexity pursuit is a generalisation of projection pursuit to time series and it is able to
use both higher-order statistical measures and temporal dependency information in separating the topics. Experimental results
on chat line and newsgroup data demonstrate that the minimum complexity time series indeed do correspond to meaningful topics
inherent in the dynamical text data, and also suggest the applicability of the method to query-based retrieval from a temporally
changing text stream.
This revised version was published online in June 2006 with corrections to the Cover Date. 相似文献
9.
Mercer kernel-based clustering in feature space 总被引:46,自引:0,他引:46
The article presents a method for both the unsupervised partitioning of a sample of data and the estimation of the possible number of inherent clusters which generate the data. This work exploits the notion that performing a nonlinear data transformation into some high dimensional feature space increases the probability of the linear separability of the patterns within the transformed space and therefore simplifies the associated data structure. It is shown that the eigenvectors of a kernel matrix which defines the implicit mapping provides a means to estimate the number of clusters inherent within the data and a computationally simple iterative procedure is presented for the subsequent feature space partitioning of the data. 相似文献
10.
This paper proposes a projection-based symmetrical factorisation method for extracting semantic features from collections
of text documents stored in a Latent Semantic space. Preliminary experimental results demonstrate this yields a comparable
representation to that provided by a novel probabilistic approach which reconsiders the entire indexing problem of text documents
and works directly in the original high dimensional vector-space representation of text. The employed projection index is
derived here from the a priori constraints on the problem. The principal advantage of this approach is computational efficiency and is obtained by the exploitation
of the Latent Semantic Indexing as a preprocessing stage. Simulation results on subsets of the 20-Newsgroups text corpus in
various settings are provided.
This revised version was published online in August 2006 with corrections to the Cover Date. 相似文献