Sciweavers

703 search results - page 140 / 141
» Predicting Time Series with Support Vector Machines
Sort
View
KDD
2006
ACM
201views Data Mining» more  KDD 2006»
14 years 7 months ago
Clustering based large margin classification: a scalable approach using SOCP formulation
This paper presents a novel Second Order Cone Programming (SOCP) formulation for large scale binary classification tasks. Assuming that the class conditional densities are mixture...
J. Saketha Nath, Chiranjib Bhattacharyya, M. Naras...
CRV
2009
IEEE
115views Robotics» more  CRV 2009»
14 years 2 months ago
Learning Model Complexity in an Online Environment
In this paper we introduce the concept and method for adaptively tuning the model complexity in an online manner as more examples become available. Challenging classification pro...
Dan Levi, Shimon Ullman
CIVR
2009
Springer
132views Image Analysis» more  CIVR 2009»
14 years 2 months ago
Real-time bag of words, approximately
We start from the state-of-the-art Bag of Words pipeline that in the 2008 benchmarks of TRECvid and PASCAL yielded the best performance scores. We have contributed to that pipelin...
Jasper R. R. Uijlings, Arnold W. M. Smeulders, Rem...
ICDM
2005
IEEE
161views Data Mining» more  ICDM 2005»
14 years 1 months ago
Making Logistic Regression a Core Data Mining Tool with TR-IRLS
Binary classification is a core data mining task. For large datasets or real-time applications, desirable classifiers are accurate, fast, and need no parameter tuning. We presen...
Paul Komarek, Andrew W. Moore
NIPS
2001
13 years 8 months ago
K-Local Hyperplane and Convex Distance Nearest Neighbor Algorithms
Guided by an initial idea of building a complex (non linear) decision surface with maximal local margin in input space, we give a possible geometrical intuition as to why K-Neares...
Pascal Vincent, Yoshua Bengio