Sciweavers

96 search results - page 4 / 20
» Classifying large data sets using SVMs with hierarchical clu...
Sort
View
APIN
2000
87views more  APIN 2000»
13 years 5 months ago
The Architecture and Performance of a Stochastic Competitive Evolutionary Neural Tree Network
: A new dynamic tree structured network - the Stochastic Competitive Evolutionary Neural Tree (SCENT) is introduced. The network is able to provide a hierarchical classification of...
Neil Davey, Rod Adams, Stella J. George
ICANN
2007
Springer
13 years 9 months ago
Resilient Approximation of Kernel Classifiers
Abstract. Trained support vector machines (SVMs) have a slow runtime classification speed if the classification problem is noisy and the sample data set is large. Approximating the...
Thorsten Suttorp, Christian Igel
JMLR
2010
108views more  JMLR 2010»
13 years 9 days ago
Tree Decomposition for Large-Scale SVM Problems
To handle problems created by large data sets, we propose a method that uses a decision tree to decompose a given data space and train SVMs on the decomposed regions. Although the...
Fu Chang, Chien-Yang Guo, Xiao-Rong Lin, Chi-Jen L...
MLDM
2005
Springer
13 years 11 months ago
Clustering Large Dynamic Datasets Using Exemplar Points
In this paper we present a method to cluster large datasets that change over time using incremental learning techniques. The approach is based on the dynamic representation of clus...
William Sia, Mihai M. Lazarescu
KDD
2010
ACM
222views Data Mining» more  KDD 2010»
13 years 7 months ago
Large linear classification when data cannot fit in memory
Recent advances in linear classification have shown that for applications such as document classification, the training can be extremely efficient. However, most of the existing t...
Hsiang-Fu Yu, Cho-Jui Hsieh, Kai-Wei Chang, Chih-J...