254 search results - page 49 / 51 » Multi-interval Discretization Methods for Decision Tree Lear... |
CEC
2007
IEEE
13 years 11 months ago
2007
IEEE
Abstract-- High-throughput microarrays inform us on different outlooks of the molecular mechanisms underlying the function of cells and organisms. While computational analysis for ...
VLDB
1995
ACM
13 years 11 months ago
1995
ACM
Classification, which involves finding rules that partition a given da.ta set into disjoint groups, is one class of data mining problems. Approaches proposed so far for mining cla...
CCO
2001
Springer
14 years 2 days ago
2001
Springer
Branch, cut, and price (BCP) is an LP-based branch and bound technique for solving large-scale discrete optimization problems (DOPs). In BCP, both cuts and variables can be generat...
HIPC
1999
Springer
13 years 12 months ago
1999
Springer
Abstract. Recent times have seen an explosive growth in the availability of various kinds of data. It has resulted in an unprecedented opportunity to develop automated data-driven ...
CLEF
2008
Springer
13 years 9 months ago
2008
Springer
In this article, we focus our efforts (i) on the study of how to automatically extract and exploit visual concepts and (ii) on fast visual diversity. First, in the Visual Concept D...