Sciweavers

1651 search results - page 302 / 331
» Measuring the Complexity of Classification Problems
Sort
View
KDD
2010
ACM
199views Data Mining» more  KDD 2010»
13 years 11 months ago
Online discovery and maintenance of time series motifs
The detection of repeated subsequences, time series motifs, is a problem which has been shown to have great utility for several higher-level data mining algorithms, including clas...
Abdullah Mueen, Eamonn J. Keogh
CEAS
2006
Springer
13 years 11 months ago
Fast Uncertainty Sampling for Labeling Large E-mail Corpora
One of the biggest challenges in building effective anti-spam solutions is designing systems to defend against the everevolving bag of tricks spammers use to defeat them. Because ...
Richard Segal, Ted Markowitz, William Arnold
FOCM
2008
100views more  FOCM 2008»
13 years 7 months ago
A Unifying Local Convergence Result for Newton's Method in Riemannian Manifolds
We consider the problem of finding a singularity of a differentiable vector field X defined on a complete Riemannian manifold. We prove a unified result for the existence and local...
Felipe Alvarez, Jérôme Bolte, Julien ...
LOGCOM
2008
94views more  LOGCOM 2008»
13 years 7 months ago
Preservation of Interpolation Features by Fibring
Fibring is a metalogical constructor that permits to combine different logics by operating on their deductive systems under certain natural restrictions, as for example that the t...
Walter Alexandre Carnielli, João Rasga, Cri...
TSMC
2008
182views more  TSMC 2008»
13 years 7 months ago
Incremental Linear Discriminant Analysis for Face Recognition
Abstract--Dimensionality reduction methods have been successfully employed for face recognition. Among the various dimensionality reduction algorithms, linear (Fisher) discriminant...
Haitao Zhao, Pong Chi Yuen