Sciweavers

3656 search results - page 205 / 732
» Compact Location Problems
Sort
View
SSPR
1998
Springer
15 years 10 months ago
Multi-interval Discretization Methods for Decision Tree Learning
Properly addressing the discretization process of continuos valued features is an important problem during decision tree learning. This paper describes four multi-interval discreti...
Petra Perner, Sascha Trautzsch
ICIAR
2010
Springer
15 years 10 months ago
A Geometric Data Structure Applicable to Image Mining and Retrieval
Abstract. Due to improvements in image acquisition and storage technology, terabyte-sized databases of images are nowadays common. This abundance of data leads us to two basic prob...
T. Iwaszko, Mahmoud Melkemi, Lhassane Idoumghar
FCCM
2009
IEEE
204views VLSI» more  FCCM 2009»
15 years 10 months ago
Acceleration and Energy Efficiency of a Geometric Algebra Computation using Reconfigurable Computers and GPUs
Geometric algebra (GA) is a mathematical framework that allows the compact description of geometric relationships and algorithms in many fields of science and engineering. The exe...
Holger Lange, Florian Stock, Andreas Koch, Dietmar...
ICANNGA
2007
Springer
161views Algorithms» more  ICANNGA 2007»
15 years 10 months ago
Evolutionary Induction of Decision Trees for Misclassification Cost Minimization
Abstract. In the paper, a new method of decision tree learning for costsensitive classification is presented. In contrast to the traditional greedy top-down inducer in the proposed...
Marek Kretowski, Marek Grzes
NGITS
1995
Springer
15 years 9 months ago
Category Translation: Learning to Understand Information on the Internet
This paper investigates the problem ofautomatically learning declarative models of information sources available on the Internet. We report on ILA, a domain-independent program th...
Mike Perkowitz, Oren Etzioni