Sciweavers

1651 search results - page 46 / 331
» Measuring the Complexity of Classification Problems
Sort
View
WEBI
2005
Springer
15 years 11 months ago
Measuring the Relative Performance of Schema Matchers
Schema matching is a complex process focusing on matching between concepts describing the data in heterogeneous data sources. There is a shift from manual schema matching, done by...
Shlomo Berkovsky, Yaniv Eytani, Avigdor Gal
MFCS
2004
Springer
15 years 11 months ago
Scaled Dimension and the Kolmogorov Complexity of Turing-Hard Sets
We study constructive and resource-bounded scaled dimension as an information content measure and obtain several results that parallel previous work on unscaled dimension. Scaled ...
John M. Hitchcock, María López-Vald&...
GECCO
2009
Springer
110views Optimization» more  GECCO 2009»
15 years 10 months ago
EMO shines a light on the holes of complexity space
Typical domains used in machine learning analyses only partially cover the complexity space, remaining a large proportion of problem difficulties that are not tested. Since the ac...
Núria Macià, Albert Orriols-Puig, Es...
CDC
2010
IEEE
164views Control Systems» more  CDC 2010»
15 years 29 days ago
A recursive system identification method based on binary measurements
Abstract-- An online approach to parameter estimation problems based on binary observations is presented in this paper. This recursive identification method relies on a least-mean ...
Kian Jafari, Jérôme Juillard, É...
IRI
2008
IEEE
16 years 10 days ago
Biological question answering with syntactic and semantic feature matching and an improved mean reciprocal ranking measurement
Specific information on biomolecular events such as protein-protein and gene-protein interactions is essential for molecular biology researchers. However, the results derived by c...
Ryan T. K. Lin, Justin Liang-Te Chiu, Hong-Jie Dai...