Sciweavers

9 search results - page 1 / 2
» Non-redundant Subgroup Discovery Using a Closure System
Sort
View
PKDD
2009
Springer
95views Data Mining» more  PKDD 2009»
13 years 11 months ago
Non-redundant Subgroup Discovery Using a Closure System
Subgroup discovery is a local pattern discovery task, in which descriptions of subpopulations of a database are evaluated against some quality function. As standard quality functio...
Mario Boley, Henrik Grosskreutz
LWA
2004
13 years 5 months ago
Towards Knowledge-Intensive Subgroup Discovery
Subgroup discovery can be applied for exploration or descriptive induction in order to discover "interesting" subgroups of the general population, given a certain proper...
Martin Atzmüller, Frank Puppe, Hans-Peter Bus...
JMLR
2010
117views more  JMLR 2010»
12 years 11 months ago
Exploiting the High Predictive Power of Multi-class Subgroups
Subgroup discovery aims at finding subsets of a population whose class distribution is significantly different from the overall distribution. A number of multi-class subgroup disc...
Tarek Abudawood, Peter A. Flach
IROS
2009
IEEE
142views Robotics» more  IROS 2009»
13 years 11 months ago
Reduced state representation in delayed-state SLAM
— This paper introduces an approach that reduces the size of the state and maximizes the sparsity of the information matrix in exactly sparse delayed-state SLAM. We propose const...
Viorela Ila, Josep M. Porta, Juan Andrade-Cetto
DKE
2002
218views more  DKE 2002»
13 years 4 months ago
Computing iceberg concept lattices with T
We introduce the notion of iceberg concept lattices and show their use in knowledge discovery in databases. Iceberg lattices are a conceptual clustering method, which is well suit...
Gerd Stumme, Rafik Taouil, Yves Bastide, Nicolas P...