• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 7,047
Next 10 →

Linear models and empirical bayes methods for assessing differential expression in microarray experiments.

by Gordon K Smyth , Gordon K Smyth - Stat. Appl. Genet. Mol. Biol. , 2004
"... Abstract The problem of identifying differentially expressed genes in designed microarray experiments is considered. Lonnstedt and Speed (2002) derived an expression for the posterior odds of differential expression in a replicated two-color experiment using a simple hierarchical parametric model. ..."
Abstract - Cited by 1321 (24 self) - Add to MetaCart
Abstract The problem of identifying differentially expressed genes in designed microarray experiments is considered. Lonnstedt and Speed (2002) derived an expression for the posterior odds of differential expression in a replicated two-color experiment using a simple hierarchical parametric model

A comparative analysis of selection schemes used in genetic algorithms

by David E. Goldberg, Kalyanmoy Deb - Foundations of Genetic Algorithms , 1991
"... This paper considers a number of selection schemes commonly used in modern genetic algorithms. Specifically, proportionate reproduction, ranking selection, tournament selection, and Genitor (or «steady state") selection are compared on the basis of solutions to deterministic difference or d ..."
Abstract - Cited by 531 (31 self) - Add to MetaCart
or differential equations, which are verified through computer simulations. The analysis provides convenient approximate or exact solutions as well as useful convergence time and growth ratio estimates. The paper recommends practical application of the analyses and suggests a number of paths for more detailed

Fast and robust fixed-point algorithms for independent component analysis

by Aapo Hyvärinen - IEEE TRANS. NEURAL NETW , 1999
"... Independent component analysis (ICA) is a statistical method for transforming an observed multidimensional random vector into components that are statistically as independent from each other as possible. In this paper, we use a combination of two different approaches for linear ICA: Comon’s informat ..."
Abstract - Cited by 884 (34 self) - Add to MetaCart
information-theoretic approach and the projection pursuit approach. Using maximum entropy approximations of differential entropy, we introduce a family of new contrast (objective) functions for ICA. These contrast functions enable both the estimation of the whole decomposition by minimizing mutual information

Multiple kernel learning, conic duality, and the SMO algorithm

by Francis R. Bach, Gert R. G. Lanckriet - In Proceedings of the 21st International Conference on Machine Learning (ICML , 2004
"... While classical kernel-based classifiers are based on a single kernel, in practice it is often desirable to base classifiers on combinations of multiple kernels. Lanckriet et al. (2004) considered conic combinations of kernel matrices for the support vector machine (SVM), and showed that the optimiz ..."
Abstract - Cited by 445 (31 self) - Add to MetaCart
While classical kernel-based classifiers are based on a single kernel, in practice it is often desirable to base classifiers on combinations of multiple kernels. Lanckriet et al. (2004) considered conic combinations of kernel matrices for the support vector machine (SVM), and showed

On the distribution of the largest eigenvalue in principal components analysis

by Iain M. Johnstone - ANN. STATIST , 2001
"... Let x �1 � denote the square of the largest singular value of an n × p matrix X, all of whose entries are independent standard Gaussian variates. Equivalently, x �1 � is the largest principal component variance of the covariance matrix X ′ X, or the largest eigenvalue of a p-variate Wishart distribu ..."
Abstract - Cited by 422 (4 self) - Add to MetaCart
is defined in terms of the Painlevé II differential equation and can be numerically evaluated and tabulated in software. Simulations showthe approximation to be informative for n and p as small as 5. The limit is derived via a corresponding result for complex Wishart matrices using methods from random matrix

A pragmatic view of knowledge and boundaries: Boundary objects in new product development

by Paul R. Carlile , 2002
"... This study explores the premise that knowledge in new product development proves both a barrier to and a source of innovation. To understand the problematic nature of knowledge and the boundaries that result, an ethnographic study was used to understand how knowledge is structured differently across ..."
Abstract - Cited by 389 (6 self) - Add to MetaCart
across the four primary functions that are dependent on each other in the creation and production of a high-volume product. A pragmatic view of “knowledge in practice ” is developed, describing knowledge as localized, embedded, and invested within a function and how, when working across functions

A review of algebraic multigrid

by K. Stüben , 2001
"... Since the early 1990s, there has been a strongly increasing demand for more efficient methods to solve large sparse, unstructured linear systems of equations. For practically relevant problem sizes, classical one-level methods had already reached their limits and new hierarchical algorithms had to b ..."
Abstract - Cited by 347 (11 self) - Add to MetaCart
Since the early 1990s, there has been a strongly increasing demand for more efficient methods to solve large sparse, unstructured linear systems of equations. For practically relevant problem sizes, classical one-level methods had already reached their limits and new hierarchical algorithms had

Practical Loss-Resilient Codes

by Michael Luby, Michael Mitzenmacher, Amin Shokrollahi, Daniel Spielman, Volker Stemann , 1997
"... We present a randomized construction of linear-time encodable and decodable codes that can transmit over lossy channels at rates extremely close to capacity. The encoding and decoding algorithms for these codes have fast and simple software implementations. Partial implementations of our algorithms ..."
Abstract - Cited by 284 (25 self) - Add to MetaCart
set of differential equations. The solution to these equations can then be expressed as p...

Media will never influence learning.

by Richard E Clark - Educational Technology Research and Development, , 1994
"... The purpose of this discussion is to explain and sharpen different points of view about the impact of media and attributes of media on learning, motivation and efficiency gains from instruction. This paper is an attempt to INTRODUCTION A Brief History of Media Research The claim of "no learnin ..."
Abstract - Cited by 333 (7 self) - Add to MetaCart
;no learning benefits" from media has been made and substantiated many times in the past. Many researchers have argued that media have differential economic benefits but no learning benefits. For example, in the first Handbook of Research on Teaching, Lumsdaine (1963) concluded that the benefits

Testing Continuous-Time Models of the Spot Interest Rate

by Yacine Aït-sahalia, Lars Hansen, Mahesh Maheswaran, José Scheinkman, Rob Vishny - Review of Financial Studies , 1996
"... Different continuous-time models for interest rates coexist in the literature. We test parametric models by comparing their implied parametric density to the same density estimated nonparametrically. We do not replace the continuous-time model by discrete approximations, even though the data are rec ..."
Abstract - Cited by 310 (9 self) - Add to MetaCart
is higher when away from the mean. The continuous-time financial theory has developed extensive tools to price derivative securities when the underlying traded asset(s) or nontraded factor(s) follow stochastic differential equations [see Merton (1990) for examples]. However, as a practical matter, how
Next 10 →
Results 1 - 10 of 7,047
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University