Sciweavers

266 search results - page 29 / 54
» On the variance of random polygons
Sort
View
SDM
2011
SIAM
241views Data Mining» more  SDM 2011»
14 years 2 months ago
A Fast Algorithm for Sparse PCA and a New Sparsity Control Criteria
Sparse principal component analysis (PCA) imposes extra constraints or penalty terms to the standard PCA to achieve sparsity. In this paper, we first introduce an efficient algor...
Yunlong He, Renato Monteiro, Haesun Park
ACSC
2004
IEEE
15 years 3 months ago
Tuning the Collision Test for Power
The collision test is an important statistical test for rejecting poor random number generators. The test simulates the throwing of balls randomly into urns. A problem in applying...
Wai Wan Tsang, Lucas Chi Kwong Hui, K. P. Chow, C....
94
Voted
CORR
2010
Springer
124views Education» more  CORR 2010»
14 years 12 months ago
Online Learning of Noisy Data with Kernels
We study online learning when individual instances are corrupted by adversarially chosen random noise. We assume the noise distribution is unknown, and may change over time with n...
Nicolò Cesa-Bianchi, Shai Shalev-Shwartz, O...
ECML
2004
Springer
15 years 5 months ago
The Principal Components Analysis of a Graph, and Its Relationships to Spectral Clustering
This work presents a novel procedure for computing (1) distances between nodes of a weighted, undirected, graph, called the Euclidean Commute Time Distance (ECTD), and (2) a subspa...
Marco Saerens, François Fouss, Luh Yen, Pie...
ICML
2000
IEEE
16 years 17 days ago
Complete Cross-Validation for Nearest Neighbor Classifiers
Cross-validation is an established technique for estimating the accuracy of a classifier and is normally performed either using a number of random test/train partitions of the dat...
Matthew D. Mullin, Rahul Sukthankar