Sciweavers

1813 search results - page 202 / 363
» Instance Pruning Techniques
Sort
View
ICML
2002
IEEE
16 years 7 months ago
Non-Disjoint Discretization for Naive-Bayes Classifiers
Previous discretization techniques have discretized numeric attributes into disjoint intervals. We argue that this is neither necessary nor appropriate for naive-Bayes classifiers...
Ying Yang, Geoffrey I. Webb
ICALP
2009
Springer
16 years 6 months ago
SDP-Based Algorithms for Maximum Independent Set Problems on Hypergraphs
Abstract. This paper deals with approximations of maximum independent sets in non-uniform hypergraphs of low degree. We obtain the first performance ratio that is sublinear in term...
Elena Losievskaja, Geir Agnarsson, Magnús M...
EDBT
2004
ACM
162views Database» more  EDBT 2004»
16 years 6 months ago
Non-contiguous Sequence Pattern Queries
Abstract. Non-contiguous subsequence pattern queries search for symbol instances in a long sequence that satisfy some soft temporal constraints. In this paper, we propose a methodo...
Nikos Mamoulis, Man Lung Yiu
CP
2009
Springer
16 years 1 months ago
Using Relaxations in Maximum Density Still Life
The Maximum Density Sill-Life Problem is to fill an n × n board of cells with the maximum number of live cells so that the board is stable under the rules of Conway’s Game of L...
Geoffrey Chu, Peter J. Stuckey, Maria Garcia de la...
VL
2009
IEEE
142views Visual Languages» more  VL 2009»
16 years 1 months ago
Using a degree of interest model to facilitate ontology navigation
Understanding and maintaining the structure of large ontologies is a cognitively demanding task. Visualizations are commonly used as a cognitive aid for presenting large ontologie...
Tricia d'Entremont, Margaret-Anne Storey