Sciweavers

Share
227 search results - page 1 / 46
» Improved Algorithms for Univariate Discretization of Continu...
Sort
View
PKDD
2007
Springer
121views Data Mining» more  PKDD 2007»
9 years 6 months ago
Improved Algorithms for Univariate Discretization of Continuous Features
In discretization of a continuous variable its numerical value range is divided into a few intervals that are used in classification. For example, Na¨ıve Bayes can benefit from...
Jussi Kujala, Tapio Elomaa
PKDD
1999
Springer
103views Data Mining» more  PKDD 1999»
9 years 4 months ago
An Evolutionary Algorithm Using Multivariate Discretization for Decision Rule Induction
Abstract. We describe EDRL-MD, an evolutionary algorithm-based system, for learning decision rules from databases. The main novelty of our approach lies in dealing with continuous ...
Wojciech Kwedlo, Marek Kretowski
ESA
2006
Springer
147views Algorithms» more  ESA 2006»
9 years 3 months ago
Univariate Polynomial Real Root Isolation: Continued Fractions Revisited
We present algorithmic, complexity and implementation results concerning real root isolation of integer univariate polynomials using the continued fraction expansion of real algeb...
Elias P. Tsigaridas, Ioannis Z. Emiris
MLDM
2009
Springer
9 years 6 months ago
Discretization of Target Attributes for Subgroup Discovery
Abstract. We describe an algorithm called TargetCluster for the discretization of continuous targets in subgroup discovery. The algorithm identifies patterns in the target data an...
Katherine Moreland, Klaus Truemper
JSC
2010
99views more  JSC 2010»
8 years 10 months ago
Faster algorithms for computing Hong's bound on absolute positiveness
We show how to compute Hong’s bound for the absolute positiveness of a polynomial in d variables with maximum degree δ in O(n logd n) time, where n is the number of non-zero co...
Kurt Mehlhorn, Saurabh Ray
books