Sciweavers

81 search results - page 1 / 17
» The minimum consistent subset cover problem and its applicat...
Sort
View
KDD
2007
ACM
249views Data Mining» more  KDD 2007»
14 years 4 months ago
The minimum consistent subset cover problem and its applications in data mining
In this paper, we introduce and study the Minimum Consistent Subset Cover (MCSC) problem. Given a finite ground set X and a constraint t, find the minimum number of consistent sub...
Byron J. Gao, Martin Ester, Jin-yi Cai, Oliver Sch...
ICDM
2010
IEEE
122views Data Mining» more  ICDM 2010»
13 years 2 months ago
Interesting Subset Discovery and Its Application on Service Processes
Various real-life datasets can be viewed as a set of records consisting of attributes explaining the records and set of measures evaluating the records. In this paper, we address t...
Maitreya Natu, Girish Keshav Palshikar
CORR
2004
Springer
119views Education» more  CORR 2004»
13 years 4 months ago
The Largest Compatible Subset Problem for Phylogenetic Data
Abstract. The phylogenetic tree construction is to infer the evolutionary relationship between species from the experimental data. However, the experimental data are often imperfec...
Andy Auyeung, Ajith Abraham
COR
2000
129views more  COR 2000»
13 years 4 months ago
Heuristics for the multi-vehicle covering tour problem
The multi-vehicle covering tour problem is de"ned on a graph G"(<6=, E), where = is a set of vertices that must collectively be covered by up to m vehicles. The probl...
Mondher Hachicha, M. John Hodgson, Gilbert Laporte...
IPL
2008
135views more  IPL 2008»
13 years 4 months ago
On the Positive-Negative Partial Set Cover problem
The Positive-Negative Partial Set Cover problem is introduced and its complexity, especially the hardness-of-approximation, is studied. The problem generalizes the Set Cover probl...
Pauli Miettinen