Results 1 - 10 of 156,599

The Nature of Statistical Learning Theory

by Vladimir N. Vapnik , 1999
"... Statistical learning theory was introduced in the late 1960’s. Until the 1990’s it was a purely theoretical analysis of the problem of function estimation from a given collection of data. In the middle of the 1990’s new types of learning algorithms (called support vector machines) based on the deve ..."
Abstract - Cited by 13236 (32 self) - Add to MetaCart
Statistical learning theory was introduced in the late 1960’s. Until the 1990’s it was a purely theoretical analysis of the problem of function estimation from a given collection of data. In the middle of the 1990’s new types of learning algorithms (called support vector machines) based

Maximum likelihood from incomplete data via the EM algorithm

by A. P. Dempster, N. M. Laird, D. B. Rubin - JOURNAL OF THE ROYAL STATISTICAL SOCIETY, SERIES B , 1977
"... A broadly applicable algorithm for computing maximum likelihood estimates from incomplete data is presented at various levels of generality. Theory showing the monotone behaviour of the likelihood and convergence of the algorithm is derived. Many examples are sketched, including missing value situat ..."
Abstract - Cited by 11972 (17 self) - Add to MetaCart
A broadly applicable algorithm for computing maximum likelihood estimates from incomplete data is presented at various levels of generality. Theory showing the monotone behaviour of the likelihood and convergence of the algorithm is derived. Many examples are sketched, including missing value

Data Streams: Algorithms and Applications

by S. Muthukrishnan , 2005
"... In the data stream scenario, input arrives very rapidly and there is limited memory to store the input. Algorithms have to work with one or few passes over the data, space less than linear in the input size or time significantly less than the input size. In the past few years, a new theory has emerg ..."
Abstract - Cited by 533 (22 self) - Add to MetaCart
In the data stream scenario, input arrives very rapidly and there is limited memory to store the input. Algorithms have to work with one or few passes over the data, space less than linear in the input size or time significantly less than the input size. In the past few years, a new theory has

References for Data Stream Algorithms

by Graham Cormode , 2007
"... Many scenarios, such as network analysis, utility monitoring, and financial applications, generate massive streams of data. These streams consist of millions or billions of simple updates every hour, and must be processed to extract the information described in tiny pieces. These notes provide an in ..."
Abstract - Add to MetaCart
an introduction to (and set of references for) data stream algorithms, and some of the techniques that have been developed over recent years to help mine the data while avoiding drowning in these massive flows of information. 1

Data Stream Algorithms

by Amit Chakrabarti
"... ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
Abstract not found

Data Streaming Algorithms for Geometric Problems

by R. Sharathkumar
"... A data stream is an ordered sequence of points that can be read only once or a small number of times. Formally, a data stream is a sequence of points ..."
Abstract - Add to MetaCart
A data stream is an ordered sequence of points that can be read only once or a small number of times. Formally, a data stream is a sequence of points

Data stream algorithms for codeword testing

by Atri Rudra, Steve Uurtamo - In ICALP
"... ar ..."
Abstract - Cited by 3 (2 self) - Add to MetaCart
Abstract not found

Data streaming algorithms for estimating entropy of network traffic

by Mitsunori Ogihara, Jia Wang, Ashwin Lall, Mitsu Ogihara, Oliver Spatscheck, Jia Wang, Chuck Zhao, Jim Xu - In Proceedings of the joint international conference on Measurement and modeling of computer systems (SIGMETRICS). ACM , 2006
"... • Given n flows of sizes a1,..., an. Let s ≡ i ai. The empirical entropy is defined as ..."
Abstract - Cited by 75 (12 self) - Add to MetaCart
• Given n flows of sizes a1,..., an. Let s ≡ i ai. The empirical entropy is defined as

A Space-Optimal Data-Stream Algorithm for Coresets in the Plane

by Pankaj Agarwal, et al.
"... Given a point set P ⊆ R², a subset Q ⊆ P is an ε-kernel of P if for every slab W containing Q, the (1+ε)-expansion of W also contains P. We present a data-stream algorithm for maintaining an ε-kernel of a stream of points in R² that uses O(1/√ε) space and takes O(log(1/ε)) amortized time to process ..."
Abstract - Cited by 19 (5 self) - Add to MetaCart
Given a point set P ⊆ R², a subset Q ⊆ P is an ε-kernel of P if for every slab W containing Q, the (1+ε)-expansion of W also contains P. We present a data-stream algorithm for maintaining an ε-kernel of a stream of points in R² that uses O(1/√ε) space and takes O(log(1/ε)) amortized time to process

A Space-Optimal Data-Stream Algorithm for Coresets in the Plane ∗

by unknown authors
"... Given a point set P ⊆ R 2, a subset Q ⊆ P is an ε-kernel of P if for every slab W containing Q, the (1 + ε)-expansion of W also contains P. We present a data-stream algorithm for maintaining an ε-kernel of a stream of points in R 2 that uses O(1 / √ ε) space and takes O(log(1/ε)) amortized time to ..."
Abstract - Add to MetaCart
Given a point set P ⊆ R 2, a subset Q ⊆ P is an ε-kernel of P if for every slab W containing Q, the (1 + ε)-expansion of W also contains P. We present a data-stream algorithm for maintaining an ε-kernel of a stream of points in R 2 that uses O(1 / √ ε) space and takes O(log(1/ε)) amortized time
Results 1 - 10 of 156,599