405 search results - page 47 / 81 » Binary Classification Trees for Multi-class Classification P... |
SODA
2004
ACM
15 years 2 days ago
2004
ACM
The (axis-parallel) stabbing number of a given set of line segments is the maximum number of segments that can be intersected by any one (axis-parallel) line. We investigate probl...
112
click to vote
SETN
2004
Springer
15 years 4 months ago
2004
Springer
Abstract. Single classifiers, such as Neural Networks, Support Vector Machines, Decision Trees and other, can be used to perform classification of data for relatively simple proble...
161
click to vote
ICDE
2003
IEEE
16 years 1 days ago
2003
IEEE
Data mining applications analyze large collections of set data and high dimensional categorical data. Search on these data types is not restricted to the classic problems of minin...
SIAMCOMP
2000
14 years 10 months ago
2000
Abstract. We consider two natural generalizations of the notion of transversal to a finite hypergraph, arising in data-mining and machine learning, the so called multiple and parti...
ALMOB
2006
14 years 10 months ago
2006
The String Barcoding (SBC) problem, introduced by Rash and Gusfield (RECOMB, 2002), consists in finding a minimum set of substrings that can be used to distinguish between all mem...