Sciweavers

178 search results - page 1 / 36
» Extension of the Generalization Complexity Measure to Real V...
Sort
View
ISNN
2010
Springer
13 years 3 months ago
Extension of the Generalization Complexity Measure to Real Valued Input Data Sets
Abstract. This paper studies the extension of the Generalization Complexity (GC) measure to real valued input problems. The GC measure, defined in Boolean space, was proposed as a...
Iván Gómez, Leonardo Franco, Jos&eac...
ICAI
2009
13 years 2 months ago
Data Mining in Incomplete Numerical and Categorical Data Sets: A Neuro Fuzzy Approach
- There are many applications dealing with incomplete data sets that take different approaches to making imputations for missing values. Most tackle the problem for numerical input...
Pilar Rey del Castillo, Jesus Cardenosa
KDD
2007
ACM
165views Data Mining» more  KDD 2007»
14 years 5 months ago
Finding low-entropy sets and trees from binary data
The discovery of subsets with special properties from binary data has been one of the key themes in pattern discovery. Pattern classes such as frequent itemsets stress the co-occu...
Eino Hinkkanen, Hannes Heikinheimo, Heikki Mannila...
QEST
2009
IEEE
13 years 11 months ago
Recent Extensions to Traviando
—Traviando is a trace analyzer and visualizer for simulation traces of discrete event dynamic systems. In this paper, we briefly outline recent extensions of Traviando towards a...
Peter Kemper
CORR
2012
Springer
207views Education» more  CORR 2012»
12 years 17 days ago
A baby step-giant step roadmap algorithm for general algebraic sets
Abstract. Let R be a real closed field and D ⊂ R an ordered domain. We give an algorithm that takes as input a polynomial Q ⊂ D[X1, . . . , Xk], and computes a description of ...
Saugata Basu, Marie-Françoise Roy, Mohab Sa...