2033 search results - page 301 / 407 » Support Vector Committee Machines |
WWW
2007
ACM
14 years 10 months ago
2007
ACM
Traditional clustering algorithms work on "flat" data, making the assumption that the data instances can only be represented by a set of homogeneous and uniform features...
WWW
2005
ACM
14 years 10 months ago
2005
ACM
Taxonomies of the Web typically have hundreds of thousands of categories and skewed category distribution over documents. It is not clear whether existing text classification tech...
KDD
2008
ACM
14 years 9 months ago
2008
ACM
Efficient training of direct multi-class formulations of linear Support Vector Machines is very useful in applications such as text classification with a huge number examples as w...
KDD
2003
ACM
14 years 9 months ago
2003
ACM
The problem of identifying approximately duplicate records in databases is an essential step for data cleaning and data integration processes. Most existing approaches have relied...
KDD
2002
ACM
14 years 9 months ago
2002
ACM
Instance selection and feature selection are two orthogonal methods for reducing the amount and complexity of data. Feature selection aims at the reduction of redundant features i...