92 search results - page 13 / 19 » On Maximal S-Free Convex Sets |
PAKDD
2004
ACM
15 years 5 months ago
2004
ACM
Condensed representations of pattern collections have been recognized to be important building blocks of inductive databases, a promising theoretical framework for data mining, and...
105
click to vote
MP
2010
14 years 10 months ago
2010
Recently, Andersen et al. [1], Borozan and Cornu´ejols [7] and Cornu´ejols and Margot [10] characterized extreme inequalities of a system of two rows with two free integer varia...
115
click to vote
SIAMJO
2008
14 years 11 months ago
2008
Eigenvectors to the second smallest eigenvalue of the Laplace matrix of a graph, also known as Fiedler vectors, are the basic ingredient in spectral graph partitioning heuristics....
102
click to vote
ICMLA
2009
14 years 9 months ago
2009
This article proposes an algorithm to automatically learn useful transformations of data to improve accuracy in supervised classification tasks. These transformations take the for...
ICML
2006
IEEE
16 years 16 days ago
2006
IEEE
RELIEF is considered one of the most successful algorithms for assessing the quality of features. In this paper, we propose a set of new feature weighting algorithms that perform s...