Results 1 - 10 of 38,791

Fast Algorithms for Mining Association Rules

by Rakesh Agrawal, Ramakrishnan Srikant , 1994
"... We consider the problem of discovering association rules between items in a large database of sales transactions. We present two new algorithms for solving this problem that are fundamentally different from the known algorithms. Empirical evaluation shows that these algorithms outperform the known a ..."
Abstract - Cited by 3612 (15 self) - Add to MetaCart
We consider the problem of discovering association rules between items in a large database of sales transactions. We present two new algorithms for solving this problem that are fundamentally different from the known algorithms. Empirical evaluation shows that these algorithms outperform the known

The fundamental properties of natural numbers

by Grzegorz Bancerek - Journal of Formalized Mathematics , 1989
"... Summary. Some fundamental properties of addition, multiplication, order relations, exact division, the remainder, divisibility, the least common multiple, the greatest common divisor are presented. A proof of Euclid algorithm is also given. MML Identifier:NAT_1. WWW:http://mizar.org/JFM/Vol1/nat_1.h ..."
Abstract - Cited by 688 (73 self) - Add to MetaCart
Summary. Some fundamental properties of addition, multiplication, order relations, exact division, the remainder, divisibility, the least common multiple, the greatest common divisor are presented. A proof of Euclid algorithm is also given. MML Identifier:NAT_1. WWW:http://mizar.org/JFM/Vol1/nat_1

The adaptive LASSO and its oracle properties

by Hui Zou - Journal of the American Statistical Association
"... The lasso is a popular technique for simultaneous estimation and variable selection. Lasso variable selection has been shown to be consistent under certain conditions. In this work we derive a necessary condition for the lasso variable selection to be consistent. Consequently, there exist certain sc ..."
Abstract - Cited by 683 (10 self) - Add to MetaCart
scenarios where the lasso is inconsistent for variable selection. We then propose a new version of the lasso, called the adaptive lasso, where adaptive weights are used for penalizing different coefficients in the!1 penalty. We show that the adaptive lasso enjoys the oracle properties; namely, it performs

A new learning algorithm for blind signal separation

by S. Amari, A. Cichocki, H. H. Yang - , 1996
"... A new on-line learning algorithm which minimizes a statistical de-pendency among outputs is derived for blind separation of mixed signals. The dependency is measured by the average mutual in-formation (MI) of the outputs. The source signals and the mixing matrix are unknown except for the number of ..."
Abstract - Cited by 622 (80 self) - Add to MetaCart
of the sources. The Gram-Charlier expansion instead of the Edgeworth expansion is used in evaluating the MI. The natural gradient approach is used to minimize the MI. A novel activation function is proposed for the on-line learning algorithm which has an equivariant property and is easily implemented on a neural

Algorithms for Quantum Computation: Discrete Logarithms and Factoring

by Peter W. Shor , 1994
"... A computer is generally considered to be a universal computational device; i.e., it is believed able to simulate any physical computational device with a cost in com-putation time of at most a polynomial factol: It is not clear whether this is still true when quantum mechanics is taken into consider ..."
Abstract - Cited by 1111 (5 self) - Add to MetaCart
into consideration. Several researchers, starting with David Deutsch, have developed models for quantum mechanical computers and have investigated their compu-tational properties. This paper gives Las Vegas algorithms for finding discrete logarithms and factoring integers on a quantum computer that take a number

A NEW POLYNOMIAL-TIME ALGORITHM FOR LINEAR PROGRAMMING

by N. Karmarkar - COMBINATORICA , 1984
"... We present a new polynomial-time algorithm for linear programming. In the worst case, the algorithm requires O(tf'SL) arithmetic operations on O(L) bit numbers, where n is the number of variables and L is the number of bits in the input. The running,time of this algorithm is better than the ell ..."
Abstract - Cited by 860 (3 self) - Add to MetaCart
the ellipsoid algorithm by a factor of O(n~'~). We prove that given a polytope P and a strictly in-terior point a E P, there is a projective transformation of the space that maps P, a to P', a ' having the following property. The ratio of the radius of the smallest sphere with center a

Entropy-Based Algorithms For Best Basis Selection

by Ronald R. Coifman, Mladen Victor Wickerhauser - IEEE Transactions on Information Theory , 1992
"... pretations (position, frequency, and scale), and we have experimented with feature-extraction methods that use best-basis compression for front-end complexity reduction. The method relies heavily on the remarkable orthogonality properties of the new libraries. It is obviously a nonlinear transformat ..."
Abstract - Cited by 675 (20 self) - Add to MetaCart
pretations (position, frequency, and scale), and we have experimented with feature-extraction methods that use best-basis compression for front-end complexity reduction. The method relies heavily on the remarkable orthogonality properties of the new libraries. It is obviously a nonlinear

GMRES: A generalized minimal residual algorithm for solving nonsymmetric linear systems

by Youcef Saad, Martin H. Schultz - SIAM J. SCI. STAT. COMPUT , 1986
"... We present an iterative method for solving linear systems, which has the property ofminimizing at every step the norm of the residual vector over a Krylov subspace. The algorithm is derived from the Arnoldi process for constructing an l2-orthogonal basis of Krylov subspaces. It can be considered a ..."
Abstract - Cited by 2076 (41 self) - Add to MetaCart
We present an iterative method for solving linear systems, which has the property ofminimizing at every step the norm of the residual vector over a Krylov subspace. The algorithm is derived from the Arnoldi process for constructing an l2-orthogonal basis of Krylov subspaces. It can be considered

Voronoi diagrams -- a survey of a fundamental geometric data structure

by Franz Aurenhammer - ACM COMPUTING SURVEYS , 1991
"... This paper presents a survey of the Voronoi diagram, one of the most fundamental data structures in computational geometry. It demonstrates the importance and usefulness of the Voronoi diagram in a wide variety of fields inside and outside computer science and surveys the history of its development. ..."
Abstract - Cited by 743 (5 self) - Add to MetaCart
. The paper puts particular emphasis on the unified exposition of its mathematical and algorithmic properties. Finally, the paper provides the first comprehensive bibliography on Voronoi diagrams and related structures.

A comparison and evaluation of multi-view stereo reconstruction algorithms.

by Steven M Seitz , Brian Curless , James Diebel , Daniel Scharstein , Richard Szeliski - In Proc. Computer Vision and Pattern Recognition ’06, , 2006
"... Abstract This paper presents a quantitative comparison of several multi-view stereo reconstruction algorithms. Until now, the lack of suitable calibrated multi-view image datasets with known ground truth (3D shape models) has prevented such direct comparisons. In this paper, we first survey multi-v ..."
Abstract - Cited by 530 (14 self) - Add to MetaCart
-view stereo algorithms and compare them qualitatively using a taxonomy that differentiates their key properties. We then describe our process for acquiring and calibrating multiview image datasets with high-accuracy ground truth and introduce our evaluation methodology. Finally, we present the results of our
Results 1 - 10 of 38,791