Sciweavers

17688 search results - page 239 / 3538
» Data Set Balancing
Sort
View
CINQ
2004
Springer
116views Database» more  CINQ 2004»
15 years 10 months ago
A Survey on Condensed Representations for Frequent Sets
Abstract. Solving inductive queries which have to return complete collections of patterns satisfying a given predicate has been studied extensively the last few years. The specific...
Toon Calders, Christophe Rigotti, Jean-Franç...
IEE
2002
72views more  IEE 2002»
15 years 6 months ago
Making inferences with small numbers of training sets
This paper discusses a potential methodological problem with empirical studies assessing project effort prediction systems. Frequently a hold-out strategy is deployed so that the ...
Colin Kirsopp, Martin J. Shepperd
SDM
2009
SIAM
161views Data Mining» more  SDM 2009»
16 years 3 months ago
Polynomial-Delay and Polynomial-Space Algorithms for Mining Closed Sequences, Graphs, and Pictures in Accessible Set Systems.
In this paper, we study efficient closed pattern mining in a general framework of set systems, which are families of subsets ordered by set-inclusion with a certain structure, pro...
Hiroki Arimura, Takeaki Uno
RSFDGRC
2005
Springer
110views Data Mining» more  RSFDGRC 2005»
15 years 12 months ago
A Rough Set Based Model to Rank the Importance of Association Rules
Abstract. Association rule algorithms often generate an excessive number of rules, many of which are not significant. It is difficult to determine which rules are more useful, int...
Jiye Li, Nick Cercone
SDM
2007
SIAM
130views Data Mining» more  SDM 2007»
15 years 8 months ago
Maximizing the Area under the ROC Curve with Decision Lists and Rule Sets
Decision lists (or ordered rule sets) have two attractive properties compared to unordered rule sets: they require a simpler classification procedure and they allow for a more co...
Henrik Boström