387 search results - page 45 / 78 » Mining Approximative Descriptions of Sets Using Rough Sets |
PKDD
2009
Springer
14 years 2 months ago
2009
Springer
The Support Vector Machine error bound is a function of the margin and radius. Standard SVM algorithms maximize the margin within a given feature space, therefore the radius is fi...
SODA
2003
ACM
13 years 9 months ago
2003
ACM
Zonotopes are centrally symmetric polytopes with a very special structure: they are the Minkowski sum of line segments. In this paper we propose to use zonotopes as bounding volum...
PKDD
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. We present an automated tool with a web interface for tracking the prevalence of Influenza-like Illness (ILI) in several regions of the United Kingdom using the contents...
KDD
1997
ACM
13 years 11 months ago
1997
ACM
Discovery of association rules is an important problem in database mining. In this paper we present new algorithms for fast association mining, which scan the database only once, ...
KDD
2006
ACM
14 years 8 months ago
2006
ACM
Ordering and ranking items of different types are important tasks in various applications, such as query processing and scientific data mining. A total order for the items can be ...