105 citations · 151 across the 14 of their papers we have counts for
6 papers · 1 filter
Adaptive Base Class Boost for Multi-class Classification
Ping Li
We develop the concept of ABC-Boost (Adaptive Base Class Boost) for multi-class classification and present ABC-MART, a concrete implementation of ABC-Boost. The original MART (Mult…
The Optimal Quantile Estimator for Compressed Counting
Ping Li
Compressed Counting (CC) was recently proposed for very efficiently computing the (approximate) th frequency moments of data streams, where . Several estimators were re…
On Approximating the Lp Distances for p>2
Ping Li
Applications in machine learning and data mining require computing pairwise Lp distances in a data matrix A. For massive high-dimensional data, computing all pairwise distances of…
Computationally Efficient Estimators for Dimension Reductions Using Stable Random Projections
Ping Li
The method of stable random projections is a tool for efficiently computing the distances using low memory, where is a tuning parameter. The method boils down to…
Compressed Counting
Ping Li
Counting is among the most fundamental operations in computing. For example, counting the pth frequency moment has been a very active area of research, in theoretical computer scie…
On Approximating Frequency Moments of Data Streams with Skewed Projections
Ping Li
We propose skewed stable random projections for approximating the pth frequency moments of dynamic data streams (0<p<=2), which has been frequently studied in theoretical computer…